Sciweavers

528 search results - page 39 / 106
» Structure learning with independent non-identically distribu...
Sort
View
CIKM
2008
Springer
13 years 10 months ago
Structure feature selection for graph classification
With the development of highly efficient graph data collection technology in many application fields, classification of graph data emerges as an important topic in the data mining...
Hongliang Fei, Jun Huan
JMLR
2010
134views more  JMLR 2010»
13 years 2 months ago
Using Contextual Representations to Efficiently Learn Context-Free Languages
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
Alexander Clark, Rémi Eyraud, Amaury Habrar...
UAI
2004
13 years 9 months ago
Factored Latent Analysis for far-field Tracking Data
This paper uses Factored Latent Analysis (FLA) to learn a factorized, segmental representation for observations of tracked objects over time. Factored Latent Analysis is latent cl...
Chris Stauffer
ATAL
2007
Springer
14 years 2 months ago
Sharing experiences to learn user characteristics in dynamic environments with sparse data
This paper investigates the problem of estimating the value of probabilistic parameters needed for decision making in environments in which an agent, operating within a multi-agen...
David Sarne, Barbara J. Grosz
SDM
2011
SIAM
183views Data Mining» more  SDM 2011»
12 years 11 months ago
Nonparametric Bayesian Co-clustering Ensembles
A nonparametric Bayesian approach to co-clustering ensembles is presented. Similar to clustering ensembles, coclustering ensembles combine various base co-clustering results to ob...
Pu Wang, Kathryn B. Laskey, Carlotta Domeniconi, M...