Sciweavers

884 search results - page 157 / 177
» Linear-Input Subset Analysis
Sort
View
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
16 years 3 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf
124
Voted
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
16 years 3 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
16 years 2 months ago
A visual-analytic toolkit for dynamic interaction graphs
In this article we describe a visual-analytic tool for the interrogation of evolving interaction network data such as those found in social, bibliometric, WWW and biological appli...
Xintian Yang, Sitaram Asur, Srinivasan Parthasarat...
KDD
2008
ACM
150views Data Mining» more  KDD 2008»
16 years 2 months ago
Hypergraph spectral learning for multi-label classification
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
Liang Sun, Shuiwang Ji, Jieping Ye
141
Voted
KDD
2007
ACM
152views Data Mining» more  KDD 2007»
16 years 2 months ago
Relational data pre-processing techniques for improved securities fraud detection
Commercial datasets are often large, relational, and dynamic. They contain many records of people, places, things, events and their interactions over time. Such datasets are rarel...
Andrew Fast, Lisa Friedland, Marc Maier, Brian Tay...