A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
Filters
Query Aggregation in Session Search
2014
Proceedings of the 3rd Workshop on Data-Driven User Behavioral Modeling and Mining from Social Media - DUBMOD '14
Session search retrieves documents for a sequence of queries in a session. Prior research demonstrated that query aggregation is an effective technique for session search. ...
Moreover, we compare various query aggregation schemes and investigate the best scheme for aggregating queries in session search. ...
Since most sessions have only 3 queries, this good match to the optimal query weights for the first 3 queries is one of the reasons that makes RL outperform other aggregation schemes. ...
doi:10.1145/2665994.2666001
dblp:conf/cikm/GuanY14
fatcat:svgq4e5kgff4xolkyez6zqs5s4
Lexical Query Modeling in Session Search
2016
Proceedings of the 2016 ACM International Conference on the Theory of Information Retrieval - ICTIR '16
We give important insights into the potential and limitations of lexical query modeling for session search and propose future directions for the field of session search. ...
Naive methods based on term frequency weighing perform on par with specialized session models. In addition, we investigate the viability of lexical query models in the setting of session search. ...
Any opinions, findings and conclusions or recommendations expressed in this material are the authors' and do not necessarily reflect those of the sponsors. ...
doi:10.1145/2970398.2970422
dblp:conf/ictir/GyselKR16
fatcat:lmc3dhumhndz5ncupw2dqtst7y
Developing a Meta-suggestion Engine for Search Queries
2022
IEEE Access
Typically, search engines provide query suggestions to assist users in the search process. Query suggestions are very important for improving user's search experience. ...
An enhanced user search experience is possible if factors, such as user preference, are examined in future work. ...
A meta-suggestion is a new query suggestion scheme that aggregates query suggestions from other search engines as candidate queries for the suggestions. ...
doi:10.1109/access.2022.3186096
fatcat:cpt7eh6j65gnjbnodj4lw7i4xe
Developing a Meta-suggestion Engine for Search Queries
[article]
2022
arXiv
pre-print
Typically, search engines provide query suggestions to assist users in the search process. Query suggestions are very important for improving users search experience. ...
An enhanced user search experience is possible if factors, such as user preference, are examined in future work. ...
A meta-suggestion is a new query suggestion scheme that aggregates query suggestions from other search engines as candidate queries for the suggestions. ...
arXiv:2110.12594v2
fatcat:7zciyhvn4jglxouhgstqq7un4e
Utilizing query change for session search
2013
Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval - SIGIR '13
Session search is the Information Retrieval (IR) task that performs document retrieval for a search session. ...
Experiments show that our approach is highly effective and outperforms top session search systems in TREC 2011 and 2012. ...
Any opinions, findings, conclusions, or recommendations expressed in this paper are of the authors, and do not necessarily reflect those of the sponsor. ...
doi:10.1145/2484028.2484055
dblp:conf/sigir/GuanZY13
fatcat:x6d6lm355rc7jcaraxqhap6sie
Learning user interests for a session-based personalized search
2008
Proceedings of the second international symposium on Information interaction in context - IIiX '08
Finally, the search personalization is achieved by re-ranking the search results for a given query using the short term user interest. ...
However most of the proposed personalized retrieval models and strategies do not distinguish between short term and long term user interests and make use of the whole search history to improve the search ...
According to [8] , the user interests are the most important contextual factor, which can alleviate an ambiguous web search in an ad hoc retrieval task. ...
doi:10.1145/1414694.1414708
dblp:conf/iiix/DaoudTB08
fatcat:s55bm3dmhvbltngnxz7pxvjzxq
Reliability and validity of query intent assessments
2013
Journal of the American Society for Information Science and Technology
It is important for the field to get a better understanding of the quality of this process as an approximation for determining the searcher's actual intent. ...
The quality of a search engine critically depends on the ability to present results that are an adequate response to the user's query and intent. ...
The evaluation also showed that the participants in most cases did not agree about the query type even though they searched with the exact same query. ...
doi:10.1002/asi.22948
fatcat:ulydrjeckrhxtlwcijiueghe4u
Personalizing atypical web search sessions
2013
Proceedings of the sixth ACM international conference on Web search and data mining - WSDM '13
The proposed method is evaluated based on Web-scale search session data spanning several months of user activity. ...
Most research in Web search personalization models users as static or slowly evolving entities with a given set of preferences defined by their past behavior. ...
To gain a first, qualitative insight into the domain, we limit our scope to the 200 most active users. Together, they submitted a total of 679,808 queries in 67,812 sessions. ...
doi:10.1145/2433396.2433434
dblp:conf/wsdm/EickhoffCBD13
fatcat:l3l6ojuxljcfzh6h26u52dnita
The hierarchical degree-of-visibility tree
2004
IEEE Transactions on Knowledge and Data Engineering
The HDoV-tree builds on and extends the R-tree such that 1) the search space is pruned based on the degree of visibility of objects and 2) internal nodes store level-of-details (LoDs) that represent a ...
In this paper, we present a novel structure called the Hierarchical Degree-of-Visibility Tree (HDoV-tree) for visibility query processing in visualization systems. ...
The basic idea of the first scheme, DoV cache replacement policy, is to retain the data of visually important nodes in memory as long as possible. ...
doi:10.1109/tkde.2004.78
fatcat:bpk27cv7w5fn7h7zkx3fja4jie
Using a graph-based ontological user profile for personalizing search
2008
Proceeding of the 17th ACM conference on Information and knowledge mining - CIKM '08
The user profile refers to the short term user interest and is used for re-ranking the search results of queries in the same search session. ...
The session boundary recognition is based on tracking changes in the dominant concepts held by the query and the user profile. ...
The user profile is initialized by the profile of the first query submitted in the search session. ...
doi:10.1145/1458082.1458352
dblp:conf/cikm/DaoudTB08
fatcat:ouq2tej6m5ckjambfuxgv2ryby
Multidimensional relevance: Prioritized aggregation in a personalized Information Retrieval setting
2012
Information Processing & Management
The originality of this approach lies in the aggregation of the considered criteria in a prioritized way, by considering the existence of a prioritization relationship over the criteria. ...
A new model for aggregating multiple criteria evaluations for relevance assessment is proposed. ...
in different search sessions with distinct search intents). ...
doi:10.1016/j.ipm.2011.07.001
fatcat:ai6ds6klizg7zndlgg4jcoyeye
Mining rich session context to improve web search
2009
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '09
In this paper, we expand the use of browsing information for web search ranking and other applications, with an emphasis on analyzing individual user sessions for creating aggregate models. ...
We evaluate its effectiveness for the problem of web search ranking, showing that it contributes significantly to retrieval performance as a novel web search feature. ...
ACKNOWLEDGMENTS We thank Benoit Dumoulin and other members of the Query Intent Modeling Team in Yahoo! Search and Yahoo! Research Barcelona for useful discussions. ...
doi:10.1145/1557019.1557131
dblp:conf/kdd/ZhuM09
fatcat:6se74mfubfb3lix6unbrnlg2ba
Privacy preserving cooperative computation for personalized web search applications
2020
Proceedings of the 35th Annual ACM Symposium on Applied Computing
Third, CoWSA is scalable as it provides acceptable computation and communication costs compared to most closely related schemes. ...
In this paper, we present CoWSA, a privacy preserving Cooperative computation framework for personalized Web Search peripheral Applications. The proposed framework is multi-fold. ...
ACKNOWLEDGMENTS We are thankful to Qwant for the valuable discussions we had on empowering users to control their personal data, and to achieve higher conidence in digital technologies. ...
doi:10.1145/3341105.3373947
dblp:conf/sac/KaanicheMZLD20
fatcat:wsty7nvgy5gytdhyz5ciyppy3u
Daedalus: Statistical Aggregation for Large-Scale Dynamic Networks
2006
Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications
An important task of any monitoring overlay, is the computation of aggregation functions such as MEAN over a set of nodes. ...
The Daedalus monitoring overlay network is composed of the most stable nodes and is used to disseminate the query and compute the answer, as in step 1. ...
doi:10.1109/infocom.2006.86
dblp:conf/infocom/KalyvianakiL06
fatcat:t32ihquzjndbzhu5p3hxffgviu
Webis at TREC 2014: Web, Session, and Contextual Suggestion Tracks
2014
Text Retrieval Conference
In this paper we give a brief overview of the Webis group's participation in the TREC 2014 Web, Session and Contextual Suggestion tracks. ...
All our runs for the Web and the Session track are on the full ClueWeb12 and use the online Indri retrieval system hosted at CMU. ...
→ R + ) is used to increase or decrease the importance of an axiom in different settings. ...
dblp:conf/trec/HagenGMMS14
fatcat:xf5xrwckdnh7tkekv2kefwoldy
« Previous
Showing results 1 — 15 out of 12,710 results