This website uses cookies

We use cookies to enhance your experience and support COUNTER Metrics for transparent reporting of readership statistics. Cookie data is not sold to third parties or used for marketing purposes.

Skip to main content
null
Internet Mathematics
  • Menu
  • Articles
    • General
    • Special Issue for WAW'15
    • Special Issue for WAW'16
    • All
  • For Authors
  • Editorial Board
  • About
  • Issues
  • Blog
  • search
  • RSS feed (opens a modal with a link to feed)

RSS Feed

Enter the URL below into your favorite RSS reader.

http://localhost:21113/feed
ISSN 1944-9488
General
Vol. 4, Issue 2, 2007December 31, 2006 EDT

Learning to Rank in Vector Spaces and Social Networks

Soumen Chakrabarti,
math
https://doi.org/10.1080/15427951.2007.10129291

Articles in Vol. 4, Issue 2, 2007

Vol. 4, Issue 2, 2007
  • Expansion and Lack Thereof in Randomly Perturbed Graphs
    Abraham D. Flaxman
  • Learning to Rank in Vector Spaces and Social Networks
    Soumen Chakrabarti
  • Infinite Limits and Adjacency Properties of a Generalized Copying Model
    Jeannette JanssenAnthony Bonato
  • In-Degree and PageRank: Why Do They Follow Similar Power Laws?
    W. R. W. ScheinhardtY. VolkovichN. Litvak
  • On Local Estimations of PageRank: A Mean Field Approach
    Marián BoguñáAlessandro FlamminiFilippo MenczerSanto Fortunato
  • On Locality in a Geometric Random Tree Model
    Ross M. Richardson
  • The Spectral Gap of a Random Subgraph of a Graph
    Fan ChungPaul Horn
Internet Mathematics
Chakrabarti, Soumen. 2007. “Learning to Rank in Vector Spaces and Social Networks.” Internet Mathematics 4 (2). https://doi.org/10.1080/15427951.2007.10129291.
Save article as...▾

View more stats

Powered by Scholastica, the modern academic journal management system