View source for Z. Kou and W. Cohen. SDM 2007

From Cohen Courses

← Z. Kou and W. Cohen. SDM 2007

You do not have permission to edit this page, for the following reason:

---

You can view and copy the source of this page.

== 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.cmu.edu/~wcohen/postscript/sdm-2007-stack.pdf Stacked Graphical Models] == Summary == This [[Category::paper]] is an extension of [[UsesMethod::Stacked Sequential Learning]] and shows how stacking can be used in non-sequential tasks, such as [[AddressesProblem::text region detection]] and [[AddressesProblem::document classification]]. The paper shows their method has very fast inference time, 40 to 80 times faster than Gibbs sampling. Within their model, the relational information is captured by augmenting data with the predictions of related instances. They applied their method on various problems with different datasets: [[UsesDataset::Web KB dataset]], [[UsesDataset::Cora network]], [[UsesDataset::GENIA dataset]], [[UsesDataset::Yapex dataset]]. == Example Stacked Graphical Models Usage == '''text region detection''' The task is to find the text regions in figures, where each figure may contain several panels. Relational information comes from the prediction of other candidates within the same panel and the predictions of four neighbor panels (up, down, right and left). The predictions of the candidate region and neighbor regions return a vector of binary features indicating whether a character is found in those regions. '''webpage classification''' The task is to classify web pages into different categories such as . Relational information comes from the number of incoming and outgoing links in each category. '''NER''' Relational information comes from nearby words. In this case Stacked Graphical Model is the same with SSL.

Return to Z. Kou and W. Cohen. SDM 2007.