On the enhanced multi-membership clustering Quasi-Clique Merger algorithm Conference

Fuller, E, Tang, W, Wu, Y et al. (2012). On the enhanced multi-membership clustering Quasi-Clique Merger algorithm . 244-248. 10.1109/ICSAI.2012.6223558

cited authors

  • Fuller, E; Tang, W; Wu, Y; Zhang, CQ

authors

abstract

  • In this paper, we survey three enhanced versions of the Quasi-Clique Merger (QCM) algorithm for clustering data sets. By assigning a graphical structure to a data set, we cluster the underlying data by analyzing the graph and identifying dense subgraphs. In the current work we outline three variations of the QCM algorithm and illustrate their effectiveness on example data sets. © 2012 IEEE.

publication date

  • July 30, 2012

Digital Object Identifier (DOI)

International Standard Book Number (ISBN) 13

start page

  • 244

end page

  • 248