Sciweavers

2103 search results - page 408 / 421
» Approximate Learning of Dynamic Models
Sort
View
FOSSACS
2005
Springer
14 years 4 months ago
Branching Cells as Local States for Event Structures and Nets: Probabilistic Applications
We study the concept of choice for true concurrency models such as prime event structures and safe Petri nets. We propose a dynamic variation of the notion of cluster previously in...
Samy Abbes, Albert Benveniste
BIS
2009
154views Business» more  BIS 2009»
14 years 22 hour ago
Using Process Mining to Generate Accurate and Interactive Business Process Maps
Abstract. The quality of today's digital maps is very high. This allows for new functionality as illustrated by modern car navigation systems (e.g., TomTom, Garmin, etc.), Goo...
Wil M. P. van der Aalst
IJFCS
2006
130views more  IJFCS 2006»
13 years 11 months ago
Mealy multiset automata
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
Gabriel Ciobanu, Viorel Mihai Gontineac
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
14 years 11 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
ATAL
2004
Springer
14 years 4 months ago
Adaptive Information Infrastructures for the e-Society
Abstract. Positioned at the confluence between human/machine and hardware/software integration and backed by a solid proof of concept realized through several scenarios encompassin...
Mihaela Ulieru