Keen-Means: A Web Page Clustering Tool Based on an Self-Adjustable K-Means Algorithm

摘要

Search engines usually do their jobs well. However, due to the fact that most existing search algorithms are keyword-based, search engines may not work as expected in some scenarios when ambiguity problems are encountered. A possible approach to overcome it is to categorize Web resources in advance. In this research, a k-means variation, the keen-means algorithm, along with its implementation is proposed. The algorithm will dynamically and automatically adjust the k value to achieve better results.