Results 1 - 10 of 402

Graphical models, exponential families, and variational inference

by Martin J. Wainwright, Michael I. Jordan , 2008
"... The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building large-scale multivariate statistical models. Graphical models have become a focus of research in many statistical, computational and mathematical fiel ..."
Abstract - Cited by 819 (28 self) - Add to MetaCart
fields, including bioinformatics, communication theory, statistical physics, combinatorial optimization, signal and image processing, information retrieval and statistical machine learning. Many problems that arise in specific instances — including the key problems of computing marginals and modes

Regularization and semi-supervised learning on large graphs

by Mikhail Belkin, Irina Matveeva, Partha Niyogi - In COLT , 2004
"... Abstract. We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition in manifold settings. It is also of potential practical importance, when the data is abundant, but labeling i ..."
Abstract - Cited by 148 (1 self) - Add to MetaCart
is expensive or requires human assistance. Our approach develops a framework for regularization on such graphs. The algorithms are very simple and involve solving a single, usually sparse, system of linear equations. Using the notion of algorithmic stability, we derive bounds on the generalization error

Learning query intent from regularized click graphs

by Xiao Li, Ye-yi Wang, Alex Acero - In SIGIR 2008 , 2008
"... This work presents the use of click graphs in improving query intent classifiers, which are critical if vertical search and general-purpose search services are to be offered in a unified user interface. Previous works on query classification have primarily focused on improving feature representation ..."
Abstract - Cited by 114 (12 self) - Add to MetaCart
, we infer class memberships of unlabeled queries from those of labeled ones according to their proximities in a click graph. Moreover, we regularize the learning with click graphs by content-based classification to avoid propagating erroneous labels. We demonstrate the effectiveness of our algorithms

Tracking Loose-limbed People

by Leonid Sigal, Sidharth Bhatia, Stefan Roth, Michael J. Black, Michael Isard , 2004
"... We pose the problem of 3D human tracking as one of inference in a graphical model. Unlike traditional kinematic tree representations, our model of the body is a collection of loosely-connected limbs. Conditional probabilities relating the 3D pose of connected limbs are learned from motioncaptured tr ..."
Abstract - Cited by 191 (7 self) - Add to MetaCart
training data. Similarly, we learn probabilistic models for the temporal evolution of each limb (forward and backward in time). Human pose and motion estimation is then solved with non-parametric belief propagation using a variation of particle filtering that can be applied over a general loopy graph

A statistical model for general contextual object recog. ECCV

by Peter Carbonetto, O De Freitas, Kobus Barnard , 2004
"... Abstract. We consider object recognition as the process of attaching meaningful labels to specific regions of an image, and propose a model that learns spatial relationships between objects. Given a set of images and their associated text (e.g. keywords, captions, descriptions), the objective is to ..."
Abstract - Cited by 129 (7 self) - Add to MetaCart
propagation in the inference step and iterative scaling on the pseudo-likelihood approximation in the parameter update step. The experiments indicate that our approximate inference and learning algorithm converges to good local solutions. Experiments on a diverse array of images show that spatial context

Learning to Rank with Graph Consistency

by Bo Geng, Linjun Yang, Xian-sheng Hua
"... The ranking models of existing image search engines are generally based on associated text while the image visual content is actually neglected. Imperfect search results fre-quently appear due to the mismatch between the textual features and the actual image content. Visual reranking, in which visua ..."
Abstract - Add to MetaCart
visual information is applied to refine text based search results, has been proven to be effective. However, the improvement brought by visual reranking is limited, and the main reason is that the errors in the text-based results will propagate to the refinement stage. In this paper, we pro-pose a

Synthesis of interface specifications for Java classes

by Rajeev Alur, P. Madhusudan, Wonhong Nam - In POPL , 2005
"... While a typical software component has a clearly specified (static) interface in terms of the methods and the input/output types they support, information about the correct sequencing of method calls the client must invoke is usually undocumented. In this paper, we propose a novel solution for autom ..."
Abstract - Cited by 142 (9 self) - Add to MetaCart
synthesis method first constructs a symbolic representation of the finite state-transition system obtained from the class using predicate abstraction. Constructing the interface then corresponds to solving a partial-information two-player game on this symbolic graph. We present a sound approach to solve

Correlation Clustering in General Weighted Graphs

by Erik D. Demaine, Dotan Emanuel, Amos Fiat, Nicole Immorlica - Theoretical Computer Science , 2006
"... We consider the following general correlation-clustering problem [1]: given a graph with real nonnegative edge weights and a 〈+〉/〈− 〉 edge labeling, partition the vertices into clusters to minimize the total weight of cut 〈+ 〉 edges and uncut 〈− 〉 edges. Thus, 〈+ 〉 edges with large weights (represen ..."
Abstract - Cited by 41 (0 self) - Add to MetaCart
-hardness and gave constant-factor approximation algorithms for the special case in which the graph is complete (full information) and every edge has the same weight. We give an O(log n)-approximation algorithm for the general case based on a linear-programming rounding and the “region-growing ” technique. We also

Learning markov networks: maximum bounded tree-width graphs

by Nathan Srebro - In Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms , 2001
"... AbstractMarkov networks are a common class of graphical models used in machine learning. Such models use an undirected graph tocapture dependency information among random variables in a joint probability distribution. Once one has chosen to use a Markovnetwork model, one aims to choose the model tha ..."
Abstract - Cited by 73 (6 self) - Add to MetaCart
AbstractMarkov networks are a common class of graphical models used in machine learning. Such models use an undirected graph tocapture dependency information among random variables in a joint probability distribution. Once one has chosen to use a Markovnetwork model, one aims to choose the model

Graph-based Transfer Learning

by Jingrui He, Yan Liu, Richard Lawrence
"... Transfer learning is the task of leveraging the information from labeled examples in some domains to predict the labels for examples in another domain. It finds abundant practical applications, such as sentiment prediction, image classification and network intrusion detection. In this paper, we prop ..."
Abstract - Cited by 12 (3 self) - Add to MetaCart
propose a graph-based transfer learning framework. It propagates the label information from the source domain to the target domain via the example-feature-example tripartite graph, and puts more emphasis on the labeled examples from the target domain via the example-example bipartite graph. Our framework
Results 1 - 10 of 402