1651 search results - page 82 / 331 » Measuring the Complexity of Classification Problems |
ILP
2003
Springer
14 years 1 months ago
2003
Springer
It is well known that many hard tasks considered in machine learning and data mining can be solved in an rather simple and robust way with an instance- and distance-based approach....
STOC
2004
ACM
14 years 8 months ago
2004
ACM
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
Classification has been commonly used in many data mining projects in the financial service industry. For instance, to predict collectability of accounts receivable, a binary clas...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Genetic representations that do not employ a one-to-one mapping of genotype to phenotype are known as indirect encodings, and can be much more efficient than direct encodings for ...
CVPR
2000
IEEE
14 years 7 days ago
2000
IEEE
We formulate face alignment as a model-based parameter estimation problem in this paper. First, we work within a framework that combines two separate subspace models to r epresent...