메뉴 건너뛰기




Volumn 37, Issue 1, 2010, Pages 618-626

An efficient and effective association-rule maintenance algorithm for record modification

Author keywords

Association rule; Data mining; Large itemset; Pre large itemset; Record modification

Indexed keywords

COMPUTATION TIME; ITEM SETS; LARGE ITEMSET; MAINTENANCE ALGORITHMS; MAINTENANCE COST; MINING ALGORITHMS; PRE-LARGE ITEMSET; REAL-WORLD APPLICATION; RECORD MODIFICATION;

EID: 70349440958     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2009.06.019     Document Type: Article
Times cited : (22)

References (14)
  • 1
    • 0027621699 scopus 로고
    • Mining association rules between sets of items in large database
    • In The
    • Agrawal, R., Imielinksi, T., & Swami, A. (1993). Mining association rules between sets of items in large database. In The ACM SIGMOD conference, pp. 207-216.
    • (1993) ACM SIGMOD conference , pp. 207-216
    • Agrawal, R.1    Imielinksi, T.2    Swami, A.3
  • 4
    • 0029733589 scopus 로고    scopus 로고
    • Cheung, D. W., Han, J., Ng, V. T., & Wong, C. Y. (1996). Maintenance of discovered association rules in large databases: an incremental updating approach. In The 12th IEEE international conference on data engineering, pp. 106-114.
    • Cheung, D. W., Han, J., Ng, V. T., & Wong, C. Y. (1996). Maintenance of discovered association rules in large databases: an incremental updating approach. In The 12th IEEE international conference on data engineering, pp. 106-114.
  • 7
    • 0039253846 scopus 로고    scopus 로고
    • Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. In The 2000 ACM SIGMOD international conference on management of data, pp. 1-12.
    • Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. In The 2000 ACM SIGMOD international conference on management of data, pp. 1-12.
  • 8
    • 34548128899 scopus 로고    scopus 로고
    • A fast updated frequent pattern tree
    • In The, man, and cybernetics, pp
    • Hong, T. P., Lin, J. W., & Wu, Y. L. (2006). A fast updated frequent pattern tree. In The IEEE international conference on systems, man, and cybernetics, pp. 2167-2172.
    • (2006) IEEE international conference on systems , pp. 2167-2172
    • Hong, T.P.1    Lin, J.W.2    Wu, Y.L.3
  • 9
    • 4544277888 scopus 로고    scopus 로고
    • A new incremental data mining algorithm using pre-large itemsets
    • Hong T.P., Wang C.Y., and Tao Y.H. A new incremental data mining algorithm using pre-large itemsets. Intelligent Data Analysis 5 2 (2001) 111-129
    • (2001) Intelligent Data Analysis , vol.5 , Issue.2 , pp. 111-129
    • Hong, T.P.1    Wang, C.Y.2    Tao, Y.H.3
  • 11
    • 0031220368 scopus 로고    scopus 로고
    • Using a hash-based method with transaction trimming for mining association rules
    • Park J.S., Chen M.S., and Yu P.S. Using a hash-based method with transaction trimming for mining association rules. IEEE Transactions on Knowledge and Data Engineering 9 5 (1997) 812-825
    • (1997) IEEE Transactions on Knowledge and Data Engineering , vol.9 , Issue.5 , pp. 812-825
    • Park, J.S.1    Chen, M.S.2    Yu, P.S.3
  • 13
    • 0030157416 scopus 로고    scopus 로고
    • Srikant, R., & Agrawal, R. (1996). Mining quantitative association rules in large relational tables. In The 1996 ACM SIGMOD international conference on management of Data, pp. 1-12.
    • Srikant, R., & Agrawal, R. (1996). Mining quantitative association rules in large relational tables. In The 1996 ACM SIGMOD international conference on management of Data, pp. 1-12.
  • 14


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