28 search results - page 3 / 6 » Efficient Incremental Mining of Top-K Frequent Closed Itemse... |
ICDM
2006
IEEE
13 years 11 months ago
2006
IEEE
High dimensionality remains a significant challenge for document clustering. Recent approaches used frequent itemsets and closed frequent itemsets to reduce dimensionality, and to...
IDA
2009
Springer
13 years 3 months ago
2009
Springer
Abstract. The effective construction of many association rule bases requires the computation of both frequent closed and frequent generator itemsets (FCIs/FGs). However, only few m...
AAAI
2006
13 years 6 months ago
2006
The generators and the unique closed pattern of an equivalence class of itemsets share a common set of transactions. The generators are the minimal ones among the equivalent items...
JIIS
2010
13 years 6 days ago
2010
The discovery of frequent patterns is a famous problem in data mining. While plenty of algorithms have been proposed during the last decade, only a few contributions have tried to ...
SDM
2004
SIAM
13 years 6 months ago
2004
SIAM
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...