clustering objects described by juxtaposition of binary data tables描述聚类对象并列的二进制数据表.pdfVIP

Hindawi Publishing Corporation Journal of Applied Mathematics and Decision Sciences Volume 2008, Article ID 125797, 13 pages doi:10.1155/2008/125797 Research Article Clustering Objects Described by Juxtaposition of Binary Data Tables Amar Rebbouh MSTD Laboratory, Faculty of Mathematics, University of Science and Technology-Houari Boumediene (USTHB), El Alia, BP 32, Algiers 16011, Algeria Correspondence should be addressed to Amar Rebbouh, arebbouh@yahoo.fr Received 3 April 2008; Revised 14 August 2008; Accepted 28 October 2008 Recommended by Khosrow Moshirvaziri This paper seeks to develop an allocation of 0/1 data matrices to physical systems upon a Kullback-Leibler distance between probability distributions. The distributions are estimated from the contents of the data matrices. We discuss an ascending hierarchical classification method, a numerical example and mention an application with survey data concerning the level of development of the departments of a given territory of a country. Copyright q 2008 Amar Rebbouh. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 1. Introduction The automatic classification of the components of a structure of multiple tables remains a vast field of research and investigation. The components are matrix objects, and the difficulty lies in the definition and the delicate choice of an index of distance between these objects see Lerman and Tallur 1. If the matrix objects are tables of measurements of the same dimension, we introduced in Rebbouh 2 an index of distance based on the inner product of Hilbert Schmidt and built a classification algorithm of k-means typ