-
Hotho, A.; Bloehdorn, S.: Data Mining 2004 : Text classification by boosting weak learners based on terms and concepts (2004)
0.05
0.054003473 = product of:
0.08100521 = sum of:
0.0691992 = product of:
0.20759758 = sum of:
0.20759758 = weight(_text_:3a in 562) [ClassicSimilarity], result of:
0.20759758 = score(doc=562,freq=2.0), product of:
0.36937886 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.043569047 = 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.33333334 = coord(1/3)
0.011806009 = product of:
0.035418026 = sum of:
0.035418026 = weight(_text_:22 in 562) [ClassicSimilarity], result of:
0.035418026 = score(doc=562,freq=2.0), product of:
0.15257138 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043569047 = 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)
0.6666667 = coord(2/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
-
Ruiz, M.E.; Srinivasan, P.: Combining machine learning and hierarchical indexing structures for text categorization (2001)
0.02
0.024116507 = product of:
0.07234952 = sum of:
0.07234952 = product of:
0.10852428 = sum of:
0.06682816 = weight(_text_:network in 1595) [ClassicSimilarity], result of:
0.06682816 = score(doc=1595,freq=2.0), product of:
0.19402927 = queryWeight, product of:
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.043569047 = queryNorm
0.3444231 = fieldWeight in 1595, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.0546875 = fieldNorm(doc=1595)
0.041696113 = weight(_text_:29 in 1595) [ClassicSimilarity], result of:
0.041696113 = score(doc=1595,freq=2.0), product of:
0.15326229 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.043569047 = queryNorm
0.27205724 = fieldWeight in 1595, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.0546875 = fieldNorm(doc=1595)
0.6666667 = coord(2/3)
0.33333334 = coord(1/3)
- Abstract
- This paper presents a method that exploits the hierarchical structure of an indexing vocabulary to guide the development and training of machine learning methods for automatic text categorization. We present the design of a hierarchical classifier based an the divide-and-conquer principle. The method is evaluated using backpropagation neural networks, such as the machine learning algorithm, that leam to assign MeSH categories to a subset of MEDLINE records. Comparisons with traditional Rocchio's algorithm adapted for text categorization, as well as flat neural network classifiers, are provided. The results indicate that the use of hierarchical structures improves Performance significantly.
- Date
- 11. 5.2003 18:29:44
-
Panyr, J.: STEINADLER: ein Verfahren zur automatischen Deskribierung und zur automatischen thematischen Klassifikation (1978)
0.01
0.010589491 = product of:
0.03176847 = sum of:
0.03176847 = product of:
0.095305406 = sum of:
0.095305406 = weight(_text_:29 in 5169) [ClassicSimilarity], result of:
0.095305406 = score(doc=5169,freq=2.0), product of:
0.15326229 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.043569047 = queryNorm
0.6218451 = fieldWeight in 5169, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.125 = fieldNorm(doc=5169)
0.33333334 = coord(1/3)
0.33333334 = coord(1/3)
- Source
- Nachrichten für Dokumentation. 29(1978), S.92-96
-
Meder, N.: Artificial intelligence as a tool of classification, or: the network of language games as cognitive paradigm (1985)
0.01
0.010501034 = product of:
0.0315031 = sum of:
0.0315031 = product of:
0.094509296 = sum of:
0.094509296 = weight(_text_:network in 7694) [ClassicSimilarity], result of:
0.094509296 = score(doc=7694,freq=4.0), product of:
0.19402927 = queryWeight, product of:
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.043569047 = queryNorm
0.48708782 = fieldWeight in 7694, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.0546875 = fieldNorm(doc=7694)
0.33333334 = coord(1/3)
0.33333334 = coord(1/3)
- Abstract
- It is shown that the cognitive paradigm may be an orientation mark for automatic classification. On the basis of research in Artificial Intelligence, the cognitive paradigm - as opposed to the behavioristic paradigm - was developed as a multiplicity of competitive world-views. This is the thesis of DeMey in his book "The cognitive paradigm". Multiplicity in a loosely-coupled network of cognitive knots is also the principle of dynamic restlessness. In competititon with cognitive views, a classification system that follows various models may learn by concrete information retrieval. During his actions the user builds implicitly a new classification order
-
Guerrero-Bote, V.P.; Moya Anegón, F. de; Herrero Solana, V.: Document organization using Kohonen's algorithm (2002)
0.01
0.008486116 = product of:
0.025458349 = sum of:
0.025458349 = product of:
0.076375045 = sum of:
0.076375045 = weight(_text_:network in 2564) [ClassicSimilarity], result of:
0.076375045 = score(doc=2564,freq=2.0), product of:
0.19402927 = queryWeight, product of:
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.043569047 = queryNorm
0.3936264 = fieldWeight in 2564, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.0625 = fieldNorm(doc=2564)
0.33333334 = coord(1/3)
0.33333334 = coord(1/3)
- Abstract
- The classification of documents from a bibliographic database is a task that is linked to processes of information retrieval based on partial matching. A method is described of vectorizing reference documents from LISA which permits their topological organization using Kohonen's algorithm. As an example a map is generated of 202 documents from LISA, and an analysis is made of the possibilities of this type of neural network with respect to the development of information retrieval systems based on graphical browsing.
-
Subramanian, S.; Shafer, K.E.: Clustering (2001)
0.01
0.007870673 = product of:
0.023612019 = sum of:
0.023612019 = product of:
0.07083605 = sum of:
0.07083605 = weight(_text_:22 in 1046) [ClassicSimilarity], result of:
0.07083605 = score(doc=1046,freq=2.0), product of:
0.15257138 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043569047 = 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.33333334 = coord(1/3)
- Date
- 5. 5.2003 14:17:22
-
Ru, C.; Tang, J.; Li, S.; Xie, S.; Wang, T.: Using semantic similarity to reduce wrong labels in distant supervision for relation extraction (2018)
0.01
0.007500738 = product of:
0.022502214 = sum of:
0.022502214 = product of:
0.06750664 = sum of:
0.06750664 = weight(_text_:network in 5055) [ClassicSimilarity], result of:
0.06750664 = score(doc=5055,freq=4.0), product of:
0.19402927 = queryWeight, product of:
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.043569047 = queryNorm
0.34791988 = fieldWeight in 5055, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.0390625 = fieldNorm(doc=5055)
0.33333334 = coord(1/3)
0.33333334 = coord(1/3)
- Abstract
- Distant supervision (DS) has the advantage of automatically generating large amounts of labelled training data and has been widely used for relation extraction. However, there are usually many wrong labels in the automatically labelled data in distant supervision (Riedel, Yao, & McCallum, 2010). This paper presents a novel method to reduce the wrong labels. The proposed method uses the semantic Jaccard with word embedding to measure the semantic similarity between the relation phrase in the knowledge base and the dependency phrases between two entities in a sentence to filter the wrong labels. In the process of reducing wrong labels, the semantic Jaccard algorithm selects a core dependency phrase to represent the candidate relation in a sentence, which can capture features for relation classification and avoid the negative impact from irrelevant term sequences that previous neural network models of relation extraction often suffer. In the process of relation classification, the core dependency phrases are also used as the input of a convolutional neural network (CNN) for relation classification. The experimental results show that compared with the methods using original DS data, the methods using filtered DS data performed much better in relation extraction. It indicates that the semantic similarity based method is effective in reducing wrong labels. The relation extraction performance of the CNN model using the core dependency phrases as input is the best of all, which indicates that using the core dependency phrases as input of CNN is enough to capture the features for relation classification and could avoid negative impact from irrelevant terms.
-
Orwig, R.E.; Chen, H.; Nunamaker, J.F.: ¬A graphical, self-organizing approach to classifying electronic meeting output (1997)
0.01
0.007425352 = product of:
0.022276055 = sum of:
0.022276055 = product of:
0.06682816 = sum of:
0.06682816 = weight(_text_:network in 6928) [ClassicSimilarity], result of:
0.06682816 = score(doc=6928,freq=2.0), product of:
0.19402927 = queryWeight, product of:
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.043569047 = queryNorm
0.3444231 = fieldWeight in 6928, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.0546875 = fieldNorm(doc=6928)
0.33333334 = coord(1/3)
0.33333334 = coord(1/3)
- Abstract
- Describes research in the application of a Kohonen Self-Organizing Map (SOM) to the problem of classification of electronic brainstorming output and an evaluation of the results. Describes an electronic meeting system and describes the classification problem that exists in the group problem solving process. Surveys the literature concerning classification. Describes the application of the Kohonen SOM to the meeting output classification problem. Describes an experiment that evaluated the classification performed by the Kohonen SOM by comparing it with those of a human expert and a Hopfield neural network. Discusses conclusions and directions for future research
-
Yang, Y.; Liu, X.: ¬A re-examination of text categorization methods (1999)
0.01
0.007425352 = product of:
0.022276055 = sum of:
0.022276055 = product of:
0.06682816 = sum of:
0.06682816 = weight(_text_:network in 3386) [ClassicSimilarity], result of:
0.06682816 = score(doc=3386,freq=2.0), product of:
0.19402927 = queryWeight, product of:
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.043569047 = queryNorm
0.3444231 = fieldWeight in 3386, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.0546875 = fieldNorm(doc=3386)
0.33333334 = coord(1/3)
0.33333334 = coord(1/3)
- Abstract
- This paper reports a controlled study with statistical significance tests an five text categorization methods: the Support Vector Machines (SVM), a k-Nearest Neighbor (kNN) classifier, a neural network (NNet) approach, the Linear Leastsquares Fit (LLSF) mapping and a Naive Bayes (NB) classifier. We focus an the robustness of these methods in dealing with a skewed category distribution, and their performance as function of the training-set category frequency. Our results show that SVM, kNN and LLSF significantly outperform NNet and NB when the number of positive training instances per category are small (less than ten, and that all the methods perform comparably when the categories are sufficiently common (over 300 instances).
-
Reiner, U.: Automatische DDC-Klassifizierung von bibliografischen Titeldatensätzen (2009)
0.01
0.006558894 = product of:
0.019676682 = sum of:
0.019676682 = product of:
0.059030045 = sum of:
0.059030045 = weight(_text_:22 in 611) [ClassicSimilarity], result of:
0.059030045 = score(doc=611,freq=2.0), product of:
0.15257138 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043569047 = 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.33333334 = coord(1/3)
- 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.006558894 = product of:
0.019676682 = sum of:
0.019676682 = product of:
0.059030045 = sum of:
0.059030045 = weight(_text_:22 in 2748) [ClassicSimilarity], result of:
0.059030045 = score(doc=2748,freq=2.0), product of:
0.15257138 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043569047 = 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.33333334 = coord(1/3)
- Date
- 1. 2.2016 18:25:22
-
Denoyer, L.; Gallinari, P.: Bayesian network model for semi-structured document classification (2004)
0.01
0.0063645868 = product of:
0.01909376 = sum of:
0.01909376 = product of:
0.057281278 = sum of:
0.057281278 = weight(_text_:network in 995) [ClassicSimilarity], result of:
0.057281278 = score(doc=995,freq=2.0), product of:
0.19402927 = queryWeight, product of:
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.043569047 = queryNorm
0.29521978 = fieldWeight in 995, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.046875 = fieldNorm(doc=995)
0.33333334 = coord(1/3)
0.33333334 = coord(1/3)
-
Yang, P.; Gao, W.; Tan, Q.; Wong, K.-F.: ¬A link-bridged topic model for cross-domain document classification (2013)
0.01
0.0053038225 = product of:
0.015911467 = sum of:
0.015911467 = product of:
0.047734402 = sum of:
0.047734402 = weight(_text_:network in 2706) [ClassicSimilarity], result of:
0.047734402 = score(doc=2706,freq=2.0), product of:
0.19402927 = queryWeight, product of:
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.043569047 = queryNorm
0.2460165 = fieldWeight in 2706, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.0390625 = fieldNorm(doc=2706)
0.33333334 = coord(1/3)
0.33333334 = coord(1/3)
- Abstract
- Transfer learning utilizes labeled data available from some related domain (source domain) for achieving effective knowledge transformation to the target domain. However, most state-of-the-art cross-domain classification methods treat documents as plain text and ignore the hyperlink (or citation) relationship existing among the documents. In this paper, we propose a novel cross-domain document classification approach called Link-Bridged Topic model (LBT). LBT consists of two key steps. Firstly, LBT utilizes an auxiliary link network to discover the direct or indirect co-citation relationship among documents by embedding the background knowledge into a graph kernel. The mined co-citation relationship is leveraged to bridge the gap across different domains. Secondly, LBT simultaneously combines the content information and link structures into a unified latent topic model. The model is based on an assumption that the documents of source and target domains share some common topics from the point of view of both content information and link structure. By mapping both domains data into the latent topic spaces, LBT encodes the knowledge about domain commonality and difference as the shared topics with associated differential probabilities. The learned latent topics must be consistent with the source and target data, as well as content and link statistics. Then the shared topics act as the bridge to facilitate knowledge transfer from the source to the target domains. Experiments on different types of datasets show that our algorithm significantly improves the generalization performance of cross-domain document classification.
-
Chae, G.; Park, J.; Park, J.; Yeo, W.S.; Shi, C.: Linking and clustering artworks using social tags : revitalizing crowd-sourced information on cultural collections (2016)
0.01
0.0053038225 = product of:
0.015911467 = sum of:
0.015911467 = product of:
0.047734402 = sum of:
0.047734402 = weight(_text_:network in 2852) [ClassicSimilarity], result of:
0.047734402 = score(doc=2852,freq=2.0), product of:
0.19402927 = queryWeight, product of:
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.043569047 = queryNorm
0.2460165 = fieldWeight in 2852, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.0390625 = fieldNorm(doc=2852)
0.33333334 = coord(1/3)
0.33333334 = coord(1/3)
- Abstract
- Social tagging is one of the most popular methods for collecting crowd-sourced information in galleries, libraries, archives, and museums (GLAMs). However, when the number of social tags grows rapidly, using them becomes problematic and, as a result, they are often left as simply big data that cannot be used for practical purposes. To revitalize the use of this crowd-sourced information, we propose using social tags to link and cluster artworks based on an experimental study using an online collection at the Gyeonggi Museum of Modern Art (GMoMA). We view social tagging as a folksonomy, where artworks are classified by keywords of the crowd's various interpretations and one artwork can belong to several different categories simultaneously. To leverage this strength of social tags, we used a clustering method called "link communities" to detect overlapping communities in a network of artworks constructed by computing similarities between all artwork pairs. We used this framework to identify semantic relationships and clusters of similar artworks. By comparing the clustering results with curators' manual classification results, we demonstrated the potential of social tagging data for automatically clustering artworks in a way that reflects the dynamic perspectives of crowds.
-
Savic, D.: Designing an expert system for classifying office documents (1994)
0.01
0.0052947453 = product of:
0.015884236 = sum of:
0.015884236 = product of:
0.047652703 = sum of:
0.047652703 = weight(_text_:29 in 2655) [ClassicSimilarity], result of:
0.047652703 = score(doc=2655,freq=2.0), product of:
0.15326229 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.043569047 = queryNorm
0.31092256 = fieldWeight in 2655, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.0625 = fieldNorm(doc=2655)
0.33333334 = coord(1/3)
0.33333334 = coord(1/3)
- Source
- Records management quarterly. 28(1994) no.3, S.20-29
-
Savic, D.: Automatic classification of office documents : review of available methods and techniques (1995)
0.00
0.0046329014 = product of:
0.013898704 = sum of:
0.013898704 = product of:
0.041696113 = sum of:
0.041696113 = weight(_text_:29 in 2219) [ClassicSimilarity], result of:
0.041696113 = score(doc=2219,freq=2.0), product of:
0.15326229 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.043569047 = queryNorm
0.27205724 = fieldWeight in 2219, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.0546875 = fieldNorm(doc=2219)
0.33333334 = coord(1/3)
0.33333334 = coord(1/3)
- Source
- Records management quarterly. 29(1995) no.4, S.3-18
-
Ruocco, A.S.; Frieder, O.: Clustering and classification of large document bases in a parallel environment (1997)
0.00
0.0046329014 = product of:
0.013898704 = sum of:
0.013898704 = product of:
0.041696113 = sum of:
0.041696113 = weight(_text_:29 in 1661) [ClassicSimilarity], result of:
0.041696113 = score(doc=1661,freq=2.0), product of:
0.15326229 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.043569047 = queryNorm
0.27205724 = fieldWeight in 1661, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.0546875 = fieldNorm(doc=1661)
0.33333334 = coord(1/3)
0.33333334 = coord(1/3)
- Date
- 29. 7.1998 17:45:02
-
Bock, H.-H.: Datenanalyse zur Strukturierung und Ordnung von Information (1989)
0.00
0.004591226 = product of:
0.013773678 = sum of:
0.013773678 = product of:
0.04132103 = sum of:
0.04132103 = weight(_text_:22 in 141) [ClassicSimilarity], result of:
0.04132103 = score(doc=141,freq=2.0), product of:
0.15257138 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043569047 = 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.33333334 = coord(1/3)
- Pages
- S.1-22
-
Dubin, D.: Dimensions and discriminability (1998)
0.00
0.004591226 = product of:
0.013773678 = sum of:
0.013773678 = product of:
0.04132103 = sum of:
0.04132103 = weight(_text_:22 in 2338) [ClassicSimilarity], result of:
0.04132103 = score(doc=2338,freq=2.0), product of:
0.15257138 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043569047 = 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.33333334 = coord(1/3)
- Date
- 22. 9.1997 19:16:05
-
Automatic classification research at OCLC (2002)
0.00
0.004591226 = product of:
0.013773678 = sum of:
0.013773678 = product of:
0.04132103 = sum of:
0.04132103 = weight(_text_:22 in 1563) [ClassicSimilarity], result of:
0.04132103 = score(doc=1563,freq=2.0), product of:
0.15257138 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043569047 = queryNorm
0.2708308 = fieldWeight in 1563, 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=1563)
0.33333334 = coord(1/3)
0.33333334 = coord(1/3)
- Date
- 5. 5.2003 9:22:09
