Sciweavers

41 search results - page 2 / 9
» A Breadth-First Algorithm for Mining Frequent Patterns from ...
Sort
View
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
14 years 5 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
KDD
2009
ACM
160views Data Mining» more  KDD 2009»
13 years 11 months ago
Clustering event logs using iterative partitioning
The importance of event logs, as a source of information in systems and network management cannot be overemphasized. With the ever increasing size and complexity of today’s even...
Adetokunbo Makanju, A. Nur Zincir-Heywood, Evangel...
GFKL
2007
Springer
184views Data Mining» more  GFKL 2007»
13 years 8 months ago
FSMTree: An Efficient Algorithm for Mining Frequent Temporal Patterns
Research in the field of knowledge discovery from temporal data recently focused on a new type of data: interval sequences. In contrast to event sequences interval sequences contai...
Steffen Kempe, Jochen Hipp, Rudolf Kruse
MLDM
2009
Springer
13 years 11 months ago
Relational Frequent Patterns Mining for Novelty Detection from Data Streams
We face the problem of novelty detection from stream data, that is, the identification of new or unknown situations in an ordered sequence of objects which arrive on-line, at cons...
Michelangelo Ceci, Annalisa Appice, Corrado Loglis...
CORR
2010
Springer
186views Education» more  CORR 2010»
13 years 5 months ago
Significant Interval and Frequent Pattern Discovery in Web Log Data
There is a considerable body of work on sequence mining of Web Log Data We are using One Pass frequent Episode discovery (or FED) algorithm, takes a different approach than the tr...
Kanak Saxena, Rahul Shukla