In [3] it was demonstrated for the first time that crossing minimization of bipartite graphs can be used to perform unsupervised clustering. In this paper, we will present the detailed analysis of the bipartite graph model used to perform unsupervised clustering as in [1, 2, 3]. We will also discuss the effect of data discretization, followed by simulation results demonstrating the noise immunity of the technique.
展开▼
