]> BibSonomy publications for /author/Tomkins http://www.bibsonomy.org/burst/author/Tomkins BibSonomy BuRST Feed for /author/Tomkins 2008-07-27T02:44:34+02:00 Propagation of Trust and Distrust http://www.bibsonomy.org/bibtex/22e0f305624c1ec9324f1139a0e067a9f/beate beate 2008-07-21T21:35:02+02:00 distrust propagation social-network trust
Propagation of Trust and Distrust
R. Guha and Ravi Kumar and Prabhakar Raghavan and Andrew Tomkins International World Wide Web Conference (2004)
to distrust propagation social-network trust by beate on 2008-07-21 21:35:02 ]]> International World Wide Web ConferencePropagation of Trust and Distrust2004distrust propagation social-network trust 2008-07-21 21:35:02.0 Statistical properties of community structure in large social and information networks. dblphttp://www.bibsonomy.org/bibtex/201b437bb0bd72b0a99a9d30621b36f54/anaappel anaappel 2008-07-09T20:25:58+02:00 community networks.
Statistical properties of community structure in large social and information networks.
Jure Leskovec and Kevin J. Lang and Anirban Dasgupta and Michael W. Mahoney WWW 695-704 (2008)
to community networks. by anaappel on 2008-07-09 20:25:58 ]]> WWWconf/www/2008695-704Statistical properties of community structure in large social and information networks.2008community networks. 2008-07-09 20:25:58.0 Networked graphs: a declarative mechanism for SPARQL rules, SPARQL views and RDF data integration on the web. dblphttp://www.bibsonomy.org/bibtex/2fa28ba75ad776c3c0d3bdb4d91985c11/casi casi 2008-07-08T17:31:47+02:00 graphs kspace-book-annotation-tools networked querying semantic sparql web
Networked graphs: a declarative mechanism for SPARQL rules, SPARQL views and RDF data integration on the web.
Simon Schenk and Steffen Staab WWW 585-594 (2008)
to graphs kspace-book-annotation-tools networked querying semantic sparql web by casi on 2008-07-08 17:31:47 ]]> WWW585-594Networked graphs: a declarative mechanism for SPARQL rules, SPARQL views and RDF data integration on the web.2008graphs kspace-book-annotation-tools networked querying semantic sparql web 2008-07-08 17:31:47.0 Video suggestion and discovery for youtube: taking random walks through the view graph. dblphttp://www.bibsonomy.org/bibtex/204160df0ba93be5c9ab93f09baae8f96/mkroell mkroell 2008-07-07T22:03:59+02:00 bipartite graph toread video
Video suggestion and discovery for youtube: taking random walks through the view graph.
Shumeet Baluja and Rohan Seth and D. Sivakumar and Yushi Jing and Jay Yagnik and Shankar Kumar and Deepak Ravichandran and Mohamed Aly WWW 895-904 (2008)
to bipartite graph toread video by mkroell on 2008-07-07 22:03:59 ]]> WWWconf/www/2008895-904Video suggestion and discovery for youtube: taking random walks through the view graph.2008bipartite graph toread video 2008-07-07 22:03:59.0 The Web as a Graph: Measurements, Models, and Methods http://www.bibsonomy.org/bibtex/205c84de5132eca5fe9e033439d3cc464/mschuber mschuber 2008-07-07T14:35:18+02:00 analysis directed graph structure web
The Web as a Graph: Measurements, Models, and Methods
Jon Kleinberg and Ravi Kumar and Prabhakar Raghavan and Sridhar Rajagopalan and Andrew Tomkins Computing and Combinatorics 1--17 (1999)
to analysis directed graph structure web by mschuber on 2008-07-07 14:35:18 ]]> Computing and Combinatorics1--17The Web as a Graph: Measurements, Models, and Methods1999analysis directed graph structure web 2008-07-07 14:35:18.0The pages and hyperlinks of the World-Wide Web may be viewed as nodes and edges in a directed graph. This graph is a fascinating object of study: it has several hundred million nodes today, over a billion links, and appears to grow exponentially withtime. There are many reasons — mathematical, sociological, and commercial — for studying the evolution of this graph. In thispaper we begin by describing two algorithms that operate on the Web graph, addressing problems from Web search and automaticcommunity discovery. We then report a number of measurements and properties of this graph that manifested themselves as weran these algorithms on the Web. Finally, we observe that traditional random graph models do not explain these observations,and we propose a new family of random graph models. These models point to a rich new sub-field of the study of random graphs,and raise questions about the analysis of graph algorithms on the Web. Representing a web page as sets of named entities of multiple types: a model and some preliminary applications. dblphttp://www.bibsonomy.org/bibtex/2f1c7b2e4f921b6458dc5a210461ef21a/dblp dblp 2008-07-06T00:00:00+02:00 dblp
Representing a web page as sets of named entities of multiple types: a model and some preliminary applications.
Nan Di and Conglei Yao and Mengcheng Duan and Jonathan J. H. Zhu and Xiaoming Li WWW 1099-1100 (2008)
to dblp by dblp on 2008-07-06 00:00:00 ]]> WWWconf/www/20081099-1100Representing a web page as sets of named entities of multiple types: a model and some preliminary applications.2008dblp 2008-07-06 00:00:00.0 The Web as a Graph: Measurements, Models, and Methods SpringerLink - Book Chapterhttp://www.bibsonomy.org/bibtex/205c84de5132eca5fe9e033439d3cc464/chriskoerner chriskoerner 2008-07-01T16:43:05+02:00 TOREAD graphs measurement web
The Web as a Graph: Measurements, Models, and Methods
Jon Kleinberg and Ravi Kumar and Prabhakar Raghavan and Sridhar Rajagopalan and Andrew Tomkins Computing and Combinatorics 1--17 (1999)
to TOREAD graphs measurement web by chriskoerner on 2008-07-01 16:43:05 ]]> Computing and Combinatorics1--17The Web as a Graph: Measurements, Models, and Methods1999TOREAD graphs measurement web 2008-07-01 16:43:05.0The pages and hyperlinks of the World-Wide Web may be viewed as nodes and edges in a directed graph. This graph is a fascinating object of study: it has several hundred million nodes today, over a billion links, and appears to grow exponentially withtime. There are many reasons — mathematical, sociological, and commercial — for studying the evolution of this graph. In thispaper we begin by describing two algorithms that operate on the Web graph, addressing problems from Web search and automaticcommunity discovery. We then report a number of measurements and properties of this graph that manifested themselves as weran these algorithms on the Web. Finally, we observe that traditional random graph models do not explain these observations,and we propose a new family of random graph models. These models point to a rich new sub-field of the study of random graphs,and raise questions about the analysis of graph algorithms on the Web. Propagation of Trust and Distrust http://www.bibsonomy.org/bibtex/24363af19dba4b9c59aef14322af54940/gwpl gwpl 2008-06-23T15:59:52+02:00 algorithm distrust graph trust trust_propagation
Propagation of Trust and Distrust
R. Guha and Ravi Kumar and Prabhakar Raghavan and Andrew Tomkins (2004)
to algorithm distrust graph trust trust_propagation by gwpl on 2008-06-23 15:59:52 ]]> Propagation of Trust and Distrust2004algorithm distrust graph trust trust_propagation 2008-06-23 15:59:52.0 An efficient two-phase service discovery mechanism. dblphttp://www.bibsonomy.org/bibtex/213fbd683258b420de6899a0da8a9da81/dblp dblp 2008-06-20T00:00:00+02:00 dblp
An efficient two-phase service discovery mechanism.
Shuiguang Deng and Zhaohui Wu and Jian Wu and Ying Li WWW 1189-1190 (2008)
to dblp by dblp on 2008-06-20 00:00:00 ]]> WWWconf/www/20081189-1190An efficient two-phase service discovery mechanism.2008dblp 2008-06-20 00:00:00.0 Graph structure in the Web http://www.bibsonomy.org/bibtex/27312eb242429752cfd3df1517d9f9e86/pprett pprett 2008-06-17T16:01:02+02:00 bowtie, graph, power-law, web
Graph structure in the Web
A. Broder and R. Kumar and F. Maghoul and P. Raghavan and S. Rajagopalan and R. Stata and A. Tomkins and J. Wiener Computer Networks 33 309--320 (2000)
to bowtie, graph, power-law, web by pprett on 2008-06-17 16:01:02 ]]> Computer NetworksJune1309--320Graph structure in the Web332000bowtie, graph, power-law, web 2008-06-17 16:01:02.0The study of the Web as a graph is not only fascinating in its own right, but also yields valuable insight into Web algorithms for crawling, searching and community discovery, and the sociological phenomena which characterize its evolution. We report on experiments on local and global properties of the Web graph using two AltaVista crawls each with over 200 million pages and 1.5 billion links. Our study indicates that the macroscopic structure of the Web is considerably more intricate than suggested by earlier experiments on a smaller scale.