282 search results - page 38 / 57 » Generating non-redundant association rules |
CONCUR
2003
Springer
15 years 2 months ago
2003
Springer
We propose an algorithm for generating a Priority Rewrite System (PRS) for an arbitrary process language in the OSOS format such that rewriting of process terms is sound for bisim...
KDD
1999
ACM
15 years 1 months ago
1999
ACM
We present an efficient algorithm (UWEP) for updating large itemsets when new transactions are added to the set of old transactions. UWEP employs a dynamic lookahead strategy in u...
CEC
2008
IEEE
14 years 9 months ago
2008
IEEE
Given the great amount of data that are generated of the experiments to analyze information of extracted chemical fluids of the brain of a rodent, arises the necessity to design an...
ECAI
1992
Springer
15 years 1 months ago
1992
Springer
We consider non-Horn Deductive Data Bases (DDB) represented in a First Order language without function symbols. In this context the DDB is an incomplete description of the world. ...
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
The firing rule of Petri nets relies on a residuation operation for the commutative monoid of natural numbers. We identify a class of residuated commutative monoids, called Petri ...