Sciweavers

267 search results - page 49 / 54
» On the approximability of influence in social networks
Sort
View
KDD
2002
ACM
182views Data Mining» more  KDD 2002»
14 years 9 months ago
ANF: a fast and scalable tool for data mining in massive graphs
Graphs are an increasingly important data source, with such important graphs as the Internet and the Web. Other familiar graphs include CAD circuits, phone records, gene sequences...
Christopher R. Palmer, Phillip B. Gibbons, Christo...
IJAR
2008
118views more  IJAR 2008»
13 years 8 months ago
Dynamic multiagent probabilistic inference
Cooperative multiagent probabilistic inference can be applied in areas such as building surveillance and complex system diagnosis to reason about the states of the distributed unc...
Xiangdong An, Yang Xiang, Nick Cercone
KDD
2012
ACM
196views Data Mining» more  KDD 2012»
11 years 11 months ago
Chromatic correlation clustering
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
Francesco Bonchi, Aristides Gionis, Francesco Gull...
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
13 years 10 months ago
Less is More: Compact Matrix Decomposition for Large Sparse Graphs
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
Jimeng Sun, Yinglian Xie, Hui Zhang, Christos Falo...
SIGMETRICS
2008
ACM
115views Hardware» more  SIGMETRICS 2008»
13 years 8 months ago
Densification arising from sampling fixed graphs
During the past decade, a number of different studies have identified several peculiar properties of networks that arise from a diverse universe, ranging from social to computer n...
Pedram Pedarsani, Daniel R. Figueiredo, Matthias G...