Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6900412 | Procedia Computer Science | 2018 | 10 Pages |
Abstract
One of the most difficult problems, in cluster analysis is the determination of the number of clusters in a data set. Solving this problem consists in detecting and finding the best number of clusters, which is an input parameter for the clustering problems. In this paper, we propose a new approach using the Maximum Stable Set Problem (MSSP) combined by Continuous Hopfield Network (CHN) to determine the number of clusters, which is a basic input parameter for K-Means method. By testing the theoretical results, the proposed approach was validated on a real application for the text mining. Some numerical examples and computational experiments assess the effectiveness of this approach as demonstrated in this paper.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Awatif Karim, Chakir Loqman, Jaouad Boumhidi,