메뉴 건너뛰기




Volumn 36, Issue 8, 2009, Pages 10890-10895

A decremental algorithm of frequent itemset maintenance for mining updated databases

Author keywords

Decremental mining; Dynamic database mining; Incremental mining

Indexed keywords

DATA MANAGEMENT; DATA MINING ALGORITHM; DATA UPDATE; DECREMENTAL ALGORITHMS; DECREMENTAL MINING; DYNAMIC DATABASE MINING; FREQUENT ITEMSET; FUNDAMENTAL OPERATIONS; INCREMENTAL MINING; MACHINE-LEARNING; MINING TECHNIQUES; PATTERN DISCOVERY; WELL MODEL;

EID: 67349218361     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2009.02.016     Document Type: Article
Times cited : (6)

References (9)
  • 1
    • 0002221136 scopus 로고
    • Fast algorithms for mining association rules
    • Agrawal R., and Srikant R. Fast algorithms for mining association rules. VLDB94 (1994) 487-499
    • (1994) VLDB94 , pp. 487-499
    • Agrawal, R.1    Srikant, R.2
  • 2
    • 0029733589 scopus 로고    scopus 로고
    • Maintenance of discovered association rules in large databases: An incremental updating technique
    • Cheung D., Han J., Ng V., and Wong C. Maintenance of discovered association rules in large databases: An incremental updating technique. ICDE'96 (1996) 106-114
    • (1996) ICDE'96 , pp. 106-114
    • Cheung, D.1    Han, J.2    Ng, V.3    Wong, C.4
  • 3
    • 0039253846 scopus 로고    scopus 로고
    • Mining frequent patterns without candidate generation
    • Han J., Pei J., and Yin Y. Mining frequent patterns without candidate generation. SIGMOD00 (2000) 1-12
    • (2000) SIGMOD00 , pp. 1-12
    • Han, J.1    Pei, J.2    Yin, Y.3
  • 5
    • 85049125672 scopus 로고    scopus 로고
    • An efficient algorithm for the incremental updation of association rules in large databases
    • Thomas S., Bodagala S., Alsabti K., and Ranka S. An efficient algorithm for the incremental updation of association rules in large databases. KDD'97 (1997) 263-266
    • (1997) KDD'97 , pp. 263-266
    • Thomas, S.1    Bodagala, S.2    Alsabti, K.3    Ranka, S.4
  • 6
    • 0002663971 scopus 로고    scopus 로고
    • Sampling large databases for association rules
    • Toivonen H. Sampling large databases for association rules. VLDB96 (1996) 134-145
    • (1996) VLDB96 , pp. 134-145
    • Toivonen, H.1
  • 7
    • 85152519885 scopus 로고
    • An improved algorithm for incremental induction of decision trees
    • Utgoff P. An improved algorithm for incremental induction of decision trees. ICML'94 (1994) 318-325
    • (1994) ICML'94 , pp. 318-325
    • Utgoff, P.1
  • 8
    • 0041428173 scopus 로고    scopus 로고
    • Post-mining: Maintenance of association rules by weighting
    • Zhang S.C., Zhang C., and Yan X. Post-mining: Maintenance of association rules by weighting. Information Systems 28 7 (2003) 691-707
    • (2003) Information Systems , vol.28 , Issue.7 , pp. 691-707
    • Zhang, S.C.1    Zhang, C.2    Yan, X.3
  • 9
    • 34147142304 scopus 로고    scopus 로고
    • EDUA: An efficient algorithm for dynamic database mining
    • Zhang S.C., Zhang J.L., and Zhang C.Q. EDUA: An efficient algorithm for dynamic database mining. Information Sciences 177 13 (2007) 2756-2767
    • (2007) Information Sciences , vol.177 , Issue.13 , pp. 2756-2767
    • Zhang, S.C.1    Zhang, J.L.2    Zhang, C.Q.3


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