메뉴 건너뛰기




Volumn , Issue , 2002, Pages 330-337

PERUSE: An unsupervised algorithm for finding recurring patterns in time series

Author keywords

[No Author keywords available]

Indexed keywords


EID: 6344252433     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (65)

References (16)
  • 2
    • 0002759539 scopus 로고
    • Unsupervised learning of multiple motifs in biopolymers using expectation maximization
    • Bailey, T. L., & Elkan, C. (1995). Unsupervised learning of multiple motifs in biopolymers using expectation maximization. Machine Learning, 21, 51-83.
    • (1995) Machine Learning , vol.21 , pp. 51-83
    • Bailey, T.L.1    Elkan, C.2
  • 4
    • 0032677683 scopus 로고    scopus 로고
    • An efficient and probabilistically sound algorithm for word discovery
    • Brent, M. R. (1999). An efficient and probabilistically sound algorithm for word discovery. Machine Learning, 34, 71-105.
    • (1999) Machine Learning , vol.34 , pp. 71-105
    • Brent, M.R.1
  • 7
    • 26444565569 scopus 로고
    • Finding structure in time
    • Elman, J. L. (1990). Finding structure in time. Cognitive Science, 14, 179-211.
    • (1990) Cognitive Science , vol.14 , pp. 179-211
    • Elman, J.L.1
  • 8
    • 0000679216 scopus 로고
    • Distributional structure
    • Harris, Z. S. (1954). Distributional structure. Word, 10, 146-162.
    • (1954) Word , vol.10 , pp. 146-162
    • Harris, Z.S.1
  • 10
    • 0025372992 scopus 로고
    • Identification of concensus patterns in unaligned DNA sequences known to be functionally related
    • Hertz, G. Z., Hartzell, G. W., & Stormo, G. D. (1990). Identification of concensus patterns in unaligned DNA sequences known to be functionally related. Computer Applications in Biosciences, 6, 81-92.
    • (1990) Computer Applications in Biosciences , vol.6 , pp. 81-92
    • Hertz, G.Z.1    Hartzell, G.W.2    Stormo, G.D.3
  • 13
    • 0027912333 scopus 로고
    • Detecting subtle sequence signals: A gibbs sampling strategy for multiple alignment
    • Lawrence, C. E., Altschul, S. F., Boguski, M. S., Liu, J. S., Neuwald, A. F., & Wooton, J. C. (1993). Detecting subtle sequence signals: A gibbs sampling strategy for multiple alignment. Science, 262, 208-214.
    • (1993) Science , vol.262 , pp. 208-214
    • Lawrence, C.E.1    Altschul, S.F.2    Boguski, M.S.3    Liu, J.S.4    Neuwald, A.F.5    Wooton, J.C.6
  • 16
    • 0034826102 scopus 로고    scopus 로고
    • SPADE: An efficient algorithm for mining frequent sequences
    • DOI 10.1023/A:1007652502315
    • Zaki, M. J. (2001). SPADE: An efficient algorithm for mining frequent sequences. Machine Learning, 42, 31-60. (Pubitemid 32872398)
    • (2001) Machine Learning , vol.42 , Issue.1-2 , pp. 31-60
    • Zaki, M.J.1


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