메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages 14-23

Learning to rank networked entities

Author keywords

Conductance; Maximum entropy; Network flow; Pagerank

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FEEDBACK; MARKOV PROCESSES; MATHEMATICAL MODELS; OPTIMIZATION; PARAMETER ESTIMATION;

EID: 33749562561     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1150402.1150409     Document Type: Conference Paper
Times cited : (70)

References (24)
  • 1
    • 33749579421 scopus 로고    scopus 로고
    • S. Agarwal, C. Cortes, and R. Herbrich, editors, NIPS Workshop
    • S. Agarwal, C. Cortes, and R. Herbrich, editors. Learning to Rank, NIPS Workshop, 2005.
    • (2005) Learning to Rank
  • 2
    • 33745889112 scopus 로고    scopus 로고
    • SemRank: Ranking complex semantic relationship search results on the semantic Web
    • Chiba, Japan
    • K. Anywanwu, A. Maduko, and A. Sheth, SemRank: Ranking complex semantic relationship search results on the semantic Web. In WWW Conference, pages 117-127, Chiba, Japan, 2005.
    • (2005) WWW Conference , pp. 117-127
    • Anywanwu, K.1    Maduko, A.2    Sheth, A.3
  • 3
    • 22944468123 scopus 로고    scopus 로고
    • Authority-based keyword queries in databases using ObjectRank
    • Toronto
    • A. Balmin, V. Hristidis, and Y. Papakonstantinou. Authority-based keyword queries in databases using ObjectRank. In VLDB, Toronto, 2004.
    • (2004) VLDB
    • Balmin, A.1    Hristidis, V.2    Papakonstantinou, Y.3
  • 4
    • 0141982347 scopus 로고    scopus 로고
    • A limited memory variable metric method for bound constraint minimization
    • Argonne National Laboratory
    • S. J. Benson and J. J. Moré. A limited memory variable metric method for bound constraint minimization. Technical Report ANL/MCS-P909-0901, Argonne National Laboratory, 2001.
    • (2001) Technical Report , vol.ANL-MCS-P909-0901
    • Benson, S.J.1    Moré, J.J.2
  • 6
    • 0002505172 scopus 로고    scopus 로고
    • The anatomy of a large-scale hypertextual web search engine
    • S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. In WWW Conference, 1998.
    • (1998) WWW Conference
    • Brin, S.1    Page, L.2
  • 7
    • 32344433867 scopus 로고    scopus 로고
    • R-MAT: A recursive model for graph mining
    • SIAM
    • D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-MAT: A recursive model for graph mining. In ICDM. SIAM, 2004.
    • (2004) ICDM
    • Chakrabarti, D.1    Zhan, Y.2    Faloutsos, C.3
  • 8
    • 33749382487 scopus 로고    scopus 로고
    • Creating customized authority lists
    • H. Chang, D. Cohn, and A. McCallum. Creating customized authority lists. In ICML, 2000.
    • (2000) ICML
    • Chang, H.1    Cohn, D.2    McCallum, A.3
  • 9
    • 0033314011 scopus 로고    scopus 로고
    • Learning to order things
    • W. W. Cohen, R. E. Shapire, and Y. Singer. Learning to order things;. JAIR, 10:243-270, 1999.
    • (1999) JAIR , vol.10 , pp. 243-270
    • Cohen, W.W.1    Shapire, R.E.2    Singer, Y.3
  • 10
    • 84880707332 scopus 로고    scopus 로고
    • Learning Web page scores by error back-propagation
    • M. Diligenti, M. Gori, and M. Maggini. Learning Web page scores by error back-propagation. In IJCAI, 2005.
    • (2005) IJCAI
    • Diligenti, M.1    Gori, M.2    Maggini, M.3
  • 11
    • 0033204106 scopus 로고    scopus 로고
    • On power-law relationships of the internet topology
    • M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the internet topology. In SIGCOMM, pages 251-262, 1999.
    • (1999) SIGCOMM , pp. 251-262
    • Faloutsos, M.1    Faloutsos, P.2    Faloutsos, C.3
  • 13
    • 77953061730 scopus 로고    scopus 로고
    • Topic-sensitive PageRank
    • T. H. Haveliwala. Topic-sensitive PageRank. In WWW, pages 517-526, 2002.
    • (2002) WWW , pp. 517-526
    • Haveliwala, T.H.1
  • 15
    • 80053438862 scopus 로고    scopus 로고
    • Scaling personalized web search
    • G. Jeh and J. Widom. Scaling personalized web search. In WWW Conference, pages 271-279, 2003.
    • (2003) WWW Conference , pp. 271-279
    • Jeh, G.1    Widom, J.2
  • 16
    • 0242456822 scopus 로고    scopus 로고
    • Optimizing search engines using clickthrough data
    • ACM
    • T. Joachims. Optimizing search engines using clickthrough data. In SIGKDD Conference. ACM, 2002.
    • (2002) SIGKDD Conference
    • Joachims, T.1
  • 17
    • 4243148480 scopus 로고    scopus 로고
    • Authoritative sources in a hyperlinked environment
    • J. M. Kleinberg. Authoritative sources in a hyperlinked environment. JACM, 46(5):604-632, 1999.
    • (1999) JACM , vol.46 , Issue.5 , pp. 604-632
    • Kleinberg, J.M.1
  • 19
    • 33749546453 scopus 로고    scopus 로고
    • Object-level ranking: Bringing order to Web objects
    • Z. Nie, Y. Zhang, J.-R. Wen, and W.-Y. Ma. Object-level ranking: Bringing order to Web objects. In WWW Conference, pages 567-574, 2005.
    • (2005) WWW Conference , pp. 567-574
    • Nie, Z.1    Zhang, Y.2    Wen, J.-R.3    Ma, W.-Y.4
  • 20
    • 16244405068 scopus 로고    scopus 로고
    • The intelligent surfer: Probabilistic combination of link and content information in pagerank
    • M. Richardson and P. Domingos. The intelligent surfer: Probabilistic combination of link and content information in pagerank. In NIPS 14, pages 1441-1448, 2002.
    • (2002) NIPS , vol.14 , pp. 1441-1448
    • Richardson, M.1    Domingos, P.2
  • 22
    • 84880475269 scopus 로고    scopus 로고
    • A new paradigm for ranking pages on the world wide Web
    • J. A. Tomlin. A new paradigm for ranking pages on the world wide Web. In WWW Conference, pages 350-355, 2003.
    • (2003) WWW Conference , pp. 350-355
    • Tomlin, J.A.1
  • 23
    • 24944537843 scopus 로고    scopus 로고
    • Large margin methods for structured and interdependent output variables
    • I. Tsochantaridis, T. Joachims, T. Hofmann, and Y. Altun. Large margin methods for structured and interdependent output variables. JMLR, 6(Sep):1453-1484, 2005.
    • (2005) JMLR , vol.6 , Issue.SEP , pp. 1453-1484
    • Tsochantaridis, I.1    Joachims, T.2    Hofmann, T.3    Altun, Y.4


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