Sciweavers

535 search results - page 32 / 107
» Generalized Version Space Trees
Sort
View
158
Voted
ICML
2006
IEEE
15 years 8 months ago
Cover Trees for Nearest Neighbor
We present a tree data structure for fast nearest neighbor operations in general n- point metric spaces (where the data set con- sists of n points). The data structure re- quir...
Alina Beygelzimer, Sham Kakade, John Langford
DIS
2007
Springer
15 years 3 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono
PPOPP
2012
ACM
13 years 7 months ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal
SDM
2008
SIAM
136views Data Mining» more  SDM 2008»
15 years 1 months ago
Exploration and Reduction of the Feature Space by Hierarchical Clustering
In this paper we propose and test the use of hierarchical clustering for feature selection. The clustering method is Ward's with a distance measure based on GoodmanKruskal ta...
Dino Ienco, Rosa Meo
SEBD
2008
169views Database» more  SEBD 2008»
15 years 1 months ago
Clustering the Feature Space
Abstract Dino Ienco and Rosa Meo Dipartimento di Informatica, Universit`a di Torino, Italy In this paper we propose and test the use of hierarchical clustering for feature selectio...
Dino Ienco, Rosa Meo