Sciweavers

3324 search results - page 295 / 665
» Learning Appropriate Contexts
Sort
View
IJCNN
2000
IEEE
15 years 10 months ago
Unsupervised Classification of Complex Clusters in Networks of Spiking Neurons
For unsupervised clustering in a network of spiking neurons we develop a temporal encoding of continuously valued data to obtain arbitrary clustering capacity and precision with a...
Sander M. Bohte, Johannes A. La Poutré, Joo...
AAAI
2008
15 years 9 months ago
Semi-Supervised Ensemble Ranking
Ranking plays a central role in many Web search and information retrieval applications. Ensemble ranking, sometimes called meta-search, aims to improve the retrieval performance b...
Steven C. H. Hoi, Rong Jin
ML
2006
ACM
163views Machine Learning» more  ML 2006»
15 years 6 months ago
Extremely randomized trees
Abstract This paper proposes a new tree-based ensemble method for supervised classification and regression problems. It essentially consists of randomizing strongly both attribute ...
Pierre Geurts, Damien Ernst, Louis Wehenkel
ICPR
2006
IEEE
16 years 7 months ago
Learning Wormholes for Sparsely Labelled Clustering
Distance functions are an important component in many learning applications. However, the correct function is context dependent, therefore it is advantageous to learn a distance f...
Eng-Jon Ong, Richard Bowden
ICML
2007
IEEE
16 years 7 months ago
Learning distance function by coding similarity
We consider the problem of learning a similarity function from a set of positive equivalence constraints, i.e. 'similar' point pairs. We define the similarity in informa...
Aharon Bar-Hillel, Daphna Weinshall