In many application domains, the amount of available data increased so much that humans need help from automatic computerized methods for extracting relevant information. Moreover, it is becoming more and more common to store data that possess inherently structural or relational characteristics. These types of data are best represented by graphs, which can very naturally represent entities, their attributes, and their relationships to other entities. In this article, we review the state of the art in graph mining, and we present advances in processing trees and graphs by two Computational Intelligence classes of methods, namely Neural Networks and Kernel Methods.
Mining Structured Data
DA SAN MARTINO, GIOVANNI;SPERDUTI, ALESSANDRO
2010
Abstract
In many application domains, the amount of available data increased so much that humans need help from automatic computerized methods for extracting relevant information. Moreover, it is becoming more and more common to store data that possess inherently structural or relational characteristics. These types of data are best represented by graphs, which can very naturally represent entities, their attributes, and their relationships to other entities. In this article, we review the state of the art in graph mining, and we present advances in processing trees and graphs by two Computational Intelligence classes of methods, namely Neural Networks and Kernel Methods.Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.