Loading...

Using minimum matching for clustering with balancing constraints

Shirali Shahreza, S ; Sharif University of Technology | 2009

515 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/CCCM.2009.5270465
  3. Publisher: 2009
  4. Abstract:
  5. Clustering is a major task in data mining which is used in many applications. However, general clustering is inappropriate for many applications where some constraints should be applied. One category of these constraints is the cluster size constraint. In this paper, we propose a new algorithm for solving the clustering with balancing constraints by using the minimum matching. We compare our algorithm with the method proposed by Banerjee and Ghosh that uses stable matching and show that our algorithm converge to the final solution in fewer iterations. ©2009 IEEE
  6. Keywords:
  7. Balancing constraints ; Clustering ; Maximum matching ; Cluster sizes ; Maximum matchings ; Stable matching ; Computer science ; Graph theory ; Image retrieval ; Clustering algorithms
  8. Source: 2009 Second ISECS International Colloquium on Computing, Communication, Control, and Management, CCCM 2009, Sanya, 8 August 2009 through 9 August 2009 ; Volume 1 , 2009 , Pages 225-228 ; 9781424442461 (ISBN)
  9. URL: https://ieeexplore.ieee.org/document/5270465