Study of clustering algorithm based on model data

Clustering technique is a key tool in data mining and pattern recognition. Usually, objects for some traditional clustering algorithms are expressed in the form of vectors, which consist of some components to be described as features. However, objects in real tasks may be some models which are clustered other than data points, for example! neural networks, decision trees, support vector machines, etc. This paper studies the clustering algorithm based on model data. By defining the extended measure, clustering methods are studied for the abstract data objects. Framework of clustering algorithm for models is presented. To validate the effectiveness of models clustering algorithm, we choose the hierarchical model clustering algorithm in the experiments. Models in clustering algorithm are BP(Back Propagation) neural networks and learning method is BP algorithm. Measures are chosen as both same-fault measure and double-fault measure for pairwise of models. Distances between clusters are the single link and the complete link, respectively. By this way, we may obtain part of neural network models which are from each cluster and improve diversity of neural network models. Then, part of models is ensembled. Moreover, we also study the relations between the number of clusters in clustering analysis, the size of ensemble learning, and performance of ensemble learning by experiments. Experimental results show that performance of ensemble learning by choosing part of models using clustering of models is improved.