Sciweavers

1400 search results - page 102 / 280
» Post-Analysis of Learned Rules
Sort
View
ICML
1999
IEEE
16 years 5 months ago
The Alternating Decision Tree Learning Algorithm
The applicationofboosting procedures to decision tree algorithmshas been shown to produce very accurate classi ers. These classiers are in the form of a majority vote over a numbe...
Yoav Freund, Llew Mason
ICALT
2003
IEEE
15 years 9 months ago
Completing LOM - How Additional Axioms Increase the Utility of Learning Object Metadata
Learning Objects Metadata describing educational resources in order to allow better reusability and retrieval. Unfortunately, annotating complete courses thoroughly with LOM metad...
Jan Brase, Mark Painter, Wolfgang Nejdl
CVPR
2008
IEEE
16 years 6 months ago
Manifold learning using robust Graph Laplacian for interactive image search
Interactive image search or relevance feedback is the process which helps a user refining his query and finding difficult target categories. This consists in partially labeling a ...
Hichem Sahbi, Patrick Etyngier, Jean-Yves Audibert...
NECO
2006
103views more  NECO 2006»
15 years 4 months ago
Optimal Spike-Timing-Dependent Plasticity for Precise Action Potential Firing in Supervised Learning
In timing-based neural codes, neurons have to emit action potentials at precise moments in time. We use a supervised learning paradigm to derive a synaptic update rule that optimi...
Jean-Pascal Pfister, Taro Toyoizumi, David Barber,...
SAT
2009
Springer
113views Hardware» more  SAT 2009»
15 years 11 months ago
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
Abstract. We offer a new understanding of some aspects of practical SAT-solvers that are based on DPLL with unit-clause propagation, clause-learning, and restarts. On the theoreti...
Albert Atserias, Johannes Klaus Fichte, Marc Thurl...