Sciweavers

1405 search results - page 96 / 281
» Anytime Algorithm for Feature Selection
Sort
View
JMLR
2008
131views more  JMLR 2008»
15 years 2 months ago
On Relevant Dimensions in Kernel Feature Spaces
We show that the relevant information of a supervised learning problem is contained up to negligible error in a finite number of leading kernel PCA components if the kernel matche...
Mikio L. Braun, Joachim M. Buhmann, Klaus-Robert M...
SIGIR
2006
ACM
15 years 8 months ago
Feature diversity in cluster ensembles for robust document clustering
The performance of document clustering systems depends on employing optimal text representations, which are not only difficult to determine beforehand, but also may vary from one ...
Xavier Sevillano, Germán Cobo, Francesc Al&...
118
Voted
ICCVW
1999
Springer
15 years 6 months ago
A General Method for Feature Matching and Model Extraction
Abstract. Popular algorithms for feature matching and model extraction fall into two broad categories, generate-and-test and Hough transform variations. However, both methods su er...
Clark F. Olson
KDD
2012
ACM
217views Data Mining» more  KDD 2012»
13 years 4 months ago
The long and the short of it: summarising event sequences with serial episodes
An ideal outcome of pattern mining is a small set of informative patterns, containing no redundancy or noise, that identifies the key structure of the data at hand. Standard freq...
Nikolaj Tatti, Jilles Vreeken
ISSTA
2006
ACM
15 years 8 months ago
A regression tests selection technique for aspect-oriented programs
As the Aspect-Oriented Software Development gains popularity, there is growing interest as developing for existing object-oriented software aspects to address the crosscutting pro...
Guoqing Xu