ITM Web Conf.
Volume 7, 20163rd Annual International Conference on Information Technology and Applications (ITA 2016)
|Number of page(s)||4|
|Section||Session 5: Algorithms and Simulation|
|Published online||21 November 2016|
Text Clustering Algorithm Based on Random Cluster Core
1 School of Software, Jiangxi Normal University, Jiangxi, 330022
2 Baidu Time Network Technology (Beijing) Co., Ltd, Beijing, 100081
Nowadays clustering has become a popular text mining algorithm, but the huge data can put forward higher requirements for the accuracy and performance of text mining. In view of the performance bottleneck of traditional text clustering algorithm, this paper proposes a text clustering algorithm with random features. This is a kind of clustering algorithm based on text density, at the same time using the neighboring heuristic rules, the concept of random cluster is introduced, which effectively reduces the complexity of the distance calculation.
© Owned by the authors, published by EDP Sciences, 2016
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.