A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Tag-Based Paper Retrieval: Minimizing User Effort with Diversity Awareness
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
Addressing this issue, our paper tackles the problem of automatically suggesting new tags for user when he formulates a query. ...
In that, each paper is associated with a set of tags, allowing user to search for relevant papers by formulating tag-based queries against the system. ...
Put It Altogether To balance informativeness and diversity in a top-k selection of tags, we design a quality measure for such a selection. ...
doi:10.1007/978-3-319-18120-2_30
fatcat:p7cv6n4ub5gm5ph7ave7qi7fze
User effort in query construction and interface selection
2000
Proceedings of the fifth ACM conference on Digital libraries - DL '00
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Survey results indicate a significant correlation between a user's level of effort and their perceived benefit from that effort. ...
This study was designed to examine user beliefs and behavior on the selection and use of search features and search interfaces. ...
Acknowledgements We thank Infoseek for donating the Ultraseek software. Thanks to Drs. Greg Newby and Bert Dempsey and the students who participated. ...
doi:10.1145/336597.336679
dblp:conf/dl/GerweV00
fatcat:6jkb4vqoazhori4o4eolqbbqwu
Active Preference Learning for Ranking Patterns
2013
2013 IEEE 25th International Conference on Tools with Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present a general framework for learning pattern ranking functions and propose a number of active learning heuristics that aim at minimizing the required user effort. ...
We evaluate the capacity of the algorithm to learn a ranking of a subgroup set defined by a complex quality measure, given only reasonably small sample rankings. ...
Matthijs van Leeuwen is supported by a Rubicon grant of the Netherlands Organisation for Scientific Research (NWO). ...
doi:10.1109/ictai.2013.85
dblp:conf/ictai/DzyubaLNR13
fatcat:ve4kndjkubd6rh3gaztwyrtuvu
Automatic term mismatch diagnosis for selective query expansion
2012
Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval - SIGIR '12
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
For a given topic, the proportion of relevant documents that do not contain a term measures the probability for the term to mismatch relevant documents, or the term mismatch probability. ...
This may not be a big problem for topics with a large and diverse set of relevant documents, but would largely increase the chance of search failure for less popular search needs. ...
We thank Chengtao Wen, Grace Hui Yang, Jin Young Kim, Charlie Clarke, Gordon Cormack and NIST for helpful discussions, feedback and access to data. ...
doi:10.1145/2348283.2348354
dblp:conf/sigir/ZhaoC12
fatcat:ksqca423gfaxpdwuawlcbeumpy
Selective user interaction
2007
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management - CIKM '07
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Acknowledgments This work was supported in part by the Center for Intelligent Information Retrieval, in part by the Defense Advanced Research Projects Agency (DARPA) under contract number HR0011-06-C-0023 ...
For the same user with time to spare for 60% of the queries, we can observe that using CV-based selection helps obtain better performance with the same effort, when compared to randomly selecting queries ...
We now extend the procedures we have developed for selective user interaction to the scenario where a user presents the system with a set of queries along with a condition that she is willing to only interact ...
doi:10.1145/1321440.1321576
dblp:conf/cikm/KumaranA07
fatcat:h2sv4yxikjerrm73xpapalqvgy
Untangling Result List Refinement and Ranking Quality
2015
Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval - SIGIR '15
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This provides a measure of user effort based on the joint effect of user interaction with RLR elements and result quality. ...
We validate our framework by conducting a user study and comparing model predictions with real user performance. Our model predictions show significant positive correlation with real user effort. ...
We use the effort users need to accomplish a task with the basic interface (effort b ) as the indicator of Dq. The higher effort b , the more difficult the query is for a basic interface. ...
doi:10.1145/2766462.2767740
dblp:conf/sigir/HeBVAR15
fatcat:gk4orwnuibdqvcg4qeucqln6gy
Different Users, Different Opinions
2015
Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval - SIGIR '15
Preserved Fulltext
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.
Experimental results on over 1,000 user sessions show that the proposed strategies outperform existing methods and also have promising generalization capability for different users and queries. ...
It is a non-trivial task for two major reasons: (1) The definition of satisfaction is rather subjective and different users may have different opinions in satisfaction judgement. (2) Most existing studies ...
We can then use a combination of xi, yi to calculate a score for each participant to measure his/her reliability. ...
doi:10.1145/2766462.2767721
dblp:conf/sigir/LiuCTS0MZ15
fatcat:ebiihfio2nbpxhgctvn3ef6gu4
A Conversational Approach to Process-oriented Case-based Reasoning
2018
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Current approaches typically require users to specify detailed queries, which can be a demanding task. ...
An evaluation with cooking workflows indicates that C-POCBR can reduce the communication effort for users during retrieval. ...
For the restriction workflows in a query we use a binary measure that evaluates whether a workflow case violates a given restriction or not. ...
doi:10.24963/ijcai.2018/762
dblp:conf/ijcai/ZeyenMB18
fatcat:argpjlcn3zaqvola4jcb4ozoji
Active learning approaches for learning regular expressions with genetic programming
2016
Proceedings of the 31st Annual ACM Symposium on Applied Computing - SAC '16
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We investigate several active learning approaches in which the user annotates only one desired extraction and then merely answers extraction queries generated by the system. ...
The results indicate that active learning is indeed a viable framework in this application domain and may thus significantly decrease the amount of costly annotation effort required. ...
Presenting a large snippet (e.g., one or more entire lines) to the user for annotation may nullify the objective of minimizing user annotation effort. ...
doi:10.1145/2851613.2851668
dblp:conf/sac/BartoliLMT16
fatcat:ldn5ndxrafgxzexr77nrap3lum
User effort minimization through adaptive diversification
2014
Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '14
Preserved Fulltext
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.
We propose an efficient approximate algorithm to select a near-optimal subset of the query results that minimizes the expected user effort. ...
We propose a principled method for adaptive diversification of query results that minimizes the user effort to find the desired results, by dynamically balancing the relevance and diversity at each query ...
Note that, for a given query, the user navigation cost (the user "effort" or actions required to find the desired results) varies for different choices of the trade-off parameter (see Figure 2 , for the ...
doi:10.1145/2623330.2623610
dblp:conf/kdd/HasanKHT14
fatcat:uq6irm6xurc3paul33wqovnscm
Query side evaluation
2009
Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval - SIGIR '09
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, the effectiveness and effort of querying is empirically examined in the context of the Principle of Least Effort, Zipf's Law and the Law of Diminishing Returns. ...
However, the effectiveness of a retrieval system is strongly influenced by the quality of the query submitted. ...
Mark Baillie for their insightful comments and the useful discussions, and I would also like to thank the anonymous reviewers for their thoughtful and constructive suggestions and feedback. ...
doi:10.1145/1571941.1572037
dblp:conf/sigir/Azzopardi09
fatcat:bmz7bhsmqvdfng3utmtm3ivb6q
AIDE: An Automated Sample-based Approach for Interactive Data Exploration
[article]
2015
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
AIDE can deliver highly accurate query predictions for very common conjunctive queries with small user effort while, given a reasonable number of samples, it can predict with high accuracy complex disjunctive ...
Such an automated system is crucial for deriving insights from complex datasets found in many big data applications such as scientific and healthcare applications as well as for reducing the human effort ...
The user model can then be translated to a range query that selects either a single multi-dimensional relevant area (conjunctive query) or multiple ones (disjunctive query). ...
arXiv:1510.08897v1
fatcat:wj2otwbirjau3blvhbwqltl3iq
Approximately optimal facet selection
2012
Proceedings of the 27th Annual ACM Symposium on Applied Computing - SAC '12
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
A crucial aspect of faceted search applications is selecting the list of facets to display to the user following each query. We call this the facet selection problem. ...
Multifaceted search is a popular interaction paradigm for discovery and mining applications that allows users to analyze and navigate through multidimensional data. ...
Acknowledgments We thank Ravi Kumar and Andrew Tomkins for valuable discussions throughout the course of this work. ...
doi:10.1145/2245276.2245409
dblp:conf/sac/LibermanL12
fatcat:s5m6ek4asbf2fdobg3l4f5ecnm
Interactive data exploration based on user relevance feedback
2014
2014 IEEE 30th International Conference on Data Engineering Workshops
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our approach relies on user relevance feedback on data samples to model user interests and strategically collects more samples to refine the model while minimizing the user effort. ...
queries. ...
Therefore, our goal is to discover relevant areas and propose to the user queries that select either a single relevant area (conjunctive queries) or multiple ones (disjunctive queries). ...
doi:10.1109/icdew.2014.6818343
dblp:conf/icde/DimitriadouPD14
fatcat:4ylbiu66ubg35k2ttstda5xqie
Feature Modulation to Improve Struggle Detection in Web Search: A Psychological Approach
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Their underlying assumption is that the more effort a user spends, the more struggling the user may be. However, recent studies have suggested this simple association might be incorrect. ...
This paper proposes a new feature modulation method for struggle detection and refers to the reversal theory in psychology. ...
Efforts to Query. The first group of features measures user efforts spent on writing queries. We
derive most of them from Edwards and Kelly’s work [10]. ...
arXiv:2112.04711v1
fatcat:q7cwfwq6k5gepk26zwrybjuir4
« Previous
Showing results 1 — 15 out of 140,405 results