Sciweavers

14 search results - page 2 / 3
» Unsupervised discovery of co-occurrence in sparse high dimen...
Sort
View
ICCV
2011
IEEE
12 years 7 months ago
A Linear Subspace Learning Approach via Sparse Coding
Linear subspace learning (LSL) is a popular approach to image recognition and it aims to reveal the essential features of high dimensional data, e.g., facial images, in a lower di...
Lei Zhang, Pengfei Zhu, Qinghu Hu, David Zhang
ICIP
2010
IEEE
13 years 5 months ago
Metaface learning for sparse representation based face recognition
Face recognition (FR) is an active yet challenging topic in computer vision applications. As a powerful tool to represent high dimensional data, recently sparse representation bas...
Meng Yang, Lei Zhang, Jian Yang, David Zhang
SADM
2010
173views more  SADM 2010»
13 years 2 months ago
Data reduction in classification: A simulated annealing based projection method
This paper is concerned with classifying high dimensional data into one of two categories. In various settings, such as when dealing with fMRI and microarray data, the number of v...
Tian Siva Tian, Rand R. Wilcox, Gareth M. James
ICPP
2000
IEEE
13 years 11 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
BMCBI
2007
158views more  BMCBI 2007»
13 years 7 months ago
Penalized likelihood for sparse contingency tables with an application to full-length cDNA libraries
Background: The joint analysis of several categorical variables is a common task in many areas of biology, and is becoming central to systems biology investigations whose goal is ...
Corinne Dahinden, Giovanni Parmigiani, Mark C. Eme...