Chun-Hsiung Tseng, Yung-Hui Chen, C. Chuang, Jia Hua Wu, Yi Syuan Yang, Yaning Liang
{"title":"基于自调节K-Means算法的网页聚类工具","authors":"Chun-Hsiung Tseng, Yung-Hui Chen, C. Chuang, Jia Hua Wu, Yi Syuan Yang, Yaning Liang","doi":"10.1109/U-MEDIA.2014.44","DOIUrl":null,"url":null,"abstract":"Search engines usually do their jobs well. However, due to the fact that most existing search algorithms are keyword-based, search engines may not work as expected in some scenarios when ambiguity problems are encountered. A possible approach to overcome it is to categorize Web resources in advance. In this research, a k-means variation, the keen-means algorithm, along with its implementation is proposed. The algorithm will dynamically and automatically adjust the k value to achieve better results.","PeriodicalId":174849,"journal":{"name":"2014 7th International Conference on Ubi-Media Computing and Workshops","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Keen-Means: A Web Page Clustering Tool Based on an Self-Adjustable K-Means Algorithm\",\"authors\":\"Chun-Hsiung Tseng, Yung-Hui Chen, C. Chuang, Jia Hua Wu, Yi Syuan Yang, Yaning Liang\",\"doi\":\"10.1109/U-MEDIA.2014.44\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Search engines usually do their jobs well. However, due to the fact that most existing search algorithms are keyword-based, search engines may not work as expected in some scenarios when ambiguity problems are encountered. A possible approach to overcome it is to categorize Web resources in advance. In this research, a k-means variation, the keen-means algorithm, along with its implementation is proposed. The algorithm will dynamically and automatically adjust the k value to achieve better results.\",\"PeriodicalId\":174849,\"journal\":{\"name\":\"2014 7th International Conference on Ubi-Media Computing and Workshops\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-07-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 7th International Conference on Ubi-Media Computing and Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/U-MEDIA.2014.44\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 7th International Conference on Ubi-Media Computing and Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/U-MEDIA.2014.44","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Keen-Means: A Web Page Clustering Tool Based on an Self-Adjustable K-Means Algorithm
Search engines usually do their jobs well. However, due to the fact that most existing search algorithms are keyword-based, search engines may not work as expected in some scenarios when ambiguity problems are encountered. A possible approach to overcome it is to categorize Web resources in advance. In this research, a k-means variation, the keen-means algorithm, along with its implementation is proposed. The algorithm will dynamically and automatically adjust the k value to achieve better results.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
