메뉴 건너뛰기




Volumn 7418 LNCS, Issue , 2012, Pages 71-82

A high-performance algorithm for frequent itemset mining

Author keywords

Algorithm; data mining; frequent itemsets

Indexed keywords

CORE PROBLEMS; EXPERIMENTAL DATA; FP GROWTHS; FP-GROWTH ALGORITHM; FREQUENT ITEMSET MINING; ITEM SETS; NOVEL PATTERNS; PATTERN GROWTH;

EID: 84865654164     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-32281-5_8     Document Type: Conference Paper
Times cited : (2)

References (21)
  • 2
    • 0036372484 scopus 로고    scopus 로고
    • Clustering by pattern similarity in large data sets
    • Wang, H., Wang, W., Yang, J., Yu, P.S.: Clustering by pattern similarity in large data sets. In: Proc. ACM SIGMOD, pp. 394-405 (2002)
    • (2002) Proc. ACM SIGMOD , pp. 394-405
    • Wang, H.1    Wang, W.2    Yang, J.3    Yu, P.S.4
  • 3
    • 52649163329 scopus 로고    scopus 로고
    • Direct discriminative pattern mining for effective classification
    • Cheng, H., Yan, X., Han, J., Yu, P.S.: Direct discriminative pattern mining for effective classification. In: Proc. ICDE, pp. 169-178 (2008)
    • (2008) Proc. ICDE , pp. 169-178
    • Cheng, H.1    Yan, X.2    Han, J.3    Yu, P.S.4
  • 4
    • 0027621699 scopus 로고
    • Mining association rules between sets of items in large databases
    • Agrawal, R., Imieliński, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proc. ACM SIGMOD, pp. 207-216 (1993)
    • (1993) Proc. ACM SIGMOD , pp. 207-216
    • Agrawal, R.1    Imieliński, T.2    Swami, A.3
  • 5
    • 0001882616 scopus 로고
    • Fast algorithms for mining association rules in large databases
    • Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proc. VLDB, pp. 487-499 (1994)
    • (1994) Proc. VLDB , pp. 487-499
    • Agrawal, R.1    Srikant, R.2
  • 6
    • 0002082857 scopus 로고
    • An efficient algorithm for mining association rules in large databases
    • Savasere, A., Omiecinski, E., Navathe, S.B.: An efficient algorithm for mining association rules in large databases. In: Proc. VLDB, pp. 432-444 (1995)
    • (1995) Proc. VLDB , pp. 432-444
    • Savasere, A.1    Omiecinski, E.2    Navathe, S.B.3
  • 8
    • 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 Min. Knowl. Disc. 8(1), 53-87 (2004)
    • (2004) Data Min. Knowl. Disc. , vol.8 , Issue.1 , pp. 53-87
    • Han, J.1    Pei, J.2    Yin, Y.3    Mao, R.4
  • 9
    • 0033718951 scopus 로고    scopus 로고
    • Scalable algorithms for association mining
    • Zaki, M.J.: Scalable algorithms for association mining. IEEE Trans. Knowl. Data Eng. 12(3), 372-390 (2000)
    • (2000) IEEE Trans. Knowl. Data Eng. , vol.12 , Issue.3 , pp. 372-390
    • Zaki, M.J.1
  • 10
    • 33644643725 scopus 로고    scopus 로고
    • A transaction mapping algorithm for frequent itemsets mining
    • Song, M., Rajasekaran, S.: A transaction mapping algorithm for frequent itemsets mining. IEEE Trans. Knowl. Data Eng. 18(4), 472-481 (2006)
    • (2006) IEEE Trans. Knowl. Data Eng. , vol.18 , Issue.4 , pp. 472-481
    • Song, M.1    Rajasekaran, S.2
  • 11
    • 6344277753 scopus 로고    scopus 로고
    • Fast vertical mining using diffsets
    • Zaki, M.J., Gouda, K.: Fast vertical mining using diffsets. In: Proc. ACM SIGKDD, pp. 326-335 (2003)
    • (2003) Proc. ACM SIGKDD , pp. 326-335
    • Zaki, M.J.1    Gouda, K.2
  • 12
    • 62249183038 scopus 로고    scopus 로고
    • Fiut: A new method for mining frequent itemsets
    • Tsay, Y.J., Hsu, T.J., Yu, J.R.: Fiut: A new method for mining frequent itemsets. Inf. Sci. 179(11), 1724-1737 (2009)
    • (2009) Inf. Sci. , vol.179 , Issue.11 , pp. 1724-1737
    • Tsay, Y.J.1    Hsu, T.J.2    Yu, J.R.3
  • 14
    • 79953879396 scopus 로고    scopus 로고
    • Memory-efficient frequent-itemset mining
    • Schlegel, B., Gemulla, R., Lehner, W.: Memory-efficient frequent-itemset mining. In: Proc. EDBT, pp. 461-472 (2011)
    • (2011) Proc. EDBT , pp. 461-472
    • Schlegel, B.1    Gemulla, R.2    Lehner, W.3
  • 16
    • 27644510774 scopus 로고    scopus 로고
    • Fast algorithms for frequent itemset mining using fp-trees
    • Grahne, G., Zhu, J.: Fast algorithms for frequent itemset mining using fp-trees. IEEE Trans. Knowl. Data Eng. 17(10), 1347-1362 (2005)
    • (2005) IEEE Trans. Knowl. Data Eng. , vol.17 , Issue.10 , pp. 1347-1362
    • Grahne, G.1    Zhu, J.2
  • 18
    • 33751160855 scopus 로고    scopus 로고
    • Efficient mining of frequent patterns using ascending frequency ordered prefix-tree
    • Liu, G., Lu, H., Lou, W., Xu, Y., Yu, J.X.: Efficient mining of frequent patterns using ascending frequency ordered prefix-tree. Data Min. Knowl. Disc. 9(3), 249-274 (2004)
    • (2004) Data Min. Knowl. Disc. , vol.9 , Issue.3 , pp. 249-274
    • Liu, G.1    Lu, H.2    Lou, W.3    Xu, Y.4    Yu, J.X.5


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