메뉴 건너뛰기




Volumn 1574, Issue , 1999, Pages 74-83

An efficient approach for incremental association rule mining

Author keywords

[No Author keywords available]

Indexed keywords

ASSOCIATION RULES; DATABASE SYSTEMS;

EID: 84947718804     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48912-6_10     Document Type: Conference Paper
Times cited : (16)

References (7)
  • 1
    • 0027621699 scopus 로고
    • Mining Association Rules between Sets of Items in Large Databases
    • Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules between Sets of Items in Large Databases, Proc. ACM SIGMOD, (1993) 207-216
    • (1993) Proc. ACM SIGMOD , pp. 207-216
    • Agrawal, R.1    Imielinski, T.2    Swami, A.3
  • 5
    • 50949090026 scopus 로고    scopus 로고
    • Efficient Graph-Based Algorithms for Discovering and Maintaining Knowledge in Large Databases
    • Lee, K.L., Efficient Graph-Based Algorithms for Discovering and Maintaining Knowledge in Large Databases, NTHU Master Thesis, (1997)
    • (1997) NTHU Master Thesis
    • Lee, K.L.1
  • 6
    • 84055221100 scopus 로고    scopus 로고
    • An Efficient Approach for Incremental Association Rule Mining
    • Tsai, P.S.M., Lee, C.C., Chen, A.L.P.: An Efficient Approach for Incremental Association Rule Mining, Technical Report, (1998)
    • (1998) Technical Report
    • Tsai, P.S.M.1    Lee, C.C.2    Chen, A.L.P.3


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