-
Hotho, A.; Bloehdorn, S.: Data Mining 2004 : Text classification by boosting weak learners based on terms and concepts (2004)
0.28
0.2845536 = product of:
0.42683035 = sum of:
0.05952498 = product of:
0.17857493 = sum of:
0.17857493 = weight(_text_:3a in 562) [ClassicSimilarity], result of:
0.17857493 = score(doc=562,freq=2.0), product of:
0.3177388 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.03747799 = 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.17857493 = weight(_text_:2f in 562) [ClassicSimilarity], result of:
0.17857493 = score(doc=562,freq=2.0), product of:
0.3177388 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.03747799 = 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.17857493 = weight(_text_:2f in 562) [ClassicSimilarity], result of:
0.17857493 = score(doc=562,freq=2.0), product of:
0.3177388 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.03747799 = 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.0101555 = product of:
0.030466499 = sum of:
0.030466499 = weight(_text_:22 in 562) [ClassicSimilarity], result of:
0.030466499 = score(doc=562,freq=2.0), product of:
0.13124153 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03747799 = 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(4/6)
- 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
-
Zhu, W.Z.; Allen, R.B.: Document clustering using the LSI subspace signature model (2013)
0.04
0.037651278 = product of:
0.112953834 = sum of:
0.102798335 = weight(_text_:ranking in 690) [ClassicSimilarity], result of:
0.102798335 = score(doc=690,freq=4.0), product of:
0.20271951 = queryWeight, product of:
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.03747799 = queryNorm
0.5070964 = fieldWeight in 690, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.046875 = fieldNorm(doc=690)
0.0101555 = product of:
0.030466499 = sum of:
0.030466499 = weight(_text_:22 in 690) [ClassicSimilarity], result of:
0.030466499 = score(doc=690,freq=2.0), product of:
0.13124153 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03747799 = queryNorm
0.23214069 = fieldWeight in 690, 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=690)
0.33333334 = coord(1/3)
0.33333334 = coord(2/6)
- Abstract
- We describe the latent semantic indexing subspace signature model (LSISSM) for semantic content representation of unstructured text. Grounded on singular value decomposition, the model represents terms and documents by the distribution signatures of their statistical contribution across the top-ranking latent concept dimensions. LSISSM matches term signatures with document signatures according to their mapping coherence between latent semantic indexing (LSI) term subspace and LSI document subspace. LSISSM does feature reduction and finds a low-rank approximation of scalable and sparse term-document matrices. Experiments demonstrate that this approach significantly improves the performance of major clustering algorithms such as standard K-means and self-organizing maps compared with the vector space model and the traditional LSI model. The unique contribution ranking mechanism in LSISSM also improves the initialization of standard K-means compared with random seeding procedure, which sometimes causes low efficiency and effectiveness of clustering. A two-stage initialization strategy based on LSISSM significantly reduces the running time of standard K-means procedures.
- Date
- 23. 3.2013 13:22:36
-
Yilmaz, T.; Ozcan, R.; Altingovde, I.S.; Ulusoy, Ö.: Improving educational web search for question-like queries through subject classification (2019)
0.01
0.014277548 = product of:
0.085665286 = sum of:
0.085665286 = weight(_text_:ranking in 5041) [ClassicSimilarity], result of:
0.085665286 = score(doc=5041,freq=4.0), product of:
0.20271951 = queryWeight, product of:
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.03747799 = queryNorm
0.42258036 = fieldWeight in 5041, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.0390625 = fieldNorm(doc=5041)
0.16666667 = coord(1/6)
- Abstract
- Students use general web search engines as their primary source of research while trying to find answers to school-related questions. Although search engines are highly relevant for the general population, they may return results that are out of educational context. Another rising trend; social community question answering websites are the second choice for students who try to get answers from other peers online. We attempt discovering possible improvements in educational search by leveraging both of these information sources. For this purpose, we first implement a classifier for educational questions. This classifier is built by an ensemble method that employs several regular learning algorithms and retrieval based approaches that utilize external resources. We also build a query expander to facilitate classification. We further improve the classification using search engine results and obtain 83.5% accuracy. Although our work is entirely based on the Turkish language, the features could easily be mapped to other languages as well. In order to find out whether search engine ranking can be improved in the education domain using the classification model, we collect and label a set of query results retrieved from a general web search engine. We propose five ad-hoc methods to improve search ranking based on the idea that the query-document category relation is an indicator of relevance. We evaluate these methods for overall performance, varying query length and based on factoid and non-factoid queries. We show that some of the methods significantly improve the rankings in the education domain.
-
Mu, T.; Goulermas, J.Y.; Korkontzelos, I.; Ananiadou, S.: Descriptive document clustering via discriminant learning in a co-embedded space of multilevel similarities (2016)
0.01
0.010095751 = product of:
0.0605745 = sum of:
0.0605745 = weight(_text_:ranking in 2496) [ClassicSimilarity], result of:
0.0605745 = score(doc=2496,freq=2.0), product of:
0.20271951 = queryWeight, product of:
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.03747799 = queryNorm
0.29880944 = fieldWeight in 2496, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.0390625 = fieldNorm(doc=2496)
0.16666667 = coord(1/6)
- Abstract
- Descriptive document clustering aims at discovering clusters of semantically interrelated documents together with meaningful labels to summarize the content of each document cluster. In this work, we propose a novel descriptive clustering framework, referred to as CEDL. It relies on the formulation and generation of 2 types of heterogeneous objects, which correspond to documents and candidate phrases, using multilevel similarity information. CEDL is composed of 5 main processing stages. First, it simultaneously maps the documents and candidate phrases into a common co-embedded space that preserves higher-order, neighbor-based proximities between the combined sets of documents and phrases. Then, it discovers an approximate cluster structure of documents in the common space. The third stage extracts promising topic phrases by constructing a discriminant model where documents along with their cluster memberships are used as training instances. Subsequently, the final cluster labels are selected from the topic phrases using a ranking scheme using multiple scores based on the extracted co-embedding information and the discriminant output. The final stage polishes the initial clusters to reduce noise and accommodate the multitopic nature of documents. The effectiveness and competitiveness of CEDL is demonstrated qualitatively and quantitatively with experiments using document databases from different application fields.
-
Dolin, R.; Agrawal, D.; El Abbadi, A.; Pearlman, J.: Using automated classification for summarizing and selecting heterogeneous information sources (1998)
0.01
0.00605745 = product of:
0.0363447 = sum of:
0.0363447 = weight(_text_:ranking in 1253) [ClassicSimilarity], result of:
0.0363447 = score(doc=1253,freq=2.0), product of:
0.20271951 = queryWeight, product of:
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.03747799 = queryNorm
0.17928566 = fieldWeight in 1253, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.0234375 = fieldNorm(doc=1253)
0.16666667 = coord(1/6)
- Abstract
- We are currently experimenting with newsgroups as collections. We have built an initial prototype which automatically classifies and summarizes newsgroups within the LCC. (The prototype can be tested below, and more details may be found at http://pharos.alexandria.ucsb.edu/). The prototype uses electronic library catalog records as a `training set' and Latent Semantic Indexing (LSI) for IR. We use the training set to build a rich set of classification terminology, and associate these terms with the relevant categories in the LCC. This association between terms and classification categories allows us to relate users' queries to nodes in the LCC so that users can select appropriate query categories. Newsgroups are similarly associated with classification categories. Pharos then matches the categories selected by users to relevant newsgroups. In principle, this approach allows users to exclude newsgroups that might have been selected based on an unintended meaning of a query term, and to include newsgroups with relevant content even though the exact query terms may not have been used. This work is extensible to other types of classification, including geographical, temporal, and image feature. Before discussing the methodology of the collection summarization and selection, we first present an online demonstration below. The demonstration is not intended to be a complete end-user interface. Rather, it is intended merely to offer a view of the process to suggest the "look and feel" of the prototype. The demo works as follows. First supply it with a few keywords of interest. The system will then use those terms to try to return to you the most relevant subject categories within the LCC. Assuming that the system recognizes any of your terms (it has over 400,000 terms indexed), it will give you a list of 15 LCC categories sorted by relevancy ranking. From there, you have two choices. The first choice, by clicking on the "News" links, is to get a list of newsgroups which the system has identified as relevant to the LCC category you select. The other choice, by clicking on the LCC ID links, is to enter the LCC hierarchy starting at the category of your choice and navigate the tree until you locate the best category for your query. From there, again, you can get a list of newsgroups by clicking on the "News" links. After having shown this demonstration to many people, we would like to suggest that you first give it easier examples before trying to break it. For example, "prostate cancer" (discussed below), "remote sensing", "investment banking", and "gershwin" all work reasonably well.
-
Panyr, J.: STEINADLER: ein Verfahren zur automatischen Deskribierung und zur automatischen thematischen Klassifikation (1978)
0.00
0.004554527 = product of:
0.027327161 = sum of:
0.027327161 = product of:
0.08198148 = sum of:
0.08198148 = weight(_text_:29 in 5169) [ClassicSimilarity], result of:
0.08198148 = score(doc=5169,freq=2.0), product of:
0.13183585 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.03747799 = 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.16666667 = coord(1/6)
- Source
- Nachrichten für Dokumentation. 29(1978), S.92-96
-
Subramanian, S.; Shafer, K.E.: Clustering (2001)
0.00
0.0033851666 = product of:
0.020311 = sum of:
0.020311 = product of:
0.060932998 = sum of:
0.060932998 = weight(_text_:22 in 1046) [ClassicSimilarity], result of:
0.060932998 = score(doc=1046,freq=2.0), product of:
0.13124153 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03747799 = 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.16666667 = coord(1/6)
- Date
- 5. 5.2003 14:17:22
-
Reiner, U.: Automatische DDC-Klassifizierung von bibliografischen Titeldatensätzen (2009)
0.00
0.0028209724 = product of:
0.016925834 = sum of:
0.016925834 = product of:
0.050777502 = sum of:
0.050777502 = weight(_text_:22 in 611) [ClassicSimilarity], result of:
0.050777502 = score(doc=611,freq=2.0), product of:
0.13124153 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03747799 = 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.16666667 = coord(1/6)
- 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.00
0.0028209724 = product of:
0.016925834 = sum of:
0.016925834 = product of:
0.050777502 = sum of:
0.050777502 = weight(_text_:22 in 2748) [ClassicSimilarity], result of:
0.050777502 = score(doc=2748,freq=2.0), product of:
0.13124153 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03747799 = 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.16666667 = coord(1/6)
- Date
- 1. 2.2016 18:25:22
-
Savic, D.: Designing an expert system for classifying office documents (1994)
0.00
0.0022772634 = product of:
0.013663581 = sum of:
0.013663581 = product of:
0.04099074 = sum of:
0.04099074 = weight(_text_:29 in 2655) [ClassicSimilarity], result of:
0.04099074 = score(doc=2655,freq=2.0), product of:
0.13183585 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.03747799 = 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.16666667 = coord(1/6)
- 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.0019926056 = product of:
0.011955633 = sum of:
0.011955633 = product of:
0.035866898 = sum of:
0.035866898 = weight(_text_:29 in 2219) [ClassicSimilarity], result of:
0.035866898 = score(doc=2219,freq=2.0), product of:
0.13183585 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.03747799 = 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.16666667 = coord(1/6)
- 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.0019926056 = product of:
0.011955633 = sum of:
0.011955633 = product of:
0.035866898 = sum of:
0.035866898 = weight(_text_:29 in 1661) [ClassicSimilarity], result of:
0.035866898 = score(doc=1661,freq=2.0), product of:
0.13183585 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.03747799 = 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.16666667 = coord(1/6)
- Date
- 29. 7.1998 17:45:02
-
Ruiz, M.E.; Srinivasan, P.: Combining machine learning and hierarchical indexing structures for text categorization (2001)
0.00
0.0019926056 = product of:
0.011955633 = sum of:
0.011955633 = product of:
0.035866898 = sum of:
0.035866898 = weight(_text_:29 in 1595) [ClassicSimilarity], result of:
0.035866898 = score(doc=1595,freq=2.0), product of:
0.13183585 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.03747799 = 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.33333334 = coord(1/3)
0.16666667 = coord(1/6)
- Date
- 11. 5.2003 18:29:44
-
Bock, H.-H.: Datenanalyse zur Strukturierung und Ordnung von Information (1989)
0.00
0.0019746807 = product of:
0.011848084 = sum of:
0.011848084 = product of:
0.03554425 = sum of:
0.03554425 = weight(_text_:22 in 141) [ClassicSimilarity], result of:
0.03554425 = score(doc=141,freq=2.0), product of:
0.13124153 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03747799 = 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.16666667 = coord(1/6)
- Pages
- S.1-22
-
Dubin, D.: Dimensions and discriminability (1998)
0.00
0.0019746807 = product of:
0.011848084 = sum of:
0.011848084 = product of:
0.03554425 = sum of:
0.03554425 = weight(_text_:22 in 2338) [ClassicSimilarity], result of:
0.03554425 = score(doc=2338,freq=2.0), product of:
0.13124153 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03747799 = 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.16666667 = coord(1/6)
- Date
- 22. 9.1997 19:16:05
-
Automatic classification research at OCLC (2002)
0.00
0.0019746807 = product of:
0.011848084 = sum of:
0.011848084 = product of:
0.03554425 = sum of:
0.03554425 = weight(_text_:22 in 1563) [ClassicSimilarity], result of:
0.03554425 = score(doc=1563,freq=2.0), product of:
0.13124153 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03747799 = 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.16666667 = coord(1/6)
- Date
- 5. 5.2003 9:22:09
-
Jenkins, C.: Automatic classification of Web resources using Java and Dewey Decimal Classification (1998)
0.00
0.0019746807 = product of:
0.011848084 = sum of:
0.011848084 = product of:
0.03554425 = sum of:
0.03554425 = weight(_text_:22 in 1673) [ClassicSimilarity], result of:
0.03554425 = score(doc=1673,freq=2.0), product of:
0.13124153 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03747799 = 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.33333334 = coord(1/3)
0.16666667 = coord(1/6)
- 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.00
0.0019746807 = product of:
0.011848084 = sum of:
0.011848084 = product of:
0.03554425 = sum of:
0.03554425 = weight(_text_:22 in 5273) [ClassicSimilarity], result of:
0.03554425 = score(doc=5273,freq=2.0), product of:
0.13124153 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03747799 = 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.33333334 = coord(1/3)
0.16666667 = coord(1/6)
- Date
- 22. 7.2006 16:24:52
-
Yi, K.: Automatic text classification using library classification schemes : trends, issues and challenges (2007)
0.00
0.0019746807 = product of:
0.011848084 = sum of:
0.011848084 = product of:
0.03554425 = sum of:
0.03554425 = weight(_text_:22 in 2560) [ClassicSimilarity], result of:
0.03554425 = score(doc=2560,freq=2.0), product of:
0.13124153 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03747799 = queryNorm
0.2708308 = fieldWeight in 2560, 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=2560)
0.33333334 = coord(1/3)
0.16666667 = coord(1/6)
- Date
- 22. 9.2008 18:31:54
-
Drori, O.; Alon, N.: Using document classification for displaying search results (2003)
0.00
0.0017079476 = product of:
0.010247685 = sum of:
0.010247685 = product of:
0.030743055 = sum of:
0.030743055 = weight(_text_:29 in 1565) [ClassicSimilarity], result of:
0.030743055 = score(doc=1565,freq=2.0), product of:
0.13183585 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.03747799 = queryNorm
0.23319192 = fieldWeight in 1565, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.046875 = fieldNorm(doc=1565)
0.33333334 = coord(1/3)
0.16666667 = coord(1/6)
- Source
- Journal of information science. 29(2003) no.2, S.97-106
