-
Gordon, M.D.; Dumais, S.: Using latent semantic indexing for literature based discovery (1998)
0.00
0.0024833512 = product of:
0.037250265 = sum of:
0.037250265 = sum of:
0.009767379 = weight(_text_:information in 4892) [ClassicSimilarity], result of:
0.009767379 = score(doc=4892,freq=4.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.1920054 = fieldWeight in 4892, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0546875 = fieldNorm(doc=4892)
0.027482886 = weight(_text_:22 in 4892) [ClassicSimilarity], result of:
0.027482886 = score(doc=4892,freq=2.0), product of:
0.101476215 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.028978055 = queryNorm
0.2708308 = fieldWeight in 4892, 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=4892)
0.06666667 = coord(1/15)
- Abstract
- Latent semantic indexing (LSI) is a statistical technique for improving information retrieval effectiveness. Here, we use LSI to assist in literature-based discoveries. The idea behind literature-based discoveries is that different authors have already published certain underlying scientific ideas that, when taken together, can be connected to hypothesize a new dicovery, and that these connections can be made by exploring the scientific literature. We explore latent semantic indexing's effectiveness on 2 discovery processes: uncovering 'nearby' relationships that are necessary to initiate the literature based discovery process; and discovering more distant relationships that may genuinely generate new discovery hypotheses
- Date
- 11. 2.2016 16:22:19
- Source
- Journal of the American Society for Information Science. 49(1998) no.8, S.674-685
-
Teevan, J.; Dumais, S.: Web retrieval, ranking and personalization (2011)
0.00
4.604387E-4 = product of:
0.00690658 = sum of:
0.00690658 = product of:
0.01381316 = sum of:
0.01381316 = weight(_text_:information in 551) [ClassicSimilarity], result of:
0.01381316 = score(doc=551,freq=2.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.27153665 = fieldWeight in 551, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.109375 = fieldNorm(doc=551)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- Source
- Interactive information seeking, behaviour and retrieval. Eds.: Ruthven, I. u. D. Kelly
-
Deerwester, S.; Dumais, S.; Landauer, T.; Furnass, G.; Beck, L.: Improving information retrieval with latent semantic indexing (1988)
0.00
4.4124527E-4 = product of:
0.0066186786 = sum of:
0.0066186786 = product of:
0.013237357 = sum of:
0.013237357 = weight(_text_:information in 2396) [ClassicSimilarity], result of:
0.013237357 = score(doc=2396,freq=10.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.2602176 = fieldWeight in 2396, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=2396)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- Abstract
- Describes a latent semantic indexing (LSI) approach for improving information retrieval. Most document retrieval systems depend on matching keywords in queries against those in documents. The LSI approach tries to overcome the incompleteness and imprecision of latent relations among terms and documents. Tested performance of the LSI method ranged from considerably better than to roughly comparable to performance based on weighted keyword matching, apparently depending on the quality of the queries. Best LSI performance was found using a global entropy weighting for terms and about 100 dimensions for representing terms, documents and queries.
- Imprint
- Medford, New Jersey : Learned Information Inc.
- Source
- ASIS'88. Information technology: planning for the next fifty years. Proceedings of the 51st Annual Meeting of the American Society for Information Science, Atlanta, Georgia, 23.-27.10.1988. Vol.25. Ed. by C.L. Borgman and E.Y.H. Pai
-
Dumais, S.; Chen, H.: Hierarchical classification of Web content (2000)
0.00
3.9466174E-4 = product of:
0.005919926 = sum of:
0.005919926 = product of:
0.011839852 = sum of:
0.011839852 = weight(_text_:information in 492) [ClassicSimilarity], result of:
0.011839852 = score(doc=492,freq=2.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.23274569 = fieldWeight in 492, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.09375 = fieldNorm(doc=492)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- Source
- Proceedings of ACM SIGIR 23rd International Conference on Research and Development in Information Retrieval. Ed. by N.J. Belkin, P. Ingwersen u. M.K. Leong