Fast Construction of ZDDs from Large-scale Hypergraphs
نویسنده
چکیده
(Abstract) We present an algorithm to compress hypergraphs into the data structure ZDDs and analyze the computational complexity. Since a ZDD provides an approach to solve large-scale problems that are difficult to compute in a reasonable amount of time and space, it is important to compress hypergraphs efficiently. Our algorithm uses multikey Quicksort given by Bentley and Sedgewick. By conducting experiments with various datasets, we show that our algorithm is significantly faster and requires smaller memory than an existing method.
منابع مشابه
A Compact and Fast Index Structure for Families of Sets
In many real-life problems, we are often faced with manipulating families of sets. Manipulation of large-scale set families is one of the important fundamental techniques for web information retrieval, integration, and mining. For this purpose, a special type of binary decision diagrams (BDDs), called Zero-suppressed BDDs (ZDDs), is used. However, current techniques for storing ZDDs require a h...
متن کاملDistinctive Frequent Itemset Mining from Time Segmented Databases Using ZDD-Based Symbolic Processing
(Abstract) Frequent itemset mining is one of the fundamental techniques for data mining and knowledge discovery. Recently, Minato et al. proposed a fast algorithm " LCM over ZDDs " for generating very large-scale frequent itemsets using Zero-suppressed BDDs (ZDDs), a compact graph-based data structure. Their method is based on LCM algorithm , one of the most efficient state-of-the-art technique...
متن کاملStudies on Decision Diagrams for Efficient Manipulation of Sets and Strings
In many real-life problems, we are often faced with manipulating discrete structures. Manipulation of large discrete structures is one of the most important problems in computer science. For this purpose, a family of data structures called decision diagrams is used. The origin of the decision diagrams is binary decision diagram (BDD) proposed by Bryant in 1980s. BDD is a data structure to repre...
متن کاملZ - Skip - Links for Fast ZDD Traversal in Handling Large - Scale Sparse Datasets ( Revised Ed . ) ∗
(Abstract) ZDD (Zero-suppressed Binary Decision Diagram) is known as an efficient data structure for representing and manipulating large-scale sets of combinations. In this article, we propose a method of using Z-Skip-Links to accelerate ZDD traversals for manipulating large-scale sparse datasets. We discuss average case complexity analysis of our method, and present the optimal parameter setti...
متن کاملFast Message Passing Algorithm Using ZDD-Based Local Structure Compilation
Compiling Bayesian Networks (BNs) into secondary structures to implement efficient exact inference is a hot topic in probabilistic modeling. One class of algorithms to compile BNs is to transform the BNs into junction tree structures utilizing the conditional dependency in the network. Performing message passing on the junction tree structure, we can calculate marginal probabilities for any var...
متن کامل