Cited By
View all- Mahdi MAhmad ANatiq HSubhi MQassim Q(2021)Comprehensive Review and Future Research Directions on Dynamic Faceted SearchApplied Sciences10.3390/app1117811311:17(8113)Online publication date: 31-Aug-2021
A Comparative Study of the Relationship between the Subjective Difficulty, Objective Difficulty of Search Tasks and Search Behaviors
Authors: 
Kun Huang, Jiaqi Chen, Chang Liu, Lulu ZhangAuthors Info & Claims
Kun Huang, Jiaqi Chen, Chang Liu, Lulu ZhangAuthors Info & ClaimsPages 421 - 424
Abstract
This study uses comparative research to compare the effects of the subjective difficulty and objective difficulty of search tasks on users' search behaviors. Data regarding users' opinions about task difficulty was obtained via a post-search questionnaire using a 5-Likert scale. When measuring subjective difficulty, tasks with ratings above 3 were considered difficult. When measuring objective difficulty, tasks with ratings higher than the average difficulty score were considered difficult. The study's findings indicate that it is better to develop task difficulty prediction models that are based on subjective difficulty because these models are more stable. Models based on objective difficulty could not match the performance of models based upon subjective difficulty. The findings shed light on issues related to experiment design that will be valuable for future research.
Supplementary Material
A Comparative Study of the Relationship between the Subjective Difficulty, Objective Difficulty of Search Tasks and Search Behaviors
- Download
- 66.45 MB
References
[1]
Yuelin Li and Nicholas J. Belkin. 2008. A faceted approach to conceptualizing tasks in information seeking. Information Processing & Management 44, 6 (2008), 1822--1837. 2008.07.005.
[2]
Chang Liu, Jingjing Liu, and Nicholas J. Belkin. 2014. Predicting Search Task Difficulty at Different Search Stages. In Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management (CIKM '14). Association for Computing Machinery, New York, NY, USA, 569--578.
[3]
Jingjing Liu, Yuan Li, and Samantha K. Hastings. 2019. Simplified Scheme of Search Task Difficulty Reasons. Journal of the Association for Information Science and Technology 70, 5 (2019), 526--529.
[4]
Edwin A. Locke. 1968. Toward a theory of task motivation and incentives. Organizational Behavior and Human Performance 3, 2 (1968), 157--189.
[5]
Jingjing Liu, Jacek Gwizdka, Chang Liu, and Nicholas J. Belkin. 2010. Predicting task difficulty for different task types. Proceedings of the American Society for Information Science and Technology 47, 1 (2010), 1--10.
[6]
Jingjing Liu, Chang Liu, Michael Cole, Nicholas J. Belkin, and Xiangmin Zhang. 2012. Exploring and predicting search task difficulty. In Proceedings of the 21st ACM international conference on Information and knowledge management (CIKM '12). Association for Computing Machinery, New York, NY, USA, 1313--1322.
[7]
Xiao Hu and Noriko Kando. 2017. Task complexity and difficulty in music information retrieval. Journal of the Association for Information Science and Technology 68, 7 (2017), 1711--1723.
[8]
Daniel Hienert, Matthew Mitsui, Philipp Mayr, Chirag Shah, and Nicholas J. Belkin. 2018. The Role of the Task Topic in Web Search of Different Task Types. In Proceedings of the 2018 Conference on Human Information Interaction & Retrieval (CHIIR '18). Association for Computing Machinery, New York, NY, USA, 72--81.
[9]
Saraschandra Karanam and Herre Van Oostendorp. 2017. Age-Related Effects of Task Difficulty on the Semantic Relevance of Query Reformulations. In Proceedings of the 16th IFIP TC 13 International Conference on Human-Computer Interaction-INTERACT (2017), 77--96. 1007/978--3--319--67744--6_6.
[10]
Peter Pirolli, Patricia Schank, Marti Hearst, and Christine Diehl. 1996. Scatter/gather browsing communicates the topic structure of a very large text collection. In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems (CHI '96). Association for Computing Machinery, New York, NY, USA, 213--220.
[11]
Jaime Arguello. 2014. Predicting Search Task Difficulty. In Proceedings of European Conference on Information Retrieval (2014), 88--99. org/10.1007/978--3--319-06028--6_8.
[12]
Anne Aula, Rehan M. Khan, and Zhiwei Guan. 2010. How does search behavior change as search becomes more difficult? In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems (CHI '10). Association for Computing Machinery, New York, NY, USA, 35--44.
Index Terms
- A Comparative Study of the Relationship between the Subjective Difficulty, Objective Difficulty of Search Tasks and Search Behaviors
Recommendations
Exploring and predicting search task difficulty
CIKM '12: Proceedings of the 21st ACM international conference on Information and knowledge managementWe report on an investigation of behavioral differences between users in difficult and easy search tasks. Behavioral factors that can be used in real-time to predict task difficulty are identified. User data was collected in a controlled lab experiment (...
Reducing Objective Difficulty Without Influencing Subjective Difficulty in a Video Game
MMAsia '23: Proceedings of the 5th ACM International Conference on Multimedia in AsiaWhile dynamic difficulty adjustment techniques can enhance the player engagement, overly apparent difficulty adjustments may have a detrimental effect on the overall gaming experience. Hence, it is desirable to implement game difficulty controls as ...
Ranking the Difficulty Level of the Knowledge Units Based on Learning Dependency
Assigning difficulty level indicators to the knowledge units helps the learners plan their learning activities more efficiently. This paper focuses on how to use the topology of a knowledge map to compute and rank the difficulty levels of knowledge ...
Comments
Information & Contributors
Information
Published In
August 2020
611 pages
ISBN:9781450375856
DOI:10.1145/3383583
- General Chairs:
- Ruhua Huang,
- Dan Wu,
- Gary Marchionini,
- Program Chairs:
- Daqing He,
- Sally Jo Cunningham,
- Preben Hansen
Copyright © 2020 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
- SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
- SIGIR: ACM Special Interest Group on Information Retrieval
- IEEE: Institute of Electrical and Electronics Engineers
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 August 2020
Check for updates
Author Tags
Qualifiers
- Short-paper
Funding Sources
- National Natural Science Foundation of China
Conference
JCDL '20: The ACM/IEEE Joint Conference on Digital Libraries in 2020
August 1 - 5, 2020
Virtual Event, China
Acceptance Rates
Overall Acceptance Rate 415 of 1,482 submissions, 28%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 149Total Downloads
- Downloads (Last 12 months)6
- Downloads (Last 6 weeks)0
Reflects downloads up to 27 Dec 2024
Other Metrics
Citations
Cited By
View all- Mahdi MAhmad ANatiq HSubhi MQassim Q(2021)Comprehensive Review and Future Research Directions on Dynamic Faceted SearchApplied Sciences10.3390/app1117811311:17(8113)Online publication date: 31-Aug-2021
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in