756 search results - page 71 / 152 » Adaptive Learning in Machine Summarization |
157
click to vote
ML
2010
ACM
15 years 1 months ago
2010
ACM
We propose two fast algorithms for abrupt change detection in streaming data that can operate on arbitrary unknown data distributions before and after the change. The first algor...
128
Voted
ICML
2007
IEEE
16 years 3 months ago
2007
IEEE
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
134
Voted
ECML
2007
Springer
15 years 8 months ago
2007
Springer
The problem of learning metrics between structured data (strings, trees or graphs) has been the subject of various recent papers. With regard to the specific case of trees, some a...
117
Voted
ML
1998
ACM
15 years 2 months ago
1998
ACM
We use simulated soccer to study multiagent learning. Each team's players (agents) share action set and policy, but may behave di erently due to position-dependent inputs. All...
127
Voted
TKDE
2010
15 years 28 days ago
2010
—A major assumption in many machine learning and data mining algorithms is that the training and future data must be in the same feature space and have the same distribution. How...