-
Hotho, A.; Bloehdorn, S.: Data Mining 2004 : Text classification by boosting weak learners based on terms and concepts (2004)
0.07
0.06572479 = sum of:
0.053544547 = product of:
0.21417819 = sum of:
0.21417819 = weight(_text_:3a in 562) [ClassicSimilarity], result of:
0.21417819 = score(doc=562,freq=2.0), product of:
0.38108775 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.044950135 = queryNorm
0.56201804 = fieldWeight in 562, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
8.478011 = idf(docFreq=24, maxDocs=44218)
0.046875 = fieldNorm(doc=562)
0.25 = coord(1/4)
0.0121802455 = product of:
0.036540736 = sum of:
0.036540736 = weight(_text_:22 in 562) [ClassicSimilarity], result of:
0.036540736 = score(doc=562,freq=2.0), product of:
0.15740772 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.044950135 = queryNorm
0.23214069 = fieldWeight in 562, 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=562)
0.33333334 = coord(1/3)
- Content
- Vgl.: http://www.google.de/url?sa=t&rct=j&q=&esrc=s&source=web&cd=1&cad=rja&ved=0CEAQFjAA&url=http%3A%2F%2Fciteseerx.ist.psu.edu%2Fviewdoc%2Fdownload%3Fdoi%3D10.1.1.91.4940%26rep%3Drep1%26type%3Dpdf&ei=dOXrUMeIDYHDtQahsIGACg&usg=AFQjCNHFWVh6gNPvnOrOS9R3rkrXCNVD-A&sig2=5I2F5evRfMnsttSgFF9g7Q&bvm=bv.1357316858,d.Yms.
- Date
- 8. 1.2013 10:22:32
-
Bianchini, C.; Bargioni, S.: Automated classification using linked open data : a case study on faceted classification and Wikidata (2021)
0.03
0.028768778 = product of:
0.057537556 = sum of:
0.057537556 = product of:
0.08630633 = sum of:
0.04494234 = weight(_text_:p in 724) [ClassicSimilarity], result of:
0.04494234 = score(doc=724,freq=2.0), product of:
0.16161878 = queryWeight, product of:
3.5955126 = idf(docFreq=3298, maxDocs=44218)
0.044950135 = queryNorm
0.27807623 = fieldWeight in 724, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5955126 = idf(docFreq=3298, maxDocs=44218)
0.0546875 = fieldNorm(doc=724)
0.04136399 = weight(_text_:c in 724) [ClassicSimilarity], result of:
0.04136399 = score(doc=724,freq=2.0), product of:
0.15505123 = queryWeight, product of:
3.4494052 = idf(docFreq=3817, maxDocs=44218)
0.044950135 = queryNorm
0.2667763 = fieldWeight in 724, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.4494052 = idf(docFreq=3817, maxDocs=44218)
0.0546875 = fieldNorm(doc=724)
0.6666667 = coord(2/3)
0.5 = coord(1/2)
- Source
- Cataloging and classification quarterly. 59(2021) no.8, p.835-852
-
Jenkins, C.: Automatic classification of Web resources using Java and Dewey Decimal Classification (1998)
0.03
0.027998284 = product of:
0.055996567 = sum of:
0.055996567 = product of:
0.08399485 = sum of:
0.04136399 = weight(_text_:c in 1673) [ClassicSimilarity], result of:
0.04136399 = score(doc=1673,freq=2.0), product of:
0.15505123 = queryWeight, product of:
3.4494052 = idf(docFreq=3817, maxDocs=44218)
0.044950135 = queryNorm
0.2667763 = fieldWeight in 1673, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.4494052 = idf(docFreq=3817, maxDocs=44218)
0.0546875 = fieldNorm(doc=1673)
0.04263086 = weight(_text_:22 in 1673) [ClassicSimilarity], result of:
0.04263086 = score(doc=1673,freq=2.0), product of:
0.15740772 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.044950135 = queryNorm
0.2708308 = fieldWeight in 1673, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0546875 = fieldNorm(doc=1673)
0.6666667 = coord(2/3)
0.5 = coord(1/2)
- Date
- 1. 8.1996 22:08:06
-
Yoon, Y.; Lee, C.; Lee, G.G.: ¬An effective procedure for constructing a hierarchical text classification system (2006)
0.03
0.027998284 = product of:
0.055996567 = sum of:
0.055996567 = product of:
0.08399485 = sum of:
0.04136399 = weight(_text_:c in 5273) [ClassicSimilarity], result of:
0.04136399 = score(doc=5273,freq=2.0), product of:
0.15505123 = queryWeight, product of:
3.4494052 = idf(docFreq=3817, maxDocs=44218)
0.044950135 = queryNorm
0.2667763 = fieldWeight in 5273, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.4494052 = idf(docFreq=3817, maxDocs=44218)
0.0546875 = fieldNorm(doc=5273)
0.04263086 = weight(_text_:22 in 5273) [ClassicSimilarity], result of:
0.04263086 = score(doc=5273,freq=2.0), product of:
0.15740772 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.044950135 = queryNorm
0.2708308 = fieldWeight in 5273, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0546875 = fieldNorm(doc=5273)
0.6666667 = coord(2/3)
0.5 = coord(1/2)
- Date
- 22. 7.2006 16:24:52
-
Wu, K.J.; Chen, M.-C.; Sun, Y.: Automatic topics discovery from hyperlinked documents (2004)
0.02
0.024658954 = product of:
0.049317908 = sum of:
0.049317908 = product of:
0.07397686 = sum of:
0.03852201 = weight(_text_:p in 2563) [ClassicSimilarity], result of:
0.03852201 = score(doc=2563,freq=2.0), product of:
0.16161878 = queryWeight, product of:
3.5955126 = idf(docFreq=3298, maxDocs=44218)
0.044950135 = queryNorm
0.23835106 = fieldWeight in 2563, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5955126 = idf(docFreq=3298, maxDocs=44218)
0.046875 = fieldNorm(doc=2563)
0.035454854 = weight(_text_:c in 2563) [ClassicSimilarity], result of:
0.035454854 = score(doc=2563,freq=2.0), product of:
0.15505123 = queryWeight, product of:
3.4494052 = idf(docFreq=3817, maxDocs=44218)
0.044950135 = queryNorm
0.22866541 = fieldWeight in 2563, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.4494052 = idf(docFreq=3817, maxDocs=44218)
0.046875 = fieldNorm(doc=2563)
0.6666667 = coord(2/3)
0.5 = coord(1/2)
- Abstract
- Topic discovery is an important means for marketing, e-Business and social science studies. As well, it can be applied to various purposes, such as identifying a group with certain properties and observing the emergence and diminishment of a certain cyber community. Previous topic discovery work (J.M. Kleinberg, Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, p. 668) requires manual judgment of usefulness of outcomes and is thus incapable of handling the explosive growth of the Internet. In this paper, we propose the Automatic Topic Discovery (ATD) method, which combines a method of base set construction, a clustering algorithm and an iterative principal eigenvector computation method to discover the topics relevant to a given query without using manual examination. Given a query, ATD returns with topics associated with the query and top representative pages for each topic. Our experiments show that the ATD method performs better than the traditional eigenvector method in terms of computation time and topic discovery quality.
-
Sojka, P.; Lee, M.; Rehurek, R.; Hatlapatka, R.; Kucbel, M.; Bouche, T.; Goutorbe, C.; Anghelache, R.; Wojciechowski, K.: Toolset for entity and semantic associations : Final Release (2013)
0.02
0.024658954 = product of:
0.049317908 = sum of:
0.049317908 = product of:
0.07397686 = sum of:
0.03852201 = weight(_text_:p in 1057) [ClassicSimilarity], result of:
0.03852201 = score(doc=1057,freq=2.0), product of:
0.16161878 = queryWeight, product of:
3.5955126 = idf(docFreq=3298, maxDocs=44218)
0.044950135 = queryNorm
0.23835106 = fieldWeight in 1057, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5955126 = idf(docFreq=3298, maxDocs=44218)
0.046875 = fieldNorm(doc=1057)
0.035454854 = weight(_text_:c in 1057) [ClassicSimilarity], result of:
0.035454854 = score(doc=1057,freq=2.0), product of:
0.15505123 = queryWeight, product of:
3.4494052 = idf(docFreq=3817, maxDocs=44218)
0.044950135 = queryNorm
0.22866541 = fieldWeight in 1057, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.4494052 = idf(docFreq=3817, maxDocs=44218)
0.046875 = fieldNorm(doc=1057)
0.6666667 = coord(2/3)
0.5 = coord(1/2)
-
Subramanian, S.; Shafer, K.E.: Clustering (2001)
0.01
0.0121802455 = product of:
0.024360491 = sum of:
0.024360491 = product of:
0.07308147 = sum of:
0.07308147 = weight(_text_:22 in 1046) [ClassicSimilarity], result of:
0.07308147 = score(doc=1046,freq=2.0), product of:
0.15740772 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.044950135 = queryNorm
0.46428138 = fieldWeight in 1046, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.09375 = fieldNorm(doc=1046)
0.33333334 = coord(1/3)
0.5 = coord(1/2)
- Date
- 5. 5.2003 14:17:22
-
Cathey, R.J.; Jensen, E.C.; Beitzel, S.M.; Frieder, O.; Grossman, D.: Exploiting parallelism to support scalable hierarchical clustering (2007)
0.01
0.010700559 = product of:
0.021401118 = sum of:
0.021401118 = product of:
0.06420335 = sum of:
0.06420335 = weight(_text_:p in 448) [ClassicSimilarity], result of:
0.06420335 = score(doc=448,freq=8.0), product of:
0.16161878 = queryWeight, product of:
3.5955126 = idf(docFreq=3298, maxDocs=44218)
0.044950135 = queryNorm
0.39725178 = fieldWeight in 448, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.5955126 = idf(docFreq=3298, maxDocs=44218)
0.0390625 = fieldNorm(doc=448)
0.33333334 = coord(1/3)
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.
-
Reiner, U.: Automatische DDC-Klassifizierung von bibliografischen Titeldatensätzen (2009)
0.01
0.010150205 = product of:
0.02030041 = sum of:
0.02030041 = product of:
0.06090123 = sum of:
0.06090123 = weight(_text_:22 in 611) [ClassicSimilarity], result of:
0.06090123 = score(doc=611,freq=2.0), product of:
0.15740772 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.044950135 = queryNorm
0.38690117 = fieldWeight in 611, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.078125 = fieldNorm(doc=611)
0.33333334 = coord(1/3)
0.5 = coord(1/2)
- Date
- 22. 8.2009 12:54:24
-
HaCohen-Kerner, Y. et al.: Classification using various machine learning methods and combinations of key-phrases and visual features (2016)
0.01
0.010150205 = product of:
0.02030041 = sum of:
0.02030041 = product of:
0.06090123 = sum of:
0.06090123 = weight(_text_:22 in 2748) [ClassicSimilarity], result of:
0.06090123 = score(doc=2748,freq=2.0), product of:
0.15740772 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.044950135 = queryNorm
0.38690117 = fieldWeight in 2748, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.078125 = fieldNorm(doc=2748)
0.33333334 = coord(1/3)
0.5 = coord(1/2)
- Date
- 1. 2.2016 18:25:22
-
Miyamoto, S.: Information clustering based an fuzzy multisets (2003)
0.01
0.009749588 = product of:
0.019499175 = sum of:
0.019499175 = product of:
0.058497526 = sum of:
0.058497526 = weight(_text_:c in 1071) [ClassicSimilarity], result of:
0.058497526 = score(doc=1071,freq=4.0), product of:
0.15505123 = queryWeight, product of:
3.4494052 = idf(docFreq=3817, maxDocs=44218)
0.044950135 = queryNorm
0.3772787 = fieldWeight in 1071, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.4494052 = idf(docFreq=3817, maxDocs=44218)
0.0546875 = fieldNorm(doc=1071)
0.33333334 = coord(1/3)
0.5 = coord(1/2)
- Abstract
- A fuzzy multiset model for information clustering is proposed with application to information retrieval on the World Wide Web. Noting that a search engine retrieves multiple occurrences of the same subjects with possibly different degrees of relevance, we observe that fuzzy multisets provide an appropriate model of information retrieval on the WWW. Information clustering which means both term clustering and document clustering is considered. Three methods of the hard c-means, fuzzy c-means, and an agglomerative method using cluster centers are proposed. Two distances between fuzzy multisets and algorithms for calculating cluster centers are defined. Theoretical properties concerning the clustering algorithms are studied. Illustrative examples are given to show how the algorithms work.
-
Malo, P.; Sinha, A.; Wallenius, J.; Korhonen, P.: Concept-based document classification using Wikipedia and value function (2011)
0.01
0.0090797255 = product of:
0.018159451 = sum of:
0.018159451 = product of:
0.05447835 = sum of:
0.05447835 = weight(_text_:p in 4948) [ClassicSimilarity], result of:
0.05447835 = score(doc=4948,freq=4.0), product of:
0.16161878 = queryWeight, product of:
3.5955126 = idf(docFreq=3298, maxDocs=44218)
0.044950135 = queryNorm
0.33707932 = fieldWeight in 4948, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.5955126 = idf(docFreq=3298, maxDocs=44218)
0.046875 = fieldNorm(doc=4948)
0.33333334 = coord(1/3)
0.5 = coord(1/2)
-
Bollmann, P.; Konrad, E.; Schneider, H.-J.; Zuse, H.: Anwendung automatischer Klassifikationsverfahren mit dem System FAKYR (1978)
0.01
0.008560447 = product of:
0.017120894 = sum of:
0.017120894 = product of:
0.05136268 = sum of:
0.05136268 = weight(_text_:p in 82) [ClassicSimilarity], result of:
0.05136268 = score(doc=82,freq=2.0), product of:
0.16161878 = queryWeight, product of:
3.5955126 = idf(docFreq=3298, maxDocs=44218)
0.044950135 = queryNorm
0.31780142 = fieldWeight in 82, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5955126 = idf(docFreq=3298, maxDocs=44218)
0.0625 = fieldNorm(doc=82)
0.33333334 = coord(1/3)
0.5 = coord(1/2)
-
Ingwersen, P.; Wormell, I.: Ranganathan in the perspective of advanced information retrieval (1992)
0.01
0.008560447 = product of:
0.017120894 = sum of:
0.017120894 = product of:
0.05136268 = sum of:
0.05136268 = weight(_text_:p in 7695) [ClassicSimilarity], result of:
0.05136268 = score(doc=7695,freq=2.0), product of:
0.16161878 = queryWeight, product of:
3.5955126 = idf(docFreq=3298, maxDocs=44218)
0.044950135 = queryNorm
0.31780142 = fieldWeight in 7695, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5955126 = idf(docFreq=3298, maxDocs=44218)
0.0625 = fieldNorm(doc=7695)
0.33333334 = coord(1/3)
0.5 = coord(1/2)
-
Fagni, T.; Sebastiani, F.: Selecting negative examples for hierarchical text classification: An experimental comparison (2010)
0.01
0.008529114 = product of:
0.017058227 = sum of:
0.017058227 = product of:
0.051174678 = sum of:
0.051174678 = weight(_text_:c in 4101) [ClassicSimilarity], result of:
0.051174678 = score(doc=4101,freq=6.0), product of:
0.15505123 = queryWeight, product of:
3.4494052 = idf(docFreq=3817, maxDocs=44218)
0.044950135 = queryNorm
0.3300501 = fieldWeight in 4101, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.4494052 = idf(docFreq=3817, maxDocs=44218)
0.0390625 = fieldNorm(doc=4101)
0.33333334 = coord(1/3)
0.5 = coord(1/2)
- Abstract
- Hierarchical text classification (HTC) approaches have recently attracted a lot of interest on the part of researchers in human language technology and machine learning, since they have been shown to bring about equal, if not better, classification accuracy with respect to their "flat" counterparts while allowing exponential time savings at both learning and classification time. A typical component of HTC methods is a "local" policy for selecting negative examples: Given a category c, its negative training examples are by default identified with the training examples that are negative for c and positive for the categories which are siblings of c in the hierarchy. However, this policy has always been taken for granted and never been subjected to careful scrutiny since first proposed 15 years ago. This article proposes a thorough experimental comparison between this policy and three other policies for the selection of negative examples in HTC contexts, one of which (BEST LOCAL (k)) is being proposed for the first time in this article. We compare these policies on the hierarchical versions of three supervised learning algorithms (boosting, support vector machines, and naïve Bayes) by performing experiments on two standard TC datasets, REUTERS-21578 and RCV1-V2.
-
Godby, C. J.; Stuler, J.: ¬The Library of Congress Classification as a knowledge base for automatic subject categorization (2001)
0.01
0.007878857 = product of:
0.015757713 = sum of:
0.015757713 = product of:
0.047273137 = sum of:
0.047273137 = weight(_text_:c in 1567) [ClassicSimilarity], result of:
0.047273137 = score(doc=1567,freq=2.0), product of:
0.15505123 = queryWeight, product of:
3.4494052 = idf(docFreq=3817, maxDocs=44218)
0.044950135 = queryNorm
0.3048872 = fieldWeight in 1567, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.4494052 = idf(docFreq=3817, maxDocs=44218)
0.0625 = fieldNorm(doc=1567)
0.33333334 = coord(1/3)
0.5 = coord(1/2)
-
Pfister, J.: Clustering von Patent-Dokumenten am Beispiel der Datenbanken des Fachinformationszentrums Karlsruhe (2006)
0.01
0.007878857 = product of:
0.015757713 = sum of:
0.015757713 = product of:
0.047273137 = sum of:
0.047273137 = weight(_text_:c in 5976) [ClassicSimilarity], result of:
0.047273137 = score(doc=5976,freq=2.0), product of:
0.15505123 = queryWeight, product of:
3.4494052 = idf(docFreq=3817, maxDocs=44218)
0.044950135 = queryNorm
0.3048872 = fieldWeight in 5976, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.4494052 = idf(docFreq=3817, maxDocs=44218)
0.0625 = fieldNorm(doc=5976)
0.33333334 = coord(1/3)
0.5 = coord(1/2)
- Source
- Effektive Information Retrieval Verfahren in Theorie und Praxis: ausgewählte und erweiterte Beiträge des Vierten Hildesheimer Evaluierungs- und Retrievalworkshop (HIER 2005), Hildesheim, 20.7.2005. Hrsg.: T. Mandl u. C. Womser-Hacker
-
Ruiz, M.E.; Srinivasan, P.: Combining machine learning and hierarchical indexing structures for text categorization (2001)
0.01
0.0074903904 = product of:
0.014980781 = sum of:
0.014980781 = product of:
0.04494234 = sum of:
0.04494234 = weight(_text_:p in 1595) [ClassicSimilarity], result of:
0.04494234 = score(doc=1595,freq=2.0), product of:
0.16161878 = queryWeight, product of:
3.5955126 = idf(docFreq=3298, maxDocs=44218)
0.044950135 = queryNorm
0.27807623 = fieldWeight in 1595, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5955126 = idf(docFreq=3298, maxDocs=44218)
0.0546875 = fieldNorm(doc=1595)
0.33333334 = coord(1/3)
0.5 = coord(1/2)
-
Bock, H.-H.: Datenanalyse zur Strukturierung und Ordnung von Information (1989)
0.01
0.0071051433 = product of:
0.014210287 = sum of:
0.014210287 = product of:
0.04263086 = sum of:
0.04263086 = weight(_text_:22 in 141) [ClassicSimilarity], result of:
0.04263086 = score(doc=141,freq=2.0), product of:
0.15740772 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.044950135 = queryNorm
0.2708308 = fieldWeight in 141, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0546875 = fieldNorm(doc=141)
0.33333334 = coord(1/3)
0.5 = coord(1/2)
- Pages
- S.1-22
-
Dubin, D.: Dimensions and discriminability (1998)
0.01
0.0071051433 = product of:
0.014210287 = sum of:
0.014210287 = product of:
0.04263086 = sum of:
0.04263086 = weight(_text_:22 in 2338) [ClassicSimilarity], result of:
0.04263086 = score(doc=2338,freq=2.0), product of:
0.15740772 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.044950135 = queryNorm
0.2708308 = fieldWeight in 2338, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0546875 = fieldNorm(doc=2338)
0.33333334 = coord(1/3)
0.5 = coord(1/2)
- Date
- 22. 9.1997 19:16:05
