메뉴 건너뛰기




Volumn 28, Issue 1, 2005, Pages 128-135

Fast updating maximum frequent itemsets

Author keywords

Data mining; Frequent pattern tree; Maximum frequent itemset; Updating

Indexed keywords

ALGORITHMS; TREES (MATHEMATICS);

EID: 14744283215     PISSN: 02544164     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (21)

References (13)
  • 4
    • 0003863164 scopus 로고    scopus 로고
    • Mining partial periodicity using frequent pattern tree
    • Simon Fraser University: Technical Report TR-99-10
    • Han J. W., Pei J., Yin Y.. Mining partial periodicity using frequent pattern tree. Simon Fraser University: Technical Report TR-99-10, 1999
    • (1999)
    • Han, J.W.1    Pei, J.2    Yin, Y.3
  • 5
    • 1642453875 scopus 로고    scopus 로고
    • An incremental updating algorithm based on prefix general list for association rules
    • Chinese source
    • Yang Ming, Sun Zhi-Hui. An incremental updating algorithm based on prefix general list for association rules. Chinese Journal of Computers, 2003, 26(10): 1318-1325 (in Chinese)
    • (2003) Chinese Journal of Computers , vol.26 , Issue.10 , pp. 1318-1325
    • Yang, M.1    Sun, Z.-H.2
  • 8
    • 0032262291 scopus 로고    scopus 로고
    • Incremental updating algorithms for mining association rules
    • Chinese source
    • Feng Yu-Cai, Feng Jian-Lin. Incremental updating algorithms for mining association rules. Journal of Software, 1998, 9(4): 301-306 (in Chinese)
    • (1998) Journal of Software , vol.9 , Issue.4 , pp. 301-306
    • Feng, Y.-C.1    Feng, J.-L.2
  • 11
    • 84890521199 scopus 로고    scopus 로고
    • Pincer-Search: A new algorithm for discovering the maximum frequent set
    • Scheck H.J., Saltor F. and Ramos I.(ed.), Heidelberg: Springer-Verlag
    • Lin D., Kedem Z. M.. Pincer-Search: A new algorithm for discovering the maximum frequent set. In: Scheck H. J., Saltor F., Ramos I. et al, eds.. Proceedings of the 6th European Conference on Extending Database Technology, Heidelberg: Springer-Verlag, 1998, 105-119
    • (1998) Proceedings of the 6th European Conference on Extending Database Technology , pp. 105-119
    • Lin, D.1    Kedem, Z.M.2
  • 12
    • 0035242284 scopus 로고    scopus 로고
    • Fast mining maximum frequent itemsets
    • Chinese source
    • Lu Song-Feng, Lu Zheng-Ding. Fast mining maximum frequent itemsets. Journal of Software, 2001, 12(2): 293-297 (in Chinese)
    • (2001) Journal of Software , vol.12 , Issue.2 , pp. 293-297
    • Lu, S.-F.1    Lu, Z.-D.2
  • 13
    • 0346252716 scopus 로고    scopus 로고
    • An algorithm and its updating algorithm based on FP-tree for mining maximum frequent itemsets
    • Chinese source
    • Song Yu-Qing, Zhu Yu-Quan, Sun Zhi-Hui, Chen Geng. An algorithm and its updating algorithm based on FP-tree for mining maximum frequent itemsets. Journal of Software, 2003, 14(9): 1586-1592 (in Chinese)
    • (2003) Journal of Software , vol.14 , Issue.9 , pp. 1586-1592
    • Song, Y.-Q.1    Zhu, Y.-Q.2    Sun, Z.-H.3    Chen, G.4


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