Page clustering using a distance based algorithm

Jairo Andrés Mojica, D. A. Rojas, Jonatan Gómez, F. González
{"title":"Page clustering using a distance based algorithm","authors":"Jairo Andrés Mojica, D. A. Rojas, Jonatan Gómez, F. González","doi":"10.1109/LAWEB.2005.27","DOIUrl":null,"url":null,"abstract":"This paper presents an application of a clustering algorithm based on gravitational forces to the problem of Web page clustering in a dynamic environment. The proposed algorithm uses a modification of the gravitational algorithm proposed by Gomez et al. but using only the distance measures (a notion of space is not required). This approach is useful when similarities (and/or then distances) between pages can be defined and compute quickly, but the definition of a space is computationally expensive. Experiments with data representing real URL's and sessions are performed, and a comparison with the incremental connected components algorithm, which has been previously used to solve this problem, is done.","PeriodicalId":286939,"journal":{"name":"Third Latin American Web Congress (LA-WEB'2005)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Third Latin American Web Congress (LA-WEB'2005)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LAWEB.2005.27","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

This paper presents an application of a clustering algorithm based on gravitational forces to the problem of Web page clustering in a dynamic environment. The proposed algorithm uses a modification of the gravitational algorithm proposed by Gomez et al. but using only the distance measures (a notion of space is not required). This approach is useful when similarities (and/or then distances) between pages can be defined and compute quickly, but the definition of a space is computationally expensive. Experiments with data representing real URL's and sessions are performed, and a comparison with the incremental connected components algorithm, which has been previously used to solve this problem, is done.
使用基于距离的算法的页面聚类
本文提出了一种基于引力的聚类算法在动态环境下的网页聚类问题中的应用。提出的算法使用了Gomez等人提出的引力算法的修改,但只使用距离度量(不需要空间概念)。当页面之间的相似性(和/或距离)可以快速定义和计算时,这种方法很有用,但是空间的定义在计算上很昂贵。对代表真实URL和会话的数据进行了实验,并与之前用于解决此问题的增量连接组件算法进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信