###
DOI:
计算机系统应用英文版:2012,21(12):190-192
本文二维码信息
码上扫一扫!
基于不可分辨关系的文本自动聚类
(四川广播电视大学 高职学院, 成都 610073)
Text Automatic Clustering Based on Indiscernibility Relation
(School of Higher Vocation, Sichuan Radio and TV University, Chengdu 610073, China)
摘要
图/表
参考文献
相似文献
本文已被:浏览 1187次   下载 2690
Received:May 11, 2012    Revised:June 12, 2012
中文摘要: 研究了文本对象在不可分辨关系下的自动聚类方法. 在自动聚类过程中, 首先把文本集转化为让机器可以处理的布尔文本信息系统; 其次在信息系统上定义对象间的不可分辨关系, 提出利用不可分辨关系进行聚类的理论基础; 然后对算法进行描述, 并用实验进行验证; 最后分析该算法的时间复杂度和缺点, 并提出具体的改进措施. 基于不可分辨关系的文本自动聚类算法具有理论基础和较好的实验效果表明该方法具有较好的应用性.
Abstract:This paper studied the automatic clustering method under the Indiscernibility relation of the text objects. In the clustering process, the text sets were converted to the Boolean text information system that the machine may process; secondly the Indiscernibility relation was defined in information systems, and the Indiscernibility relation clustering theory was proposed; then the algorithm was described, which was proved by experiment; Analyzing the time complexity and disadvantages of the algorithm, gives the concrete improvement measures. Based on Indiscernibility relation automatic text clustering algorithm has a theoretical foundation and good experimental results show that this method has better application.
文章编号:     中图分类号:    文献标志码:
基金项目:
引用文本:
周勇.基于不可分辨关系的文本自动聚类.计算机系统应用,2012,21(12):190-192
ZHOU Yong.Text Automatic Clustering Based on Indiscernibility Relation.COMPUTER SYSTEMS APPLICATIONS,2012,21(12):190-192