Sciweavers

2773 search results - page 524 / 555
» Decomposing Social Networks
Sort
View
EDBT
2012
ACM
228views Database» more  EDBT 2012»
13 years 8 months ago
Finding maximal k-edge-connected subgraphs from a large graph
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang...
KDD
2009
ACM
167views Data Mining» more  KDD 2009»
16 years 6 months ago
SNARE: a link analytic system for graph labeling and risk detection
Classifying nodes in networks is a task with a wide range of applications. It can be particularly useful in anomaly and fraud detection. Many resources are invested in the task of...
Mary McGlohon, Stephen Bay, Markus G. Anderle, Dav...
MOBISYS
2009
ACM
16 years 6 months ago
A framework of energy efficient mobile sensing for automatic user state recognition
Urban sensing, participatory sensing, and user activity recognition can provide rich contextual information for mobile applications such as social networking and location-based se...
Yi Wang, Jialiu Lin, Murali Annavaram, Quinn Jacob...
KDD
2005
ACM
140views Data Mining» more  KDD 2005»
16 years 6 months ago
Graphs over time: densification laws, shrinking diameters and possible explanations
How do real graphs evolve over time? What are "normal" growth patterns in social, technological, and information networks? Many studies have discovered patterns in stati...
Jure Leskovec, Jon M. Kleinberg, Christos Faloutso...
SDM
2009
SIAM
138views Data Mining» more  SDM 2009»
16 years 3 months ago
ShatterPlots: Fast Tools for Mining Large Graphs.
Graphs appear in several settings, like social networks, recommendation systems, computer communication networks, gene/protein biological networks, among others. A deep, recurring...
Ana Paula Appel, Andrew Tomkins, Christos Faloutso...