Hierarchical clustering using K-Iterations Fast Learning Artificial Neural Networks (KFLANN)

• Main Author: Wong, Lai Ping
• Other Authors: Xu Jian
• Format: Theses and Dissertations
• Published: 2008
• Subjects: DRNTU::Engineering::Computer science and engineering::Computing methodologies::Artificial intelligence
• Online Access: https://hdl.handle.net/10356/2530
• Institution: Nanyang Technological University

Hierarchical clustering using hybrid learning model of KFLANN and Multilayer Perceptron with Backpropagation learning algorithm (MLP-BP) is proposed to address high dimensional classification problems. K-Iterations Fast Learning Artificial Neural Network (KFLANN) was enhanced to tackle the sensitivity of clustering against Data Presentation Sequence. Number of cluster is not required prior clustering process for KFLANN clustering algorithm. Data driven scheme is used to define network parameters and only small number of iterations is needed for the algorithm to converge. The KFLANN tends to cumbersome when feature dimensionality is large. HieFLANN and HieFLANN-BP were proposed to avoid this cumbersome. Hierarchical network made up of KFLANN (HieFLANN) was developed to address the limitation of KFLANN in handling large dimensionality problem set. HieFLANN performs clustering and data transformation within a single model. Data transformation adopts canonical covariance concept. HieFLANN only perform classical clustering on a given problem set, thus it lacks of generalization ability. HieFLANN-BP with hybrid learning model as its subunits was build to tackle this issue. It inherits generalization capability from the MLP-BP. Performance of a learning system tends to drop when portion of irrelevant information increases. Feature selection scheme based on purity and relevance (PURE) was proposed to filter irrelevant information.