78 search results - page 5 / 16 » Subquadratic Approximation Algorithms for Clustering Problem... |
ICDE
2008
IEEE
14 years 8 months ago
2008
IEEE
Finding latent patterns in high dimensional data is an important research problem with numerous applications. Existing approaches can be summarized into 3 categories: feature selec...
EDBT
2006
ACM
14 years 7 months ago
2006
ACM
In many decision-making applications, the skyline query is frequently used to find a set of dominating data points (called skyline points) in a multidimensional dataset. In a high-...
NIPS
2007
13 years 8 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
SOCO
2008
Springer
13 years 7 months ago
2008
Springer
We introduce a new method for data clustering based on a particular Gaussian mixture model (GMM). Each cluster of data, modeled as a GMM into an input space, is interpreted as a hy...
NIPS
2001
13 years 8 months ago
2001
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...