Tunkelang, D.: Dynamic category sets : an approach for faceted search (2006)
0.01
0.012802532 = product of:
0.051210128 = sum of:
0.051210128 = weight(_text_:data in 3082) [ClassicSimilarity], result of:
0.051210128 = score(doc=3082,freq=4.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.34584928 = fieldWeight in 3082, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0546875 = fieldNorm(doc=3082)
0.25 = coord(1/4)
- Abstract
- In this paper, we present Dynamic Category Sets, a novel approach that addresses the vocabulary problem for faceted data. In their paper on the vocabulary problem, Furnas et al. note that "the keywords that are assigned by indexers are often at odds with those tried by searchers." Faceted search systems exhibit an interesting aspect of this problem: users do not necessarily understand an information space in terms of the same facets as the indexers who designed it. Our approach addresses this problem by employing a data-driven approach to discover sets of values across multiple facets that best match the query. When there are multiple candidates, we offer a clarification dialog that allows the user to disambiguate them.
