Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Zero-suppressed BDDs for set manipulation in combinatorial problems
DAC '93 Proceedings of the 30th international Design Automation Conference
Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Binary decision diagrams and applications for VLSI CAD
Binary decision diagrams and applications for VLSI CAD
Modern Information Retrieval
Scalable Algorithms for Association Mining
IEEE Transactions on Knowledge and Data Engineering
Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach
Data Mining and Knowledge Discovery
Efficient Method of Combinatorial Item Set Analysis Based on Zero-Suppressed BDDs
WIRI '05 Proceedings of the International Workshop on Challenges in Web Information Retrieval and Integration
VSOP (valued-sum-of-products) calculator for knowledge processing based on zero-suppressed BDDs
Proceedings of the 2005 international conference on Federation over the Web
| Hi-index | 0.00 |
Manipulation of large-scale combinatorial data is one of the important fundamental technique for web information retrieval, integration, and mining. Recently, we proposed a new approach based on Zero-suppressed BDDs (Binary Decision Diagrams) for efficient database analysis. In this paper, we present VSOP program developed for calculating combinatorial item sets specified by symbolic expressions. Based on ZBDD techniques, VSOP can efficiently handle large-scale sum-of-products expressions with a number of item symbols. VSOP supports not only Boolean set operations but also numerical arithmetic operations based on Valued-Sum-Of-Products algebra, such as addition, subtraction, multiplication, division, numerical comparison, etc. VSOP will facilitate research and development for various database analysis problems.