메뉴 건너뛰기




Volumn 6, Issue 4, 2006, Pages 381-414

Computing customized page ranks

Author keywords

Interface personalization; PageRank; Search engines; Web page scoring systems

Indexed keywords

CONSTRAINT THEORY; INTERFACES (COMPUTER); MATHEMATICAL MODELS; QUADRATIC PROGRAMMING; SEARCH ENGINES;

EID: 33845449121     PISSN: 15335399     EISSN: 15576051     Source Type: Journal    
DOI: 10.1145/1183463.1183466     Document Type: Article
Times cited : (11)

References (37)
  • 1
    • 0029638653 scopus 로고
    • The complexity and approximability of finding maximum feasible susbystems of linear relations
    • AMALDI, E. AND KANN, V. 1995. The complexity and approximability of finding maximum feasible susbystems of linear relations. Theoret. Comput. Science 147, 181-210.
    • (1995) Theoret. Comput. Science , vol.147 , pp. 181-210
    • Amaldi, E.1    Kann, V.2
  • 2
    • 0042766369 scopus 로고    scopus 로고
    • Engineering a multi-purpose test collection for web retrieval experiments
    • BAILEY, P., CEASWELL, N., AND HAWKING, D. 2003. Engineering a multi-purpose test collection for Web retrieval experiments. Inform. Process. Manag.: Int. J. 39, 6, 853-871.
    • (2003) Inform. Process. Manag.: Int. J. , vol.39 , Issue.6 , pp. 853-871
    • Bailey, P.1    Ceaswell, N.2    Hawking, D.3
  • 6
    • 21844491552 scopus 로고
    • Estimating qualifications in a self-evaluating group
    • BOMZE, I. AND GUTJAHH, W. 1995. Estimating qualifications in a self-evaluating group. Quality and Quantity 29, 241-250.
    • (1995) Quality and Quantity , vol.29 , pp. 241-250
    • Bomze, I.1    Gutjahh, W.2
  • 11
    • 0026126376 scopus 로고
    • Locating minimal infeasible sets in linear programs
    • CHINNECK, J. V. 1991. Locating minimal infeasible sets in linear programs. ORSA J. Comp. 3, 157-168.
    • (1991) ORSA J. Comp. , vol.3 , pp. 157-168
    • Chinneck, J.V.1
  • 12
    • 0029775543 scopus 로고    scopus 로고
    • Computer codes for analysis of infeasible linear programs
    • CHINNECK, J. V. 1996. Computer codes for analysis of infeasible linear programs. J. Oper. Res. Soc. 47, 61-72.
    • (1996) J. Oper. Res. Soc. , vol.47 , pp. 61-72
    • Chinneck, J.V.1
  • 13
    • 0346452791 scopus 로고    scopus 로고
    • Fast heuristics for the maximum feasible subsystem problem
    • CHINNECK, J. V. 2001. Fast heuristics for the maximum feasible subsystem problem. INFORMS J. Comp. 3, 210-223.
    • (2001) INFORMS J. Comp. , vol.3 , pp. 210-223
    • Chinneck, J.V.1
  • 14
    • 17444392177 scopus 로고    scopus 로고
    • The missing link - A probabilistic model of document content and hypertext connectivity
    • COHN, D. AND HOFMANN, T. 2001. The missing link - a probabilistic model of document content and hypertext connectivity. Neural Inform. Process. Syst. 13.
    • (2001) Neural Inform. Process. Syst. , vol.13
    • Cohn, D.1    Hofmann, T.2
  • 22
    • 4243148480 scopus 로고    scopus 로고
    • Authoritative sources in a hyperlinked environment
    • KLEINBERG, J. 1999. Authoritative sources in a hyperlinked environment. J. ACM 46, 5, 604-632.
    • (1999) J. ACM , vol.46 , Issue.5 , pp. 604-632
    • Kleinberg, J.1
  • 23
    • 0032640910 scopus 로고    scopus 로고
    • Digital libraries and autonomous citation indexing
    • LAWRENCE, S., GILES, C. L., AND BOLLACKER, K. 1999. Digital libraries and autonomous citation indexing. IEEE Comput. 32, 6, 67-71.
    • (1999) IEEE Comput. , vol.32 , Issue.6 , pp. 67-71
    • Lawrence, S.1    Giles, C.L.2    Bollacker, K.3
  • 24
    • 0005320688 scopus 로고    scopus 로고
    • The quest for correct information on the web: Hyper search engines
    • MARCHIORI, M. 1997. The quest for correct information on the Web: Hyper search engines. Comput. Netw. ISDN Syst. 29, 1225-1235.
    • (1997) Comput. Netw. ISDN Syst. , vol.29 , pp. 1225-1235
    • Marchiori, M.1
  • 28
    • 84948481845 scopus 로고
    • An algorithm for suffix stripping
    • PORTER, M. 1980. An algorithm for suffix stripping. Program 14, 3, 130-137.
    • (1980) Program , vol.14 , Issue.3 , pp. 130-137
    • Porter, M.1
  • 30
    • 16244405068 scopus 로고    scopus 로고
    • The intellingent surfer: Probabilistic combination of link and content information in pagerank
    • MIT Press, Cambridge, MA
    • RICHARDSON, M. AND DOMINGOS, P. 2002. The intellingent surfer: probabilistic combination of link and content information in pagerank. in Advances Neural Inform. Process. Syst. 14. MIT Press, Cambridge, MA.
    • (2002) Advances Neural Inform. Process. Syst. , vol.14
    • Richardson, M.1    Domingos, P.2
  • 31
    • 33845412786 scopus 로고    scopus 로고
    • Combining link and content information in web search
    • Springer, New York, NY
    • RICHARDSON, M. AND DOMINGOS, P. 2004. Combining link and content information in web search. Web Dynamics. Springer, New York, NY.
    • (2004) Web Dynamics
    • Richardson, M.1    Domingos, P.2
  • 32
    • 0002442796 scopus 로고    scopus 로고
    • Machine learning in automated text categorization
    • SEBASTIANI, F. 2002. Machine learning in automated text categorization. ACM Comput. Surv. 34, 1, 1-47.
    • (2002) ACM Comput. Surv. , vol.34 , Issue.1 , pp. 1-47
    • Sebastiani, F.1
  • 34
    • 0012709468 scopus 로고    scopus 로고
    • Detecting us in infeasible linear programmes using techniquesfrom goal programming
    • TAMIZ, M., MARDLE, S., AND JONES, D. 1996. Detecting us in infeasible linear programmes using techniquesfrom goal programming. Comp. Oper. Resear. 32, 2, 113-119.
    • (1996) Comp. Oper. Resear. , vol.32 , Issue.2 , pp. 113-119
    • Tamiz, M.1    Mardle, S.2    Jones, D.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.