Sciweavers

323 search results - page 43 / 65
» New Algorithms for Learning in Presence of Errors
Sort
View
ICMCS
2007
IEEE
194views Multimedia» more  ICMCS 2007»
14 years 3 months ago
Automatically Tuning Background Subtraction Parameters using Particle Swarm Optimization
A common trait of background subtraction algorithms is that they have learning rates, thresholds, and initial values that are hand-tuned for a scenario in order to produce the des...
Brandyn White, Mubarak Shah
ICANNGA
2007
Springer
161views Algorithms» more  ICANNGA 2007»
14 years 17 days ago
Evolutionary Induction of Decision Trees for Misclassification Cost Minimization
Abstract. In the paper, a new method of decision tree learning for costsensitive classification is presented. In contrast to the traditional greedy top-down inducer in the proposed...
Marek Kretowski, Marek Grzes
ROBOCUP
2004
Springer
147views Robotics» more  ROBOCUP 2004»
14 years 2 months ago
Learning to Drive and Simulate Autonomous Mobile Robots
We show how to apply learning methods to two robotics problems, namely the optimization of the on-board controller of an omnidirectional robot, and the derivation of a model of the...
Alexander Gloye, Cüneyt Göktekin, Anna E...
CDC
2008
IEEE
171views Control Systems» more  CDC 2008»
14 years 3 months ago
Constrained optimal control theory for differential linear repetitive processes
Abstract. Differential repetitive processes are a distinct class of continuous-discrete twodimensional linear systems of both systems theoretic and applications interest. These pr...
Michael Dymkov, Eric Rogers, Siarhei Dymkou, Krzys...
DATAMINE
2010
120views more  DATAMINE 2010»
13 years 8 months ago
A weighted voting summarization of SOM ensembles
Abstract Weighted Voting Superposition (WeVoS) is a novel summarization algorithm for the results of an ensemble of Self-Organizing Maps. Its principal aim is to achieve the lowest...
Bruno Baruque, Emilio Corchado