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.