网络挖掘

Ricardo Baeza-Yates
{"title":"网络挖掘","authors":"Ricardo Baeza-Yates","doi":"10.1109/LAWEB.2005.49","DOIUrl":null,"url":null,"abstract":"The Web grows and evolves faster than we would like and expect, imposing scalability and relevance problems to Web search engines. There are three main data types in the Web: content (text, multimedia), structure (links that form a graph) and Web usage (transactions from Web logs). We emphasize the last type of data, in particular a new subfield called query mining. Server logs of search engines store traces of queries submitted by users, which include queries themselves along with Web pages selected in their answers. Query mining is based in the fact that user queries in search engines and Web sites give valuable information on the interests of people. In addition, clicks after queries relate those interests to actual content. The framework is based on a new vectorial representation of query traces which allows to treat them similarly to documents in traditional information retrieval systems. Also, we consider the problem of reducing the bias in the selections caused by the particular answer rankings computed by the search engine. We show the application of the clustering framework to two problems: relevance ranking boosting and query recommendation. Finally, we show with experiments the effectiveness of our approach. The same ideas can be applied to advertising campaigns in search engines and the automatic generation of a pseudo-ontology for queries.","PeriodicalId":286939,"journal":{"name":"Third Latin American Web Congress (LA-WEB'2005)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Web mining\",\"authors\":\"Ricardo Baeza-Yates\",\"doi\":\"10.1109/LAWEB.2005.49\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Web grows and evolves faster than we would like and expect, imposing scalability and relevance problems to Web search engines. There are three main data types in the Web: content (text, multimedia), structure (links that form a graph) and Web usage (transactions from Web logs). We emphasize the last type of data, in particular a new subfield called query mining. Server logs of search engines store traces of queries submitted by users, which include queries themselves along with Web pages selected in their answers. Query mining is based in the fact that user queries in search engines and Web sites give valuable information on the interests of people. In addition, clicks after queries relate those interests to actual content. The framework is based on a new vectorial representation of query traces which allows to treat them similarly to documents in traditional information retrieval systems. Also, we consider the problem of reducing the bias in the selections caused by the particular answer rankings computed by the search engine. We show the application of the clustering framework to two problems: relevance ranking boosting and query recommendation. Finally, we show with experiments the effectiveness of our approach. The same ideas can be applied to advertising campaigns in search engines and the automatic generation of a pseudo-ontology for queries.\",\"PeriodicalId\":286939,\"journal\":{\"name\":\"Third Latin American Web Congress (LA-WEB'2005)\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"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.49\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Third Latin American Web Congress (LA-WEB'2005)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LAWEB.2005.49","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

Web的发展和演变速度比我们希望和期望的要快,这给Web搜索引擎带来了可伸缩性和相关性问题。Web中有三种主要的数据类型:内容(文本、多媒体)、结构(形成图形的链接)和Web使用(来自Web日志的事务)。我们强调最后一种数据类型,特别是称为查询挖掘的新子领域。搜索引擎的服务器日志存储用户提交的查询的跟踪,其中包括查询本身以及在其答案中选择的Web页面。查询挖掘是基于这样一个事实:用户在搜索引擎和Web站点中的查询提供了有关人们兴趣的有价值的信息。此外,查询后的点击将这些兴趣与实际内容联系起来。该框架基于一种新的查询轨迹的向量表示,使得查询轨迹可以像传统信息检索系统中的文档一样被处理。此外,我们还考虑了减少由搜索引擎计算的特定答案排名引起的选择偏差的问题。我们展示了聚类框架在两个问题上的应用:相关性排名提升和查询推荐。最后,通过实验验证了该方法的有效性。同样的思想也可以应用于搜索引擎中的广告活动和查询伪本体的自动生成。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Web mining
The Web grows and evolves faster than we would like and expect, imposing scalability and relevance problems to Web search engines. There are three main data types in the Web: content (text, multimedia), structure (links that form a graph) and Web usage (transactions from Web logs). We emphasize the last type of data, in particular a new subfield called query mining. Server logs of search engines store traces of queries submitted by users, which include queries themselves along with Web pages selected in their answers. Query mining is based in the fact that user queries in search engines and Web sites give valuable information on the interests of people. In addition, clicks after queries relate those interests to actual content. The framework is based on a new vectorial representation of query traces which allows to treat them similarly to documents in traditional information retrieval systems. Also, we consider the problem of reducing the bias in the selections caused by the particular answer rankings computed by the search engine. We show the application of the clustering framework to two problems: relevance ranking boosting and query recommendation. Finally, we show with experiments the effectiveness of our approach. The same ideas can be applied to advertising campaigns in search engines and the automatic generation of a pseudo-ontology for queries.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信