Bipartite Graph Partitioning for Data Clustering: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 02:4602:46, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,911 bytes +1,911‎ Created page with "Title: Bipartite Graph Partitioning for Data Clustering Abstract: This research proposes a new data clustering method based on partitioning a bipartite graph. The partition is constructed by minimizing the normalized sum of edge weights between unmatched pairs of vertices. The algorithm uses a partial singular value decomposition (SVD) to approximate the solution. The study connects the clustering algorithm to correspondence analysis in multivariate analysis and discuss..."
Retrieved from "https://simplesci.org/wiki/Bipartite_Graph_Partitioning_for_Data_Clustering"