Sciweavers

KDD
2012
ACM
205views Data Mining» more  KDD 2012»
11 years 7 months ago
From user comments to on-line conversations
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...
Chunyan Wang, Mao Ye, Bernardo A. Huberman
KDD
2012
ACM
187views Data Mining» more  KDD 2012»
11 years 7 months ago
Unsupervised feature selection for linked social media data
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...
Jiliang Tang, Huan Liu
KDD
2012
ACM
197views Data Mining» more  KDD 2012»
11 years 7 months ago
On the separability of structural classes of communities
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,...
Bruno D. Abrahao, Sucheta Soundarajan, John E. Hop...
KDD
2012
ACM
190views Data Mining» more  KDD 2012»
11 years 7 months ago
Multi-label hypothesis reuse
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...
Sheng-Jun Huang, Yang Yu, Zhi-Hua Zhou
KDD
2012
ACM
177views Data Mining» more  KDD 2012»
11 years 7 months ago
Random forests for metric learning with implicit pairwise position dependence
Caiming Xiong, David Johnson, Ran Xu, Jason J. Cor...
KDD
2012
ACM
281views Data Mining» more  KDD 2012»
11 years 7 months ago
Active spectral clustering via iterative uncertainty reduction
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...
Fabian L. Wauthier, Nebojsa Jojic, Michael I. Jord...
KDD
2012
ACM
187views Data Mining» more  KDD 2012»
11 years 7 months ago
Sampling minimal frequent boolean (DNF) patterns
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 ...
Geng Li, Mohammed J. Zaki
KDD
2012
ACM
242views Data Mining» more  KDD 2012»
11 years 7 months ago
Query-driven discovery of semantically similar substructures in heterogeneous networks
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 ...
Xiao Yu, Yizhou Sun, Peixiang Zhao, Jiawei Han
KDD
2012
ACM
196views Data Mining» more  KDD 2012»
11 years 7 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...
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
11 years 7 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray