Sciweavers

4930 search results - page 390 / 986
» Learning minimal abstractions
Sort
View
ML
2010
ACM
159views Machine Learning» more  ML 2010»
15 years 5 months ago
Algorithms for optimal dyadic decision trees
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
Don R. Hush, Reid B. Porter
ICMLA
2009
15 years 4 months ago
Ranking Electrical Feeders of the New York Power Grid
components of a system by susceptibility to failure. In this extended abstract, we present an ongoing project to rank the underground primary feeders of Consolidated Edison Company...
Philip Gross, Ansaf Salleb-Aouissi, Haimonti Dutta...
CAISE
2011
Springer
14 years 10 months ago
Supporting Dynamic, People-Driven Processes through Self-learning of Message Flows
Abstract. Flexibility and automatic learning are key aspects to support users in dynamic business environments such as value chains across SMEs or when organizing a large event. Pr...
Christoph Dorn, Schahram Dustdar
192
Voted
IROS
2009
IEEE
132views Robotics» more  IROS 2009»
16 years 1 months ago
Automatic selection of task spaces for imitation learning
Abstract— Previous work [1] shows that the movement representation in task spaces offers many advantages for learning object-related and goal-directed movement tasks through imit...
Manuel Mühlig, Michael Gienger, Jochen J. Ste...
KSEM
2009
Springer
16 years 1 months ago
A Competitive Learning Approach to Instance Selection for Support Vector Machines
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
Mario Zechner, Michael Granitzer