A MODIFIED TEXT CATEGORIZATING ALGORITHM
Zhijian Liang
Abstract
Zhijian Liang
Abstract
This paper has proposed and realized a kind of text clustering algorithm used for high dimensional sparse similar matrix.This algorithm combines the idea of hierarchical clustering and partitioning clustering,and it could control the selection of clustering algorithm and the creation of new clusters through a threshold.Judging from a small sample experimental result,the algorithm′s recalling rate and correct rate is higher than some classical methods
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper has proposed and realized a kind of text clustering algorithm used for high dimensional sparse similar matrix.This algorithm combines the idea of hierarchical clustering and partitioning clustering,and it could control the selection of clustering algorithm and the creation of new clusters through a threshold.Judging from a small sample experimental result,the algorithm′s recalling rate and correct rate is higher than some classical methods
Key concepts: Cluster analysis, Canopy clustering algorithm, CURE data clustering algorithm, Computer science, Correlation clustering, Algorithm, Single-linkage clustering, Selection (genetic algorithm)