Efficient spatial classification using decoupled conditional random fields

Authors:
Chi-Hoon Lee;Russell Greiner;Osmar Zaïane
Affiliations:
Department of Computing Science, University of Alberta, Edmonton, AB, Canada;Department of Computing Science, University of Alberta, Edmonton, AB, Canada;Department of Computing Science, University of Alberta, Edmonton, AB, Canada
Venue:
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
Year:
2006

Citing 8
Cited 2

Fast training of support vector machines using sequential minimal optimization

Advances in kernel methods
Learning in graphical models

Learning in graphical models
Markov random field modeling in image analysis

Markov random field modeling in image analysis
A Tutorial on Support Vector Machines for Pattern Recognition

Data Mining and Knowledge Discovery
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data

ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
Kernel Methods for Pattern Analysis

Kernel Methods for Pattern Analysis
Learning associative Markov networks

ICML '04 Proceedings of the twenty-first international conference on Machine learning
Support vector random fields for spatial classification

PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases

Segmenting Brain Tumors Using Pseudo---Conditional Random Fields

MICCAI '08 Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I
Constrained classification on structured data

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present a discriminative method to classify data that have interdependencies in 2-D lattice. Although both Markov Random Fields (MRFs) and Conditional Random Fields (CRFs) are well-known methods for modeling such dependencies, they are often ineffective and inefficient, respectively. This is because many of the simplifying assumptions that underlie the MRF's efficiency compromise its accuracy. As CRFs are discriminative, they are typically more accurate than the generative MRFs. This also means their learning process is more expensive. This paper addresses this situation by defining and using “Decoupled Conditional Random Fields (DCRFs)”, a variant of CRFs whose learning process is more efficient as it decouples the tasks of learning potentials. Although our model is only guaranteed to approximate a CRF, our empirical results on synthetic/real datasets show that DCRF is essentially as accurate as other CRF variants, but is many times faster to train.