Sciweavers

16404 search results - page 875 / 3281
» A set coverage problem
Sort
View
ICML
2006
IEEE
16 years 8 months ago
Optimal kernel selection in Kernel Fisher discriminant analysis
In Kernel Fisher discriminant analysis (KFDA), we carry out Fisher linear discriminant analysis in a high dimensional feature space defined implicitly by a kernel. The performance...
Seung-Jean Kim, Alessandro Magnani, Stephen P. Boy...
ICML
2003
IEEE
16 years 8 months ago
Online Feature Selection using Grafting
In the standard feature selection problem, we are given a fixed set of candidate features for use in a learning problem, and must select a subset that will be used to train a mode...
Simon Perkins, James Theiler
ICML
1996
IEEE
16 years 8 months ago
Unsupervised Learning Using MML
This paper discusses the unsupervised learning problem. An important part of the unsupervised learning problem is determining the numberofconstituent groups (componentsor classes)...
Jonathan J. Oliver, Rohan A. Baxter, Chris S. Wall...
WWW
2009
ACM
16 years 8 months ago
Automatic web service composition with abstraction and refinement
ion and Refinement Hyunyoung Kil Wonhong Nam Dongwon Lee The Pennsylvania State University, University Park, PA 16802, USA {hykil, wnam, dongwon}@psu.edu The behavioral descriptio...
Hyunyoung Kil, Wonhong Nam, Dongwon Lee
WWW
2001
ACM
16 years 8 months ago
Rank aggregation methods for the Web
We consider the problem of combining ranking results from various sources. In the context of the Web, the main applications include building meta-search engines, combining ranking...
Cynthia Dwork, Ravi Kumar, Moni Naor, D. Sivakumar