Sciweavers

1651 search results - page 162 / 331
» Measuring the Complexity of Classification Problems
Sort
View
ML
2002
ACM
123views Machine Learning» more  ML 2002»
13 years 7 months ago
Feature Generation Using General Constructor Functions
Most classification algorithms receive as input a set of attributes of the classified objects. In many cases, however, the supplied set of attributes is not sufficient for creatin...
Shaul Markovitch, Dan Rosenstein
PODS
2009
ACM
171views Database» more  PODS 2009»
14 years 8 months ago
XML schema mappings
Relational schema mappings have been extensively studied in connection with data integration and exchange problems, but mappings between XML schemas have not received the same amo...
Shun'ichi Amano, Leonid Libkin, Filip Murlak
IQ
2007
13 years 9 months ago
In Search Of An Accuracy Metric
Practitioners and researchers often refer to error rates or accuracy percentages of databases. The former is the number of cells in error divided by the total number of cells; the...
Craig W. Fisher, Eitel J. M. Lauría, Caroly...
SWAT
2004
Springer
136views Algorithms» more  SWAT 2004»
14 years 1 months ago
The Relative Worst Order Ratio Applied to Seat Reservation
The seat reservation problem is the problem of assigning passengers to seats on a train with n seats and k stations enroute in an online manner. The performance of algorithms for t...
Joan Boyar, Paul Medvedev
ICPR
2004
IEEE
14 years 9 months ago
On Classifier Domains of Competence
We study the domain of dominant competence of six popular classifiers in a space of data complexity measurements. We observe that the simplest classifiers, nearest neighbor and li...
Ester Bernadó i Mansilla, Tin Kam Ho