Please use this identifier to cite or link to this item: https://doi.org/10.1145/1148020.1148022
DC FieldValue
dc.titleA Maximal Figure-of-Merit (MFoM)-learning approach to robust classifier design for text categorization
dc.contributor.authorGao, S.
dc.contributor.authorWen, W.U.
dc.contributor.authorLee, C.-H.
dc.contributor.authorChua, T.-S.
dc.date.accessioned2013-07-04T07:45:17Z
dc.date.available2013-07-04T07:45:17Z
dc.date.issued2006
dc.identifier.citationGao, S., Wen, W.U., Lee, C.-H., Chua, T.-S. (2006). A Maximal Figure-of-Merit (MFoM)-learning approach to robust classifier design for text categorization. ACM Transactions on Information Systems 24 (2) : 190-218. ScholarBank@NUS Repository. https://doi.org/10.1145/1148020.1148022
dc.identifier.issn10468188
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/39600
dc.description.abstractWe propose a maximal figure-of-merit (MFoM)-learning approach for robust classifier design, which directly optimizes performance metrics of interest for different target classifiers. The proposed approach, embedding the decision functions of classifiers and performance metrics into an overall training objective, learns the parameters of classifiers in a decision-feedback manner to effectively take into account both positive and negative training samples, thereby reducing the required size of positive training data. It has three desirable properties: (a) it is a performance metric, oriented learning; (b) the optimized metric is consistent in both training and evaluation sets; and (c) it is more robust and less sensitive to data variation, and can handle insufficient training data scenarios. We evaluate it on a text categorization task using the Reuters-21578 dataset. Training an F 1-based binary tree classifier using MFoM, we observed significantly improved performance and enhanced robustness compared to the baseline and SVM, especially for categories with insufficient training samples. The generality for designing other metrics-based classifiers is also demonstrated by comparing precision, recall, and F 1-based classifiers. The results clearly show consistency of performance between the training and evaluation stages for each classifier, and MFoM optimizes the chosen metric. © 2006 ACM.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1145/1148020.1148022
dc.sourceScopus
dc.subjectDecision tree
dc.subjectGeneralized probabilistic descent method
dc.subjectInformation retrieval
dc.subjectLatent semantic indexing
dc.subjectMaximal figure-of-merit
dc.subjectText categorization
dc.typeArticle
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.doi10.1145/1148020.1148022
dc.description.sourcetitleACM Transactions on Information Systems
dc.description.volume24
dc.description.issue2
dc.description.page190-218
dc.description.codenATISE
dc.identifier.isiut000240017200002
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.