Sciweavers

JMLR
2012
12 years 1 months ago
Multi-label Subspace Ensemble
A challenging problem of multi-label learning is that both the label space and the model complexity will grow rapidly with the increase in the number of labels, and thus makes the...
Tianyi Zhou, Dacheng Tao
ICCV
2011
IEEE
12 years 11 months ago
Latent Low-Rank Representation for Subspace Segmentation and Feature Extraction
Low-Rank Representation (LRR) [16, 17] is an effective method for exploring the multiple subspace structures of data. Usually, the observed data matrix itself is chosen as the dic...
Guangcan Liu, Shuicheng Yan
SDM
2011
SIAM
198views Data Mining» more  SDM 2011»
13 years 2 months ago
Exemplar-based Robust Coherent Biclustering
The biclustering, co-clustering, or subspace clustering problem involves simultaneously grouping the rows and columns of a data matrix to uncover biclusters or sub-matrices of the...
Kewei Tu, Xixiu Ouyang, Dingyi Han, Vasant Honavar
SDM
2011
SIAM
183views Data Mining» more  SDM 2011»
13 years 2 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...
CORR
2011
Springer
209views Education» more  CORR 2011»
13 years 3 months ago
Analysis and Improvement of Low Rank Representation for Subspace segmentation
We analyze and improve low rank representation (LRR), the state-of-the-art algorithm for subspace segmentation of data. We prove that for the noiseless case, the optimization mode...
Siming Wei, Zhouchen Lin
CVPR
2011
IEEE
13 years 6 months ago
A Closed Form Solution to Robust Subspace Estimation and Clustering
We consider the problem of fitting one or more subspaces to a collection of data points drawn from the subspaces and corrupted by noise/outliers. We pose this problem as a rank m...
Paolo Favaro, René, Vidal, Avinash Ravichandran
CORR
2008
Springer
151views Education» more  CORR 2008»
13 years 11 months ago
Exact Matrix Completion via Convex Optimization
We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at ran...
Emmanuel J. Candès, Benjamin Recht
NIPS
2008
14 years 26 days ago
Regularized Co-Clustering with Dual Supervision
By attempting to simultaneously partition both the rows (examples) and columns (features) of a data matrix, Co-clustering algorithms often demonstrate surprisingly impressive perf...
Vikas Sindhwani, Jianying Hu, Aleksandra Mojsilovi...
ICALP
2007
Springer
14 years 5 months ago
Private Multiparty Sampling and Approximation of Vector Combinations
We consider the problem of private efficient data mining of vertically-partitioned databases. Each of several parties holds a column of a data matrix (a vector) and the parties wan...
Yuval Ishai, Tal Malkin, Martin J. Strauss, Rebecc...
SIGMOD
2008
ACM
157views Database» more  SIGMOD 2008»
14 years 11 months ago
CRD: fast co-clustering on large datasets utilizing sampling-based matrix decomposition
The problem of simultaneously clustering columns and rows (coclustering) arises in important applications, such as text data mining, microarray analysis, and recommendation system...
Feng Pan, Xiang Zhang, Wei Wang 0010