Sciweavers

151 search results - page 19 / 31
» Edge Anonymity in Social Network Graphs
Sort
View
KDD
2009
ACM
150views Data Mining» more  KDD 2009»
14 years 9 months ago
Large human communication networks: patterns and a utility-driven generator
Given a real, and weighted person-to-person network which changes over time, what can we say about the cliques that it contains? Do the incidents of communication, or weights on t...
Nan Du, Christos Faloutsos, Bai Wang, Leman Akoglu
CSCW
2006
ACM
14 years 2 months ago
Draw-together: graphical editor for collaborative drawing
Collaborative object-based graphical editors offer good support for design teams to work concurrently on their design. However, not much research has been done on maintaining cons...
Claudia-Lavinia Ignat, Moira C. Norrie
STOC
2007
ACM
140views Algorithms» more  STOC 2007»
14 years 9 months ago
On the submodularity of influence in social networks
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...
Elchanan Mossel, Sébastien Roch
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
13 years 6 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
SDM
2009
SIAM
138views Data Mining» more  SDM 2009»
14 years 6 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...