-
Aqeel, S.U.; Beitzel, S.M.; Jensen, E.C.; Grossman, D.; Frieder, O.: On the development of name search techniques for Arabic (2006)
0.06
0.063717805 = product of:
0.12743561 = sum of:
0.12743561 = sum of:
0.08569186 = weight(_text_:o in 5289) [ClassicSimilarity], result of:
0.08569186 = score(doc=5289,freq=2.0), product of:
0.25764057 = queryWeight, product of:
5.017288 = idf(docFreq=795, maxDocs=44218)
0.05135056 = queryNorm
0.33260235 = fieldWeight in 5289, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.017288 = idf(docFreq=795, maxDocs=44218)
0.046875 = fieldNorm(doc=5289)
0.04174375 = weight(_text_:22 in 5289) [ClassicSimilarity], result of:
0.04174375 = score(doc=5289,freq=2.0), product of:
0.17982091 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05135056 = queryNorm
0.23214069 = fieldWeight in 5289, 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=5289)
0.5 = coord(1/2)
- Date
- 22. 7.2006 17:20:20
-
Beitzel, S.M.; Jensen, E.C.; Chowdhury, A.; Frieder, O.; Grossman, D.: Temporal analysis of a very large topically categorized Web query log (2007)
0.06
0.0612334 = sum of:
0.025528463 = product of:
0.10211385 = sum of:
0.10211385 = weight(_text_:authors in 60) [ClassicSimilarity], result of:
0.10211385 = score(doc=60,freq=6.0), product of:
0.23409766 = queryWeight, product of:
4.558814 = idf(docFreq=1258, maxDocs=44218)
0.05135056 = queryNorm
0.43620193 = fieldWeight in 60, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
4.558814 = idf(docFreq=1258, maxDocs=44218)
0.0390625 = fieldNorm(doc=60)
0.25 = coord(1/4)
0.03570494 = product of:
0.07140988 = sum of:
0.07140988 = weight(_text_:o in 60) [ClassicSimilarity], result of:
0.07140988 = score(doc=60,freq=2.0), product of:
0.25764057 = queryWeight, product of:
5.017288 = idf(docFreq=795, maxDocs=44218)
0.05135056 = queryNorm
0.27716863 = fieldWeight in 60, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.017288 = idf(docFreq=795, maxDocs=44218)
0.0390625 = fieldNorm(doc=60)
0.5 = coord(1/2)
- Abstract
- The authors review a log of billions of Web queries that constituted the total query traffic for a 6-month period of a general-purpose commercial Web search service. Previously, query logs were studied from a single, cumulative view. In contrast, this study builds on the authors' previous work, which showed changes in popularity and uniqueness of topically categorized queries across the hours in a day. To further their analysis, they examine query traffic on a daily, weekly, and monthly basis by matching it against lists of queries that have been topically precategorized by human editors. These lists represent 13% of the query traffic. They show that query traffic from particular topical categories differs both from the query stream as a whole and from other categories. Additionally, they show that certain categories of queries trend differently over varying periods. The authors key contribution is twofold: They outline a method for studying both the static and topical properties of a very large query log over varying periods, and they identify and examine topical trends that may provide valuable insight for improving both retrieval effectiveness and efficiency.
-
Cathey, R.J.; Jensen, E.C.; Beitzel, S.M.; Frieder, O.; Grossman, D.: Exploiting parallelism to support scalable hierarchical clustering (2007)
0.04
0.03570494 = product of:
0.07140988 = sum of:
0.07140988 = product of:
0.14281976 = sum of:
0.14281976 = weight(_text_:o in 448) [ClassicSimilarity], result of:
0.14281976 = score(doc=448,freq=8.0), product of:
0.25764057 = queryWeight, product of:
5.017288 = idf(docFreq=795, maxDocs=44218)
0.05135056 = queryNorm
0.55433726 = fieldWeight in 448, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
5.017288 = idf(docFreq=795, maxDocs=44218)
0.0390625 = fieldNorm(doc=448)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- A distributed memory parallel version of the group average hierarchical agglomerative clustering algorithm is proposed to enable scaling the document clustering problem to large collections. Using standard message passing operations reduces interprocess communication while maintaining efficient load balancing. In a series of experiments using a subset of a standard Text REtrieval Conference (TREC) test collection, our parallel hierarchical clustering algorithm is shown to be scalable in terms of processors efficiently used and the collection size. Results show that our algorithm performs close to the expected O(n**2/p) time on p processors rather than the worst-case O(n**3/p) time. Furthermore, the O(n**2/p) memory complexity per node allows larger collections to be clustered as the number of nodes increases. While partitioning algorithms such as k-means are trivially parallelizable, our results confirm those of other studies which showed that hierarchical algorithms produce significantly tighter clusters in the document clustering task. Finally, we show how our parallel hierarchical agglomerative clustering algorithm can be used as the clustering subroutine for a parallel version of the buckshot algorithm to cluster the complete TREC collection at near theoretical runtime expectations.
-
Beitzel, S.M.; Jensen, E.C.; Chowdhury, A.; Grossman, D.; Frieder, O; Goharian, N.: Fusion of effective retrieval strategies in the same information retrieval system (2004)
0.02
0.021422965 = product of:
0.04284593 = sum of:
0.04284593 = product of:
0.08569186 = sum of:
0.08569186 = weight(_text_:o in 2502) [ClassicSimilarity], result of:
0.08569186 = score(doc=2502,freq=2.0), product of:
0.25764057 = queryWeight, product of:
5.017288 = idf(docFreq=795, maxDocs=44218)
0.05135056 = queryNorm
0.33260235 = fieldWeight in 2502, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.017288 = idf(docFreq=795, maxDocs=44218)
0.046875 = fieldNorm(doc=2502)
0.5 = coord(1/2)
0.5 = coord(1/2)
