메뉴 건너뛰기




Volumn 21, Issue 1, 2005, Pages 109-128

Fast discovery of sequential patterns through memory indexing and database partitioning

Author keywords

Data mining; Database partitioning; Find then index; Memory indexing; Sequential patterns

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE; DATA MINING; DATABASE SYSTEMS; OPTIMIZATION; PATTERN MATCHING; THRESHOLD LOGIC;

EID: 12744252835     PISSN: 10162364     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (47)

References (23)
  • 16
    • 0029212693 scopus 로고    scopus 로고
    • Mining sequential patterns: Generalizations and performance improvements
    • An extended version is the IBM Research Report RJ 9994
    • R. Srikant and R. Agrawal, "Mining sequential patterns: Generalizations and performance improvements," in Proceedings of 5th International Conference on Extending Database Technology, 1996, pp. 3-17. (An extended version is the IBM Research Report RJ 9994)
    • (1996) Proceedings of 5th International Conference on Extending Database Technology , pp. 3-17
    • Srikant, R.1    Agrawal, R.2
  • 18
    • 0031188758 scopus 로고    scopus 로고
    • Discovering patterns from large and dynamic sequential data
    • K. Wang, "Discovering patterns from large and dynamic sequential data," Journal of Intelligent Information Systems, Vol. 9, 1997, pp. 33-56.
    • (1997) Journal of Intelligent Information Systems , vol.9 , pp. 33-56
    • Wang, K.1
  • 21
    • 0034826102 scopus 로고    scopus 로고
    • SPADE: An efficient algorithm for mining frequent sequences
    • M. J. Zaki, "SPADE: an efficient algorithm for mining frequent sequences," Machine Learning Journal, Vol. 42, 2001, pp. 31-60.
    • (2001) Machine Learning Journal , vol.42 , pp. 31-60
    • Zaki, M.J.1
  • 23
    • 12744275799 scopus 로고    scopus 로고
    • Private communication with Prof. Jiawei Han
    • Private communication with Prof. Jiawei Han.


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