Block clustering of contingency table and mixture model

  • Authors:
  • Mohamed Nadif;Gérard Govaert

  • Affiliations:
  • LITA EA3097, Université de Metz, Metz, France;HEUDIASYC, UMR CNRS 6599, Université de Technologie de Compiègne, Compiègne Cedex, France

  • Venue:
  • IDA'05 Proceedings of the 6th international conference on Advances in Intelligent Data Analysis
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Block clustering or simultaneous clustering has become an important challenge in data mining context. It has practical importance in a wide of variety of applications such as text, web-log and market basket data analysis. Typically, the data that arises in these applications is arranged as a two-way contingency or co-occurrence table. In this paper, we embed the block clustering problem in the mixture approach. We propose a Poisson block mixture model and adopting the classification maximum likelihood principle we perform a new algorithm. Simplicity, fast convergence and scalability are the major advantages of the proposed approach.