Sciweavers

476 search results - page 26 / 96
» Learning a Distance Metric from Relative Comparisons
Sort
View
ACL
2007
13 years 10 months ago
A Seed-driven Bottom-up Machine Learning Framework for Extracting Relations of Various Complexity
A minimally supervised machine learning framework is described for extracting relations of various complexity. Bootstrapping starts from a small set of n-ary relation instances as...
Feiyu Xu, Hans Uszkoreit, Hong Li
AAAI
2007
13 years 11 months ago
Temporal Difference and Policy Search Methods for Reinforcement Learning: An Empirical Comparison
Reinforcement learning (RL) methods have become popular in recent years because of their ability to solve complex tasks with minimal feedback. Both genetic algorithms (GAs) and te...
Matthew E. Taylor, Shimon Whiteson, Peter Stone
IJCAI
1989
13 years 10 months ago
An Empirical Comparison of Pattern Recognition, Neural Nets, and Machine Learning Classification Methods
Classification methods from statistical pattern recognition, neural nets, and machine learning were applied to four real-world data sets. Each of these data sets has been previous...
Sholom M. Weiss, Ioannis Kapouleas
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 9 months ago
Information Distance
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distan...
Charles H. Bennett, Péter Gács, Ming...
CMOT
2004
141views more  CMOT 2004»
13 years 8 months ago
Small Worlds Among Interlocking Directors: Network Structure and Distance in Bipartite Graphs
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...
Garry Robins, Malcolm Alexander