110 search results - page 4 / 22 » Finding Generalized Projected Clusters In High Dimensional S... |
CIKM
2008
Springer
14 years 12 days ago
2008
Springer
Finding latent patterns in high dimensional data is an important research problem with numerous applications. The most well known approaches for high dimensional data analysis are...
ECCV
2006
Springer
15 years 9 days ago
2006
Springer
Abstract. We cast the problem of motion segmentation of feature trajectories as linear manifold finding problems and propose a general framework for motion segmentation under affin...
AAAI
2006
13 years 11 months ago
2006
Among various feature extraction algorithms, those based on genetic algorithms are promising owing to their potential parallelizability and possible applications in large scale an...
IV
2007
IEEE
14 years 4 months ago
2007
IEEE
High-dimensional data is, by its nature, difficult to visualise. Many current techniques involve reducing the dimensionality of the data, which results in a loss of information. ...
IPPS
1998
IEEE
14 years 2 months ago
1998
IEEE
Abstract. Finding paths in high-dimensional gemetric spaces is a provably hard problem. Recently, a general randomized planning scheme has emerged as an e ective approach to solve ...