240
click to vote
KDD
2012
ACM
13 years 9 months ago
2012
ACM
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
212
click to vote
KDD
2012
ACM
13 years 9 months ago
2012
ACM
We present an analysis of user conversations in on-line social media and their evolution over time. We propose a dynamic model that predicts the growth dynamics and structural pro...
200
click to vote
KDD
2012
ACM
13 years 9 months ago
2012
ACM
The prevalent use of social media produces mountains of unlabeled, high-dimensional data. Feature selection has been shown effective in dealing with high-dimensional data for eï¬...
202
click to vote
KDD
2012
ACM
13 years 9 months ago
2012
ACM
Three major factors govern the intricacies of community extraction in networks: (1) the application domain includes a wide variety of networks of fundamentally different natures,...
249
click to vote
KDD
2012
ACM
13 years 9 months ago
2012
ACM
Multi-label learning arises in many real-world tasks where an object is naturally associated with multiple concepts. It is well-accepted that, in order to achieve a good performan...
249
click to vote
KDD
2012
ACM
13 years 9 months ago
2012
ACM
Spectral clustering is a widely used method for organizing data that only relies on pairwise similarity measurements. This makes its application to non-vectorial data straightforw...
231
Voted
KDD
2012
ACM
13 years 9 months ago
2012
ACM
We tackle the challenging problem of mining the simplest Boolean patterns from categorical datasets. Instead of complete enumeration, which is typically infeasible for this class ...
246
click to vote
KDD
2012
ACM
13 years 9 months ago
2012
ACM
Heterogeneous information networks that contain multiple types of objects and links are ubiquitous in the real world, such as bibliographic networks, cyber-physical networks, and ...
225
click to vote
KDD
2012
ACM
13 years 9 months ago
2012
ACM
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...