5 Result(s)
within
Computer Science
Artificial Intelligence
Data Mining and Knowledge Discovery
Takahisa Toda
-
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...
-
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
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
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...
