Cantitate/Preț
Produs
Total produse
Vezi coșul
Algorithms and Models for the Web-Graph: 6th International Workshop, WAW 2009 Barcelona, Spain, February 12-13, 2009, Proceedings de Konstantin Avratchenkov

Algorithms and Models for the Web-Graph: 6th International Workshop, WAW 2009 Barcelona, Spain, February 12-13, 2009, Proceedings: Lecture Notes in Computer Science, cartea 5427

Editat de Konstantin Avratchenkov, Debora Donato, Nelly Litvak
en Limba Engleză Paperback – 26 ian 2009
This book constitutes the refereed proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph, WAW 2009, held in Barcelona, Spain, in February 2009 - co-located with WSDM 2009, the Second ACM International Conference on Web Search and Data Mining. The 14 revised full papers presented were carefully reviewed and selected from numerous submissions for inclusion in the book. The papers address a wide variety of topics related to the study of the Web-graph such as theoretical and empirical analysis of the Web graph and Web 2.0 graphs, random walks on the Web and Web 2.0 graphs and their applications, and design and performance evaluation of the algorithms for social networks. The workshop papers have been naturally clustered in three topical sections on graph models for complex networks, pagerank and Web graph, and social networks and search.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 31861 lei

Preț vechi: 39827 lei
-20% Nou

Puncte Express: 478
Preț estimativ în valută:
6097€ • 6413$ • 5094£

Carte tipărită la comandă

Livrare economică 09-23 ianuarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540959946
ISBN-10: 3540959947
Pagini: 196
Ilustrații: X, 185 p.
Dimensiuni: 155 x 235 x 10 mm
Greutate: 0.3 kg
Ediția:2009
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Graph Models for Complex Networks.- Information Theoretic Comparison of Stochastic Graph Models: Some Experiments.- Approximating the Number of Network Motifs.- Finding Dense Subgraphs with Size Bounds.- The Giant Component in a Random Subgraph of a Given Graph.- Quantifying the Impact of Information Aggregation on Complex Networks: A Temporal Perspective.- PageRank and Web Graph.- A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank.- Choose the Damping, Choose the Ranking?.- Characterization of Tail Dependence for In-Degree and PageRank.- Web Page Rank Prediction with PCA and EM Clustering.- Permuting Web Graphs.- Social Networks and Search.- A Dynamic Model for On-Line Social Networks.- TC-SocialRank: Ranking the Social Web.- Exploiting Positive and Negative Graded Relevance Assessments for Content Recommendation.- Cluster Based Personalized Search.

Textul de pe ultima copertă

This book constitutes the refereed proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph, WAW 2009, held in Barcelona, Spain, in February 2009 - co-located with WSDM 2009, the Second ACM International Conference on Web Search and Data Mining.
The 14 revised full papers presented were carefully reviewed and selected from numerous submissions for inclusion in the book. The papers address a wide variety of topics related to the study of the Web-graph such as theoretical and empirical analysis of the Web graph and Web 2.0 graphs, random walks on the Web and Web 2.0 graphs and their applications, and design and performance evaluation of the algorithms for social networks. The workshop papers have been naturally clustered in three topical sections on graph models for complex networks, pagerank and Web graph, and social networks and search.