基于查询频率历史的相关关键词提取与聚类

Toru Onoda, T. Yumoto, K. Sumiya
{"title":"基于查询频率历史的相关关键词提取与聚类","authors":"Toru Onoda, T. Yumoto, K. Sumiya","doi":"10.1109/ISUC.2008.22","DOIUrl":null,"url":null,"abstract":"Query-recommendation systems based on inputted queries have become widespread. These services are effective if users cannot input relevant queries. However, the conventional systems do not take into consideration the relevance between recommended queries. This paper proposes a method of obtaining related queries and clustering them by using the history of query frequencies in query logs. We define similarity in queries based on the history of query frequency and use it for clustering queries. We selected various queries and extracted related queries and then clustered them. We found that our method was useful for clustering queries that were used in around the same term.","PeriodicalId":339811,"journal":{"name":"2008 Second International Symposium on Universal Communication","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Extracting and Clustering Related Keywords based on History of Query Frequency\",\"authors\":\"Toru Onoda, T. Yumoto, K. Sumiya\",\"doi\":\"10.1109/ISUC.2008.22\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Query-recommendation systems based on inputted queries have become widespread. These services are effective if users cannot input relevant queries. However, the conventional systems do not take into consideration the relevance between recommended queries. This paper proposes a method of obtaining related queries and clustering them by using the history of query frequencies in query logs. We define similarity in queries based on the history of query frequency and use it for clustering queries. We selected various queries and extracted related queries and then clustered them. We found that our method was useful for clustering queries that were used in around the same term.\",\"PeriodicalId\":339811,\"journal\":{\"name\":\"2008 Second International Symposium on Universal Communication\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Second International Symposium on Universal Communication\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISUC.2008.22\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Second International Symposium on Universal Communication","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISUC.2008.22","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

基于输入查询的查询推荐系统已经变得非常普遍。如果用户不能输入相关查询,这些服务是有效的。然而,传统的系统没有考虑推荐查询之间的相关性。本文提出了一种利用查询日志中的查询频率历史来获取相关查询并进行聚类的方法。我们根据查询频率的历史定义查询的相似度,并将其用于聚类查询。我们选择各种查询并提取相关查询,然后对它们进行聚类。我们发现我们的方法对于在同一术语中使用的集群查询很有用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Extracting and Clustering Related Keywords based on History of Query Frequency
Query-recommendation systems based on inputted queries have become widespread. These services are effective if users cannot input relevant queries. However, the conventional systems do not take into consideration the relevance between recommended queries. This paper proposes a method of obtaining related queries and clustering them by using the history of query frequencies in query logs. We define similarity in queries based on the history of query frequency and use it for clustering queries. We selected various queries and extracted related queries and then clustered them. We found that our method was useful for clustering queries that were used in around the same term.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信