Abstract

According to the selection difficulties of initial clustering center of k-means clustering algorithm, this paper proposes a method that is to use complex network degree to improve k-means clustering algorithm for fault pattern recognition method, and to improve the accuracy of clustering. Use network to represent fault data structure, with joint connecting matrix to express similarity between nodes, according to the complex concepts of networks degree, calculate the size of every node degree, and select the maximum degree of node as k-means clustering initial center. This method is applied to the rolling bearing clustering diagnosis example, achieving good fault diagnosis effect. This study provides a new method for the selection of initial cluster centers of K-means clustering.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.