PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Berlingerio M., Bonchi F., Giannotti F. Towards Constraint-Based Subgraph Mining. In: Proceedings of the Fifteenth Italian Symposium on Advanced Database Systems, SEBD 2007 (Torre Canne (Fasano, BR), 17-20 June 2007). Atti, pp. 274 - 281. Michelangelo Ceci, Donato Malerba and Letizia Tanca (eds.). Sagraf S.r.l. - Z.I. Capurso (BA), 2007.
 
 
Abstract
(English)
The traditional motivations for constraint-based pattern mining, i.e., user-controlled focus in the mining process and gain in efficiency, are even stronger when dealing with graphs. On the one hand, mining graphs faces larger computational demands than itemsets or sequences, on the other hand, there are many application domains, such as cheminformatics or proteomics, where meaningful constraints naturally arise. Thus it is important to develop a framework for constraint-based graph mining, individuating properties of interesting constraints and developing adequate computational techniques. In this paper we first introduce a large variety of constraints on graphs and we show that they are all either anti-monotone or monotone; we then provide preliminary results on subgraph mining under a conjunction of these kinds of constraints.
Subject data mining
H.2.8 Database Applications


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional