메뉴 건너뛰기




Volumn 1, Issue , 2006, Pages 593-597

Mining sequences with temporal annotations

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; FEATURE EXTRACTION; PATTERN RECOGNITION; PROBLEM SOLVING; RELATIONAL DATABASE SYSTEMS;

EID: 33751026482     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1141277.1141413     Document Type: Conference Paper
Times cited : (53)

References (7)
  • 2
    • 85140527321 scopus 로고    scopus 로고
    • An efficient approach to clustering in large multimedia databases with noise
    • A. Hinneburg and D. A. Keim. An efficient approach to clustering in large multimedia databases with noise. In Knowledge Discovery and Data Mining, pages 58-65, 1998.
    • (1998) Knowledge Discovery and Data Mining , pp. 58-65
    • Hinneburg, A.1    Keim, D.A.2
  • 3
    • 0035016443 scopus 로고    scopus 로고
    • Prefixspan: Mining sequential patterns by prefix-projected growth
    • J. Pei et al. Prefixspan: Mining sequential patterns by prefix-projected growth. In ICDE, pages 215-225, 2001.
    • (2001) ICDE , pp. 215-225
    • Pei, J.1
  • 4
    • 84897708583 scopus 로고    scopus 로고
    • Mining sequential patterns: Generalizations and performance improvements
    • R. Srikant and R. Agrawal. Mining sequential patterns: Generalizations and performance improvements. In EDBT, pages 3-17, 1996.
    • (1996) EDBT , pp. 3-17
    • Srikant, R.1    Agrawal, R.2
  • 7
    • 85135956507 scopus 로고    scopus 로고
    • Sequence mining in categorical domains: Incorporating constraints
    • M. J. Zaki. Sequence mining in categorical domains: Incorporating constraints. In CIKM, pages 422-429, 2000.
    • (2000) CIKM , pp. 422-429
    • Zaki, M.J.1


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