메뉴 건너뛰기




Volumn 46, Issue 1, 2003, Pages 97-121

Incremental mining of sequential patterns in large databases

Author keywords

Data mining; Incremental mining; Sequential patterns

Indexed keywords

ALGORITHMS; COST EFFECTIVENESS; DATA MINING; WORLD WIDE WEB;

EID: 0037845220     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0169-023X(02)00209-4     Document Type: Article
Times cited : (115)

References (28)
  • 6
    • 0012192210 scopus 로고    scopus 로고
    • Efficient mining of association rules using closed itemset lattices
    • Pasquier N., Bastide Y., Taouil R., Lakhal L. Efficient mining of association rules using closed itemset lattices. Information Systems. 19(4):1998;33-54.
    • (1998) Information Systems , vol.19 , Issue.4 , pp. 33-54
    • Pasquier, N.1    Bastide, Y.2    Taouil, R.3    Lakhal, L.4
  • 11
    • 0038489721 scopus 로고    scopus 로고
    • Technical Report Ph.D. Dissertation, University of Rochester, New York
    • M. Zaki, Scalable data mining for rules, Technical Report Ph.D. Dissertation, University of Rochester, New York, 1998.
    • (1998) Scalable Data Mining for Rules
    • Zaki, M.1
  • 14
    • 0034227675 scopus 로고    scopus 로고
    • Quantifying the utility of the past in mining large databases
    • Pudi V., Haritsa J. Quantifying the utility of the past in mining large databases. Information Systems. 25(5):2000;323-344.
    • (2000) Information Systems , vol.25 , Issue.5 , pp. 323-344
    • Pudi, V.1    Haritsa, J.2
  • 15
    • 0031188758 scopus 로고    scopus 로고
    • Discovering patterns from large and dynamic sequential data
    • Wang K. Discovering patterns from large and dynamic sequential data. Journal of Intelligent Information Systems. 1997;8-33.
    • (1997) Journal of Intelligent Information Systems , pp. 8-33
    • Wang, K.1
  • 26
    • 0002790814 scopus 로고    scopus 로고
    • Efficient algorithms for discovering frequent sets in incremental databases
    • R. Feldman, Y. Aumann, Efficient algorithms for discovering frequent sets in incremental databases, in: Proceedings of the DMKD Workshop 1997 pp. 414-425.
    • (1997) Proceedings of the DMKD Workshop 1997 , pp. 414-425
    • Feldman, R.1    Aumann, Y.2
  • 28
    • 22444451988 scopus 로고    scopus 로고
    • Is sampling useful in data mining? A case in the maintenance of discovered association rule
    • Lee S., Cheung D., Kao B. Is sampling useful in data mining? A case in the maintenance of discovered association rule. Data Mining and Knowledge Discovery. 2(3):1998;233-262.
    • (1998) Data Mining and Knowledge Discovery , vol.2 , Issue.3 , pp. 233-262
    • Lee, S.1    Cheung, D.2    Kao, B.3


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