Dependency of Constrained Clustering of Transaction Data on Known Data Distribution

Abstract

Most well-known partitioning clustering algorithms adopt an iterative procedure to converge to the stable status. One problem is that the quality of clustering and execution time is especially sensitive to initial conditions (e.g. initial cluster centers and cluster number). In addition, the method used to measure similarity between two transaction data is… (More)
DOI: 10.1109/CEC-EEE.2007.38

6 Figures and Tables

Topics

  • Presentations referencing similar topics