Affiliations: [a] College of Computer and Information Engineering, Xiamen University of Technology, Xiamen, China
| [b] College of Economics and Management, Xiamen University of Technology, Xiamen, China
Correspondence:
[*]
Corresponding author. Hailiang Jiang, College of Computer and Information Engineering, Xiamen University of Technology, Xiamen 361024, China. E-mail: 1348284274@qq.com.
Abstract: Learning Vector Quantization (LVQ) is a clustering method with supervised information, simple structures, and powerful functions. LVQ assumes that the data samples are labeled, and the learning process uses labels to assist clustering. However, the LVQ is sensitive to initial values, resulting in a poor clustering effect. To overcome these shortcomings, a granular LVQ clustering algorithm is proposed by adopting the neighborhood granulation technology and the LVQ. Firstly, the neighborhood granulation is carried out on some features of a sample of the data set, then a neighborhood granular vector is formed. Furthermore, the size and operations of neighborhood granular vectors are defined, and the relative and absolute granular distances between granular vectors are proposed. Finally, these granular distances are proved to be metrics, and a granular LVQ clustering algorithm is designed. Some experiments are tested on several UCI data sets, and the results show that the granular LVQ clustering is better than the traditional LVQ clustering under suitable neighborhood parameters and distance measurement.
