-
Kulyukin, V.A.; Settle, A.: Ranked retrieval with semantic networks and vector spaces (2001)
0.06
0.061977558 = product of:
0.18593267 = sum of:
0.011980709 = weight(_text_:information in 6934) [ClassicSimilarity], result of:
0.011980709 = score(doc=6934,freq=2.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.1551638 = fieldWeight in 6934, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0625 = fieldNorm(doc=6934)
0.17395195 = weight(_text_:networks in 6934) [ClassicSimilarity], result of:
0.17395195 = score(doc=6934,freq=8.0), product of:
0.20804176 = queryWeight, product of:
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.043984205 = queryNorm
0.8361396 = fieldWeight in 6934, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.0625 = fieldNorm(doc=6934)
0.33333334 = coord(2/6)
- Abstract
- The equivalence of semantic networks with spreading activation and vector spaces with dot product is investigated under ranked retrieval. Semantic networks are viewed as networks of concepts organized in terms of abstraction and packaging relations. It is shown that the two models can be effectively constructed from each other. A formal method is suggested to analyze the models in terms of their relative performance in the same universe of objects
- Source
- Journal of the American Society for Information Science and technology. 52(2001) no.14, S.1224-1233
-
Chang, C.-H.; Hsu, C.-C.: Integrating query expansion and conceptual relevance feedback for personalized Web information retrieval (1998)
0.06
0.0589638 = product of:
0.1179276 = sum of:
0.020966241 = weight(_text_:information in 1319) [ClassicSimilarity], result of:
0.020966241 = score(doc=1319,freq=8.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.27153665 = fieldWeight in 1319, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0546875 = fieldNorm(doc=1319)
0.07610398 = weight(_text_:networks in 1319) [ClassicSimilarity], result of:
0.07610398 = score(doc=1319,freq=2.0), product of:
0.20804176 = queryWeight, product of:
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.043984205 = queryNorm
0.36581108 = fieldWeight in 1319, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.0546875 = fieldNorm(doc=1319)
0.020857384 = product of:
0.04171477 = sum of:
0.04171477 = weight(_text_:22 in 1319) [ClassicSimilarity], result of:
0.04171477 = score(doc=1319,freq=2.0), product of:
0.1540252 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043984205 = queryNorm
0.2708308 = fieldWeight in 1319, 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=1319)
0.5 = coord(1/2)
0.5 = coord(3/6)
- Abstract
- Keyword based querying has been an immediate and efficient way to specify and retrieve related information that the user inquired. However, conventional document ranking based on an automatic assessment of document relevance to the query may not be the best approach when little information is given. Proposes an idea to integrate 2 existing techniques, query expansion and relevance feedback to achieve a concept-based information search for the Web
- Date
- 1. 8.1996 22:08:06
- Source
- Computer networks and ISDN systems. 30(1998) nos.1/7, S.621-623
-
Yan, E.; Ding, Y.; Sugimoto, C.R.: P-Rank: an indicator measuring prestige in heterogeneous scholarly networks (2011)
0.05
0.05285687 = product of:
0.1585706 = sum of:
0.012707461 = weight(_text_:information in 4349) [ClassicSimilarity], result of:
0.012707461 = score(doc=4349,freq=4.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.16457605 = fieldWeight in 4349, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=4349)
0.14586315 = weight(_text_:networks in 4349) [ClassicSimilarity], result of:
0.14586315 = score(doc=4349,freq=10.0), product of:
0.20804176 = queryWeight, product of:
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.043984205 = queryNorm
0.70112437 = fieldWeight in 4349, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.046875 = fieldNorm(doc=4349)
0.33333334 = coord(2/6)
- Abstract
- Ranking scientific productivity and prestige are often limited to homogeneous networks. These networks are unable to account for the multiple factors that constitute the scholarly communication and reward system. This study proposes a new informetric indicator, P-Rank, for measuring prestige in heterogeneous scholarly networks containing articles, authors, and journals. P-Rank differentiates the weight of each citation based on its citing papers, citing journals, and citing authors. Articles from 16 representative library and information science journals are selected as the dataset. Principle Component Analysis is conducted to examine the relationship between P-Rank and other bibliometric indicators. We also compare the correlation and rank variances between citation counts and P-Rank scores. This work provides a new approach to examining prestige in scholarly communication networks in a more comprehensive and nuanced way.
- Source
- Journal of the American Society for Information Science and Technology. 62(2011) no.3, S.467-477
-
Soulier, L.; Jabeur, L.B.; Tamine, L.; Bahsoun, W.: On ranking relevant entities in heterogeneous networks using a language-based model (2013)
0.04
0.042117 = product of:
0.084234 = sum of:
0.014975886 = weight(_text_:information in 664) [ClassicSimilarity], result of:
0.014975886 = score(doc=664,freq=8.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.19395474 = fieldWeight in 664, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0390625 = fieldNorm(doc=664)
0.054359984 = weight(_text_:networks in 664) [ClassicSimilarity], result of:
0.054359984 = score(doc=664,freq=2.0), product of:
0.20804176 = queryWeight, product of:
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.043984205 = queryNorm
0.26129362 = fieldWeight in 664, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.0390625 = fieldNorm(doc=664)
0.0148981325 = product of:
0.029796265 = sum of:
0.029796265 = weight(_text_:22 in 664) [ClassicSimilarity], result of:
0.029796265 = score(doc=664,freq=2.0), product of:
0.1540252 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043984205 = queryNorm
0.19345059 = fieldWeight in 664, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0390625 = fieldNorm(doc=664)
0.5 = coord(1/2)
0.5 = coord(3/6)
- Abstract
- A new challenge, accessing multiple relevant entities, arises from the availability of linked heterogeneous data. In this article, we address more specifically the problem of accessing relevant entities, such as publications and authors within a bibliographic network, given an information need. We propose a novel algorithm, called BibRank, that estimates a joint relevance of documents and authors within a bibliographic network. This model ranks each type of entity using a score propagation algorithm with respect to the query topic and the structure of the underlying bi-type information entity network. Evidence sources, namely content-based and network-based scores, are both used to estimate the topical similarity between connected entities. For this purpose, authorship relationships are analyzed through a language model-based score on the one hand and on the other hand, non topically related entities of the same type are detected through marginal citations. The article reports the results of experiments using the Bibrank algorithm for an information retrieval task. The CiteSeerX bibliographic data set forms the basis for the topical query automatic generation and evaluation. We show that a statistically significant improvement over closely related ranking models is achieved.
- Date
- 22. 3.2013 19:34:49
- Source
- Journal of the American Society for Information Science and Technology. 64(2013) no.3, S.500-515
-
Jiang, X.; Sun, X.; Yang, Z.; Zhuge, H.; Lapshinova-Koltunski, E.; Yao, J.: Exploiting heterogeneous scientific literature networks to combat ranking bias : evidence from the computational linguistics area (2016)
0.03
0.029155392 = product of:
0.08746617 = sum of:
0.01058955 = weight(_text_:information in 3017) [ClassicSimilarity], result of:
0.01058955 = score(doc=3017,freq=4.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.13714671 = fieldWeight in 3017, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0390625 = fieldNorm(doc=3017)
0.076876625 = weight(_text_:networks in 3017) [ClassicSimilarity], result of:
0.076876625 = score(doc=3017,freq=4.0), product of:
0.20804176 = queryWeight, product of:
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.043984205 = queryNorm
0.369525 = fieldWeight in 3017, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.0390625 = fieldNorm(doc=3017)
0.33333334 = coord(2/6)
- Abstract
- It is important to help researchers find valuable papers from a large literature collection. To this end, many graph-based ranking algorithms have been proposed. However, most of these algorithms suffer from the problem of ranking bias. Ranking bias hurts the usefulness of a ranking algorithm because it returns a ranking list with an undesirable time distribution. This paper is a focused study on how to alleviate ranking bias by leveraging the heterogeneous network structure of the literature collection. We propose a new graph-based ranking algorithm, MutualRank, that integrates mutual reinforcement relationships among networks of papers, researchers, and venues to achieve a more synthetic, accurate, and less-biased ranking than previous methods. MutualRank provides a unified model that involves both intra- and inter-network information for ranking papers, researchers, and venues simultaneously. We use the ACL Anthology Network as the benchmark data set and construct the gold standard from computer linguistics course websites of well-known universities and two well-known textbooks. The experimental results show that MutualRank greatly outperforms the state-of-the-art competitors, including PageRank, HITS, CoRank, Future Rank, and P-Rank, in ranking papers in both improving ranking effectiveness and alleviating ranking bias. Rankings of researchers and venues by MutualRank are also quite reasonable.
- Source
- Journal of the Association for Information Science and Technology. 67(2016) no.7, S.1679-1702
-
Ding, Y.; Yan, E.; Frazho, A.; Caverlee, J.: PageRank for ranking authors in co-citation networks (2009)
0.03
0.025979813 = product of:
0.077939436 = sum of:
0.012707461 = weight(_text_:information in 3161) [ClassicSimilarity], result of:
0.012707461 = score(doc=3161,freq=4.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.16457605 = fieldWeight in 3161, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=3161)
0.06523198 = weight(_text_:networks in 3161) [ClassicSimilarity], result of:
0.06523198 = score(doc=3161,freq=2.0), product of:
0.20804176 = queryWeight, product of:
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.043984205 = queryNorm
0.31355235 = fieldWeight in 3161, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.046875 = fieldNorm(doc=3161)
0.33333334 = coord(2/6)
- Abstract
- This paper studies how varied damping factors in the PageRank algorithm influence the ranking of authors and proposes weighted PageRank algorithms. We selected the 108 most highly cited authors in the information retrieval (IR) area from the 1970s to 2008 to form the author co-citation network. We calculated the ranks of these 108 authors based on PageRank with the damping factor ranging from 0.05 to 0.95. In order to test the relationship between different measures, we compared PageRank and weighted PageRank results with the citation ranking, h-index, and centrality measures. We found that in our author co-citation network, citation rank is highly correlated with PageRank with different damping factors and also with different weighted PageRank algorithms; citation rank and PageRank are not significantly correlated with centrality measures; and h-index rank does not significantly correlate with centrality measures but does significantly correlate with other measures. The key factors that have impact on the PageRank of authors in the author co-citation network are being co-cited with important authors.
- Source
- Journal of the American Society for Information Science and Technology. 60(2009) no.11, S.2229-2243
-
Ding, Y.: Topic-based PageRank on author cocitation networks (2011)
0.03
0.025979813 = product of:
0.077939436 = sum of:
0.012707461 = weight(_text_:information in 4348) [ClassicSimilarity], result of:
0.012707461 = score(doc=4348,freq=4.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.16457605 = fieldWeight in 4348, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=4348)
0.06523198 = weight(_text_:networks in 4348) [ClassicSimilarity], result of:
0.06523198 = score(doc=4348,freq=2.0), product of:
0.20804176 = queryWeight, product of:
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.043984205 = queryNorm
0.31355235 = fieldWeight in 4348, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.046875 = fieldNorm(doc=4348)
0.33333334 = coord(2/6)
- Abstract
- Ranking authors is vital for identifying a researcher's impact and standing within a scientific field. There are many different ranking methods (e.g., citations, publications, h-index, PageRank, and weighted PageRank), but most of them are topic-independent. This paper proposes topic-dependent ranks based on the combination of a topic model and a weighted PageRank algorithm. The author-conference-topic (ACT) model was used to extract topic distribution of individual authors. Two ways for combining the ACT model with the PageRank algorithm are proposed: simple combination (I_PR) or using a topic distribution as a weighted vector for PageRank (PR_t). Information retrieval was chosen as the test field and representative authors for different topics at different time phases were identified. Principal component analysis (PCA) was applied to analyze the ranking difference between I_PR and PR_t.
- Source
- Journal of the American Society for Information Science and Technology. 62(2011) no.3, S.449-466
-
Zhang, D.; Dong, Y.: ¬An effective algorithm to rank Web resources (2000)
0.03
0.025367994 = product of:
0.15220796 = sum of:
0.15220796 = weight(_text_:networks in 3662) [ClassicSimilarity], result of:
0.15220796 = score(doc=3662,freq=2.0), product of:
0.20804176 = queryWeight, product of:
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.043984205 = queryNorm
0.73162216 = fieldWeight in 3662, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.109375 = fieldNorm(doc=3662)
0.16666667 = coord(1/6)
- Source
- Computer networks. 33(2000) nos.1/6, S.449-455
-
Finding anything in the billion page Web : are algorithms the key? (1999)
0.03
0.025367994 = product of:
0.15220796 = sum of:
0.15220796 = weight(_text_:networks in 6248) [ClassicSimilarity], result of:
0.15220796 = score(doc=6248,freq=2.0), product of:
0.20804176 = queryWeight, product of:
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.043984205 = queryNorm
0.73162216 = fieldWeight in 6248, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.109375 = fieldNorm(doc=6248)
0.16666667 = coord(1/6)
- Source
- Computer networks. 31(1999) no.11-16, S.1760-1761
-
Voorhees, E.M.: Implementing agglomerative hierarchic clustering algorithms for use in document retrieval (1986)
0.02
0.023878481 = product of:
0.07163544 = sum of:
0.023961417 = weight(_text_:information in 402) [ClassicSimilarity], result of:
0.023961417 = score(doc=402,freq=2.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.3103276 = fieldWeight in 402, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.125 = fieldNorm(doc=402)
0.047674023 = product of:
0.095348045 = sum of:
0.095348045 = weight(_text_:22 in 402) [ClassicSimilarity], result of:
0.095348045 = score(doc=402,freq=2.0), product of:
0.1540252 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043984205 = queryNorm
0.61904186 = fieldWeight in 402, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.125 = fieldNorm(doc=402)
0.5 = coord(1/2)
0.33333334 = coord(2/6)
- Source
- Information processing and management. 22(1986) no.6, S.465-476
-
Back, J.: ¬An evaluation of relevancy ranking techniques used by Internet search engines (2000)
0.02
0.02089367 = product of:
0.06268101 = sum of:
0.020966241 = weight(_text_:information in 3445) [ClassicSimilarity], result of:
0.020966241 = score(doc=3445,freq=2.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.27153665 = fieldWeight in 3445, 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=3445)
0.04171477 = product of:
0.08342954 = sum of:
0.08342954 = weight(_text_:22 in 3445) [ClassicSimilarity], result of:
0.08342954 = score(doc=3445,freq=2.0), product of:
0.1540252 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043984205 = queryNorm
0.5416616 = fieldWeight in 3445, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.109375 = fieldNorm(doc=3445)
0.5 = coord(1/2)
0.33333334 = coord(2/6)
- Date
- 25. 8.2005 17:42:22
- Source
- Library and information research news. 24(2000) no.77, S.30-34
-
Losada, D.E.; Barreiro, A.: Emebedding term similarity and inverse document frequency into a logical model of information retrieval (2003)
0.02
0.01593281 = product of:
0.04779843 = sum of:
0.023961417 = weight(_text_:information in 1422) [ClassicSimilarity], result of:
0.023961417 = score(doc=1422,freq=8.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.3103276 = fieldWeight in 1422, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0625 = fieldNorm(doc=1422)
0.023837011 = product of:
0.047674023 = sum of:
0.047674023 = weight(_text_:22 in 1422) [ClassicSimilarity], result of:
0.047674023 = score(doc=1422,freq=2.0), product of:
0.1540252 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043984205 = queryNorm
0.30952093 = fieldWeight in 1422, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0625 = fieldNorm(doc=1422)
0.5 = coord(1/2)
0.33333334 = coord(2/6)
- Abstract
- We propose a novel approach to incorporate term similarity and inverse document frequency into a logical model of information retrieval. The ability of the logic to handle expressive representations along with the use of such classical notions are promising characteristics for IR systems. The approach proposed here has been efficiently implemented and experiments against test collections are presented.
- Date
- 22. 3.2003 19:27:23
- Footnote
- Beitrag eines Themenheftes: Mathematical, logical, and formal methods in information retrieval
- Source
- Journal of the American Society for Information Science and technology. 54(2003) no.4, S.285-301
-
Crestani, F.; Dominich, S.; Lalmas, M.; Rijsbergen, C.J.K. van: Mathematical, logical, and formal methods in information retrieval : an introduction to the special issue (2003)
0.01
0.013295909 = product of:
0.039887726 = sum of:
0.022009967 = weight(_text_:information in 1451) [ClassicSimilarity], result of:
0.022009967 = score(doc=1451,freq=12.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.2850541 = fieldWeight in 1451, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=1451)
0.017877758 = product of:
0.035755515 = sum of:
0.035755515 = weight(_text_:22 in 1451) [ClassicSimilarity], result of:
0.035755515 = score(doc=1451,freq=2.0), product of:
0.1540252 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043984205 = queryNorm
0.23214069 = fieldWeight in 1451, 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=1451)
0.5 = coord(1/2)
0.33333334 = coord(2/6)
- Abstract
- Research an the use of mathematical, logical, and formal methods, has been central to Information Retrieval research for a long time. Research in this area is important not only because it helps enhancing retrieval effectiveness, but also because it helps clarifying the underlying concepts of Information Retrieval. In this article we outline some of the major aspects of the subject, and summarize the papers of this special issue with respect to how they relate to these aspects. We conclude by highlighting some directions of future research, which are needed to better understand the formal characteristics of Information Retrieval.
- Date
- 22. 3.2003 19:27:36
- Footnote
- Einführung zu den Beiträgen eines Themenheftes: Mathematical, logical, and formal methods in information retrieval
- Source
- Journal of the American Society for Information Science and technology. 54(2003) no.4, S.281-284
-
Klas, C.-P.; Fuhr, N.; Schaefer, A.: Evaluating strategic support for information access in the DAFFODIL system (2004)
0.01
0.013295909 = product of:
0.039887726 = sum of:
0.022009967 = weight(_text_:information in 2419) [ClassicSimilarity], result of:
0.022009967 = score(doc=2419,freq=12.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.2850541 = fieldWeight in 2419, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=2419)
0.017877758 = product of:
0.035755515 = sum of:
0.035755515 = weight(_text_:22 in 2419) [ClassicSimilarity], result of:
0.035755515 = score(doc=2419,freq=2.0), product of:
0.1540252 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043984205 = queryNorm
0.23214069 = fieldWeight in 2419, 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=2419)
0.5 = coord(1/2)
0.33333334 = coord(2/6)
- Abstract
- The digital library system Daffodil is targeted at strategic support of users during the information search process. For searching, exploring and managing digital library objects it provides user-customisable information seeking patterns over a federation of heterogeneous digital libraries. In this paper evaluation results with respect to retrieval effectiveness, efficiency and user satisfaction are presented. The analysis focuses on strategic support for the scientific work-flow. Daffodil supports the whole work-flow, from data source selection over information seeking to the representation, organisation and reuse of information. By embedding high level search functionality into the scientific work-flow, the user experiences better strategic system support due to a more systematic work process. These ideas have been implemented in Daffodil followed by a qualitative evaluation. The evaluation has been conducted with 28 participants, ranging from information seeking novices to experts. The results are promising, as they support the chosen model.
- Date
- 16.11.2008 16:22:48
-
Song, D.; Bruza, P.D.: Towards context sensitive information inference (2003)
0.01
0.013244277 = product of:
0.03973283 = sum of:
0.024834696 = weight(_text_:information in 1428) [ClassicSimilarity], result of:
0.024834696 = score(doc=1428,freq=22.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.32163754 = fieldWeight in 1428, product of:
4.690416 = tf(freq=22.0), with freq of:
22.0 = termFreq=22.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0390625 = fieldNorm(doc=1428)
0.0148981325 = product of:
0.029796265 = sum of:
0.029796265 = weight(_text_:22 in 1428) [ClassicSimilarity], result of:
0.029796265 = score(doc=1428,freq=2.0), product of:
0.1540252 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043984205 = queryNorm
0.19345059 = fieldWeight in 1428, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0390625 = fieldNorm(doc=1428)
0.5 = coord(1/2)
0.33333334 = coord(2/6)
- Abstract
- Humans can make hasty, but generally robust judgements about what a text fragment is, or is not, about. Such judgements are termed information inference. This article furnishes an account of information inference from a psychologistic stance. By drawing an theories from nonclassical logic and applied cognition, an information inference mechanism is proposed that makes inferences via computations of information flow through an approximation of a conceptual space. Within a conceptual space information is represented geometrically. In this article, geometric representations of words are realized as vectors in a high dimensional semantic space, which is automatically constructed from a text corpus. Two approaches were presented for priming vector representations according to context. The first approach uses a concept combination heuristic to adjust the vector representation of a concept in the light of the representation of another concept. The second approach computes a prototypical concept an the basis of exemplar trace texts and moves it in the dimensional space according to the context. Information inference is evaluated by measuring the effectiveness of query models derived by information flow computations. Results show that information flow contributes significantly to query model effectiveness, particularly with respect to precision. Moreover, retrieval effectiveness compares favorably with two probabilistic query models, and another based an semantic association. More generally, this article can be seen as a contribution towards realizing operational systems that mimic text-based human reasoning.
- Date
- 22. 3.2003 19:35:46
- Footnote
- Beitrag eines Themenheftes: Mathematical, logical, and formal methods in information retrieval
- Source
- Journal of the American Society for Information Science and technology. 54(2003) no.4, S.321-334
-
Li, J.; Willett, P.: ArticleRank : a PageRank-based alternative to numbers of citations for analysing citation networks (2009)
0.01
0.012812771 = product of:
0.076876625 = sum of:
0.076876625 = weight(_text_:networks in 751) [ClassicSimilarity], result of:
0.076876625 = score(doc=751,freq=4.0), product of:
0.20804176 = queryWeight, product of:
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.043984205 = queryNorm
0.369525 = fieldWeight in 751, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.72992 = idf(docFreq=1060, maxDocs=44218)
0.0390625 = fieldNorm(doc=751)
0.16666667 = coord(1/6)
- Abstract
- Purpose - The purpose of this paper is to suggest an alternative to the widely used Times Cited criterion for analysing citation networks. The approach involves taking account of the natures of the papers that cite a given paper, so as to differentiate between papers that attract the same number of citations. Design/methodology/approach - ArticleRank is an algorithm that has been derived from Google's PageRank algorithm to measure the influence of journal articles. ArticleRank is applied to two datasets - a citation network based on an early paper on webometrics, and a self-citation network based on the 19 most cited papers in the Journal of Documentation - using citation data taken from the Web of Knowledge database. Findings - ArticleRank values provide a different ranking of a set of papers from that provided by the corresponding Times Cited values, and overcomes the inability of the latter to differentiate between papers with the same numbers of citations. The difference in rankings between Times Cited and ArticleRank is greatest for the most heavily cited articles in a dataset. Originality/value - This is a novel application of the PageRank algorithm.
-
Faloutsos, C.: Signature files (1992)
0.01
0.011939241 = product of:
0.03581772 = sum of:
0.011980709 = weight(_text_:information in 3499) [ClassicSimilarity], result of:
0.011980709 = score(doc=3499,freq=2.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.1551638 = fieldWeight in 3499, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0625 = fieldNorm(doc=3499)
0.023837011 = product of:
0.047674023 = sum of:
0.047674023 = weight(_text_:22 in 3499) [ClassicSimilarity], result of:
0.047674023 = score(doc=3499,freq=2.0), product of:
0.1540252 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043984205 = queryNorm
0.30952093 = fieldWeight in 3499, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0625 = fieldNorm(doc=3499)
0.5 = coord(1/2)
0.33333334 = coord(2/6)
- Date
- 7. 5.1999 15:22:48
- Source
- Information retrieval: data structures and algorithms. Ed.: W.B. Frakes u. R. Baeza-Yates
-
Bornmann, L.; Mutz, R.: From P100 to P100' : a new citation-rank approach (2014)
0.01
0.011939241 = product of:
0.03581772 = sum of:
0.011980709 = weight(_text_:information in 1431) [ClassicSimilarity], result of:
0.011980709 = score(doc=1431,freq=2.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.1551638 = fieldWeight in 1431, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0625 = fieldNorm(doc=1431)
0.023837011 = product of:
0.047674023 = sum of:
0.047674023 = weight(_text_:22 in 1431) [ClassicSimilarity], result of:
0.047674023 = score(doc=1431,freq=2.0), product of:
0.1540252 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043984205 = queryNorm
0.30952093 = fieldWeight in 1431, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0625 = fieldNorm(doc=1431)
0.5 = coord(1/2)
0.33333334 = coord(2/6)
- Date
- 22. 8.2014 17:05:18
- Source
- Journal of the Association for Information Science and Technology. 65(2014) no.9, S.1939-1943
-
Kanaeva, Z.: Ranking: Google und CiteSeer (2005)
0.01
0.011894252 = product of:
0.035682756 = sum of:
0.014825371 = weight(_text_:information in 3276) [ClassicSimilarity], result of:
0.014825371 = score(doc=3276,freq=4.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.1920054 = fieldWeight in 3276, 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=3276)
0.020857384 = product of:
0.04171477 = sum of:
0.04171477 = weight(_text_:22 in 3276) [ClassicSimilarity], result of:
0.04171477 = score(doc=3276,freq=2.0), product of:
0.1540252 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043984205 = queryNorm
0.2708308 = fieldWeight in 3276, 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=3276)
0.5 = coord(1/2)
0.33333334 = coord(2/6)
- Abstract
- Im Rahmen des klassischen Information Retrieval wurden verschiedene Verfahren für das Ranking sowie die Suche in einer homogenen strukturlosen Dokumentenmenge entwickelt. Die Erfolge der Suchmaschine Google haben gezeigt dass die Suche in einer zwar inhomogenen aber zusammenhängenden Dokumentenmenge wie dem Internet unter Berücksichtigung der Dokumentenverbindungen (Links) sehr effektiv sein kann. Unter den von der Suchmaschine Google realisierten Konzepten ist ein Verfahren zum Ranking von Suchergebnissen (PageRank), das in diesem Artikel kurz erklärt wird. Darüber hinaus wird auf die Konzepte eines Systems namens CiteSeer eingegangen, welches automatisch bibliographische Angaben indexiert (engl. Autonomous Citation Indexing, ACI). Letzteres erzeugt aus einer Menge von nicht vernetzten wissenschaftlichen Dokumenten eine zusammenhängende Dokumentenmenge und ermöglicht den Einsatz von Banking-Verfahren, die auf den von Google genutzten Verfahren basieren.
- Date
- 20. 3.2005 16:23:22
- Source
- Information - Wissenschaft und Praxis. 56(2005) H.2, S.87-92
-
Fan, W.; Fox, E.A.; Pathak, P.; Wu, H.: ¬The effects of fitness functions an genetic programming-based ranking discovery for Web search (2004)
0.01
0.011147052 = product of:
0.033441156 = sum of:
0.015563398 = weight(_text_:information in 2239) [ClassicSimilarity], result of:
0.015563398 = score(doc=2239,freq=6.0), product of:
0.0772133 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.043984205 = queryNorm
0.20156369 = fieldWeight in 2239, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=2239)
0.017877758 = product of:
0.035755515 = sum of:
0.035755515 = weight(_text_:22 in 2239) [ClassicSimilarity], result of:
0.035755515 = score(doc=2239,freq=2.0), product of:
0.1540252 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043984205 = queryNorm
0.23214069 = fieldWeight in 2239, 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=2239)
0.5 = coord(1/2)
0.33333334 = coord(2/6)
- Abstract
- Genetic-based evolutionary learning algorithms, such as genetic algorithms (GAs) and genetic programming (GP), have been applied to information retrieval (IR) since the 1980s. Recently, GP has been applied to a new IR taskdiscovery of ranking functions for Web search-and has achieved very promising results. However, in our prior research, only one fitness function has been used for GP-based learning. It is unclear how other fitness functions may affect ranking function discovery for Web search, especially since it is weIl known that choosing a proper fitness function is very important for the effectiveness and efficiency of evolutionary algorithms. In this article, we report our experience in contrasting different fitness function designs an GP-based learning using a very large Web corpus. Our results indicate that the design of fitness functions is instrumental in performance improvement. We also give recommendations an the design of fitness functions for genetic-based information retrieval experiments.
- Date
- 31. 5.2004 19:22:06
- Source
- Journal of the American Society for Information Science and technology. 55(2004) no.7, S.628-636
