메뉴 건너뛰기




Volumn , Issue , 2011, Pages 96-104

Semi-supervised ranking on very large graphs with rich metadata

Author keywords

Mapreduce; Page importance; Pagerank

Indexed keywords

DATA MINING; GRAPH THEORY; GRAPHIC METHODS; LEARNING ALGORITHMS; MARKOV PROCESSES; SEARCH ENGINES; SUPERVISED LEARNING;

EID: 80052688388     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2020408.2020430     Document Type: Conference Paper
Times cited : (53)

References (25)
  • 7
    • 0038589165 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 Computer Networks and ISDN Systems, volume 30, issue 1-7, pages 107-117, 1998.
    • (1998) Computer Networks and ISDN Systems , vol.30 , Issue.1-7 , pp. 107-117
    • Brin, S.1    Page, L.2
  • 20
    • 0031538203 scopus 로고    scopus 로고
    • Overview of okapi projects
    • S. E. Robertson. Overview of okapi projects. Journal of Documentatioin, volumn 53, issue 1, pages 3-7, 1997.
    • (1997) Journal of Documentatioin , vol.53 , Issue.1 , pp. 3-7
    • Robertson, S.E.1
  • 21
    • 34250637587 scopus 로고    scopus 로고
    • To randomize or not to randomize: Space optimal summaries for hyperlink analysis
    • DOI 10.1145/1135777.1135823, Proceedings of the 15th International Conference on World Wide Web
    • T. Sarlos, A. A. Benczur, K. Csalogany, D. Fogaras, and B. Racz. To randomize or not to randomize: space optimal summaries for hyperlink analysis. In the proceedings of the 15th International World Wide Web Conference (WWW), pages 297-306, 2006. (Pubitemid 46946622)
    • (2006) Proceedings of the 15th International Conference on World Wide Web , pp. 297-306
    • Sarlos, T.1    Benczr, A.A.2    Csalogany, K.3    Fogaras, D.4    Racz, B.5
  • 25
    • 80052662270 scopus 로고    scopus 로고
    • http://www.yr-bcn.es/webspam/datasets/uk2007/.


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