Sciweavers

160 search results - page 6 / 32
» Efficient Kernel-based Learning for Trees
Sort
View
JMLR
2000
134views more  JMLR 2000»
15 years 2 months ago
Learning with Mixtures of Trees
This paper describes the mixtures-of-trees model, a probabilistic model for discrete multidimensional domains. Mixtures-of-trees generalize the probabilistic trees of Chow and Liu...
Marina Meila, Michael I. Jordan
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
16 years 3 months ago
A new efficient probabilistic model for mining labeled ordered trees
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhi...
203
Voted
ICAART
2010
INSTICC
15 years 11 months ago
Complexity of Stochastic Branch and Bound Methods for Belief Tree Search in Bayesian Reinforcement Learning
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
Christos Dimitrakakis
145
Voted
INFORMATICALT
2008
196views more  INFORMATICALT 2008»
15 years 2 months ago
An Efficient and Sensitive Decision Tree Approach to Mining Concept-Drifting Data Streams
Abstract. Data stream mining has become a novel research topic of growing interest in knowledge discovery. Most proposed algorithms for data stream mining assume that each data blo...
Cheng-Jung Tsai, Chien-I Lee, Wei-Pang Yang
128
Voted
ICML
2008
IEEE
16 years 3 months ago
Fast solvers and efficient implementations for distance metric learning
In this paper we study how to improve nearest neighbor classification by learning a Mahalanobis distance metric. We build on a recently proposed framework for distance metric lear...
Kilian Q. Weinberger, Lawrence K. Saul