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.
|Titolo:||Graph Adjacency Matrix Associated with a Data Partition|
|Data di pubblicazione:||2004|
|Nome del convegno:||International Conference on Computational Science and Its Applications, ICSSA 2004|
|Appare nelle tipologie:||4.1 Contributo in Atti di convegno|