Sciweavers

57 search results - page 8 / 12
» Anonymizing Weighted Social Network Graphs
Sort
View
SDM
2004
SIAM
229views Data Mining» more  SDM 2004»
13 years 8 months ago
R-MAT: A Recursive Model for Graph Mining
How does a `normal' computer (or social) network look like? How can we spot `abnormal' sub-networks in the Internet, or web graph? The answer to such questions is vital ...
Deepayan Chakrabarti, Yiping Zhan, Christos Falout...
ICLP
2010
Springer
13 years 11 months ago
Using Generalized Annotated Programs to Solve Social Network Optimization Problems
Abstract. Reasoning about social networks (labeled, directed, weighted graphs) is becoming increasingly important and there are now models of how certain phenomena (e.g. adoption o...
Paulo Shakarian, V. S. Subrahmanian, Maria Luisa S...
SOCIALCOM
2010
13 years 5 months ago
A Scalable Framework for Modeling Competitive Diffusion in Social Networks
Multiple phenomena often diffuse through a social network, sometimes in competition with one another. Product adoption and political elections are two examples where network diffus...
Matthias Broecheler, Paulo Shakarian, V. S. Subrah...
GD
2009
Springer
13 years 10 months ago
More Flexible Radial Layout
We describe an algorithm for radial layout of undirected graphs, in which nodes are constrained to concentric circles centered at the origin. Such constraints are typical, e.g., i...
Ulrik Brandes, Christian Pich
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
13 years 5 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu