Algorithms and Models for the Web-Graph

6th International Workshop, WAW 2009 Barcelona, Spain, February 12-13, 2009, Proceedings
Buch | Softcover
X, 185 Seiten
2009 | 2009
Springer Berlin (Verlag)
978-3-540-95994-6 (ISBN)

Lese- und Medienproben

Algorithms and Models for the Web-Graph -
53,49 inkl. MwSt
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.

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.

Erscheint lt. Verlag 26.1.2009
Reihe/Serie Lecture Notes in Computer Science
Theoretical Computer Science and General Issues
Zusatzinfo X, 185 p.
Verlagsort Berlin
Sprache englisch
Maße 155 x 235 mm
Gewicht 305 g
Themenwelt Informatik Theorie / Studium Algorithmen
Mathematik / Informatik Mathematik Wahrscheinlichkeit / Kombinatorik
Schlagworte Algorithm analysis and problem complexity • algorithms • Bookmarks • collaborative editing • Computational Graph Theory • connectivity • Distributed Systems • folksonomy • graph-based web search • Hardcover, Softcover / Informatik, EDV/Informatik • Multivariate Extremes • Networking Algorithms • online algorithms • Pagerank • Performance • power law graphs • RAN • random graph • Ranking • regular variation • stochastic equations • web algorithms • Web Data Mining • Web graph • web graph analysis • Web graph modeling • Web Information Retrieval • Wiki • Wikipedia
ISBN-10 3-540-95994-7 / 3540959947
ISBN-13 978-3-540-95994-6 / 9783540959946
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
IT zum Anfassen für alle von 9 bis 99 – vom Navi bis Social Media

von Jens Gallenbacher

Buch | Softcover (2021)
Springer (Verlag)
29,99
Interlingua zur Gewährleistung semantischer Interoperabilität in der …

von Josef Ingenerf; Cora Drenkhahn

Buch | Softcover (2023)
Springer Fachmedien (Verlag)
32,99