Sciweavers

2512 search results - page 63 / 503
» Learning from Highly Structured Data by Decomposition
Sort
View
ICDT
2001
ACM
116views Database» more  ICDT 2001»
15 years 2 months ago
On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces
Abstract. Nearest-neighbor queries in high-dimensional space are of high importance in various applications, especially in content-based indexing of multimedia data. For an optimiz...
Stefan Berchtold, Christian Böhm, Daniel A. K...
SDM
2004
SIAM
123views Data Mining» more  SDM 2004»
14 years 11 months ago
Nonlinear Manifold Learning for Data Stream
There has been a renewed interest in understanding the structure of high dimensional data set based on manifold learning. Examples include ISOMAP [25], LLE [20] and Laplacian Eige...
Martin H. C. Law, Nan Zhang 0002, Anil K. Jain
PAMI
2006
127views more  PAMI 2006»
14 years 9 months ago
Incremental Nonlinear Dimensionality Reduction by Manifold Learning
Understanding the structure of multidimensional patterns, especially in unsupervised case, is of fundamental importance in data mining, pattern recognition and machine learning. Se...
Martin H. C. Law, Anil K. Jain
UAI
1998
14 years 11 months ago
The Bayesian Structural EM Algorithm
In recent years there has been a flurry of works on learning Bayesian networks from data. One of the hard problems in this area is how to effectively learn the structure of a beli...
Nir Friedman
TVCG
2011
152views more  TVCG 2011»
14 years 4 months ago
Automated Analytical Methods to Support Visual Exploration of High-Dimensional Data
—Visual exploration of multivariate data typically requires projection onto lower-dimensional representations. The number of possible representations grows rapidly with the numbe...
Andrada Tatu, Georgia Albuquerque, Martin Eisemann...