基于自适应柱k -均值-高斯萤火虫算法的最优质心选择分层文档聚类

IF 2.2 Q3 COMPUTER SCIENCE, CYBERNETICS International Journal of Intelligent Computing and Cybernetics Pub Date : 2019-03-01 DOI:10.6025/jic/2019/10/1/1-14
P. Nagalashmi
{"title":"基于自适应柱k -均值-高斯萤火虫算法的最优质心选择分层文档聚类","authors":"P. Nagalashmi","doi":"10.6025/jic/2019/10/1/1-14","DOIUrl":null,"url":null,"abstract":": In recent days, data growth is enormous and tough to handle it, in an oragnised manner and in apt time. In data mining, wide range of researches are available for managing data effectively. Document clustering is a spirited zone in data mining and here our main objective is to assemble the related documents. In this paper, we generate an algorithm for clustering by means of Adaptive Pillar K-Means and Gaussian Firefly Algorithm. For determining the proper centroid in order to attain the proper clustered documents, Adaptive Pillar K-means algorithm is utilized. Subsequently, Gaussian firefly algorithm is exploited for the optimization process and also for enhancing the precision that results in reducing the sum of squared errors and computational time. Here, the performance of the proposed methodology is compared with various algorithms such as Genetic Algorithm, Ant colony optimization and gravity clustering. The attained results show the performance of the proposed methodology and the simulation results illustrated the betterment in quality with low sum of squared errors.","PeriodicalId":45291,"journal":{"name":"International Journal of Intelligent Computing and Cybernetics","volume":null,"pages":null},"PeriodicalIF":2.2000,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Hierarchical Document Clustering via Optimal Centroid Selection using Adaptive Pillar K-means – Gaussian Firefly Algorithm\",\"authors\":\"P. Nagalashmi\",\"doi\":\"10.6025/jic/2019/10/1/1-14\",\"DOIUrl\":null,\"url\":null,\"abstract\":\": In recent days, data growth is enormous and tough to handle it, in an oragnised manner and in apt time. In data mining, wide range of researches are available for managing data effectively. Document clustering is a spirited zone in data mining and here our main objective is to assemble the related documents. In this paper, we generate an algorithm for clustering by means of Adaptive Pillar K-Means and Gaussian Firefly Algorithm. For determining the proper centroid in order to attain the proper clustered documents, Adaptive Pillar K-means algorithm is utilized. Subsequently, Gaussian firefly algorithm is exploited for the optimization process and also for enhancing the precision that results in reducing the sum of squared errors and computational time. Here, the performance of the proposed methodology is compared with various algorithms such as Genetic Algorithm, Ant colony optimization and gravity clustering. The attained results show the performance of the proposed methodology and the simulation results illustrated the betterment in quality with low sum of squared errors.\",\"PeriodicalId\":45291,\"journal\":{\"name\":\"International Journal of Intelligent Computing and Cybernetics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.2000,\"publicationDate\":\"2019-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Intelligent Computing and Cybernetics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.6025/jic/2019/10/1/1-14\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, CYBERNETICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Intelligent Computing and Cybernetics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.6025/jic/2019/10/1/1-14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, CYBERNETICS","Score":null,"Total":0}
引用次数: 0

摘要

近期数据增长巨大,处理困难,要有组织、及时。在数据挖掘中,对数据的有效管理有着广泛的研究。文档聚类是数据挖掘中的一个重要领域,这里我们的主要目标是组装相关的文档。本文利用自适应柱k均值和高斯萤火虫算法生成了一种聚类算法。为了确定合适的质心以获得合适的聚类文档,采用了自适应柱k -均值算法。随后,利用高斯萤火虫算法进行优化过程,并提高精度,从而减少误差平方和和和计算时间。本文将该方法的性能与遗传算法、蚁群优化和重力聚类等算法进行了比较。仿真结果表明,该方法具有较好的效果,且平方和误差较小。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Hierarchical Document Clustering via Optimal Centroid Selection using Adaptive Pillar K-means – Gaussian Firefly Algorithm
: In recent days, data growth is enormous and tough to handle it, in an oragnised manner and in apt time. In data mining, wide range of researches are available for managing data effectively. Document clustering is a spirited zone in data mining and here our main objective is to assemble the related documents. In this paper, we generate an algorithm for clustering by means of Adaptive Pillar K-Means and Gaussian Firefly Algorithm. For determining the proper centroid in order to attain the proper clustered documents, Adaptive Pillar K-means algorithm is utilized. Subsequently, Gaussian firefly algorithm is exploited for the optimization process and also for enhancing the precision that results in reducing the sum of squared errors and computational time. Here, the performance of the proposed methodology is compared with various algorithms such as Genetic Algorithm, Ant colony optimization and gravity clustering. The attained results show the performance of the proposed methodology and the simulation results illustrated the betterment in quality with low sum of squared errors.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
6.80
自引率
4.70%
发文量
26
期刊最新文献
X-News dataset for online news categorization X-News dataset for online news categorization A novel ensemble causal feature selection approach with mutual information and group fusion strategy for multi-label data Contextualized dynamic meta embeddings based on Gated CNNs and self-attention for Arabic machine translation Dynamic community detection algorithm based on hyperbolic graph convolution
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1