CoChat

Cost-Sensitive Neighborhood Granularity Selection for Hierarchical Classification

Li, Shuai, Yang, Jie, Bao, Huanan, Xia, Deyou, Zhang, Qinghua, Wang, Guoyin · 2025 · IEEE Transactions on Knowledge and Data Engineering

The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.

Abstract

Multi-label classification represented by hierarchical classification (HC) plays an important role in current large-scale problems, which can acquire a more accurate expression of data that conforms to the human multi-granularity cognitive process. To compress the original dataset and simultaneously enhance the expressive force of models, selecting an appropriate granularity for approximately describing the classification is the main task in the rough set theory. Nevertheless, the current rough set theory merely concerns flat classification and encounters new problems when approximately describing HC. 1) There lacks a measure to correctly reflect misclassification in accordance with the hierarchical accuracy of HC on the training set. 2) There lacks a measure relying on the distribution of the dataset to reflect the difference between two distinct feature sets describing HC in generalization ability. To address the mentioned issues, this paper utilizes the knowledge distance to characterize HC and proposes a cost-sensitive granularity selection for HC. First, HC and features are respectively granulated according to hierarchical quotient space and neighborhood granular structures. Then, knowledge distance and its extended form are employed to formulate misclassification and test costs. On this basis, a cost-sensitive neighborhood granularity selection is presented for HC. Finally, we experimentally demonstrate the excellent performance of the proposed method in terms of efficiency and HC accuracy both in synthetic and real datasets.

Overview

Integrity signals

Registry

Crossref · 10.1109/tkde.2025.3566038

Cites

42 of 42 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Show all 42 references

Research works printed but not linked: 2

  1. Zhang, 1992, Theory and Applications of Problem Solving
  2. Cai, 2007, Exploiting known taxonomies in learning overlapping concepts, 714

Cited by

See all 49

Metadata

Authors
Li, S., Yang, J., Bao, H., Xia, D., Zhang, Q., & Wang, G.
Affiliations
  • Nanchang Hangkong University (CN)
  • Zunyi Normal College (CN)
  • Chongqing University of Posts and Telecommunications (CN)
  • Chongqing University of Science and Technology (CN)
Venue
IEEE Transactions on Knowledge and Data Engineering
Published
2025-08
Volume
37
Issue
8
Pages
4471-4484
ISSN
  • 1041-4347 (ISSN-L)
  • 1558-2191
  • 2326-3865
OpenAlex
W4410027613
Cited by
45
References
42
Citations by year
2026: 33 · 2025: 12
FWCI
23.39
Type
journal article
Language
en
Open access
closed
Locations
IEEE Transactions on Knowledge and Data Engineering (publishedVersion)
Funders
  • National Natural Science Foundation of China (62366033, 62466063, 62221005)
  • Natural Science Foundation of Jiangxi Province (20232BAB202049, 20242BAB25121)
  • Guizhou Provincial Department of Education Colleges and Universities Science and Technology Innovation Team (QJJ [2023] 084)
  • Initial Fund for Doctors of Nanchang Hangkong University (EA202407194)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Rough Sets and Fuzzy Logic
  • Physical Sciences › Computer Science › Artificial Intelligence › Text and Document Classification Technologies
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
Keywords
hierarchical classification, multi-label classification, knowledge distance, cost-sensitive learning, rough set theory, misclassification cost, feature selection, model generalization

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Cost-Sensitive Neighborhood Granularity Selection for Hierarchical Classification. https://app.cochat.ai/papers/10.1109/tkde.2025.3566038
The paper
Li, S., Yang, J., Bao, H., Xia, D., Zhang, Q., & Wang, G. (2025). Cost-Sensitive Neighborhood Granularity Selection for Hierarchical Classification. IEEE Transactions on Knowledge and Data Engineering. https://doi.org/10.1109/tkde.2025.3566038

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.