Hierarchical multi-stage dimensional reduction based on feature hashing and bi-filtering strategy for large-scale text classification
The advancement in technology has resulted in large size of data, which then introduce challenges to labelling or classification tasks with high dimensional features. Specifically, in the case of text labelling problem, the existing classification models are challenged with a huge number of instance...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 语言: | English English English |
| 出版: |
2023
|
| 主题: | |
| 在线阅读: | http://eprints.uthm.edu.my/11027/1/24p%20ABUBAKAR%20ADO.pdf http://eprints.uthm.edu.my/11027/2/ABUBAKAR%20ADO%20COPYRIGTH%20DECLARATION.pdf http://eprints.uthm.edu.my/11027/3/ABUBAKAR%20ADO%20WATERMARK.pdf |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
| 总结: | The advancement in technology has resulted in large size of data, which then introduce challenges to labelling or classification tasks with high dimensional features. Specifically, in the case of text labelling problem, the existing classification models are challenged with a huge number of instances, millions number of features, and large number of categories. Such challenge requires a well-defined hierarchy structure and automated classification models to label the instances within the hierarchy, which can be referred to as Large-Scale Hierarchical Text Classification (LSHTC). Even with a well-defined hierarchy, the LSHTC problem is still facing a scalability issue. Therefore, this requires improvements in the dimensional reduction phase of the LSHTC framework that aim at constructing a subset of informative features. However, using the existing dimensionality reduction methods in LSHTC problem has the consequence of introducing bad collisions or results discrepancy limitations. Therefore, in this thesis, a Multi-stage Dimensional Reduction Method (MDRM) based on feature hashing and bi-strategy filter method is proposed for the LSHTC problem. In view of solving the aforementioned problems, a Modified Feature Hashing (MFH) based on term weight to minimize bad collisions rate is presented, whereas for dealing with results discrepancy, a new Bi-strategy Filtering Approach (BFA) is presented. Experimental results show that the proposed MFH outperformed the conventional features hashing approximately by 3%. BFA has achieved the highest average micro-f1 score of 53.38% and 55.58%, and the highest average macro-f1 score of 45.83% and 49.23% compare to the single strategy filtering methods. It also achieves highest hierarchical-f1 of 79.99%, 67.83%, and 67.95% compare to existing multi-strategy filtering approaches. Lastly, the MDRM has achieved the best performance in terms of average micro-f1 (58.47% and 54.77%) and average macro-f1 (51.14% and 48.70%), respectively. In the case of running time, the MDRM has achieved 11% faster than the single stage reduction method and about 37% faster than baseline method |
|---|