Hierarchical rough decision theoretic framework for text classification
Published 1 July 2010
Wen Li, Duoqian Miao, Weili Wang, Nan Zhang
Citations59
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
An instance-centric hierarchical classification framework based on decision-theoretic rough set model is proposed and Comparative experimental results with Chinese text classification benchmark TanCorp illustrate the effectiveness of proposed notions.
Abstract
Hierarchical classification problems have been wide investigated in the past years. The available hierarchical classification methods, which use the top-down level-based scheme, often suffer from the burden of inter-level error transmission. In this paper, an instance-centric hierarchical classification framework based on decision-theoretic rough set model is proposed. The procedure of classification will be divided into two phases. Firstly, a hierarchical rough decision model is constructed to acquire all possible paths as well as reduce error transmission. A general loss function for supervised leaning is also defined by which the cost and benefit of assigning an instance to a specific subcategory can be evaluated. Subsequently, a novel classification routing method special for support vector machine is put forward in order to select an optimal classification path. Comparative experimental results with Chinese text classification benchmark TanCorp illustrate the effectiveness of proposed notions.
Keywords
Computer Science
The Nature of Statistical Learning Theory
39,279 Citations1995Vladimir Vapnik
Pattern classification and scene analysis
12,643 Citations1973Richard O. Duda, Peter E. Hart
Information RetrievalAn Evaluation of Statistical Approaches to Text Categorization
1,946 Citations1999Yiming Yang
Analysis and empirical evidence suggest that the evaluation results on some versions of Reuters were significantly affected by the inclusion of a large portion of unlabelled documents, mading those results difficult to interpret and leading to considerable confusions in the literature.
In Defense of One-Vs-All Classification
1,387 Citations2004Ryan Rifkin, Aldebaro Klautau
It is argued that a simple "one-vs-all" scheme is as accurate as any other approach, assuming that the underlying binary classifiers are well-tuned regularized classifiers such as support vector machines.
Journal of Machine Learning ResearchIn Defense of One-Vs-All Classification
895 Citations2004RifkinRyan, KlautauAldebaro
Hierarchical classification of Web content
805 Citations2000Susan Dumais, Hao Chen
This paper explores the use of hierarchical structure for classifying a large, heterogeneous collection of web content using support vector machine (SVM) classifiers, which have been shown to be efficient and effective for classification, but not previously explored in the context of hierarchical classification.
International Journal of Man-Machine StudiesA decision theoretic framework for approximating concepts
612 Citations1992Yiyu Yao, S. K. M. Wong
This paper shows that if a given concept is approximated by one set, the same result given by the α-cut in the fuzzy set theory is obtained, and can derive both the algebraic and probabilistic rough set approximations.
Information SciencesAttribute reduction in decision-theoretic rough set models
546 Citations2008Yiyu Yao, Yan Zhao
This paper addresses attribute reduction in decision-theoretic rough set models regarding different classification properties, such as decision-monotocity, confidence, coverage, generality and cost, and provides a new insight into the problem of attribute reduction.
Improving Text Classification by Shrinkage in a Hierarchy of Classes
478 Citations2022Andrew McCallum, Roni Rosenfeld +2 more
This paper shows that the accuracy of a naive Bayes text classi(cid:12)er can be significantly improved by taking advantage of a hierarchy of classes, and adopts an established statistical technique called shrinkage that smoothes parameter estimates of a data-sparse child with its parent in order to obtain more robust parameter estimates.
Lecture notes in computer scienceDecision-Theoretic Rough Set Models
452 Citations2007Yiyu Yao
It is shown that the decision-theoretic models need to consider additional issues in probabilistic rough set models.
Expert Systems with ApplicationsAn effective refinement strategy for KNN text classifier
275 Citations2005S TAN
This paper proposes a new refinement strategy, which is called as DragPushing, for the K-Nearest Neighbors Classifier, and shows that DragP pushing achieved a significant improvement on the performance of the KNN Classifier.
Information RetrievalHierarchical Text Categorization Using Neural Networks
248 Citations2002Miguel E. Ruiz, Padmini Srinivasan
The results show that the use of the hierarchical structure improves text categorization performance with respect to an equivalent flat model, and the optimized Rocchio algorithm achieves a performance comparable with that of the Hierarchical Mixture of Experts model.
Journal of Intelligent Information SystemsClassifying web documents in a hierarchy of categories: a comprehensive study
119 Citations2007Michelangelo Ceci, Donato Malerba
A general hierarchical text categorization framework where the hierarchy of categories is involved in all phases of automated document classification, namely feature selection, learning and classification of a new document is proposed.
IEEE Transactions on Knowledge and Data EngineeringRough Cluster Quality Index Based on Decision Theory
114 Citations2009Pawan Lingras, Min Chen +1 more
The proposed cluster validity index based on the decision-theoretic rough set model by considering various loss functions is shown to help determine optimal number of clusters, as well as an important parameter called threshold in rough clustering.
Computers & Mathematics with ApplicationsCriteria for choosing a rough set model
74 Citations2008Joseph P. Herbert, JingTao Yao
This work investigates how two rough set models, the Pawlak model and the probabilistic model, influence the decision goals of a user and presents a list of decision types corresponding to the available information and user needs.
IEEE Transactions on Knowledge and Data EngineeringBlocking reduction strategies in hierarchical text classification
55 Citations2004Aixin Sun, Ee‐Peng Lim +2 more
Three methods are proposed to address the blocking problem, namely, threshold reduction, restricted voting, and extended multiplicative, and it is shown that the Restricted Voting method delivered the best performance.
Lecture notes in computer scienceA Multi-View Decision Model Based on Decision-Theoretic Rough Set
42 Citations2009Xianzhong Zhou, Huaxiong Li
A multi-view decision method based on decision-theoretic rough set model is proposed, in which optimistic decision, pessimistic decision, and indifferent decision are provided according to the cost of misclassification.
Lecture notes in computer scienceRough Multi-category Decision Theoretic Framework
42 Citations2008Pawan Lingras, Min Chen +1 more
The decision theoretic rough set model is extended to supervised and unsupervised multi-category problems and can be used to study the multi-classification and clustering problems within the context of rough set theory.
Fundamenta InformaticaeSemi-supervised Rough Cost/Benefit Decisions
14 Citations2009Pawan Lingras, Min Chen +1 more
A semi-supervised decision theoretic rough set model is described that is used to model financial cost/benefit scenarios for a promotional campaign in a real-world retail store.