메뉴 건너뛰기




Volumn 24, Issue 1, 2008, Pages 33-46

Mining closed sequential patterns with time constraints

Author keywords

Closed sequential pattern; Memory index; Sequence mining; Sequential pattern; Time constraint

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DATA STORAGE EQUIPMENT; DATABASE SYSTEMS; REAL TIME SYSTEMS;

EID: 38949192580     PISSN: 10162364     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper
Times cited : (11)

References (19)
  • 7
    • 12744252835 scopus 로고    scopus 로고
    • Fast discovery of sequential patterns through memory indexing and database partitioning
    • M. Y. Lin and S. Y. Lee, "Fast discovery of sequential patterns through memory indexing and database partitioning," Journal of Information Science and Engineering, Vol. 21, 2005, pp. 109-128.
    • (2005) Journal of Information Science and Engineering , vol.21 , pp. 109-128
    • Lin, M.Y.1    Lee, S.Y.2
  • 8
    • 23844526866 scopus 로고    scopus 로고
    • Efficient mining of sequential patterns with time constraints by delimited pattern-growth
    • M. Y. Lin and S. Y. Lee, "Efficient mining of sequential patterns with time constraints by delimited pattern-growth," Knowledge and Information Systems, Vol. 7, 2005, pp. 499-514.
    • (2005) Knowledge and Information Systems , vol.7 , pp. 499-514
    • Lin, M.Y.1    Lee, S.Y.2
  • 13
    • 23844553153 scopus 로고    scopus 로고
    • TSP: Mining top-& closed sequential patterns
    • T. Petre, X. Yan, and J. Han, "TSP: mining top-& closed sequential patterns," Knowledge and Information Systems, Vol. 7, 2005, pp. 438-457.
    • (2005) Knowledge and Information Systems , vol.7 , pp. 438-457
    • Petre, T.1    Yan, X.2    Han, J.3
  • 14
    • 2442588422 scopus 로고    scopus 로고
    • SLPMiner: An algorithm for finding frequent sequential patterns using length-decreasing support constraint
    • M. Seno and G. Karypis, "SLPMiner: an algorithm for finding frequent sequential patterns using length-decreasing support constraint," in Proceedings of the IEEE International Conference on Data Mining, 2002, pp. 418-425.
    • (2002) Proceedings of the IEEE International Conference on Data Mining , pp. 418-425
    • Seno, M.1    Karypis, G.2
  • 18
    • 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


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