Sciweavers

190 search results - page 22 / 38
» Constraint-Based Subspace Clustering.
Sort
View
MM
2006
ACM
203views Multimedia» more  MM 2006»
14 years 2 months ago
Learning image manifolds by semantic subspace projection
In many image retrieval applications, the mapping between highlevel semantic concept and low-level features is obtained through a learning process. Traditional approaches often as...
Jie Yu, Qi Tian
BIBE
2004
IEEE
120views Bioinformatics» more  BIBE 2004»
14 years 22 days ago
Identifying Projected Clusters from Gene Expression Profiles
In microarray gene expression data, clusters may hide in subspaces. Traditional clustering algorithms that make use of similarity measurements in the full input space may fail to ...
Kevin Y. Yip, David W. Cheung, Michael K. Ng, Kei-...
IPSN
2007
Springer
14 years 3 months ago
Robust system multiangulation using subspace methods
Sensor location information is a prerequisite to the utility of most sensor networks. In this paper we present a robust and low-complexity algorithm to self-localize and orient se...
Joshua N. Ash, Lee C. Potter
ICCS
2007
Springer
14 years 3 months ago
Dynamic Tracking of Facial Expressions Using Adaptive, Overlapping Subspaces
We present a Dynamic Data Driven Application System (DDDAS) to track 2D shapes across large pose variations by learning non-linear shape manifold as overlapping, piecewise linear s...
Dimitris N. Metaxas, Atul Kanaujia, Zhiguo Li
BMCBI
2008
121views more  BMCBI 2008»
13 years 9 months ago
Microarray data mining using landmark gene-guided clustering
Background: Clustering is a popular data exploration technique widely used in microarray data analysis. Most conventional clustering algorithms, however, generate only one set of ...
Pankaj Chopra, Jaewoo Kang, Jiong Yang, HyungJun C...