282 search results - page 18 / 57 » Generating non-redundant association rules |
SIGMOD
1997
ACM
15 years 1 months ago
1997
ACM
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...
134
click to vote
BMCBI
2006
14 years 9 months ago
2006
Background: The number of sequences compiled in many genome projects is growing exponentially, but most of them have not been characterized experimentally. An automatic annotation...
APIN
2006
14 years 9 months ago
2006
It is not an easy task to know a priori the most appropriate fuzzy sets that cover the domains of quantitative attributes for fuzzy association rules mining. In general, it is unre...
98
Voted
BMCBI
2006
14 years 9 months ago
2006
Background: Microarray technology is generating huge amounts of data about the expression level of thousands of genes, or even whole genomes, across different experimental conditi...
SIGMOD
2004
ACM
15 years 9 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...