基于二部图的快速聚类算法

Spectral clustering algorithm can effectively learn the data manifold distribution and non-convex distribution of data.However, the spectral clustering process which involves the graph construction and eigen-decomposition has the high computational complexity. It is difficult to apply the spectral clustering to deal with the large-scale data directly.The fast clustering based on bipartite graph (FCBG) algorithm reduces the size of original data structure by using the sampling method and learns the relationship between the selection data and original data. The algorithm can optimize the weights of bipartite graph edge mean while maintaining the cluster structure of bipartite graph. The computational complexity of proposed algorithm increases linearly with the increase of data size. The experimental analysis shows that the algorithm can effectively learn the data relationship and obtain the better clustering results with less time consumption.