Graph Partition Based on Dimensionless Similarity and Its Application to Fault Diagnosis

In order to improve the efficiency of fault diagnosis, a novel granular computing algorithm is developed to reduce computational cost. It is realized by extracting and partitioning on the complete graphs, and in the process of graph generation, the dimensionless similarity method is proposed to overcome the influence of attributes with different dimensions. So, the algorithm is named graph partition based on dimensionless similarity (GPDS). Moreover, similarity threshold determination method based on frequency distribution histogram is proposed to reduce the dependency on the experiences of experts. Finally, different characteristic data are applied to verify the theories. The experimental results indicate that the compressed training samples can maintain the classification accuracy. Furthermore, the elapsed time can be obviously reduced. Therefore, the GPDS method can be used in fault diagnosis properly.