{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T00:31:50Z","timestamp":1761006710826,"version":"build-2065373602"},"reference-count":19,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2005,1,31]],"date-time":"2005-01-31T00:00:00Z","timestamp":1107129600000},"content-version":"vor","delay-in-days":822,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc of Assoc for Info"],"published-print":{"date-parts":[[2002,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Link structure analysis is widely recognized as an important tool in WWW information retrieval and is extensively used in the retrieval and ranking algorithms of major WWW search engines. Common extensions of link analyses involve changing the Web subgraphs that are analyzed. In this work, we present two techniques which bias co\u2010citation based link analyses towards favorable pages and away from undesired pages. Both techniques are integrated seamlessly into existing link\u2010analyzing algorithms.<\/jats:p><jats:p>Our first technique extends the notion of hubs by introducing <jats:italic>pseudo hubs<\/jats:italic>, which represent any trait of Web pages that is desirable to users. Pseudo hubs are added as pseudo nodes to the Web\u2010graph and are linked to those pages which exhibit the desirable traits. The ensuing co\u2010citation analysis then treats these pseudo nodes as if they were regular pages. This results in the rankings of pages with favorable traits being boosted. The second technique incorporates negative relevance judgments into the analysis, causing the results to shift away from the surroundings of undesired pages.<\/jats:p>","DOI":"10.1002\/meet.1450390147","type":"journal-article","created":{"date-parts":[[2005,1,31]],"date-time":"2005-01-31T12:49:04Z","timestamp":1107175744000},"page":"425-435","source":"Crossref","is-referenced-by-count":1,"title":["Introducing regulated bias into co\u2010citation ranking schemes on the Web"],"prefix":"10.1002","volume":"39","author":[{"given":"Ronny","family":"Lempel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shlomo","family":"Moran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2005,1,31]]},"reference":[{"key":"e_1_2_7_2_1","doi-asserted-by":"crossref","unstructured":"Aridor Y. Carmel D. Lempel R. Maarek Y. S. andSofier A.(2000).Knowledge agents on the web.Proc. 4th International Workshop on Cooperative Information Agents.","DOI":"10.1007\/978-3-540-45012-2_3"},{"key":"e_1_2_7_3_1","doi-asserted-by":"crossref","unstructured":"Bharat K.(2000).Searchpad: explicit capture of search context to support web search. In Proceedings 9th International World Wide Web Conference Amsterdam.","DOI":"10.1016\/S1389-1286(00)00047-5"},{"key":"e_1_2_7_4_1","doi-asserted-by":"crossref","unstructured":"Bharat K.andHenzinger M. R.(1998).Improved algorithms for topic distillation in a hyperlinked environment.Proc. 21'th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval.","DOI":"10.1145\/290941.290972"},{"key":"e_1_2_7_5_1","doi-asserted-by":"crossref","unstructured":"Borodin A. Roberts G. O. Rosenthal J. S. andTsaparas P.(2001).Finding authorities and hubs from link structures on the world wide web. InProc. 10th International World Wide Web Conference pages415\u2013429.","DOI":"10.1145\/371920.372096"},{"key":"e_1_2_7_6_1","doi-asserted-by":"crossref","unstructured":"Brin S.andPage L.(1998).The anatomy of a large\u2010scale hypertextual web search engine.Proc. 7th International WWW Conference.","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"e_1_2_7_7_1","unstructured":"Chakrabarti S. Dom B. Gibson D. Kleinberg J. Kumar S. Raghavan P. Rajagopalan S. andTomkins A.(1999a).Hypersearching the web.Scientific American."},{"key":"e_1_2_7_8_1","doi-asserted-by":"crossref","unstructured":"Chakrabarti S. Dom B. Gibson D. Kleinberg J. Kumar S. Raghavan P. Rajagopalan S. andTomkins A.(1999b).Mining the link structure of the www.IEEE Computer.","DOI":"10.1109\/2.781636"},{"key":"e_1_2_7_9_1","doi-asserted-by":"crossref","unstructured":"Chakrabarti S. Dom B. Gibson D. Kleinberg J. M. Raghavan P. andRajagopalan S.(1998).Automatic resource list compilation by analyzing hyperlink structure and associated text. Proc. 7th International WWW Conference.","DOI":"10.1016\/S0169-7552(98)00087-7"},{"key":"e_1_2_7_10_1","unstructured":"Chang H. Cohn D. andMcCallum A.(2000).Creating customized authority lists. In Proc. 17th International Conference on Machine Learning (ICML\u20102000) pages127\u2013134."},{"key":"e_1_2_7_11_1","doi-asserted-by":"crossref","unstructured":"Dwork C. Kumar R. Naor M. andSavikumar D.(2001).Rank aggregation methods for the web. InProc. 10th International World Wide Web Conference pages613\u2013622.","DOI":"10.1145\/371920.372165"},{"key":"e_1_2_7_12_1","doi-asserted-by":"crossref","unstructured":"Gibson D. Kleinberg J. M. andRaghavan P.(1998).Inferring web communities from link topology.Proc. 9th ACM Conference on Hypertext and Hypermedia.","DOI":"10.1145\/276627.276652"},{"key":"e_1_2_7_13_1","unstructured":"IBM. IBM Corporation Almaden Research Center. CLEVER.www.almaden.ibm.com\/cs\/k53\/clever.html"},{"key":"e_1_2_7_14_1","doi-asserted-by":"crossref","unstructured":"Jin R.andDumais S.(2001).Probabilistic combination of content and links. InProc. 24'th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval pages402\u2013403.","DOI":"10.1145\/383952.384039"},{"key":"e_1_2_7_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324140"},{"key":"e_1_2_7_16_1","doi-asserted-by":"crossref","unstructured":"Kleinberg J. M. Kumar R. Raghavan P. Rajagopalan S. andTomkins A. S.(1999).The web as a graph: Measurements models and methods.Proceedings of the Fifth International Computing and Combinatorics Conference.","DOI":"10.1007\/3-540-48686-0_1"},{"volume-title":"The Theory of Matrices","year":"1985","author":"Lancaster P.","key":"e_1_2_7_17_1"},{"key":"e_1_2_7_18_1","doi-asserted-by":"crossref","unstructured":"Lawrence S.andGiles C. L.(1998).Searching the world wide web.Science 280.","DOI":"10.1126\/science.280.5360.98"},{"key":"e_1_2_7_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/382979.383041"},{"key":"e_1_2_7_20_1","doi-asserted-by":"crossref","unstructured":"Marchiori M.(1997).The quest for correct information on the web: Hyper search engines.Proc. 6th International WWW Conference.","DOI":"10.1016\/S0169-7552(97)00036-6"}],"container-title":["Proceedings of the American Society for Information Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fmeet.1450390147","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/asistdl.onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/meet.1450390147","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T09:53:20Z","timestamp":1760954000000},"score":1,"resource":{"primary":{"URL":"https:\/\/asistdl.onlinelibrary.wiley.com\/doi\/10.1002\/meet.1450390147"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["10.1002\/meet.1450390147"],"URL":"https:\/\/doi.org\/10.1002\/meet.1450390147","archive":["Portico"],"relation":{},"ISSN":["0044-7870","1550-8390"],"issn-type":[{"type":"print","value":"0044-7870"},{"type":"electronic","value":"1550-8390"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}