Sciweavers

Share
9 search results - page 1 / 2
» A New Concise Representation of Frequent Patterns through Di...
Sort
View
CLA
2007
8 years 7 months ago
A New Concise Representation of Frequent Patterns through Disjunctive Search Space
The interest in a further pruning of the set of frequent patterns that can be drawn from real-life datasets is growing up. In fact, it is a quite survival reflex towards providing...
Tarek Hamrouni, Islem Denden, Sadok Ben Yahia, Eng...
KAIS
2008
114views more  KAIS 2008»
8 years 6 months ago
A new concise representation of frequent itemsets using generators and a positive border
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representat...
Guimei Liu, Jinyan Li, Limsoon Wong
KDD
2002
ACM
189views Data Mining» more  KDD 2002»
9 years 6 months ago
Sequential PAttern mining using a bitmap representation
We introduce a new algorithm for mining sequential patterns. Our algorithm is especially efficient when the sequential patterns in the database are very long. We introduce a novel...
Jay Ayres, Jason Flannick, Johannes Gehrke, Tomi Y...
KDD
2006
ACM
228views Data Mining» more  KDD 2006»
9 years 6 months ago
Algorithms for time series knowledge mining
Temporal patterns composed of symbolic intervals are commonly formulated with Allen's interval relations originating in temporal reasoning. This representation has severe dis...
Fabian Mörchen
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
9 years 6 months ago
Efficient closed pattern mining in the presence of tough block constraints
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
Krishna Gade, Jianyong Wang, George Karypis
books