Mining Constrained Graphs: The Case of Workflow Systems (Contributo in volume (capitolo o saggio))

Type
Label
  • Mining Constrained Graphs: The Case of Workflow Systems (Contributo in volume (capitolo o saggio)) (literal)
Anno
  • 2006-01-01T00:00:00+01:00 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
  • 10.1007/11615576_8 (literal)
Alternative label
  • Gianluigi Greco; Antonella Guzzo; Giuseppe Manco; Luigi Pontieri; Domenico Saccà (2006)
    Mining Constrained Graphs: The Case of Workflow Systems
    in Constraint-Based Mining and Inductive Databases, 2006
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Gianluigi Greco; Antonella Guzzo; Giuseppe Manco; Luigi Pontieri; Domenico Saccà (literal)
Pagina inizio
  • 155 (literal)
Pagina fine
  • 171 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#url
  • http://www.springerlink.com/content/n868l0p13647gv0q/fulltext.pdf (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#titoloVolume
  • Constraint-Based Mining and Inductive Databases (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#volumeInCollana
  • 3848 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#pagineTotali
  • 12 (literal)
Note
  • ISI Web of Science (WOS) (literal)
  • Google Scholar (literal)
  • Scopu (literal)
  • DBLP (literal)
  • Science direct - Elsevier (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • Department of Mathematics, University of Calabria, Italy; ICAR, CNR, Italy; ICAR, CNR, Italy; ICAR, CNR, Italy + Dept. DEIS, University of Calabria, Italy. (literal)
Titolo
  • Mining Constrained Graphs: The Case of Workflow Systems (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#isbn
  • 3-540-31331-1 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#curatoriVolume
  • Jean-François Boulicaut; Luc De Raedt; Heikki Mannila (literal)
Abstract
  • Constrained graphs are directed graphs describing the control flow of processes models. In such graphs, nodes represent activities involved in the process, and edges the precedence relationship among such activities. Typically, nodes and edges can specify some constraints, which control the interaction among the activities. Faced with the above features constrained graphs are widely used in the modelling and analysis of Workflow processes. In this paper we overview two mining problems related to the analysis of constrained graphs, namely the analysis of frequent patterns of execution, and the induction of a constrained graph from a set of execution traces. We discuss some complexity aspects related to the problem of reasoning and mining on constrained graphs, and overview two algorithms for the mentioned problems. (literal)
Prodotto di
Autore CNR

Incoming links:


Prodotto
Autore CNR di
data.CNR.it