Hierarchical Discriminant Analysis.

Area of Science:

• Machine Learning
• Data Science
• Computer Vision

Background:

• Internet of Things (IoT) data is high-dimensional and challenging to process.
• Existing subspace learning algorithms struggle with bias caused by inter-class and intra-class distance discrepancies.
• Overwhelmed intra-class distance impacts the effectiveness of dimensionality reduction.

Purpose of the Study:

• To propose a novel algorithm, Hierarchical Discriminant Analysis (HDA), for effective subspace learning.
• To address and balance the bias issue in transforming high-dimensional data to a low-dimensional space.
• To enhance the performance of dimensionality reduction techniques for intelligent data.

Main Methods:

• Developed Hierarchical Discriminant Analysis (HDA), a new subspace learning algorithm.
• HDA prioritizes minimizing the sum of intra-class distances.
• Subsequently, HDA maximizes the sum of inter-class distances to balance data representation.

Main Results:

• Extensive experiments were conducted on benchmark face datasets.
• HDA demonstrated superior performance compared to existing dimensionality reduction algorithms.
• The proposed method effectively balances inter-class and intra-class distance biases.

Conclusions:

• Hierarchical Discriminant Analysis (HDA) offers an improved approach to subspace learning for high-dimensional data.
• HDA effectively mitigates bias issues, leading to better data processing outcomes.
• The algorithm shows significant potential for applications in data visualization and classification.