Performance analysis of query related user profiling for web search

D. Madusubram, S. Shantharajah
{"title":"Performance analysis of query related user profiling for web search","authors":"D. Madusubram, S. Shantharajah","doi":"10.1109/ICPRIME.2013.6496493","DOIUrl":null,"url":null,"abstract":"Record matching, which recognizes the records that symbolize the similar real-world article, is an imperative tread for data incorporation. Most state-of-the-art record corresponding techniques are managed, which needs the user to present training data. These techniques are not appropriate for the Web catalog situation, where the records to counterpart are query results vigorously produced on the dash. Such records are query reliant and a pre-arranged technique by means of training instances from preceding query results might fall short on the consequences of a novel query. To deal with the crisis of record similar in the Web database set-up, an unconfirmed, online verification corresponding technique, UDD, presented for efficiently recognize replicas from the query outcome records of numerous Web databases. UDD proficiently identified the replica pairs in the dataset but consumes more time. There are numerous methods have discussed the problem of user profiling fundamental component of personalization applications. In this paper, we analyze current query related user profiling schemes and provide an overview of the emerging record matching with query results from multiple web databases. Also comparisons are done between the various schemes to explain the advantages and limitations. In this paper, experimental evaluation shows that the performance analysis of the query related user profiling for web search on the basis of precision, recall, F-measure.","PeriodicalId":123210,"journal":{"name":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPRIME.2013.6496493","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Record matching, which recognizes the records that symbolize the similar real-world article, is an imperative tread for data incorporation. Most state-of-the-art record corresponding techniques are managed, which needs the user to present training data. These techniques are not appropriate for the Web catalog situation, where the records to counterpart are query results vigorously produced on the dash. Such records are query reliant and a pre-arranged technique by means of training instances from preceding query results might fall short on the consequences of a novel query. To deal with the crisis of record similar in the Web database set-up, an unconfirmed, online verification corresponding technique, UDD, presented for efficiently recognize replicas from the query outcome records of numerous Web databases. UDD proficiently identified the replica pairs in the dataset but consumes more time. There are numerous methods have discussed the problem of user profiling fundamental component of personalization applications. In this paper, we analyze current query related user profiling schemes and provide an overview of the emerging record matching with query results from multiple web databases. Also comparisons are done between the various schemes to explain the advantages and limitations. In this paper, experimental evaluation shows that the performance analysis of the query related user profiling for web search on the basis of precision, recall, F-measure.
web搜索查询相关用户分析的性能分析
记录匹配,即识别代表相似现实世界文章的记录,是数据合并的必要步骤。大多数最先进的记录对应技术是管理的,这需要用户提供训练数据。这些技术不适合Web目录的情况,在这种情况下,对应的记录是在折线上大量生成的查询结果。这样的记录依赖于查询,通过从先前的查询结果中训练实例来预先安排的技术可能无法满足新查询的结果。为了解决Web数据库设置中记录相似的危机,提出了一种未经证实的在线验证对应技术UDD,用于从众多Web数据库的查询结果记录中高效地识别副本。UDD可以熟练地识别数据集中的副本对,但会消耗更多的时间。有许多方法讨论了用户分析问题,这是个性化应用程序的基本组成部分。在本文中,我们分析了当前与查询相关的用户分析方案,并概述了与多个web数据库的查询结果匹配的新记录。并对各种方案进行了比较,以说明其优点和局限性。在本文中,实验评估表明,查询相关用户特征分析的性能分析适用于基于准确率、召回率、F-measure的网页搜索。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信