메뉴 건너뛰기




Volumn 3589, Issue , 2005, Pages 458-467

A general effective framework for monotony and tough constraint based sequential pattern mining

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; PATTERN RECOGNITION;

EID: 26844513291     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11546849_45     Document Type: Conference Paper
Times cited : (2)

References (9)
  • 1
  • 3
    • 0035016443 scopus 로고    scopus 로고
    • PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth
    • Heidelberg, Germany, April
    • Jian Pei, Jiawei Han, Behzad Mortazavi-Asl and Helen Pinto. PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth. In. Proc. 2001 Int. Conf. Data Engineering (ICDE'01), pages 215-224, Heidelberg, Germany, April 2001.
    • (2001) Proc. 2001 Int. Conf. Data Engineering (ICDE'01) , pp. 215-224
    • Pei, J.1    Han, J.2    Mortazavi-Asl, B.3    Pinto, H.4


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