Sciweavers

1778 search results - page 12 / 356
» Local multidimensional scaling
Sort
View
120
Voted
CSDA
2006
82views more  CSDA 2006»
15 years 3 months ago
Nearest neighbours in least-squares data imputation algorithms with different missing patterns
Methods for imputation of missing data in the so-called least-squares approximation approach, a non-parametric computationally efficient multidimensional technique, are experiment...
Ito Wasito, Boris Mirkin
131
Voted
APVIS
2003
15 years 5 months ago
A Scalable Method for Visualising Changes in Portfolio Data
In this paper techniques from multidimensional scaling and graph drawing are coupled to provide an overview-and-detail style method for visualising a high dimensional dataset whos...
Tim Dwyer
151
Voted
NIPS
2004
15 years 5 months ago
Euclidean Embedding of Co-Occurrence Data
Embedding algorithms search for low dimensional structure in complex data, but most algorithms only handle objects of a single type for which pairwise distances are specified. Thi...
Amir Globerson, Gal Chechik, Fernando C. Pereira, ...
130
Voted
IJCV
2000
149views more  IJCV 2000»
15 years 3 months ago
Recognition without Correspondence using Multidimensional Receptive Field Histograms
The appearance of an object is composed of local structure. This local structure can be described and characterized by a vector of local features measured by local operators such a...
Bernt Schiele, James L. Crowley
143
Voted
AE
1999
Springer
15 years 8 months ago
Characterizing Locality in Decoder-Based EAs for the Multidimensional Knapsack Problem
The performance of decoder-based evolutionary algorithms (EAs) strongly depends on the locality of the used decoder and operators. While many approaches to characterize locality ar...
Jens Gottlieb, Günther R. Raidl