Research on Intelligent Clustering Algorithm of High Dimension Power Dispatching Communication

2019 
Aiming at the poor robustness of traditional power dispatching communication data clustering algorithm an intelligent clustering algorithm for heterogeneous high-dimensional power dispatching communication data under explicit rank constraint is proposed. Through data cleaning, integration and matrix calculation, the rank of communication data matrix is obtained, and the preprocessing of communication data is completed. According to the explicit constraint of rank, the cluster of communication data is generated, and the threshold value and other parameters are set. After selecting the cluster heads according to the threshold value, select the same or small difference cluster heads according to the rank constraint to form the data cluster, and complete the intelligent clustering of the communication data. Through the comparison with the traditional clustering algorithm, the simulation results show that the proposed data clustering algorithm is nearly four times more robust and more advantageous than the traditional clustering algorithm.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    0
    References
    0
    Citations
    NaN
    KQI
    []