Applying hybrid Kepso clustering to web pages

ACM SE '10 Pub Date : 2010-04-15 DOI:10.1145/1900008.1900027
Teng-Sheng Moh, Ameya Sabnis
{"title":"Applying hybrid Kepso clustering to web pages","authors":"Teng-Sheng Moh, Ameya Sabnis","doi":"10.1145/1900008.1900027","DOIUrl":null,"url":null,"abstract":"Various optimization methods are used along with the standard clustering algorithms to make the clustering process simpler and quicker. In this paper we propose a new hybrid technique of clustering known as K-Evolutionary Particle Swarm Optimization (KEPSO) based on the concept of Particle Swarm Optimization (PSO). The proposed algorithm uses the K-means algorithm as the first step and the Evolutionary Particle Swarm Optimization (EPSO) algorithm as the second step to perform clustering. The experiments were performed using the clustering benchmark data. This method was compared with the standard K-means and EPSO algorithms. The results show that this method produced compact results and performed faster than other clustering algorithms. Later, the algorithm was used to cluster web pages. The web pages were clustered by first cleaning the unnecessary data and then labeling the obtained web pages to categorize them.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM SE '10","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1900008.1900027","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Various optimization methods are used along with the standard clustering algorithms to make the clustering process simpler and quicker. In this paper we propose a new hybrid technique of clustering known as K-Evolutionary Particle Swarm Optimization (KEPSO) based on the concept of Particle Swarm Optimization (PSO). The proposed algorithm uses the K-means algorithm as the first step and the Evolutionary Particle Swarm Optimization (EPSO) algorithm as the second step to perform clustering. The experiments were performed using the clustering benchmark data. This method was compared with the standard K-means and EPSO algorithms. The results show that this method produced compact results and performed faster than other clustering algorithms. Later, the algorithm was used to cluster web pages. The web pages were clustered by first cleaning the unnecessary data and then labeling the obtained web pages to categorize them.
将混合Kepso聚类应用于网页
在标准聚类算法的基础上,采用了多种优化方法,使聚类过程更简单、更快。本文基于粒子群优化(PSO)的概念,提出了一种新的混合聚类技术——k -进化粒子群优化(KEPSO)。该算法采用K-means算法作为第一步,进化粒子群优化(EPSO)算法作为第二步进行聚类。实验采用聚类基准数据进行。将该方法与标准K-means和EPSO算法进行了比较。结果表明,该方法的聚类结果紧凑,速度快于其他聚类算法。随后,该算法被用于网页聚类。该方法首先清除不必要的数据,然后对得到的网页进行标记,对其进行分类。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信