메뉴 건너뛰기




Volumn 3878 LNCS, Issue , 2006, Pages 514-523

A new algorithm for fast discovery of maximal sequential patterns in a document collection

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER SCIENCE; DATA MINING; DATABASE SYSTEMS; INFORMATION RETRIEVAL; PATTERN RECOGNITION; PROBLEM SOLVING; TEXT PROCESSING;

EID: 33745542053     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper
Times cited : (30)

References (11)
  • 4
    • 0035016443 scopus 로고    scopus 로고
    • PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth
    • Pel, 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 (ICDE 01)
    • Pel, J.1    Han2
  • 7
    • 33745573515 scopus 로고    scopus 로고
    • http://kdd.ics.uci.edu/databases/reuters21578/reuters21578.html
  • 8
    • 85135956507 scopus 로고    scopus 로고
    • Sequence mining in categorical domains: Incorporating constraints
    • Washington, DC, November
    • Mohammed J. Zaki, Sequence Mining in Categorical Domains: Incorporating Constraints, in 9th International Conference on Information and Knowledge Management, pp 422-429, Washington, DC, November 2000.
    • (2000) 9th International Conference on Information and Knowledge Management , pp. 422-429
    • Zaki, M.J.1
  • 11
    • 13844256245 scopus 로고    scopus 로고
    • Mining sequential patterns by pattern-growth: The prefixSpan approach
    • October
    • Jian Pei, Jiawei Han, et. al. "Mining Sequential Patterns by Pattern-Growth: The PrefixSpan Approach", IEEE Transactions on Knowledge and Data Engineering, Vol. 16, No. 10, October 2004.
    • (2004) IEEE Transactions on Knowledge and Data Engineering , vol.16 , Issue.10
    • Pei, J.1    Han, J.2


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