Ke, W.: Decentralized search and the clustering paradox in large scale information networks (2012)
0.01
0.007724557 = product of:
0.030898228 = sum of:
0.030898228 = weight(_text_:information in 94) [ClassicSimilarity], result of:
0.030898228 = score(doc=94,freq=18.0), product of:
0.08850355 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.050415643 = queryNorm
0.34911853 = fieldWeight in 94, product of:
4.2426405 = tf(freq=18.0), with freq of:
18.0 = termFreq=18.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=94)
0.25 = coord(1/4)
- Abstract
- Amid the rapid growth of information today is the increasing challenge for people to navigate its magnitude. Dynamics and heterogeneity of large information spaces such as the Web raise important questions about information retrieval in these environments. Collection of all information in advance and centralization of IR operations are extremely difficult, if not impossible, because systems are dynamic and information is distributed. The chapter discusses some of the key issues facing classic information retrieval models and presents a decentralized, organic view of information systems pertaining to search in large scale networks. It focuses on the impact of network structure on search performance and discusses a phenomenon we refer to as the Clustering Paradox, in which the topology of interconnected systems imposes a scalability limit.
- Source
- Next generation search engines: advanced models for information retrieval. Eds.: C. Jouis, u.a
