Sciweavers

3708 search results - page 376 / 742
» The Inverse Classification Problem
Sort
View
CSDA
2006
96views more  CSDA 2006»
15 years 6 months ago
Analysis of new variable selection methods for discriminant analysis
Several methods to select variables that are subsequently used in discriminant analysis are proposed and analysed. The aim is to find from among a set of m variables a smaller sub...
Joaquín A. Pacheco, Silvia Casado, Laura N&...
ICDM
2010
IEEE
226views Data Mining» more  ICDM 2010»
15 years 4 months ago
Edge Weight Regularization over Multiple Graphs for Similarity Learning
The growth of the web has directly influenced the increase in the availability of relational data. One of the key problems in mining such data is computing the similarity between o...
Pradeep Muthukrishnan, Dragomir R. Radev, Qiaozhu ...
ICANN
2007
Springer
15 years 10 months ago
Active Learning to Support the Generation of Meta-examples
Meta-Learning has been used to select algorithms based on the features of the problems being tackled. Each training example in this context, i.e. each meta-example, stores the feat...
Ricardo Bastos Cavalcante Prudêncio, Teresa ...
SIAMDM
2008
99views more  SIAMDM 2008»
15 years 6 months ago
Hat Guessing Games
Hat problems have become a popular topic in recreational mathematics. In a typical hat problem, each of n players tries to guess the color of the hat they are wearing by looking a...
Steve Butler, Mohammad Taghi Hajiaghayi, Robert D....
SIAMDM
2008
90views more  SIAMDM 2008»
15 years 6 months ago
Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction
Recently, a strong link has been discovered between supermodularity on lattices and tractability of optimization problems known as maximum constraint satisfaction problems. The pre...
Andrei A. Krokhin, Benoit Larose