GDC: A Hybrid Method for Hierarchical Data Grading and Classification
With the continuous expansion of big data scales, traditional single data grading and classification algorithms face challenges in handling complex data structures and achieving efficient querying. This paper proposes GDC, a hybrid method combining hierarchical clustering and decision trees. The method first builds a bottom-up data hierarchy using agglomerative hierarchical clustering, requiring no predefined cluster numbers. Decision trees are then employed to perform precise classification within each grade based on multi-dimensional features such as business value, sensitivity, and usage frequency. Simulated and real-world datasets are used in experiments, evaluated by accuracy and query efficiency improvement rate. The results show that GDC is effective and efficiency. This work advances data grading/classification methods for big data, with significant implications for query efficiency and data security in practice.
Authors
- Xingyu Lan (ORCID: https://orcid.org/0000-0001-7331-2433)
- Xiaocong Chen
- Shengjie Zhai (ORCID: https://orcid.org/0009-0004-4162-5119)
- Ke Huang (ORCID: https://orcid.org/0000-0002-3625-3937)
- Wumo Pan (ORCID: https://orcid.org/0009-0000-2397-0534)
- Chao Han (ORCID: https://orcid.org/0000-0002-6818-6441)
- Tian Tian (ORCID: https://orcid.org/0000-0001-9092-9128)
- Xudong Li (ORCID: https://orcid.org/0009-0003-2628-0530)
Institutions
- Key Laboratory of Nuclear Radiation and Nuclear Energy Technology (CN)
Publication Details
- Published
- 2025-06-27
- DOI
- https://doi.org/10.1109/iccste65902.2025.11138212
- Primary Topic
- Neural Networks and Applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00