Hierarchical Discriminant Analysis
AbstractThe Internet of Things (IoT) generates lots of high-dimensional sensor intelligent data. The processing of high-dimensional data (e.g., data visualization and data classification) is very difficult, so it requires excellent subspace learning algorithms to learn a latent subspace to preserve the intrinsic structure of the high-dimensional data, and abandon the least useful information in the subsequent processing. In this context, many subspace learning algorithms have been presented. However, in the process of transforming the high-dimensional data into the low-dimensional space, the huge difference between the sum of inter-class distance and the sum of intra-class distance for distinct data may cause a bias problem. That means that the impact of intra-class distance is overwhelmed. To address this problem, we propose a novel algorithm called Hierarchical Discriminant Analysis (HDA). It minimizes the sum of intra-class distance first, and then maximizes the sum of inter-class distance. This proposed method balances the bias from the inter-class and that from the intra-class to achieve better performance. Extensive experiments are conducted on several benchmark face datasets. The results reveal that HDA obtains better performance than other dimensionality reduction algorithms. View Full-Text
Share & Cite This Article
Lu, D.; Ding, C.; Xu, J.; Wang, S. Hierarchical Discriminant Analysis. Sensors 2018, 18, 279.
Lu D, Ding C, Xu J, Wang S. Hierarchical Discriminant Analysis. Sensors. 2018; 18(1):279.Chicago/Turabian Style
Lu, Di; Ding, Chuntao; Xu, Jinliang; Wang, Shangguang. 2018. "Hierarchical Discriminant Analysis." Sensors 18, no. 1: 279.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.