Difference between revisions of "Z. Kou and W. Cohen. SDM 2007"
From Cohen Courses
Jump to navigationJump to searchPastStudents (talk | contribs) (Created page with '== Citation == Zhenzhen Kou and William W. Cohen. Stacked Graphical Models for Efficient Inference in Markov Random Fields in SDM-2007. == Online version == [http://www.cs.cm…') |
PastStudents (talk | contribs) |
||
| Line 8: | Line 8: | ||
== Summary == | == Summary == | ||
| + | This paper is an extension of Stacked Sequential Learning and shows how stacking can be used in non-sequential tasks, such as | ||
| + | text region detection. | ||
| + | |||
| + | The key points of the paper are: | ||
| + | * very fast inference time, 40 to 80 times faster than Gibbs sampling. | ||
| + | * relational information is captured by augmenting data with the predictions of related instances. | ||
| + | * Authors look at an image processing problem where the relation of instances is not sequential. | ||
Revision as of 22:09, 8 October 2010
Citation
Zhenzhen Kou and William W. Cohen. Stacked Graphical Models for Efficient Inference in Markov Random Fields in SDM-2007.
Online version
Summary
This paper is an extension of Stacked Sequential Learning and shows how stacking can be used in non-sequential tasks, such as text region detection.
The key points of the paper are:
- very fast inference time, 40 to 80 times faster than Gibbs sampling.
- relational information is captured by augmenting data with the predictions of related instances.
- Authors look at an image processing problem where the relation of instances is not sequential.
