An Incremental Approach to Efficiently Retrieving Representative Information for Mobile Search on Web

Jin Zhang, Q. Wei, Guoqing Chen
{"title":"An Incremental Approach to Efficiently Retrieving Representative Information for Mobile Search on Web","authors":"Jin Zhang, Q. Wei, Guoqing Chen","doi":"10.1109/ICMB-GMR.2010.40","DOIUrl":null,"url":null,"abstract":"Mobile search is one of the emerging and promising fields for researchers and practitioners. Nowadays, in consideration of screen size and navigability, current PC web search engines and information retrieval approaches may hardly be transplanted onto mobile search platforms directly. This paper presents an efficient approach to retrieving a compact set of differentiated documents which is information equivalent to the set of all documents satisfying query criteria. In doing so, based upon the idea [7] that extracts a representative document from each class derived from the transitive closure of a documents’ similarity matrix, the paper proposes an incremental strategy to deal with the computational complexity in generating the transitive closure and respective classes, which becomes crucial in massive data and mobile search applications. Theoretical analysis and data experiments show the advantage of the proposed approach.","PeriodicalId":138929,"journal":{"name":"2010 Ninth International Conference on Mobile Business and 2010 Ninth Global Mobility Roundtable (ICMB-GMR)","volume":"257 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Ninth International Conference on Mobile Business and 2010 Ninth Global Mobility Roundtable (ICMB-GMR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMB-GMR.2010.40","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Mobile search is one of the emerging and promising fields for researchers and practitioners. Nowadays, in consideration of screen size and navigability, current PC web search engines and information retrieval approaches may hardly be transplanted onto mobile search platforms directly. This paper presents an efficient approach to retrieving a compact set of differentiated documents which is information equivalent to the set of all documents satisfying query criteria. In doing so, based upon the idea [7] that extracts a representative document from each class derived from the transitive closure of a documents’ similarity matrix, the paper proposes an incremental strategy to deal with the computational complexity in generating the transitive closure and respective classes, which becomes crucial in massive data and mobile search applications. Theoretical analysis and data experiments show the advantage of the proposed approach.
一种高效检索Web移动搜索代表性信息的增量方法
移动搜索是研究人员和实践者的新兴和有前途的领域之一。目前,考虑到屏幕尺寸和可导航性,现有的PC网络搜索引擎和信息检索方法很难直接移植到移动搜索平台上。本文提出了一种高效的检索差分文档压缩集的方法,该信息等价于满足查询条件的所有文档的集合。为此,基于[7]从文档相似矩阵的传递闭包派生的每个类中提取代表性文档的思想,本文提出了一种增量策略来处理生成传递闭包和相应类的计算复杂性,这在海量数据和移动搜索应用中至关重要。理论分析和数据实验表明了该方法的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信