Abstract
On the whole, there are two ways to dispose of multiclass classification problem. One is deal it with directly. And the other is dividing it into several binary-class problems. For this reason, it will be simpler as regards individual binary-class problems. And it can improve the accuracy of the multiclass classification problem by reorganize the effect. So how to decompose several binary-class problems is the most important point. Here, based on our study, we use Dynamic Programming as foundation to get the optimal solution of multiclass¡¦s decomposition. Not only get it simplify but also can achieved the best classified result.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0703103-113453 |
| Date | 03 July 2003 |
| Creators | Pao, Yi-Hua |
| Contributors | none, none, none |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | Cholon |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0703103-113453 |
| Rights | unrestricted, Copyright information available at source archive |
Page generated in 0.0041 seconds