Competitive Learning Mechanisms for Scalable, Incremental and Balanced Clustering of Streaming Texts

Proceedings of the International Joint Conference on Neural Networks

Volumn 4, Issue , 2003, Pages 2697-2702

  Banerjee, Arindam ^a   Ghosh, Joydeep ^a  

^a The University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION MANAGEMENT; LEARNING ALGORITHMS; PROBLEM SOLVING; WEBSITES;

TEXT DOCUMENTS;

LEARNING SYSTEMS;

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

References (19)

1. S. C. Ahalt, A. K. Krishnamurthy, P. Chen, and D. E. Melton. Competitive learning algorithms for vector quantization. Neural Networks, 3(3):277-290, 1990.
2. H. Akaike. A new look at statistical model identification. IEEE Transactions on Automatic Control, AU-19:716-722, 1974.
3. R. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison Wesley, New York, 1999.
4. A. Banerjee and J. Ghosh. Frequency sensitive competitive learning for clustering on high-dimensional hyperspheres. In Proc. IJCNN'02, Honolulu, pages 1590-1595, May 2002.
5. P. S. Bradley, K. P. Bennett, and A. Demiriz. Constrained k-means clustering. Technical report, Microsoft Research, May 2000.
6. D. deSieno. Adding conscience to competitive learning. In IEEE Annual Int'l. Conf. on Neural Networks, pages 1117-1124, 1988.
7. I. S. Dhillon and D. S. Modha. Concept decompositions for large sparse text data using clustering. Machine Learning, 42(1): 143-175, January 2001.
8. J. H. Friedman. An overview of predictive learning and function approximation. In V. Cherkassky, J.H. Friedman, and H. Wechsler, editors, From Statistics to Neural Networks, Proc. NATO/ASI Workshop, pages 1-61. Springer Verlag, 1994.
9. A. S. Galanopoulos and S. C. Ahalt. Codeword distribution for frequency sensitive competitive learning with one dimensional input data. IEEE Trans. Neural Networks, 7(3):752-756, 1996.
10. J. Ghosh. Scalable clustering methods for data mining. In Nong Ye, editor, Handbook of Data Mining. Lawrence Erlbaum, 2003.
11. A. K. Jain and R. C. Dubes. Algorithms for Clustering Data. Prentice Hall, New Jersey, 1988.
12. K. V. Mardia. Statistics of directional data. J. Royal Statistical Society. Series B (Methodological), 37(3):349-393, 1975.
13. R. M. Neal and G. E. Hinten. A view of the EM algorithm that justifies incremental, sparse, and other variants. In M. I. Jordan, editor, Learning in Graphical Models, pages 355-368. MIT Press, 1998.
14. J. C. Principe, J.-M. Kuo, and S. Celebi. An analysis of the gamma memory in dynamic neural networks. IEEE Transactions on Neural Networks, 5:331-337, March 1994.
15. V. Ramamurti and J. Ghosh. Structurally adaptive modular networks for non-stationary environments. IEEE Transactions on Neural Networks, 10(1): 152-60, 1999.
16. A. Strehl, J. Ghosh, and R. Mooney. Impact of similarity measures on web-page clustering. In Proc. of 17th National Conference on AI: Workshop on AI for Web Search (AAAI 2000), pages 58-64. AAAI, July 2000.
17. H. G. C. Tråvén. A neural network approach to statistical pattern classification by "semiparametric" estimation of probability density functions. IEEE Transactions on Neural Networks, 2(3):366-377, 1991.
18. B. Widrow and S.D. Stearns. Adaptive Signal Processing. Prentice-Hall, Englewood Cliffs, N.J., 1985.
19. Y. J. Zhang and Z. Q. Liu. Self-splitting competitive learning: A new on-line clustering paradigm. IEEE Transactions on Neural Networks, 13(2):369-380, March 2002.