메뉴 건너뛰기




Volumn 5012 LNAI, Issue , 2008, Pages 234-246

LCM over ZBDDs: Fast generation of very large-scale frequent itemsets using a compact graph-based representation

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATIONAL METHODS; DATA COMPRESSION; DATA MINING;

EID: 44649117401     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68125-0_22     Document Type: Conference Paper
Times cited : (35)

References (16)
  • 1
    • 0027621699 scopus 로고    scopus 로고
    • Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: Buneman, P., Jajodia, S. (eds.) Proc. of the 1993 ACM SIGMOD International Conference on Management of Data, 22(2) of SIGMOD Record, pp. 207-216 (1993)
    • Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: Buneman, P., 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
    • 0022769976 scopus 로고
    • Graph-based algorithms for Boolean function manipulation
    • Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers C-35(8), 677-691 (1986)
    • (1986) IEEE Transactions on Computers , vol.C-35 , Issue.8 , pp. 677-691
    • Bryant, R.E.1
  • 4
    • 44649176836 scopus 로고    scopus 로고
    • Goethals, B., Zaki, M.J.: Frequent itemset mining dataset repository. In: Frequent Itemset Mining Implementations (FIMI 2003) (2003), http://fimi.es.helsinki.fi/data/
    • Goethals, B., Zaki, M.J.: Frequent itemset mining dataset repository. In: Frequent Itemset Mining Implementations (FIMI 2003) (2003), http://fimi.es.helsinki.fi/data/
  • 5
    • 2442449952 scopus 로고    scopus 로고
    • Mining frequent patterns without candidate generation: A frequent-pattern tree approach
    • Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Mining and Knowledge Discovery 8(1), 53-87 (2004)
    • (2004) Data Mining and Knowledge Discovery , vol.8 , Issue.1 , pp. 53-87
    • Han, J.1    Pei, J.2    Yin, Y.3    Mao, R.4
  • 7
    • 0027211369 scopus 로고
    • Zero-suppressed BDDs for set manipulation in combinatorial problems
    • Minato, S.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: Proc. of 30th ACM/IEEE Design Automation Conference, pp. 272-277 (1993)
    • (1993) Proc. of 30th ACM/IEEE Design Automation Conference , pp. 272-277
    • Minato, S.1
  • 8
    • 33750733013 scopus 로고    scopus 로고
    • Minato, S.: Symmetric item set mining based on zero-suppressed BDDs. In: Todorovski, L., Lavrač, N., Jantke, K.P. (eds.) DS 2006. LNCS (LNAI), 4265, pp. 321-326. Springer, Heidelberg (2006)
    • Minato, S.: Symmetric item set mining based on zero-suppressed BDDs. In: Todorovski, L., Lavrač, N., Jantke, K.P. (eds.) DS 2006. LNCS (LNAI), vol. 4265, pp. 321-326. Springer, Heidelberg (2006)
  • 9
    • 33746035952 scopus 로고    scopus 로고
    • Minato, S., Arimura, H.: Efficient combinatorial item set analysis based on zero-suppressed BDDs. In: Proc. IEEE/IEICE/IPSJ International Workshop on Challenges in Web Information Retrieval and Integration (WIRI-2005), April 2005, pp. 3-10 (2005)
    • Minato, S., Arimura, H.: Efficient combinatorial item set analysis based on zero-suppressed BDDs. In: Proc. IEEE/IEICE/IPSJ International Workshop on Challenges in Web Information Retrieval and Integration (WIRI-2005), April 2005, pp. 3-10 (2005)
  • 10
    • 34247526012 scopus 로고    scopus 로고
    • Minato, S., Arimura, H.: frequent closed item set mining based on zero-suppressed BDDs. Trans. of the Japanese Society of Artificial Intelligence 22(2), 165-172 (2007)
    • Minato, S., Arimura, H.: frequent closed item set mining based on zero-suppressed BDDs. Trans. of the Japanese Society of Artificial Intelligence 22(2), 165-172 (2007)
  • 11
    • 38449098336 scopus 로고    scopus 로고
    • Minato, S., Arimura, H.: Frequent pattern mining and knowledge indexing based on zero-suppressed BDDs. In: Džeroski, S., Struyf, J. (eds.) KDID 2006. LNCS, 4747, pp. 152-169. Springer, Heidelberg (2007)
    • Minato, S., Arimura, H.: Frequent pattern mining and knowledge indexing based on zero-suppressed BDDs. In: Džeroski, S., Struyf, J. (eds.) KDID 2006. LNCS, vol. 4747, pp. 152-169. Springer, Heidelberg (2007)
  • 13
    • 44649135040 scopus 로고    scopus 로고
    • Uno, T., Kiyomi, M., Arimura, H.: LCM ver.2: efficient mining algorithms for frequent/closed/maximal itemsets. In: Perner, P. (ed.) ICDM 2004. LNCS (LNAI), 3275, Springer, Heidelberg (2004)
    • Uno, T., Kiyomi, M., Arimura, H.: LCM ver.2: efficient mining algorithms for frequent/closed/maximal itemsets. In: Perner, P. (ed.) ICDM 2004. LNCS (LNAI), vol. 3275, Springer, Heidelberg (2004)
  • 16
    • 0033718951 scopus 로고    scopus 로고
    • Scalable algorithms for association mining
    • Zaki, M.J.: Scalable algorithms for association mining. IEEE Trans. Knowl. Data Eng. 12(2), 372-390 (2000)
    • (2000) IEEE Trans. Knowl. Data Eng , vol.12 , Issue.2 , pp. 372-390
    • Zaki, M.J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.