메뉴 건너뛰기




Volumn 19, Issue 9, 2007, Pages 1188-1201

Discovering frequent generalized episodes when events persist for different durations

Author keywords

Data mining; Efficient algorithms; Event durations; Frequent episodes; Sequential data

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; CONSTRAINT THEORY; DATA STRUCTURES;

EID: 34547997531     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2007.1055     Document Type: Article
Times cited : (50)

References (12)
  • 3
    • 0032627945 scopus 로고    scopus 로고
    • Efficient Mining of Partial Periodic Patterns in Time Series Database
    • J. Han, G. Dong, and Y. Yin, "Efficient Mining of Partial Periodic Patterns in Time Series Database," Proc. 15th Int'l Conf. Data Eng., (ICDE '99), pp. 106-115, 1999.
    • (1999) Proc. 15th Int'l Conf. Data Eng., (ICDE '99) , pp. 106-115
    • Han, J.1    Dong, G.2    Yin, Y.3
  • 4
    • 28244452013 scopus 로고    scopus 로고
    • Discovering Frequent Episodes and Learning Hidden Markov Models: A Formal Connection
    • Nov
    • S. Laxman, P.S. Sastry, and K.P. Unnikrishnan, "Discovering Frequent Episodes and Learning Hidden Markov Models: A Formal Connection," IEEE Trans. Knowledge and Data Eng., vol. 17, no. 11, pp. 1505-1517, Nov. 2005.
    • (2005) IEEE Trans. Knowledge and Data Eng , vol.17 , Issue.11 , pp. 1505-1517
    • Laxman, S.1    Sastry, P.S.2    Unnikrishnan, K.P.3
  • 12
    • 34547998282 scopus 로고    scopus 로고
    • Discovering Frequent Episodes: Fast Algorithms, Connections with HMMs and Generalizations,
    • PhD dissertation, Dept. of Electrical Eng, Indian Inst. of Science, Mar
    • S. Laxman, "Discovering Frequent Episodes: Fast Algorithms, Connections with HMMs and Generalizations," PhD dissertation, Dept. of Electrical Eng., Indian Inst. of Science, Mar. 2006.
    • (2006)
    • Laxman, S.1


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