Sciweavers

759 search results - page 19 / 152
» Structured Learning with Approximate Inference
Sort
View
ICML
2004
IEEE
14 years 11 months ago
Variational methods for the Dirichlet process
Variational inference methods, including mean field methods and loopy belief propagation, have been widely used for approximate probabilistic inference in graphical models. While ...
David M. Blei, Michael I. Jordan
ACCV
2006
Springer
14 years 4 months ago
Probabilistic Modeling for Structural Change Inference
We view the task of change detection as a problem of object recognition from learning. The object is defined in a 3D space where the time is the 3rd dimension. We propose two com...
Wei Liu, Véronique Prinet
TFS
2008
157views more  TFS 2008»
13 years 10 months ago
Efficient Self-Evolving Evolutionary Learning for Neurofuzzy Inference Systems
Abstract--This study proposes an efficient self-evolving evolutionary learning algorithm (SEELA) for neurofuzzy inference systems (NFISs). The major feature of the proposed SEELA i...
Cheng-Jian Lin, Cheng-Hung Chen, Chin-Teng Lin
ICDM
2007
IEEE
124views Data Mining» more  ICDM 2007»
14 years 5 months ago
Community Learning by Graph Approximation
Learning communities from a graph is an important problem in many domains. Different types of communities can be generalized as link-pattern based communities. In this paper, we p...
Bo Long, Xiaoyun Xu, Zhongfei (Mark) Zhang, Philip...
ICDM
2008
IEEE
172views Data Mining» more  ICDM 2008»
14 years 5 months ago
Active Learning of Equivalence Relations by Minimizing the Expected Loss Using Constraint Inference
Selecting promising queries is the key to effective active learning. In this paper, we investigate selection techniques for the task of learning an equivalence relation where the ...
Steffen Rendle, Lars Schmidt-Thieme