A frequently recurring problem in several applications is to compare two or more data sets and evaluate the level of similarity. In this paper we describe a technique to compare two data partitions of different data sets. The comparison is obtained by means of matrices called Graph Adjacency Matrices which represent the data sets. Then, a match coefficient returns an estimation of the level of similarity between the data sets.
Graph Adjacency Matrix Associated with a Data Partition / Acciani, Giuseppe; G., Fornarelli; L., Liturri. - LNCS 3044:(2004), pp. 979-987. (Intervento presentato al convegno International Conference on Computational Science and Its Applications, ICSSA 2004 tenutosi a Assisi, Italy nel May 14-17, 2004).
Graph Adjacency Matrix Associated with a Data Partition
ACCIANI, Giuseppe;
2004-01-01
Abstract
A frequently recurring problem in several applications is to compare two or more data sets and evaluate the level of similarity. In this paper we describe a technique to compare two data partitions of different data sets. The comparison is obtained by means of matrices called Graph Adjacency Matrices which represent the data sets. Then, a match coefficient returns an estimation of the level of similarity between the data sets.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
