Sciweavers

1651 search results - page 44 / 331
» Measuring the Complexity of Classification Problems
Sort
View
ISCI
2008
181views more  ISCI 2008»
13 years 7 months ago
Attribute reduction in decision-theoretic rough set models
Rough set theory can be applied to rule induction. There are two different types of classification rules, positive and boundary rules, leading to different decisions and consequen...
Yiyu Yao, Yan Zhao
EMO
2006
Springer
120views Optimization» more  EMO 2006»
13 years 9 months ago
Rule Induction for Classification Using Multi-objective Genetic Programming
Multi-objective metaheuristics have previously been applied to partial classification, where the objective is to produce simple, easy to understand rules that describe subsets of a...
Alan P. Reynolds, Beatriz de la Iglesia
CSJM
2006
59views more  CSJM 2006»
13 years 7 months ago
Traveling Salesman Problem with Transportation
Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined -- a synthesis of classical TS...
Valeriu Ungureanu
SEUS
2005
IEEE
14 years 1 months ago
Measurement-Based Worst-Case Execution Time Analysis
In the last years the number of electronic control systems has increased significantly. In order to stay competitive more and more functionality is integrated into more and more p...
Ingomar Wenzel, Raimund Kirner, Bernhard Rieder, P...
CORR
2010
Springer
101views Education» more  CORR 2010»
13 years 7 months ago
Online Learning: Random Averages, Combinatorial Parameters, and Learnability
We develop a theory of online learning by defining several complexity measures. Among them are analogues of Rademacher complexity, covering numbers and fatshattering dimension fro...
Alexander Rakhlin, Karthik Sridharan, Ambuj Tewari