384 search results - page 29 / 77 » Learning Markov Network Structure with Decision Trees |
PAKDD
1998
ACM
14 years 1 months ago
1998
ACM
Abstract. Approaches to data mining proposed so far are mainly symbolic decision trees and numerical feedforward neural networks methods. While decision trees give, in many cases, ...
ISNN
2004
Springer
14 years 2 months ago
2004
Springer
This paper proposes a novel hierarchical clustering method that can classify given data without specified knowledge of the number of classes. In this method, at each node of a hie...
GECCO
2009
Springer
14 years 21 days ago
2009
Springer
Many approaches to active learning involve training one classifier by periodically choosing new data points about which the classifier has the least confidence, but designing a co...
ICML
2005
IEEE
14 years 9 months ago
2005
IEEE
We present a kernel-based algorithm for hierarchical text classification where the documents are allowed to belong to more than one category at a time. The classification model is...
ICANN
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. This paper presents Recurrent Policy Gradients, a modelfree reinforcement learning (RL) method creating limited-memory stochastic policies for partially observable Markov...