Sciweavers

396 search results - page 40 / 80
» Lossy Reduction for Very High Dimensional Data
Sort
View
SIAMJO
2010
100views more  SIAMJO 2010»
14 years 6 months ago
Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
Nathan Krislock, Henry Wolkowicz
IWANN
2005
Springer
15 years 5 months ago
Heuristic Search over a Ranking for Feature Selection
In this work, we suggest a new feature selection technique that lets us use the wrapper approach for finding a well suited feature set for distinguishing experiment classes in hig...
Roberto Ruiz, José Cristóbal Riquelm...
ICANN
1997
Springer
15 years 3 months ago
Topology Representing Networks for Intrinsic Dimensionality Estimation
Abstract. In this paper we compare two methods for intrinsic dimensionality (ID) estimation based on optimally topology preserving maps (OTPMs). The rst one is a direct approach, w...
Jörg Bruske, Gerald Sommer
EDBT
2009
ACM
184views Database» more  EDBT 2009»
15 years 6 months ago
Distributed similarity search in high dimensions using locality sensitive hashing
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
Parisa Haghani, Sebastian Michel, Karl Aberer
ICML
2001
IEEE
16 years 19 days ago
Toward Optimal Active Learning through Sampling Estimation of Error Reduction
This paper presents an active learning method that directly optimizes expected future error. This is in contrast to many other popular techniques that instead aim to reduce versio...
Nicholas Roy, Andrew McCallum