Sciweavers

1224 search results - page 66 / 245
» On the Optimality of the Dimensionality Reduction Method
Sort
View
NIPS
2003
15 years 7 months ago
Locality Preserving Projections
Many problems in information processing involve some form of dimensionality reduction. In this paper, we introduce Locality Preserving Projections (LPP). These are linear projecti...
Xiaofei He, Partha Niyogi
GD
2005
Springer
15 years 11 months ago
Non-planar Core Reduction of Graphs
We present a reduction method that reduces a graph to a smaller core graph which behaves invariant with respect to planarity measures like crossing number, skewness, and thickness....
Carsten Gutwenger, Markus Chimani
KDD
2001
ACM
253views Data Mining» more  KDD 2001»
16 years 6 months ago
GESS: a scalable similarity-join algorithm for mining large data sets in high dimensional spaces
The similarity join is an important operation for mining high-dimensional feature spaces. Given two data sets, the similarity join computes all tuples (x, y) that are within a dis...
Jens-Peter Dittrich, Bernhard Seeger
EOR
2007
100views more  EOR 2007»
15 years 6 months ago
Parallel radial basis function methods for the global optimization of expensive functions
We introduce a master–worker framework for parallel global optimization of computationally expensive functions using response surface models. In particular, we parallelize two r...
Rommel G. Regis, Christine A. Shoemaker
ICPR
2000
IEEE
16 years 7 months ago
Reduction of Bias in Maximum Likelihood Ellipse Fitting
An improved maximum likelihood estimator for ellipse fitting based on the heteroscedastic errors-in-variables (HEIV) regression algorithm is proposed. The technique significantly ...
Bogdan Matei, Peter Meer