Sciweavers

8 search results - page 1 / 2
» A Probabilistic Spell for the Curse of Dimensionality
Sort
View
ALENEX
2001
105views Algorithms» more  ALENEX 2001»
13 years 5 months ago
A Probabilistic Spell for the Curse of Dimensionality
Range searches in metric spaces can be very di cult if the space is \high dimensional", i.e. when the histogram of distances has a large mean and a small variance. The so-cal...
Edgar Chávez, Gonzalo Navarro
CDC
2008
IEEE
137views Control Systems» more  CDC 2008»
13 years 11 months ago
An approximate dynamic programming approach to probabilistic reachability for stochastic hybrid systems
— This paper addresses the computational overhead involved in probabilistic reachability computations for a general class of controlled stochastic hybrid systems. An approximate ...
Alessandro Abate, Maria Prandini, John Lygeros, Sh...
DEXAW
1999
IEEE
168views Database» more  DEXAW 1999»
13 years 8 months ago
Using the Distance Distribution for Approximate Similarity Queries in High-Dimensional Metric Spaces
We investigate the problem of approximate similarity (nearest neighbor) search in high-dimensional metric spaces, and describe how the distance distribution of the query object ca...
Paolo Ciaccia, Marco Patella
DIS
2006
Springer
13 years 8 months ago
On Class Visualisation for High Dimensional Data: Exploring Scientific Data Sets
Parametric Embedding (PE) has recently been proposed as a general-purpose algorithm for class visualisation. It takes class posteriors produced by a mixture-based clustering algori...
Ata Kabán, Jianyong Sun, Somak Raychaudhury...
IJCNN
2000
IEEE
13 years 9 months ago
Probabilistic Neural Network Models for Sequential Data
It has already been shown how Artificial Neural Networks (ANNs) can be incorporated into probabilistic models. In this paper we review some of the approaches which have been prop...
Yoshua Bengio