메뉴 건너뛰기




Volumn 17, Issue 10, 2005, Pages 1347-1362

Fast algorithms for frequent itemset mining using FP-trees

Author keywords

Association rules; Data mining

Indexed keywords

ASSOCIATION RULES; DATA MINING TASKS; FP-ARRAY TECHNIQUE; INFORMATION COMPRESSION;

EID: 27644510774     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2005.166     Document Type: Article
Times cited : (476)

References (36)
  • 1
    • 84861259385 scopus 로고    scopus 로고
    • http://www.almaden.ibm.com/cs/quest/syndata.html, 2003.
    • (2003)
  • 2
    • 84861269418 scopus 로고    scopus 로고
    • http://www.almaden.ibm.com/cs/people/bayardo/resources.html, 2003.
    • (2003)
  • 3
    • 84861259389 scopus 로고    scopus 로고
    • http://fimi.cs.helsinki.fi, 2003.
    • (2003)
  • 4
    • 84861266475 scopus 로고    scopus 로고
    • http://www-sal.cs.uiuc.edu/~hanj/pubs/software.htm, 2004.
    • (2004)
  • 10
    • 0035007850 scopus 로고    scopus 로고
    • MAFIA: A maximal frequent itemset algorithm for transactional databases
    • Apr.
    • D. Burdick, M. Calimlim, and J. Gehrke, "MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases," Proc. Int'l Conf. Data Eng., pp. 443-452, Apr. 2001.
    • (2001) Proc. Int'l Conf. Data Eng. , pp. 443-452
    • Burdick, D.1    Calimlim, M.2    Gehrke, J.3
  • 13
    • 19544379860 scopus 로고    scopus 로고
    • Mining frequent itemsets from secondary memory
    • Nov.
    • G. Grahne and J. Zhu, "Mining Frequent Itemsets from Secondary Memory," Proc. IEEE Int'l Conf. Data Mining, pp. 91-98, Nov. 2004.
    • (2004) Proc. IEEE Int'l Conf. Data Mining , pp. 91-98
    • Grahne, G.1    Zhu, J.2
  • 15
    • 2442449952 scopus 로고    scopus 로고
    • Mining frequent patterns without candidate generation: A frequent-pattern tree approach
    • J. Han, J. Pei, Y. Yin, and R. Mao, "Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach," Data Mining and Knowledge Discovery, vol. 8, no. 1, pp. 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
  • 16
    • 78149328321 scopus 로고    scopus 로고
    • Mining top-K frequent closed patterns without minimum support
    • Dec.
    • J. Han, J. Wang, Y. Lu, and P. Tzvetkov, "Mining Top-K Frequent Closed Patterns without Minimum Support," Proc. Int'l Conf. Data Mining, pp. 211-218, Dec. 2002.
    • (2002) Proc. Int'l Conf. Data Mining , pp. 211-218
    • Han, J.1    Wang, J.2    Lu, Y.3    Tzvetkov, P.4
  • 20
    • 21944442464 scopus 로고    scopus 로고
    • Levelwise search and borders of theories in knowledge discovery
    • H. Mannila and H. Toivonen, "Levelwise Search and Borders of Theories in Knowledge Discovery," Data Mining and Knowledge Discovery, vol. 1, no. 3, pp. 241-258, 1997.
    • (1997) Data Mining and Knowledge Discovery , vol.1 , Issue.3 , pp. 241-258
    • Mannila, H.1    Toivonen, H.2
  • 25
    • 0031220368 scopus 로고    scopus 로고
    • Using a hash-based method with transaction trimming for mining association rules
    • J. Park, M. Chen, and P. Yu, "Using a Hash-Based Method with Transaction Trimming for Mining Association Rules," IEEE Trans. Knowledge and Data Eng. vol. 9, no. 5, pp. 813-825, 1997.
    • (1997) IEEE Trans. Knowledge and Data Eng. , vol.9 , Issue.5 , pp. 813-825
    • Park, J.1    Chen, M.2    Yu, P.3
  • 29
    • 0002663969 scopus 로고    scopus 로고
    • Sampling large databases for association rules
    • Sept.
    • H. Toivonen, "Sampling Large Databases for Association Rules," Proc. Int'l Conf. Very Large Data Bases, pp. 134-145, Sept. 1996.
    • (1996) Proc. Int'l Conf. Very Large Data Bases , pp. 134-145
    • Toivonen, H.1
  • 30
    • 77952363125 scopus 로고    scopus 로고
    • CLOSET+: Searching for the best strategies for mining frequent closed itemsets
    • Aug.
    • J. Wang, J. Han, and J. Pei, "CLOSET+: Searching for the Best Strategies for Mining Frequent Closed Itemsets," Proc. Int'l Conf. Knowledge Discovery and Data Mining, pp. 236-245, Aug. 2003.
    • (2003) Proc. Int'l Conf. Knowledge Discovery and Data Mining , pp. 236-245
    • Wang, J.1    Han, J.2    Pei, J.3
  • 31
    • 85012157812 scopus 로고    scopus 로고
    • Star-cubing: Computing iceberg cubes by top-down and bottom-up integration
    • Sept.
    • D. Xin, J. Han, X. Li, and B.W. Wah, "Star-Cubing: Computing Iceberg Cubes by Top-Down and Bottom-Up Integration," Proc. Int'l Conf. Very Large Data Bases, pp. 476-487, Sept. 2003.
    • (2003) Proc. Int'l Conf. Very Large Data Bases , pp. 476-487
    • Xin, D.1    Han, J.2    Li, X.3    Wah, B.W.4
  • 33
    • 0033718951 scopus 로고    scopus 로고
    • Scalable algorithms for association mining
    • M.J. Zaki, "Scalable Algorithms for Association Mining," IEEE Trans. Knowledge and Data Mining, vol. 12, no. 3, pp. 372-390, 2000.
    • (2000) IEEE Trans. Knowledge and Data Mining , vol.12 , Issue.3 , pp. 372-390
    • Zaki, M.J.1
  • 34
    • 0347709684 scopus 로고    scopus 로고
    • CHARM: An efficient algorithm for closed itemset mining
    • Apr.
    • M.J. Zaki and C. Hsiao, "CHARM: An Efficient Algorithm for Closed Itemset Mining," Proc. SIAM Int'l Conf. Data Mining, pp. 457-473, Apr. 2002.
    • (2002) Proc. SIAM Int'l Conf. Data Mining , pp. 457-473
    • Zaki, M.J.1    Hsiao, C.2
  • 36
    • 15744380682 scopus 로고    scopus 로고
    • Smartminer: A depth first algorithm guided by tail information for mining maximal frequent itemsets
    • Dec.
    • Q. Zou, W.W. Chu, and B. Lu, "SmartMiner: A Depth First Algorithm Guided by Tail Information for Mining Maximal Frequent Itemsets," Proc. IEEE Int'l Conf. Data Mining, Dec. 2002.
    • (2002) Proc. IEEE Int'l Conf. Data Mining
    • Zou, Q.1    Chu, W.W.2    Lu, B.3


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