메뉴 건너뛰기




Volumn 3287, Issue , 2004, Pages 478-486

A fast algorithm to find all the maximal frequent sequences in a text

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; PATTERN RECOGNITION;

EID: 33749669643     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30463-0_60     Document Type: Article
Times cited : (13)

References (10)
  • 5
    • 0035016443 scopus 로고    scopus 로고
    • PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth
    • ICDE 01
    • Pei, J, Han, et all: "PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth" in Proc International Conference on Data Engineering (ICDE 01), 2001.
    • (2001) Proc International Conference on Data Engineering
    • Pei, J.1    Han2
  • 10
    • 35048816773 scopus 로고    scopus 로고
    • Public domain documents from American and English literature as well as Western philosophy. http://www.infomotions.com/alex/


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