Sciweavers

465 search results - page 81 / 93
» Optimization Over the Efficient Set of Multi-objective Conve...
Sort
View
ICS
2010
Tsinghua U.
14 years 6 months ago
Distribution-Specific Agnostic Boosting
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
Vitaly Feldman
RECSYS
2009
ACM
14 years 3 months ago
Preference elicitation with subjective features
Utility or preference elicitation is a critical component in many recommender and decision support systems. However, most frameworks for elicitation assume a predefined set of fe...
Craig Boutilier, Kevin Regan, Paolo Viappiani
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
14 years 2 months ago
Evolutionary selection of minimum number of features for classification of gene expression data using genetic algorithms
Selecting the most relevant factors from genetic profiles that can optimally characterize cellular states is of crucial importance in identifying complex disease genes and biomark...
Alper Küçükural, Reyyan Yeniterzi...
ICDE
2004
IEEE
137views Database» more  ICDE 2004»
14 years 10 months ago
Selectivity Estimation for XML Twigs
Twig queries represent the building blocks of declarative query languages over XML data. A twig query describes a complex traversal of the document graph and generates a set of el...
Neoklis Polyzotis, Minos N. Garofalakis, Yannis E....
ALENEX
2001
215views Algorithms» more  ALENEX 2001»
13 years 10 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