In this paper we describe a technique to compare two data partitions of two different data sets as frequently occurs in defect detection. The comparison is obtained dividing each data set in partitions by means of an unsupervised neural network and associating an undirected complete weighted graph structure to these partitions. Then, a graph matching operation returns an estimation of the level of similarity between the data sets.

Unsupervised NN and Graph Matching Approach to Compare Data Sets

G. Acciani;G. Fornarelli;Liturri, Luciano
2004

Abstract

In this paper we describe a technique to compare two data partitions of two different data sets as frequently occurs in defect detection. The comparison is obtained dividing each data set in partitions by means of an unsupervised neural network and associating an undirected complete weighted graph structure to these partitions. Then, a graph matching operation returns an estimation of the level of similarity between the data sets.
IEEE International Joint Conference on Neural Networks, IJCNN 04
0-7803-8359-1
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11589/21567
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact