Enhanced hypertext categorization using hyperlinks
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Learning to extract symbolic knowledge from the World Wide Web
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
Markov Random Fields with Efficient Approximations
CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
What Energy Functions Can Be Minimizedvia Graph Cuts?
IEEE Transactions on Pattern Analysis and Machine Intelligence
Discriminative probabilistic models for relational data
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Supervised clustering with support vector machines
ICML '05 Proceedings of the 22nd international conference on Machine learning
Learning structured prediction models: a large margin approach
ICML '05 Proceedings of the 22nd international conference on Machine learning
Kernel-Based Learning of Hierarchical Multilabel Classification Models
The Journal of Machine Learning Research
Structured Prediction, Dual Extragradient and Bregman Projections
The Journal of Machine Learning Research
Classification in Networked Data: A Toolkit and a Univariate Case Study
The Journal of Machine Learning Research
Efficient inference with cardinality-based clique potentials
Proceedings of the 24th international conference on Machine learning
Discriminative Learning of Max-Sum Classifiers
The Journal of Machine Learning Research
The Journal of Machine Learning Research
Cost-sensitive learning with conditional Markov networks
Data Mining and Knowledge Discovery
Learning to assign degrees of belief in relational domains
Machine Learning
Domain adaptation of information extraction models
ACM SIGMOD Record
Polyhedral outer approximations with application to natural language parsing
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
An Inductive Logic Programming Approach to Statistical Relational Learning
Proceedings of the 2005 conference on An Inductive Logic Programming Approach to Statistical Relational Learning
Semi-supervised multi-label learning by constrained non-negative matrix factorization
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Get out the vote: determining support or opposition from congressional floor-debate transcripts
EMNLP '06 Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing
Instance-based AMN classification for improved object recognition in 2D and 3D laser range data
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Onboard contextual classification of 3-D point clouds with learned high-order Markov random fields
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Learning an interactive segmentation system
Proceedings of the Seventh Indian Conference on Computer Vision, Graphics and Image Processing
Collective Inference for Extraction MRFs Coupled with Symmetric Clique Potentials
The Journal of Machine Learning Research
Efficient structured support vector regression
ACCV'10 Proceedings of the 10th Asian conference on Computer vision - Volume Part III
Graph attribute embedding via Riemannian submersion learning
Computer Vision and Image Understanding
Robust classification of curvilinear and surface-like structures in 3d point cloud data
ISVC'11 Proceedings of the 7th international conference on Advances in visual computing - Volume Part I
Coarse-to-fine classification via parametric and nonparametric models for computer-aided diagnosis
Proceedings of the 20th ACM international conference on Information and knowledge management
Efficient spatial classification using decoupled conditional random fields
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
Fast Approximate Energy Minimization with Label Costs
International Journal of Computer Vision
Learning to place new objects in a scene
International Journal of Robotics Research
Joint Optimization for Object Class Segmentation and Dense Stereo Reconstruction
International Journal of Computer Vision
User-Centric Learning and Evaluation of Interactive Segmentation Systems
International Journal of Computer Vision
Efficient exact inference for 3d indoor scene understanding
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part VI
Structured apprenticeship learning
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II
Contextually guided semantic labeling and search for three-dimensional point clouds
International Journal of Robotics Research
Hi-index | 0.00 |
Markov networks are extensively used to model complex sequential, spatial, and relational interactions in fields as diverse as image processing, natural language analysis, and bioinformatics. However, inference and learning in general Markov networks is intractable. In this paper, we focus on learning a large subclass of such models (called associative Markov networks) that are tractable or closely approximable. This subclass contains networks of discrete variables with K labels each and clique potentials that favor the same labels for all variables in the clique. Such networks capture the "guilt by association" pattern of reasoning present in many domains, in which connected ("associated") variables tend to have the same label. Our approach exploits a linear programming relaxation for the task of finding the best joint assignment in such networks, which provides an approximate quadratic program (QP) for the problem of learning a margin-maximizing Markov network. We show that for associative Markov network over binary-valued variables, this approximate QP is guaranteed to return an optimal parameterization for Markov networks of arbitrary topology. For the nonbinary case, optimality is not guaranteed, but the relaxation produces good solutions in practice. Experimental results with hypertext and newswire classification show significant advantages over standard approaches.