Sciweavers

299 search results - page 28 / 60
» Implicit Enumeration of Patterns
Sort
View
EDBT
2011
ACM
199views Database» more  EDBT 2011»
13 years 1 months ago
Finding closed frequent item sets by intersecting transactions
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
Christian Borgelt, Xiaoyuan Yang, Rubén Nog...
DAWAK
2004
Springer
14 years 1 months ago
PROWL: An Efficient Frequent continuity Mining Algorithm on Event Sequences
Mining association rule in event sequences is an important data mining problem with many applications. Most of previous studies on association rules are on mining intra-transaction...
Kuo-Yu Huang, Chia-Hui Chang, Kuo-Zui Lin
EJC
2010
13 years 10 months ago
A q-enumeration of alternating permutations
A classical result of Euler states that the tangent numbers are an alternating sum of Eulerian numbers. A dual result of Roselle states that the secant numbers can be obtained by a...
Matthieu Josuat-Vergès
STACS
2010
Springer
14 years 4 months ago
Planar Subgraph Isomorphism Revisited
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
Frederic Dorn
SSS
2009
Springer
163views Control Systems» more  SSS 2009»
14 years 4 months ago
Developing Autonomic and Secure Virtual Organisations with Chemical Programming
This paper studies the development of autonomic and secure Virtual Organisations (VOs) when following the chemical-programming paradigm. We have selected the Higher-Order Chemical ...
Alvaro E. Arenas, Jean-Pierre Banâtre, Thier...