Chen, L.-C.: Next generation search engine for the result clustering technology (2012)
0.02
0.020178104 = product of:
0.07062336 = sum of:
0.03856498 = weight(_text_:wide in 105) [ClassicSimilarity], result of:
0.03856498 = score(doc=105,freq=2.0), product of:
0.1312982 = queryWeight, product of:
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.029633347 = queryNorm
0.29372054 = fieldWeight in 105, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.046875 = fieldNorm(doc=105)
0.0060537956 = weight(_text_:information in 105) [ClassicSimilarity], result of:
0.0060537956 = score(doc=105,freq=2.0), product of:
0.052020688 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.029633347 = queryNorm
0.116372846 = fieldWeight in 105, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=105)
0.01797477 = weight(_text_:retrieval in 105) [ClassicSimilarity], result of:
0.01797477 = score(doc=105,freq=2.0), product of:
0.08963835 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.029633347 = queryNorm
0.20052543 = fieldWeight in 105, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.046875 = fieldNorm(doc=105)
0.008029819 = product of:
0.024089456 = sum of:
0.024089456 = weight(_text_:22 in 105) [ClassicSimilarity], result of:
0.024089456 = score(doc=105,freq=2.0), product of:
0.103770934 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.029633347 = queryNorm
0.23214069 = fieldWeight in 105, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046875 = fieldNorm(doc=105)
0.33333334 = coord(1/3)
0.2857143 = coord(4/14)
- Abstract
- Result clustering has recently attracted a lot of attention to provide the users with a succinct overview of relevant search results than traditional search engines. This chapter proposes a mixed clustering method to organize all returned search results into a hierarchical tree structure. The clustering method accomplishes two main tasks, one is label construction and the other is tree building. This chapter uses precision to measure the quality of clustering results. According to the results of experiments, the author preliminarily concluded that the performance of the system is better than many other well-known commercial and academic systems. This chapter makes several contributions. First, it presents a high performance system based on the clustering method. Second, it develops a divisive hierarchical clustering algorithm to organize all returned snippets into hierarchical tree structure. Third, it performs a wide range of experimental analyses to show that almost all commercial systems are significantly better than most current academic systems.
- Date
- 17. 4.2012 15:22:11
- Source
- Next generation search engines: advanced models for information retrieval. Eds.: C. Jouis, u.a
