skip to main content
10.1145/3383583.3398614acmconferencesArticle/Chapter ViewAbstractPublication PagesjcdlConference Proceedingsconference-collections
short-paper

A Comparative Study of the Relationship between the Subjective Difficulty, Objective Difficulty of Search Tasks and Search Behaviors

Published:01 August 2020Publication History

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.

Skip Supplemental Material Section

Supplemental Material

3383583.3398614.mp4

mp4

66.4 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. DOI: http://dx.doi.org/10.1016/j.ipm. 2008.07.005.Google ScholarGoogle ScholarDigital LibraryDigital Library
  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. DOI: https://doi.org/10.1145/2661829.2661939.Google ScholarGoogle Scholar
  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. DOI: http://dx.doi.org/10.1002/asi.24125.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Edwin A. Locke. 1968. Toward a theory of task motivation and incentives. Organizational Behavior and Human Performance 3, 2 (1968), 157--189. DOI: http://dx.doi.org/10.1016/0030--5073(68)90004--4.Google ScholarGoogle ScholarCross RefCross Ref
  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. DOI: http://dx.doi.org/10.1002/meet.14504701173.Google ScholarGoogle ScholarDigital LibraryDigital Library
  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. DOI: https://doi.org/10.1145/2396761.2398434.Google ScholarGoogle ScholarDigital LibraryDigital Library
  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. DOI: http://dx.doi.org/10.1002/asi.23803.Google ScholarGoogle ScholarDigital LibraryDigital Library
  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. DOI: https://doi.org/10.1145/3176349.3176382.Google ScholarGoogle Scholar
  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. DOI: http://dx.doi.org/10. 1007/978--3--319--67744--6_6.Google ScholarGoogle ScholarCross RefCross Ref
  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. DOI: https://doi.org/10.1145/238386.238489.Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Jaime Arguello. 2014. Predicting Search Task Difficulty. In Proceedings of European Conference on Information Retrieval (2014), 88--99. DOI:http://dx.doi. org/10.1007/978--3--319-06028--6_8.Google ScholarGoogle ScholarDigital LibraryDigital Library
  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. DOI: https://doi.org/10.1145/1753326.1753333.Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A Comparative Study of the Relationship between the Subjective Difficulty, Objective Difficulty of Search Tasks and Search Behaviors

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      JCDL '20: Proceedings of the ACM/IEEE Joint Conference on Digital Libraries in 2020
      August 2020
      611 pages
      ISBN:9781450375856
      DOI:10.1145/3383583

      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]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 1 August 2020

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • short-paper

      Acceptance Rates

      Overall Acceptance Rate415of1,482submissions,28%
    • Article Metrics

      • Downloads (Last 12 months)13
      • Downloads (Last 6 weeks)2

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader