Discrete-Time hopfield neural network based text clustering algorithm

Authors:
Zekeriya Uykan;Murat Can Ganiz;Çağla Şahinli
Affiliations:
Electronics and Communications Engineering Dept., Dogus University, Istanbul, Turkey;Computer Engineering Dept., Dogus University, Istanbul, Turkey;Computer Engineering Dept., Dogus University, Istanbul, Turkey
Venue:
ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part I
Year:
2012

Citing 7
Cited 0

Data clustering: a review

ACM Computing Surveys (CSUR)
An Intelligent Information System for Organizing Online Text Documents

Knowledge and Information Systems
Learning from little: comparison of classifiers given little training

PKDD '04 Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases
Data Mining: Concepts and Techniques

Data Mining: Concepts and Techniques
Generative model-based document clustering: a comparative study

Knowledge and Information Systems
Text Mining And Its Applications To Intelligence, Crm And Knowledge Management (Advances in Management Information)

Text Mining And Its Applications To Intelligence, Crm And Knowledge Management (Advances in Management Information)
The WEKA data mining software: an update

ACM SIGKDD Explorations Newsletter

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this study we propose a discrete-time Hopfield Neural Network based clustering algorithm for text clustering for cases L=2q where L is the number of clusters and q is a positive integer. The optimum general solution for even 2-cluster case is not known. The main contribution of this paper is as follows: We show that i) sum of intra-cluster distances which is to be minimized by a text clustering algorithm is equal to the Lyapunov (energy) function of the Hopfield Network whose weight matrix is equal to the Laplacian matrix obtained from the document-by-document distance matrix for 2-cluster case; and ii) the Hopfield Network can be iteratively applied to text clustering for L=2k. Results of our experiments on several benchmark text datasets show the effectiveness of the proposed algorithm as compared to the k-means.