Sciweavers

434 search results - page 44 / 87
» Dimensionality Reduction of Clustered Data Sets
Sort
View
EMNLP
2009
13 years 6 months ago
Improving Verb Clustering with Automatically Acquired Selectional Preferences
In previous research in automatic verb classification, syntactic features have proved the most useful features, although manual classifications rely heavily on semantic features. ...
Lin Sun, Anna Korhonen
NIPS
2008
13 years 10 months ago
Spectral Clustering with Perturbed Data
Spectral clustering is useful for a wide-ranging set of applications in areas such as biological data analysis, image processing and data mining. However, the computational and/or...
Ling Huang, Donghui Yan, Michael I. Jordan, Nina T...
VLDB
2000
ACM
166views Database» more  VLDB 2000»
14 years 6 days ago
What Is the Nearest Neighbor in High Dimensional Spaces?
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...
Alexander Hinneburg, Charu C. Aggarwal, Daniel A. ...
ICIP
2007
IEEE
14 years 15 days ago
Unsupervised Nonlinear Manifold Learning
This communication deals with data reduction and regression. A set of high dimensional data (e.g., images) usually has only a few degrees of freedom with corresponding variables t...
Matthieu Brucher, Christian Heinrich, Fabrice Heit...
APVIS
2010
13 years 3 months ago
Visual analysis of high dimensional point clouds using topological landscapes
In this paper, we present a novel three-stage process to visualize the structure of point clouds in arbitrary dimensions. To get insight into the structure and complexity of a dat...
Patrick Oesterling, Christian Heine, Heike Jä...