Liu, J.; Li, Y.; Hastings, S.K.: Simplified scheme of search task difficulty reasons (2019)
0.01
0.0075442037 = product of:
0.02263261 = sum of:
0.02263261 = weight(_text_:on in 5224) [ClassicSimilarity], result of:
0.02263261 = score(doc=5224,freq=4.0), product of:
0.109763056 = queryWeight, product of:
2.199415 = idf(docFreq=13325, maxDocs=44218)
0.04990557 = queryNorm
0.20619515 = fieldWeight in 5224, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
2.199415 = idf(docFreq=13325, maxDocs=44218)
0.046875 = fieldNorm(doc=5224)
0.33333334 = coord(1/3)
- Abstract
- This article reports on a study that aimed at simplifying a search task difficulty reason scheme. Liu, Kim, and Creel (2015) (denoted LKC15) developed a 21-item search task difficulty reason scheme using a controlled laboratory experiment. The current study simplified the scheme through another experiment that followed the same design as LKC15 and involved 32 university students. The study had one added questionnaire item that provided a list of the 21 difficulty reasons in the multiple-choice format. By comparing the current study with LKC15, a concept of primary top difficulty reasons was proposed, which reasonably simplified the 21-item scheme to an 8-item top reason list. This limited number of reasons is more manageable and makes it feasible for search systems to predict task difficulty reasons from observable user behaviors, which builds the basis for systems to improve user satisfaction based on predicted search difficulty reasons.
