Unsupervised Clustering of Symbol Strings

Proceedings of the International Joint Conference on Neural Networks

Volumn 4, Issue , 2003, Pages 3250-3255

  Flanagan, John A ^a  

^a NOKIA RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ITERATIVE METHODS; LEARNING SYSTEMS;

SYMBOL STRINGS;

DATA PROCESSING;

EID: 0141703405     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. D. Hand, H. Mannila, and P. Smyth, Principles of Data Mining, ser. Adaptive Computation and Machine Learning. The MIT Press, 2001.
2. A. Jain and R. Dubes, Algorithms for Clustering Data. Englewood Cliffs. NJ: Prentice Hall, 1988.
3. J. Shi and J. Malik, "Normalized usts and image segmentation," IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 22, no. 8, pp. 888-905, Aug. 2000.
4. C. C. Aggarwal, J. L. Wolf, P. S. Yu, C. Procopiuc, and J. S. Park, "Fast algorithms for projected clustering," in Proceedings of the 1999 ACM SIGMOD international conference on Management of data. ACM Press, 1999, pp. 61-72.
5. V. Levenshtein, "Binary codes capable of correcting deletions, insertions and reversals," Soviet Physics Doklady, vol. 10, no. 8, pp. 707-710, Feb. 1966.
6. R. Hamming, "Error detecting and error correcting codes," Bell Sytem Techical Journal, vol. 9. pp. 147-160, April 1950.
7. T. Kohonen and P. Somervuo, "Self-organizing maps of symbol strings," Neural Processing Letters, vol. 10, pp. 151-159, 1999.
8. P. Somervuo, "Self-organizing maps for signal and symbol sequences," Ph.D. dissertation, Helsinki University of Technology, 2000, acta Polytechnica Scandinavia, Mathematics and Computing Series No. 107.
9. T. Kohonen, Self-Organizing Maps. Berlin, Heidelberg: Springer, 2001, (Third Extended Edition).
10. S. Kaski, T. H. K. Lagus, and T. Kohonen, "WEBSOM- self-organizing maps of document collections," Neurocomputing, vol. 21, pp. 101-117, 1998.
11. H. Kushner and D. Clark, Stochastic approximation methods for constrained and unconstrained systems. Springer-Verlag, 1978.
12. I. V. Cadez, S. Gaffney, and P. Smyth, "A general probabilistic framework for clustering individuals and objects," in Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining. ACM Press, 2000, pp. 140-149.