메뉴 건너뛰기




Volumn 26, Issue 3, 2007, Pages 231-242

IMSP: An information theoretic approach for multi-dimensional sequential pattern mining

Author keywords

Data mining; Hellinger measure; Machine learning; Sequential pattern

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; INFORMATION THEORY; PATTERN RECOGNITION;

EID: 34247101918     PISSN: 0924669X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10489-006-0016-0     Document Type: Article
Times cited : (3)

References (14)
  • 2
    • 84947770983 scopus 로고    scopus 로고
    • The PSP approach for mining sequential patterns
    • In the 2nd European symposium on principles of data mining and knowledge discovery PKDD'98, Nantes, France
    • Masseglia F, Cathala F, Poncelet P (1998) The PSP approach for mining sequential patterns. In the 2nd European symposium on principles of data mining and knowledge discovery (PKDD'98). vol 1510, Nantes, France, LNAI, pp 176-184
    • (1998) LNAI , vol.1510 , pp. 176-184
    • Masseglia, F.1    Cathala, F.2    Poncelet, P.3
  • 3
    • 0036565016 scopus 로고    scopus 로고
    • Mining sequential patterns with regular expression constraints
    • Garafalakis M, Rastogi R, Shim K (2002) Mining sequential patterns with regular expression constraints. IEEE Trans Knowl Data Eng 14(3):530-552
    • (2002) IEEE Trans Knowl Data Eng , vol.14 , Issue.3 , pp. 530-552
    • Garafalakis, M.1    Rastogi, R.2    Shim, K.3
  • 6
    • 0034826102 scopus 로고    scopus 로고
    • Zaki MJ (2001) SPADE: an efficient algorithm for mining frequent sequences. In: Fisher D (ed) Mach Learn J, special issue on Unsupervised Learning 42, nos (1/2) pp 31-60
    • Zaki MJ (2001) SPADE: an efficient algorithm for mining frequent sequences. In: Fisher D (ed) Mach Learn J, special issue on Unsupervised Learning vol. 42, nos (1/2) pp 31-60
  • 7
    • 2442446148 scopus 로고    scopus 로고
    • BIDE: Efficient mining of frequent closed sequences
    • Wang J, Han J (2004) BIDE: efficient mining of frequent closed sequences. Int Conf Data Eng (ICDE04)
    • (2004) Int Conf Data Eng (ICDE04)
    • Wang, J.1    Han, J.2
  • 8
    • 4444326044 scopus 로고    scopus 로고
    • CloSpan: Mining closed sequential patterns in large databases
    • Yan X, Han J, Afshar R (2003) CloSpan: mining closed sequential patterns in large databases. Int Conf Data Min
    • (2003) Int Conf Data Min
    • Yan, X.1    Han, J.2    Afshar, R.3
  • 10
    • 34247159646 scopus 로고    scopus 로고
    • ApproxMAP: Approximate mining of consensus sequential patterns
    • Kim H, Pei J, Wang W, Duncan D (2003) ApproxMAP: approximate mining of consensus sequential patterns. Int Conf Data Min
    • (2003) Int Conf Data Min
    • Kim, H.1    Pei, J.2    Wang, W.3    Duncan, D.4
  • 12
    • 34247141521 scopus 로고    scopus 로고
    • Quinlan JR (1993) C4.5: programs for machine learning. Morgan Kaufmann Publisher
    • Quinlan JR (1993) C4.5: programs for machine learning. Morgan Kaufmann Publisher
  • 14
    • 0000204608 scopus 로고
    • Minimum hellinger distances for parametric models
    • Beran RJ (1977) Minimum hellinger distances for parametric models. Ann. Statistics 5:445-463
    • (1977) Ann. Statistics , vol.5 , pp. 445-463
    • Beran, R.J.1


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