Sciweavers

199 search results - page 10 / 40
» A large time-aware web graph
Sort
View
WWW
2010
ACM
14 years 2 months ago
Measurement-calibrated graph models for social network experiments
Access to realistic, complex graph datasets is critical to research on social networking systems and applications. Simulations on graph data provide critical evaluation of new sys...
Alessandra Sala, Lili Cao, Christo Wilson, Robert ...
WAW
2009
Springer
136views Algorithms» more  WAW 2009»
14 years 2 months ago
Permuting Web Graphs
Since the first investigations on web graph compression, it has been clear that the ordering of the nodes of the graph has a fundamental influence on the compression rate (usuall...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
NAACL
2010
13 years 5 months ago
The viability of web-derived polarity lexicons
We examine the viability of building large polarity lexicons semi-automatically from the web. We begin by describing a graph propagation framework inspired by previous work on con...
Leonid Velikovich, Sasha Blair-Goldensohn, Kerry H...
WEBI
2010
Springer
13 years 5 months ago
Hierarchical Cost-Sensitive Web Resource Acquisition for Record Matching
Web information is increasingly used as evidence in solving various problems, including record matching. However, acquiring web-based resources is slow and can incur other access c...
Yee Fan Tan, Min-Yen Kan
PAKDD
2011
ACM
209views Data Mining» more  PAKDD 2011»
12 years 10 months ago
Spectral Analysis for Billion-Scale Graphs: Discoveries and Implementation
Abstract. Given a graph with billions of nodes and edges, how can we find patterns and anomalies? Are there nodes that participate in too many or too few triangles? Are there clos...
U. Kang, Brendan Meeder, Christos Faloutsos