-
Chapter and Conference Paper
ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems
This paper proposes an algorithmic framework for solving various combinatorial reconfiguration problems by using zero-suppressed binary decision diagrams (ZDDs), a data structure for representing families of s...
-
Chapter and Conference Paper
Applying Combinatorial Testing to Verification-Based Fairness Testing
Fairness testing, given a machine learning classifier, detects discriminatory data contained in it via executing test cases. In this paper, we propose a new approach to fairness testing named Vbt-Ct, which applie...
-
Chapter and Conference Paper
Efficient Fairness Testing Through Hash-Based Sampling
There is a growing concern on algorithm fairness, according to wider adoption of machine learning techniques in our daily life. Testing of individual fairness is an approach to algorithm fairness concern. Veri...
-
Chapter and Conference Paper
Extended Min-Hash Focusing on Intersection Cardinality
Min-Hash is a reputable hashing technique which realizes set similarity search. Min-Hash assumes the Jaccard similarity $$\frac{|A\cap...
-
Article
Dualization of boolean functions using ternary decision diagrams
Dualization of Boolean functions is a fundamental problem that appears in various fields such as artificial intelligence, logic, data mining, etc. For monotone Boolean functions, many empirical researches that...
-
Chapter and Conference Paper
Improved Compression-Based Pattern Recognition Exploiting New Useful Features
Compression-based pattern recognition measures the similarity between objects with relying on data compression techniques. This paper improves the current compression-based pattern recognition by exploiting ne...
-
Chapter and Conference Paper
Fast Exact Algorithm to Solve Continuous Similarity Search for Evolving Queries
We study the continuous similarity search problem for evolving queries which has recently been formulated. Given a data stream and a database composed of n sets of items, the purpose of this problem is to maintai...
-
Chapter and Conference Paper
Superset Generation on Decision Diagrams
Generating all supersets from a given set family is important, because it is closely related to identifying cause-effect relationship. This paper presents an efficient method for superset generation by using t...
-
Chapter and Conference Paper
A General Framework for Parallel Unary Operations on ZDDs
A zero-suppressed binary decision diagram is a compressed data structure that represents families of sets. There are various basic operations to manipulate families of sets over ZDDs such as union, intersectio...
-
Chapter and Conference Paper
Three-way Indexing ZDDs for Large-Scale Sparse Datasets
Zero-suppressed decision diagrams (ZDDs) are a data structure for representing combinations over item sets. They have been applied to many areas such as data mining. When ZDDs represent large-scale sparse data...
-
Chapter and Conference Paper
Hypergraph Transversal Computation with Binary Decision Diagrams
We study a hypergraph transversal computation: given a hypergraph, the problem is to generate all minimal transversals. This problem is related to many applications in computer science and various algorithms h...
-
Chapter and Conference Paper
Fast Compression of Large-Scale Hypergraphs for Solving Combinatorial Problems
We present a fast algorithm to compress hypergraphs into the data structure ZDDs. We furthermore analyze the computational complexity. Our algorithm uses multikey Quicksort given by Bentley and Sedgewick. By c...
