Using greedy algorithm to learn graphical model for digit recognition
| dc.contributor.advisor | Ravikumar, Pradeep | |
| dc.creator | Yang, Jisong | en |
| dc.date.accessioned | 2015-01-20T19:53:39Z | en |
| dc.date.accessioned | 2018-01-22T22:27:14Z | |
| dc.date.available | 2018-01-22T22:27:14Z | |
| dc.date.issued | 2014-12 | en |
| dc.date.submitted | December 2014 | en |
| dc.date.updated | 2015-01-20T19:53:39Z | en |
| dc.description | text | en |
| dc.description.abstract | Graphical model, the marriage between graph theory and probability theory, has been drawing increasing attention because of its many attractive features. In this paper, we consider the problem of learning the structure of graphical model based on observed data through a greedy forward-backward algorithm and with the use of learned model to classify the data into different categories. We establish the graphical model associated with a binary Ising Markov random field. And model selection is implemented by adding and deleting edges between nodes. Our experiments show that: compared with previous methods, the proposed algorithm has better performance in terms of correctness rate and model selection. | en |
| dc.description.department | Statistics | en |
| dc.format.mimetype | application/pdf | en |
| dc.identifier.uri | http://hdl.handle.net/2152/28131 | en |
| dc.language.iso | en | en |
| dc.subject | Graphical model | en |
| dc.subject | Markov random field | en |
| dc.title | Using greedy algorithm to learn graphical model for digit recognition | en |
| dc.type | Thesis | en |