Sciweavers

1614 search results - page 161 / 323
» Learning Rules and Their Exceptions
Sort
View
ICMLA
2009
15 years 1 months ago
All-Monotony: A Generalization of the All-Confidence Antimonotony
Abstract--Many studies have shown the limits of support/confidence framework used in Apriori-like algorithms to mine association rules. One solution to cope with this limitation is...
Yannick Le Bras, Philippe Lenca, Sorin Moga, St&ea...
123
Voted
COLING
2010
14 years 10 months ago
Boosting Relation Extraction with Limited Closed-World Knowledge
This paper presents a new approach to improving relation extraction based on minimally supervised learning. By adding some limited closed-world knowledge for confidence estimation...
Feiyu Xu, Hans Uszkoreit, Sebastian Krause, Hong L...
TNN
2010
130views Management» more  TNN 2010»
14 years 10 months ago
Large developing receptive fields using a distributed and locally reprogrammable address-event receiver
A distributed and locally reprogrammable address event receiver has been designed, in which incoming addressevents are monitored simultaneously by all synapses, allowing for arbitr...
Simeon A. Bamford, Alan F. Murray, David J. Willsh...
132
Voted
ICML
2006
IEEE
16 years 4 months ago
Fast time series classification using numerosity reduction
Many algorithms have been proposed for the problem of time series classification. However, it is clear that one-nearest-neighbor with Dynamic Time Warping (DTW) distance is except...
Xiaopeng Xi, Eamonn J. Keogh, Christian R. Shelton...
104
Voted
ALT
2007
Springer
16 years 8 days ago
Tuning Bandit Algorithms in Stochastic Environments
Algorithms based on upper-confidence bounds for balancing exploration and exploitation are gaining popularity since they are easy to implement, efficient and effective. In this p...
Jean-Yves Audibert, Rémi Munos, Csaba Szepe...