{"title":"使用URL和标签内容聚类搜索结果的K-Means","authors":"S. Poomagal, Dr. T. Hamsapriya","doi":"10.1109/PACC.2011.5978906","DOIUrl":null,"url":null,"abstract":"Increasing volume of web has resulted in the flooding of huge collection of web documents in search results creating difficulty for the user to browse the necessary document. Clustering is a solution to organize search results in a better way for browsing. It is a process of combining similar web documents into groups. For web page clustering, terms (features) can be extracted from different parts of a web page. Giansalvatore, Salvatore and Alessandro[1] have extracted terms from entire web page for clustering Stanis law Osinski et al.,[2] have considered terms only from snippets. A new method is introduced in this paper which extract terms from URL, Title tag and Meta tag to produce clusters of web documents. The reason for selecting these parts of a web page is that they contain keywords which are available in a web page. Clustering algorithm used in this paper is K-means. Proposed method of clustering is compared with snippet based clustering in terms of intra-cluster distance and inter-cluster distance.","PeriodicalId":403612,"journal":{"name":"2011 International Conference on Process Automation, Control and Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"K-Means for Search Results Clustering Using URL and Tag Contents\",\"authors\":\"S. Poomagal, Dr. T. Hamsapriya\",\"doi\":\"10.1109/PACC.2011.5978906\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Increasing volume of web has resulted in the flooding of huge collection of web documents in search results creating difficulty for the user to browse the necessary document. Clustering is a solution to organize search results in a better way for browsing. It is a process of combining similar web documents into groups. For web page clustering, terms (features) can be extracted from different parts of a web page. Giansalvatore, Salvatore and Alessandro[1] have extracted terms from entire web page for clustering Stanis law Osinski et al.,[2] have considered terms only from snippets. A new method is introduced in this paper which extract terms from URL, Title tag and Meta tag to produce clusters of web documents. The reason for selecting these parts of a web page is that they contain keywords which are available in a web page. Clustering algorithm used in this paper is K-means. Proposed method of clustering is compared with snippet based clustering in terms of intra-cluster distance and inter-cluster distance.\",\"PeriodicalId\":403612,\"journal\":{\"name\":\"2011 International Conference on Process Automation, Control and Computing\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-07-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Process Automation, Control and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PACC.2011.5978906\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Process Automation, Control and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACC.2011.5978906","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10
摘要
网络容量的增加导致搜索结果中大量的网络文档泛滥,给用户浏览必要的文档带来了困难。聚类是一种以更好的浏览方式组织搜索结果的解决方案。这是一个将相似的web文档组合成组的过程。对于网页聚类,可以从网页的不同部分提取术语(特征)。Giansalvatore, Salvatore和Alessandro[1]从整个网页中提取术语进行聚类Stanis law Osinski等[2]只考虑了来自片段的术语。本文介绍了一种从URL、Title标签和Meta标签中提取术语来生成web文档聚类的新方法。选择网页的这些部分的原因是它们包含了网页中可用的关键字。本文使用的聚类算法是K-means。将该聚类方法与基于片段的聚类方法在簇内距离和簇间距离方面进行了比较。
K-Means for Search Results Clustering Using URL and Tag Contents
Increasing volume of web has resulted in the flooding of huge collection of web documents in search results creating difficulty for the user to browse the necessary document. Clustering is a solution to organize search results in a better way for browsing. It is a process of combining similar web documents into groups. For web page clustering, terms (features) can be extracted from different parts of a web page. Giansalvatore, Salvatore and Alessandro[1] have extracted terms from entire web page for clustering Stanis law Osinski et al.,[2] have considered terms only from snippets. A new method is introduced in this paper which extract terms from URL, Title tag and Meta tag to produce clusters of web documents. The reason for selecting these parts of a web page is that they contain keywords which are available in a web page. Clustering algorithm used in this paper is K-means. Proposed method of clustering is compared with snippet based clustering in terms of intra-cluster distance and inter-cluster distance.