About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
SDM 2004
Conference paper
IFD: Iterative feature and data clustering
Abstract
In this paper, we propose a new clustering algorithm, IFD1, based on a cluster model of data coefficients D and feature coefficients F, The coefficients denote the degree (or weights) of the data and features associated with the clusters. Clustering is performed via an iterative optimization procedure to mutually reinforce the relationships between the coefficients. The mutually reinforcing optimization exploits the duality of the data and features and enable a simultaneous clustering of both data and features. We have shown the convergence property of the clustering algorithm and discussed its connections with various existential approaches. Extensive experimental results on both synthetic and real data sets : show the effectiveness of IFD algorithm.