106 search results - page 1 / 22 » Finding Interesting Associations without Support Pruning |
ICDE
2000
IEEE
14 years 5 months ago
2000
IEEE
SIGMOD
2004
ACM
14 years 4 months ago
2004
ACM
Microarray datasets typically contain large number of columns but small number of rows. Association rules have been proved to be useful in analyzing such datasets. However, most e...
JIS
2006
13 years 4 months ago
2006
In recent years, the weakness of the canonical support-confidence framework for associations mining has been widely studied. One of the difficulties in applying association rules ...
ICDE
2004
IEEE
14 years 5 months ago
2004
IEEE
Mining sequential patterns in large databases is an important research topic. The main challenge of mining sequential patterns is the high processing cost due to the large amount ...
ICDE
2000
IEEE
14 years 5 months ago
2000
IEEE
Dynamic Miss-Countingalgorithms are proposed, which find all implication and similarity rules with confidence pruning but without support pruning. To handle data sets with a large...