Sciweavers

23 search results - page 2 / 5
» sdm 2011
Sort
View
SDM
2011
SIAM
183views Data Mining» more  SDM 2011»
12 years 7 months ago
Nonparametric Bayesian Co-clustering Ensembles
A nonparametric Bayesian approach to co-clustering ensembles is presented. Similar to clustering ensembles, coclustering ensembles combine various base co-clustering results to ob...
Pu Wang, Kathryn B. Laskey, Carlotta Domeniconi, M...
SDM
2011
SIAM
232views Data Mining» more  SDM 2011»
12 years 7 months ago
A Sequential Dual Method for Structural SVMs
In many real world prediction problems the output is a structured object like a sequence or a tree or a graph. Such problems range from natural language processing to computationa...
Shirish Krishnaj Shevade, Balamurugan P., S. Sunda...
SDM
2011
SIAM
233views Data Mining» more  SDM 2011»
12 years 7 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
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
12 years 7 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
SDM
2011
SIAM
241views Data Mining» more  SDM 2011»
12 years 7 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