Frequent closed item set mining based on zero-suppressed BDDs

Transactions of the Japanese Society for Artificial Intelligence

Volumn 22, Issue 2, 2007, Pages 165-172

  Minato, Shin Ichi ^a   Arimura, Hiroki ^a  

^a HOKKAIDO UNIVERSITY   (Japan)

Author keywords

BDD; Closed pattern; Data mining; Item set; ZBDD

Indexed keywords

EID: 34247526012     PISSN: 13460714     EISSN: 13468030     Source Type: Journal    
DOI: 10.1527/tjsai.22.165     Document Type: Article

References (11)

1. Agrawal, R., Imielinski, T., and Swami, A. N.: Mining association rules between sets of items in large databases, in Buneman, P. and Jajodia, S. eds., Proc. of the 1993 ACM SIGMOD International Conference on Management of Data, Vol. 22(2) of SIGMOD Record. pp. 207-216 (1993)
2. Bryant, R. E.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, Vol. C-35. No. 8. pp. 677-691 (1986)
3. Coudert, O., Madre, J. C., and Fraisse, H.: A new viewpoint on two-level logic minimization, in Proc. of 30th ACM/IEEE Design Automation Conference, pp. 625-630 (1093)
4. Goethals, B.: Survey on frequent pattern mining (2003), http://www.cs.helsinki.fi/u/goethals/publications/survey.ps
5. Goethals, B. and Zaki, M. J.: Frequent itemset mining dataset repository (2003). Frequent Itemset Mining Implementations (FIMI'03), http://fimi.cs. helsinki.fi/data/
6. Han, J., Pei, J., Yin, Y., and Mao, R.: Mining frequent patterns without candidate generation: a frequent-pattern tree approach, Data Mining and Knowledge Discovery, Vol. 8, No. 1, pp. 53-87 (2004)
7. Minato, S.: Zero-suppressed BDDs for set manipulation in combinatorial problems, in Proc. of 30th ACM/IEEE Design Automation Conference, pp. 272-277 (1993)
8. Minato, S. and Arimura, H.: Frequent pattern mining and knowledge indexing based on zero-suppressed BDDs, in The 5th International Workshop on Knowledge Discovery in Inductive Databases (KDID'06), pp. 83-94 (2006)
9. Okuno, H., Minato, S., and Isozaki, H.: On the properties of combination set operations, in Information Procssing Letters, Vol. 66, pp. 195-199. Elsevier (1998)
10. Uno, T., Uchida, Y., Asai, T., and Arimura, H.: LCM: an efficient algorithm for enumerating frequent closed item sets, in Proc. Workshop on Frequent Itemset Mining Implementations (FIMI'03) (2003), http://fimi.cs.helsinki.fi/src/
11. Zaki, M. J.: Scalable algorithms for association mining, IEEE Trans. Knowl. Data Eng., Vol. 12, No. 2, pp. 372-390 (2000)