Max stable set problem to found the initial centroids in clustering problem
In this paper, we propose a new approach to solve the document-clustering using the K-Means algorithm. The latter is sensitive to the random selection of the k cluster centroids in the initialization phase. To evaluate the quality of K-Means clustering we propose to model the text document clusterin...
Saved in:
Main Authors: | Karim, Awatif (Author), Loqman, Chakir (Author), Hami, Youssef (Author), Boumhidi, Jaouad (Author) |
---|---|
Format: | EJournal Article |
Published: |
Institute of Advanced Engineering and Science,
2022-01-01.
|
Subjects: | |
Online Access: | Get fulltext |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Effective Feature Set Selection and Centroid Classifier Algorithm for Web Services Discovery
by: K, Venkatachalam, et al.
Published: (2017) -
Tectonics - Problems of Regional Settings
by: Evgenii V. Sharkov
Published: (2018) -
K-Means Clustering and Genetic Algorithm to Solve Vehicle Routing Problem with Time Windows Problem
by: Alfiyatin, Adyan Nur, et al.
Published: (2018) -
Research of Strategic Alliance Stable Decision-making Model Based on Rough Set and DEA
by: Yi, Zhang
Published: (2013) -
Centroidal-polygon: a new modified Euler to improve speed of resistor-inductor circuit equation
by: Zulkifli, Nur Shahirah, et al.
Published: (2021)