Sciweavers

1217 search results - page 135 / 244
» On compressing frequent patterns
Sort
View
DAWAK
2000
Springer
15 years 8 months ago
Data Mining Support in Database Management Systems
Abstract. The most popular data mining techniques consist in searching databases for frequently occurring patterns, e.g. association rules, sequential patterns. We argue that in co...
Tadeusz Morzy, Marek Wojciechowski, Maciej Zakrzew...
APSEC
1997
IEEE
15 years 8 months ago
Using Extended Event Traces to Describe Communication in Software Architectures
A crucial aspect of the architecture of a software system is its decomposition into components and the specification of component interactions. In this report we use a variant of...
Manfred Broy, Christoph Hofmann, Ingolf Krüge...
137
Voted
KDD
1998
ACM
105views Data Mining» more  KDD 1998»
15 years 8 months ago
PlanMine: Sequence Mining for Plan Failures
This paper presents the PLANMINE sequence mining algorithm to extract patterns of events that predict failures in databases of plan executions. New techniques were needed because ...
Mohammed Javeed Zaki, Neal Lesh, Mitsunori Ogihara
FIMI
2004
212views Data Mining» more  FIMI 2004»
15 years 5 months ago
A Space Optimization for FP-Growth
Frequency mining problem comprises the core of several data mining algorithms. Among frequent pattern discovery algorithms, FP-GROWTH employs a unique search strategy using compac...
Eray Özkural, Cevdet Aykanat
ENTCS
2008
73views more  ENTCS 2008»
15 years 4 months ago
Invariants for Non-Hierarchical Object Structures
We present a Hoare-style specification and verification approach for invariants in sequential OO programs. It allows invariants over nonhierarchical object structures, in which upd...
Ronald Middelkoop, Cornelis Huizing, Ruurd Kuiper,...