메뉴 건너뛰기




Volumn 4093 LNAI, Issue , 2006, Pages 56-63

A fast algorithm for maintenance of association rules in incremental databases

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; DATA MINING; DATA STRUCTURES; TREES (MATHEMATICS); DATABASE SYSTEMS; FORESTRY;

EID: 33749380544     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11811305_5     Document Type: Conference Paper
Times cited : (32)

References (13)
  • 1
    • 0027621699 scopus 로고
    • Mining association rules between sets of items in large databases
    • May
    • R. Agrawal, T. Imielinski, and A. S wami. "Mining Association Rules between Sets of Items in Large Databases," Proceedings of ACM SIGMOD, May 1993, 207-216
    • (1993) Proceedings of ACM SIGMOD , pp. 207-216
    • Agrawal, R.1    Imielinski, T.2    Wami, A.S.3
  • 2
    • 0002221136 scopus 로고    scopus 로고
    • Fast algorithm for mining Association rules
    • R. Agrawal and R.Srikant. "Fast algorithm for mining Association rules," In VLDB'94, 487-499.
    • VLDB'94 , pp. 487-499
    • Agrawal, R.1    Srikant, R.2
  • 5
    • 0003372359 scopus 로고    scopus 로고
    • Mining frequent patterns by pattern-growth: Methodology and implications
    • J. Han and J. Pei. "Mining frequent patterns by pattern-growth: methodology and implications," In SIGKDD'00, 14-20.
    • SIGKDD'00 , pp. 14-20
    • Han, J.1    Pei, J.2
  • 6
    • 6344277753 scopus 로고    scopus 로고
    • Fast vertical mining using diffsets
    • Zaki and K. Gouda. "Fast vertical mining using diffsets," In SIGKDD'03, 326-335
    • SIGKDD'03 , pp. 326-335
    • Zaki1    Gouda, K.2
  • 10
    • 35048834898 scopus 로고    scopus 로고
    • An efficient approach for maintaining association rules based on adjusting FP-tree structures
    • Jia-Ling Koh and Shui-Feng Shieh. "An Efficient Approach for Maintaining Association Rules Based on Adjusting FP-Tree Structures," DASFAA 2004, 417-424
    • DASFAA 2004 , pp. 417-424
    • Koh, J.-L.1    Shieh, S.-F.2
  • 11
    • 0035007850 scopus 로고    scopus 로고
    • MAFIA: A maximal frequent itemset algorithm for transactional databases
    • D. Burdick, M. Calimlim, and J. Gehrke. "MAFIA: A maximal frequent itemset algorithm for transactional databases," In ICDE'01, 443-452.
    • ICDE'01 , pp. 443-452
    • Burdick, D.1    Calimlim, M.2    Gehrke, J.3
  • 12
    • 2442629149 scopus 로고    scopus 로고
    • CHARM: An efficient algorithm for closed itemset mining
    • M. Zaki and C. Hsiao. "CHARM: An efficient algorithm for closed itemset mining," In SDM'02, 12-28
    • SDM'02 , pp. 12-28
    • Zaki, M.1    Hsiao, C.2
  • 13
    • 77952363125 scopus 로고    scopus 로고
    • CLOSET+: Searching for the best strategies for mining frequent closed itemsets
    • J. Y. Wang, J. Han, and J. Pei. "CLOSET+: Searching for the Best Strategies for Mining Frequent Closed Itemsets," In SIGKDD'03, 236-245
    • SIGKDD'03 , pp. 236-245
    • Wang, J.Y.1    Han, J.2    Pei, J.3


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