Sciweavers

1897 search results - page 276 / 380
» Mining Chains of Relations
Sort
View
SDM
2011
SIAM
241views Data Mining» more  SDM 2011»
14 years 9 months ago
A Fast Algorithm for Sparse PCA and a New Sparsity Control Criteria
Sparse principal component analysis (PCA) imposes extra constraints or penalty terms to the standard PCA to achieve sparsity. In this paper, we first introduce an efficient algor...
Yunlong He, Renato Monteiro, Haesun Park
200
Voted
SDM
2011
SIAM
233views Data Mining» more  SDM 2011»
14 years 9 months ago
Multi-Instance Mixture Models
Multi-instance (MI) learning is a variant of supervised learning where labeled examples consist of bags (i.e. multi-sets) of feature vectors instead of just a single feature vecto...
James R. Foulds, Padhraic Smyth
SISAP
2011
IEEE
437views Data Mining» more  SISAP 2011»
14 years 9 months ago
Succinct nearest neighbor search
In this paper we present a novel technique for nearest neighbor searching dubbed neighborhood approximation. The central idea is to divide the database into compact regions repres...
Eric Sadit Tellez, Edgar Chávez, Gonzalo Na...
KDD
2012
ACM
281views Data Mining» more  KDD 2012»
13 years 8 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
212views Data Mining» more  KDD 2012»
13 years 8 months ago
eTrust: understanding trust evolution in an online world
Most existing research about online trust assumes static trust relations between users. As we are informed by social sciences, trust evolves as humans interact. Little work exists...
Jiliang Tang, Huan Liu, Huiji Gao, Atish Das Sarma...