110 search results - page 14 / 22 » Finding Generalized Projected Clusters In High Dimensional S... |
DAGM
2010
Springer
13 years 11 months ago
2010
Springer
Density modeling is notoriously difficult for high dimensional data. One approach to the problem is to search for a lower dimensional manifold which captures the main characteristi...
BMCBI
2005
13 years 10 months ago
2005
Background: The most common method of identifying groups of functionally related genes in microarray data is to apply a clustering algorithm. However, it is impossible to determin...
SIGIR
2003
ACM
14 years 3 months ago
2003
ACM
Most existing clustering algorithms cluster highly related data objects such as Web pages and Web users separately. The interrelation among different types of data objects is eith...
CVPR
2007
IEEE
15 years 11 days ago
2007
IEEE
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
CIKM
2010
Springer
13 years 9 months ago
2010
Springer
This paper presents a novel approach for the visualization and clustering of crowd video contents by using multilinear principal component analysis (MPCA). In contrast to feature-...