Efficient method of combinatorial item set analysis based on zero-suppressed BDDs

Proceedings - International Workshop on Challenges in Web Information Retrieval and Integration, WIRI'05

Volumn 2005, Issue , 2005, Pages 4-11

  Minato, Shin Ichi ^a   Arimura, Hiroki ^a  

^a HOKKAIDO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY DECISION DIAGRAMS (BDD); GRAPH-BASED REPRESENTATION; ITEM SET ANALYSIS;

BOOLEAN FUNCTIONS; COMBINATORIAL MATHEMATICS; DATA MINING; DATABASE SYSTEMS; GRAPH THEORY; INTEGRATION; PROBLEM SOLVING;

INFORMATION RETRIEVAL;

EID: 33746035952     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WIRI.2005.15     Document Type: Conference Paper

References (17)

1. Akers, S. B., Binary decision diagrams, IEEE Trans. Comput., C-27, 6 (1978), 509-516.
2. R. Agrawal, T. Imielinski, and A. N. Swami, Mining Association rules between sets of items in large databases, In P. Buneman and S. Jajodia, edtors, Proc. of the. 1993 ACM SIGMOD International Conference on Management of Data, Vol. 22(2) of SIGMOD Record, pp. 207-216, ACM Press, 1993.
3. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen and A. I. Verkamo, Fast Discovery of Association Rules, In Advances in Knowledge Discovery and Data Mining, MIT Press, 307-328, 1996.
4. J.-F. Boulicaut, Proc. 2nd International Workshop on Knowledge Discovery in Inductive Databases (KDID'03), Cavtat-Dubrovnik, 2003.
5. Bryant, R. E., Graph-based algorithms for Boolean function manipulation, IEEE Trans. Comput., C-35, 8 (1986), 677-691.
6. D. Burdick, M. Calimlim, J. Gehrke, MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases, In Proc. ICDE 2001, 443-452, 2001.
7. B. Goethals, "Survey on Frequent Pattern Mining", Manuscript, 2003. http://www.cs.helsinki.fi/u/goethals/publications/survey.ps
8. B. Goethals, M. Javeed Zaki (Eds.), Frequent Itemset Mining Dataset Repository, Frequent Itemset Mining Implementations (FIMI'03), 2003. http://fimi.cs.helsinki.fi/data/
9. J. Han, J. Pei, Y. Yin, R. Mao, Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach, Data Mining and Knowledge Discovery, 8(1), 53-87, 2004.
10. L. Jiang, M. Inaba, and H. Imai: A BDD-based Method for Mining Association Rules, in Proceedings of 55th National Convention of IPSJ, Vol. 3, pp. 397-398, Sept. 1997, IPSJ.
11. Lee, C. Y., Representation of switching circuits by binary-decision programs, Bell Sys. Tech. Jour., 38 (1959), 985-999.
12. H. Mannila, H. Toivonen, Multiple Uses of Frequent Sets and Condensed Representations, In Proc. KDD, 189-194, 1996.
13. S. Minato: Zero-suppressed BDDs for set manipulation in combinatorial problems, In Proc. 30th ACM/IEEE Design Automation Conf. (DAC-93), (1993), 272-277.
14. S. Minato: "Binary Decision Diagrams and Applications for VLSI CAD", Kluwer Academic Publishers, November 1996.
15. S. Minato, Zero-suppressed BDDs and Their Applications, International Journal on Software Tools for Technology Transfer (STTT), Springer, Vol. 3, No. 2, pp. 156-170, May 2001.
16. Ricardo Baeza-Yates, Berthier Ribiero-Neto, "Modern Information Retrieval", Addison Wesley, 1999.
17. M. J. Zaki, Scalable Algorithms for Association Mining, IEEE Trans. Knowl. Data Eng. 12(2), 372-390, 2000.