Symmetric item set mining based on zero-suppressed BDDs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4265 LNAI, Issue , 2006, Pages 321-326

  Minato, Shin Ichi ^a  

^a HOKKAIDO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BENCHMARKING; BOOLEAN FUNCTIONS; DATABASE SYSTEMS; INFORMATION RETRIEVAL; PROBLEM SOLVING;

BINARY DECISION DIAGRAMS (BDD); SYMMETRIC ITEM SET MINING; SYMMETRY CHECKING METHODS; ZERO SUPPRESSED BDD;

DATA MINING;

EID: 33750733013     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11893318_35     Document Type: Conference Paper

References (10)

1. 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.
2. Bryant, R. E., Graph-based algorithms for Boolean function manipulation, IEEE Trans. Comput., C-35, 8 (1986), 677-691.
3. B. Goethals, "Survey on Frequent Pattern Mining", Manuscript, 2003. http://www.cs.helsinki.fi/ u/goethals/publications/survey.ps
4. B. Goethals, M. Javeed Zaki (Eds.), Frequent Itemset Mining Dataset Repository, Frequent Itemset Mining Implementations (FIMI'03), 2003. http://fimi.cs.helsinki.fi/data/
5. N. Kettle and A. King: "An Anytime Symmetry Detection Algorithm for ROBDDs," In Proc. IEEE/ACM 11th Asia and South Pacific Design Automation Conference (ASPDAC-2006), pp. 243-248, Jan. 2006.
6. Minato, S., Zero-suppressed BDDs for set manipulation in combinatorial problems, In Proc. 30th ACM/IEEE Design Automation Conf. (DAC-93), (1993), 272-277.
7. S. Minato and H. Arimura: "Efficient Combinatorial Item Set Analysis Based on Zero-Suppressed BDDs", IEEE/IEICE/IPSJ International Workshop on Challenges in Web Information Retrieval and Integration (WIRI-2005), pp. 3-10, Apr., 2005.
8. S. Minato: "Finding Simple Disjoint Decompositions in Frequent Itemset Data Using Zero-suppressed BDD," In Proc. of IEEE ICDM 2005 workshop on Computational Intelligence in Data Mining, pp. 3-11, ISBN-0-9738918-5-8, Nov. 2005.
9. A. Mishchenko, "Fast Computation of Symmetries in Boolean Functions," IEEE Trans. Computer-Aided Design, Vol. 22, No. 11, pp. 1588-1593, 2003.
10. T. Uno, T. Asai, Y. Uchida and H. Arimura, "An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases," In Proc. of the 8th International Conference on Discovery Science 2004 (DS-2004), 2004.