基于模糊集的Web文本聚类分析算法

Yun Peng, S. Ding
{"title":"基于模糊集的Web文本聚类分析算法","authors":"Yun Peng, S. Ding","doi":"10.1109/ISCSCT.2008.139","DOIUrl":null,"url":null,"abstract":"There are a large quantity of non-certain and non-structure contents in the Web text at the present time. It is difficult to cluster the text by some normal classification methods. An algorithm of Web text clustering analysis based on fuzzy set is proposed in this paper, and the algorithm has been described in detail by example. The technique can improve the algorithm complexity of time and space, increase the robustness of the algorithm. To check the accuracy and efficiency of the algorithm, the comparative analysis of the sample and test data is provided in the end.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Algorithm of Web Text Clustering Analysis Based on Fuzzy Set\",\"authors\":\"Yun Peng, S. Ding\",\"doi\":\"10.1109/ISCSCT.2008.139\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"There are a large quantity of non-certain and non-structure contents in the Web text at the present time. It is difficult to cluster the text by some normal classification methods. An algorithm of Web text clustering analysis based on fuzzy set is proposed in this paper, and the algorithm has been described in detail by example. The technique can improve the algorithm complexity of time and space, increase the robustness of the algorithm. To check the accuracy and efficiency of the algorithm, the comparative analysis of the sample and test data is provided in the end.\",\"PeriodicalId\":228533,\"journal\":{\"name\":\"2008 International Symposium on Computer Science and Computational Technology\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Symposium on Computer Science and Computational Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCSCT.2008.139\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Computer Science and Computational Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCSCT.2008.139","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

目前,网络文本中存在着大量的非确定性、非结构性内容。常规的分类方法很难对文本进行聚类。本文提出了一种基于模糊集的Web文本聚类分析算法,并通过实例对该算法进行了详细说明。该技术可以提高算法的时间复杂度和空间复杂度,增强算法的鲁棒性。为了验证算法的准确性和效率,最后给出了样本和测试数据的对比分析。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Algorithm of Web Text Clustering Analysis Based on Fuzzy Set
There are a large quantity of non-certain and non-structure contents in the Web text at the present time. It is difficult to cluster the text by some normal classification methods. An algorithm of Web text clustering analysis based on fuzzy set is proposed in this paper, and the algorithm has been described in detail by example. The technique can improve the algorithm complexity of time and space, increase the robustness of the algorithm. To check the accuracy and efficiency of the algorithm, the comparative analysis of the sample and test data is provided in the end.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信