Hierarchical multi-stage dimensional reduction based on feature hashing and bi-filtering strategy for large-scale text classification

Ado, Abubakar (2023) Hierarchical multi-stage dimensional reduction based on feature hashing and bi-filtering strategy for large-scale text classification. Doctoral thesis, Universiti Tun Hussein Onn Malaysia.

	Text 24p ABUBAKAR ADO.pdf Download (1MB)
	Text (Copyright Declaration) ABUBAKAR ADO COPYRIGTH DECLARATION.pdf Restricted to Repository staff only Download (763kB) | Request a copy
	Text (Full Text) ABUBAKAR ADO WATERMARK.pdf Restricted to Registered users only Download (3MB) | Request a copy

Abstract

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.

Item Type:	Thesis (Doctoral)
Subjects:	T Technology > T Technology (General)
Divisions:	Faculty of Computer Science and Information Technology > Department of Information Security
Depositing User:	Mrs. Sabarina Che Mat
Date Deposited:	13 May 2024 07:02
Last Modified:	13 May 2024 07:02
URI:	http://eprints.uthm.edu.my/id/eprint/10813

Actions (login required)

View Item