[confproc]
J. Alon
/ 2003
/ Discovering cluster in motion time-series data
/ Proceedings of Computer Vision and Pattern Recognition
[confproc]
F. Porrkli
/ 2004
/ Clustering variable length sequences by eigenvector decomposition using hmm
/ Intermational workshop on statistical pattern recognition(SPR 2004)
[journal]
T. Okuda
/ 1976
/ A method for the correction of garbled words based on the levenshtein metric
/ IEEE Transaction on Computers
C25(2)
: 172~177
[book]
A. K. Jain
/ 1988
/ Algorithms for clustering data
/ Prentice Hall
[confproc]
J. Lin
/ 2002
/ Finding motifs in time series," In the Workshop on Temporal Data Mining
/ at the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
[confproc]
L. Rabiner
/ 1989
/ A tutorial on Hidden Markov Models and selected applications in speech recognition
/ Proc. of IEEE
: 257~286
[journal]
전진호
/ 2006
/
A Study for Determining the Best Number of Clusters on Temporal Data
/ 한국콘텐츠학회 논문지
/ 한국콘텐츠학회
6(1)
: 23~30
[confproc]
T. Kosaka
/ 1995
/ Speaker-independent phone modeling based on speaker-dependent hmm's composition and clustering
/ In Proceeding of the Twentieth International Conference on Acoustics, Speech, and Signal Processing
: 441~444
[confproc]
L. R. Rabiner
/ 1989
/ Hmm clustering for connected word recognition
/ In Proceedings of the Fourteenth International Conference on Acoustics, Speech, and Signal Processing
: 405~408
[confproc]
E. Dermatas
/ 1996
/ Algorithm for clustering continuous density hmm by recognition error
/ IEEE Transactions on Speech and Audio Processing
: 231~234
[journal]
D. Heckerman
/ 1995
/ A tutorial on learning with Bayesian Network
/ Machine Learning
20
: 197~243