Sciweavers

3050 search results - page 398 / 610
» On-line Algorithms in Machine Learning
Sort
View
MLDM
2005
Springer
15 years 10 months ago
SSC: Statistical Subspace Clustering
Subspace clustering is an extension of traditional clustering that seeks to find clusters in different subspaces within a dataset. This is a particularly important challenge with...
Laurent Candillier, Isabelle Tellier, Fabien Torre...
ICML
1994
IEEE
15 years 8 months ago
A Conservation Law for Generalization Performance
Conservation of information (COI) popularized by the no free lunch theorem is a great leveler of search algorithms, showing that on average no search outperforms any other. Yet in ...
Cullen Schaffer
ECML
1987
Springer
15 years 8 months ago
Induction in Noisy Domains
This paper examines the induction of classification rules from examples using real-world data. Real-world data is almost always characterized by two features, which are important ...
Peter Clark, Tim Niblett
GECCO
2008
Springer
261views Optimization» more  GECCO 2008»
15 years 6 months ago
SSNNS -: a suite of tools to explore spiking neural networks
We are interested in engineering smart machines that enable backtracking of emergent behaviors. Our SSNNS simulator consists of hand-picked tools to explore spiking neural network...
Heike Sichtig, J. David Schaffer, Craig B. Laramee
ICPR
2004
IEEE
16 years 6 months ago
Learning Sample Subspace with Application to Face Detection
In this paper, we present a novel maximum correlation sample subspace method and apply it to human face detection [1] in still images. The algorithm starts by projecting all the t...
Guoping Qiu, Jianzhong Fang