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. © Springer-Verlag 2004.
Cite
CITATION STYLE
Acciani, G., Fornarelli, G., & Liturri, L. (2004). Graph Adjacency Matrix Associated with a Data Partition. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3044, 979–987. https://doi.org/10.1007/978-3-540-24709-8_103
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
