661 search results - page 88 / 133 » Scalable Parallel Data Mining for Association Rules |
PAKDD
2007
ACM
14 years 3 months ago
2007
ACM
When companies seek for the combination of products which can constantly generate high profit, the association rule mining (ARM) or the utility mining will not achieve such task. ...
JMLR
2008
13 years 9 months ago
2008
Closed sets have been proven successful in the context of compacted data representation for association rule learning. However, their use is mainly descriptive, dealing only with ...
PAKDD
2005
ACM
14 years 2 months ago
2005
ACM
We define sporadic rules as those with low support but high confidence: for example, a rare association of two symptoms indicating a rare disease. To find such rules using the w...
DIS
2008
Springer
13 years 10 months ago
2008
Springer
Frequent closures (FCIs) and generators (FGs) as well as the precedence relation on FCIs are key components in the definition of a variety of association rule bases. Although their...
DKE
2002
13 years 8 months ago
2002
We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suit...