Stanford Matrix Considered Harmful

I discuss the implications of using small data sets for experiments related to the web graph.

• Publication year

  2007

• Venue

  Web Information Retrieval and Linear Algebra Algorithms

• Publication date

  2007-10-10

• Fields of study

  Mathematics, Computer Science

• Identifiers
  arXiv 0710.1962
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• No references are available for this paper.

• SoK: The Faults in our Graph Benchmarks

  2024cites this paper
• Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks

  2010cites this paper
• HyperANF: approximating the neighbourhood function of very large graphs on a budget

  2010cites this paper
• PageRank: Functional dependencies

  2009cites this paper
• Frank van Rest A mathematical approach to scalable personalized PageRank

  2009cites this paper
• The Sinkhorn-Knopp Algorithm: Convergence and Applications

  2008cites this paper
• When rank trumps precision: using the power method to compute google's pagerank

  2007cites this paper