基于文本挖掘的自动非负矩阵分解的层次聚类方法

摘要

随着网络信息技术的飞速发展,人们在如此庞大的信息中如何找到有用的信息成为一个问题,文本挖掘技术在这样的背景下应运而生.为解决层次关系的文字资料的文本挖掘,文章提出一种新自动非负矩阵分解的层次聚类方法.实验结果对实际数据集进行了比较,结果表明,该方法对于所有情况的平均估计要优于其他传统方法,对于具有层次关系的文字资料的数据挖掘是一种较好的方法.%With the rapid development of network information technology, how to find useful information in such huge information becomes a problem.Under the background, text mining technology emerged.In order to solve text mining of the hierarchical text information, this paper proposed a new automatic non-negative matrix factorization hierarchical clustering method.Experimental results on real data sets were compared, the results show that the method for all instances of the average estimation is better than other traditional methods.For hierarchical text data mining it is a kind of better method.