Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH scholarly article en Vigna, Sebastiano License
when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-10587
URL:

Stanford Matrix Considered Harmful

pdf-format:


Abstract

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


BibTeX - Entry

@InProceedings{vigna:DagSemProc.07071.15,
  author =	{Vigna, Sebastiano},
  title =	{{Stanford Matrix Considered Harmful}},
  booktitle =	{Web Information Retrieval and Linear Algebra Algorithms},
  pages =	{1--3},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7071},
  editor =	{Andreas Frommer and Michael W. Mahoney and Daniel B. Szyld},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2007/1058},
  URN =		{urn:nbn:de:0030-drops-10587},
  doi =		{10.4230/DagSemProc.07071.15},
  annote =	{Keywords: Weg graph, PageRank, HITS}
}

Keywords: Weg graph, PageRank, HITS
Seminar: 07071 - Web Information Retrieval and Linear Algebra Algorithms
Issue date: 2007
Date of publication: 28.06.2007


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI