Wu, H.; Zubair, M. & Maly, K. (2006),
Harvesting social knowledge from folksonomies., in
Uffe Kock Wiil; Peter J. Nürnberg & Jessica Rubart, ed.,
'Hypertext'
, ACM,
, pp. 111-114
.
[BibTeX]
[Endnote]
Langville, A. N. & Meyer, C. D. (2005),
'A Survey of Eigenvector Methods of Web Information Retrieval'
, The SIAM Review 47
(1)
, 135-161
.
[BibTeX]
[Endnote]
Web information retrieval is significantly more challenging than traditional well-controlled,
small document collection information retrieval. One main difference between traditional
information retrieval and Web information retrieval is the Web’s hyperlink structure. This
structure has been exploited by several of today’s leading Web search engines, particularly
Google and Teoma. In this survey paper, we focus on Web information retrieval methods
that use eigenvector computations, presenting the three popular methods of HITS,
PageRank, and SALSA.
Almeida, R. B. & Almeida, V. A. F. (2004),
A community-aware search engine, in
'Proceedings of the 13th international conference on World Wide Web'
, ACM Press, New York, NY, USA
, pp. 413--421
.
[BibTeX]
[Endnote]
Current search technologies work in a "one size fits all" fashion. Therefore, the answer to a query is independent of specific user information need. In this paper we describe a novel ranking technique for personalized search servicesthat combines content-based and community-based evidences. The community-based information is used in order to provide context for queries andis influenced by the current interaction of the user with the service. Ouralgorithm is evaluated using data derived from an actual service available on the Web an online bookstore. We show that the quality of content-based ranking strategies can be improved by the use of communityinformation as another evidential source of relevance. In our experiments the improvements reach up to 48% in terms of average precision.
Almeida, R. & Almeida, V. (2003),
'Design and evaluation of a user-based community discovery technique'
'Proceedings of the 4th International Conference on Internet Computing'
, 17--23
.
[BibTeX]
[Endnote]
Borodin, A.; Roberts, G. O.; Rosenthal, J. S. & Tsaparas, P. (2001),
Finding authorities and hubs from link structures on the World Wide Web, in
'Proceedings of the 10th international conference on World Wide Web'
, ACM Press, New York, NY, USA
, pp. 415--429
.
[BibTeX]
[Endnote]
Kleinberg, J. M. (1999),
'Authoritative sources in a hyperlinked environment', J. ACM
46
, 604--632
.
[BibTeX]
[Endnote]
<par>The network structure of a hyperlinked environment can be a rich source of information about the content of the environment, provided we have effective means for understanding it. We develop a set of algorithmic tools for extracting information from the link structures of such environments, and report on experiments that demonstrate their effectiveness in a variety of context on the World Wide Web. The central issue we address within our framework is the distillation of broad search topics, through the discovery of “authorative” information sources on such topics. We propose and test an algorithmic formulation of the notion of authority, based on the relationship between a set of relevant authoritative pages and the set of “hub pages” that join them together in the link structure. Our formulation has connections to the eigenvectors of certain matrices associated with the link graph; these connections in turn motivate additional heuristrics for link-based analysis.</par>
Kleinberg, J. M. (1999),
'Authoritative sources in a hyperlinked environment', Journal of the ACM
46
(5)
, 604--632
.
[BibTeX]
[Endnote]
. The network structure of a hyperlinked environment can be a rich source of information about the content of the environment, provided we have effective means for understanding it. We develop a set of algorithmic tools for extracting information from the link structures of such environments, and report on experiments that demonstrate their effectiveness in a variety of contexts on the World Wide Web. The central issue we address within our framework is the distillation of broad search topics,...