388 search results - page 27 / 78 » Mining Frequent Itemsets Using Support Constraints |
SAC
2010
ACM
14 years 3 months ago
2010
ACM
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...
ICDE
2003
IEEE
14 years 10 months ago
2003
IEEE
The output of boolean association rule mining algorithms is often too large for manual examination. For dense datasets, it is often impractical to even generate all frequent items...
KDID
2004
13 years 10 months ago
2004
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
DATAMINE
2008
13 years 8 months ago
2008
Abstract. In this paper we aim at extending the non-derivable condensed representation in frequent itemset mining to sequential pattern mining. We start by showing a negative examp...
DAWAK
2009
Springer
14 years 18 days ago
2009
Springer
Since transaction identifiers (ids) are unique and would not usually be frequent, mining frequent patterns with transaction ids, showing records they occurred in, provides an effic...