JournalArticlekleinberg1999authoritativeAuthoritative sources in a hyperlinked environment1999KleinbergM.Jon604-63246 ISSN: 0004-5411 DOI: 10.1145/324133.324140ACMNew York, NY, USAJ. ACMSeptemberhttp://doi.acm.org/10.1145/324133.324140<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>authorities, hits, hubs, kleinberg, snaJournalArticlekleinberg1999hitsAuthoritative sources in a hyperlinked environment1999KleinbergM.Jon604-63246Journal of the ACM5http://citeseer.ist.psu.edu/kleinberg99authoritative.html. 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,...hits, ranking, search, sosbuchConferenceProceedingsinproceedings988728A community-aware search engine2004AlmeidaB.RodrigoAlmeidaA. F.Virgilio413-421 ISBN: 1-58113-844-XACM PressNew York, NY, USAProceedings of the 13th international conference on World Wide WebProceedings of the 13th international conference on World Wide Webhttp://doi.acm.org/10.1145/988672.988728
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.search, engine, detection, hits, community, networkMiscalmeida03designDesign and evaluation of a user-based community discovery technique2003AlmeidaR.B.AlmeidaV.A.F.17-23Proceedings of the 4th International Conference on Internet ComputingProceedings of the 4th International Conference on Internet Computingciteseer.ist.psu.edu/almeida03design.htmlDesign and evaluation of a user-based community discovery techniquedetection, hits, community, networkConferenceProceedingsinproceedingsconf/ht/WuZM06Harvesting social knowledge from folksonomies.2006WuHarrisZubairMohammadMalyKurtWiilKockUffeNürnbergJ.PeterRubartJessica111-114 ISBN: 1-59593-417-0ACMHypertextHypertexthttp://dblp.uni-trier.de/db/conf/ht/ht2006.html#WuZM06directed, graph, hits, ranking, toreadconf/ht/2006ConferenceProceedingsinproceedingsconf/www/BorodinRRT01Finding authorities and hubs from link structures on the World Wide Web2001BorodinAllanRobertsO.GarethRosenthalS.JeffreyTsaparasPanayiotis415-429ACM PressNew York, NY, USAProceedings of the 10th international conference on World Wide WebProceedings of the 10th international conference on World Wide Webhttp://doi.acm.org/10.1145/371920.372096detection, hits, community, networkMisceigenvector2005LangvilleA Survey of Eigenvector Methods of Web Information Retrieval2005LangvilleN.AmyMeyerD.Carl135-16147The SIAM Review1http://www.cofc.edu/~langvillea/surveyEVwebIRReprint.pdfA Survey of Eigenvector Methods of Web Information RetrievalWeb 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.web, svd, pagerank, ir, eigenvector, salsa, lsi, ****, hits