Hierarchical Semantic Risk Minimization for Large-Scale Classification

被引:12
作者
Wang, Yu [1 ]
Wang, Zhou [2 ]
Hu, Qinghua [1 ]
Zhou, Yucan [3 ]
Su, Honglei [4 ]
机构
[1] Tianjin Univ, Coll Intelligence & Comp, Tianjin 300350, Peoples R China
[2] Univ Waterloo, Dept Elect & Comp Engn, Waterloo, ON N2L 3G1, Canada
[3] Chinese Acad Sci, Inst Informat Engn, Beijing 100089, Peoples R China
[4] Qingdao Univ, Sch Elect Informat, Qingdao 266071, Peoples R China
基金
中国国家自然科学基金;
关键词
Semantics; Task analysis; Predictive models; Risk management; Optimization; Dogs; Uncertainty; Deep Q-network (DQN); granular computing; hierarchical classification; multigranularity learning; risk minimization; REJECT OPTION; DEEP; STRATEGIES; DOCUMENTS;
D O I
10.1109/TCYB.2021.3059631
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Hierarchical structures of labels usually exist in large-scale classification tasks, where labels can be organized into a tree-shaped structure. The nodes near the root stand for coarser labels, while the nodes close to leaves mean the finer labels. We label unseen samples from the root node to a leaf node, and obtain multigranularity predictions in the hierarchical classification. Sometimes, we cannot obtain a leaf decision due to uncertainty or incomplete information. In this case, we should stop at an internal node, rather than going ahead rashly. However, most existing hierarchical classification models aim at maximizing the percentage of correct predictions, and do not take the risk of misclassifications into account. Such risk is critically important in some real-world applications, and can be measured by the distance between the ground truth and the predicted classes in the class hierarchy. In this work, we utilize the semantic hierarchy to define the classification risk and design an optimization technique to reduce such risk. By defining the conservative risk and the precipitant risk as two competing risk factors, we construct the balanced conservative/precipitant semantic (BCPS) risk matrix across all nodes in the semantic hierarchy with user-defined weights to adjust the tradeoff between two kinds of risks. We then model the classification process on the semantic hierarchy as a sequential decision-making task. We design an algorithm to derive the risk-minimized predictions. There are two modules in this model: 1) multitask hierarchical learning and 2) deep reinforce multigranularity learning. The first one learns classification confidence scores of multiple levels. These scores are then fed into deep reinforced multigranularity learning for obtaining a global risk-minimized prediction with flexible granularity. Experimental results show that the proposed model outperforms state-of-the-art methods on seven large-scale classification datasets with the semantic tree.
引用
收藏
页码:9546 / 9558
页数:13
相关论文
共 42 条