Sciweavers

158 search results - page 22 / 32
» A Dynamic Adaptation of AD-trees for Efficient Machine Learn...
Sort
View
ICML
2005
IEEE
14 years 8 months ago
Online feature selection for pixel classification
Online feature selection (OFS) provides an efficient way to sort through a large space of features, particularly in a scenario where the feature space is large and features take a...
Karen A. Glocer, Damian Eads, James Theiler
KDD
2008
ACM
181views Data Mining» more  KDD 2008»
14 years 8 months ago
Learning subspace kernels for classification
Kernel methods have been applied successfully in many data mining tasks. Subspace kernel learning was recently proposed to discover an effective low-dimensional subspace of a kern...
Jianhui Chen, Shuiwang Ji, Betul Ceran, Qi Li, Min...
ALENEX
2001
215views Algorithms» more  ALENEX 2001»
13 years 9 months ago
An Empirical Study of a New Approach to Nearest Neighbor Searching
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
Songrit Maneewongvatana, David M. Mount
WWW
2002
ACM
14 years 8 months ago
Learning to map between ontologies on the semantic web
Ontologies play a prominent role on the Semantic Web. They make possible the widespread publication of machine understandable data, opening myriad opportunities for automated info...
AnHai Doan, Jayant Madhavan, Pedro Domingos, Alon ...
ESANN
2000
13 years 9 months ago
Distributed clustering and local regression for knowledge discovery in multiple spatial databases
Many large -scale spatial data analysis problems involve an investigation of relationships in heterogeneous databases. In such situations, instead of making predictions uniformly a...
Aleksandar Lazarevic, Dragoljub Pokrajac, Zoran Ob...