It is rarely possible to use an optimal classifier. Often the classifier used for a specific problem is an approximation of the optimal classifier. Methods are presented for evaluating the performance of an approximation in the model class of Bayesian Networks. Specifically for the approximation of class conditional independence a bound for the performance is sharpened. The class conditional independence approximation is connected to the minimum description length principle (MDL), which is connected to Jeffreys’ prior through commonly used assumptions. One algorithm for unsupervised classification is presented and compared against other unsupervised classifiers on three data sets. / <p>Report code: LiU-TEK-LIC 2006:11.</p>
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:liu-5856 |
| Date | January 2006 |
| Creators | Ekdahl, Magnus |
| Publisher | Linköpings universitet, Matematisk statistik, Linköpings universitet, Tekniska högskolan, Matematiska institutionen |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Licentiate thesis, monograph, info:eu-repo/semantics/masterThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | Linköping Studies in Science and Technology. Thesis, 0280-7971 ; 1230 |
Page generated in 0.0021 seconds