118 search results - page 1 / 24 » Using an Interest Ontology for Improved Support in Rule Mini... |
DAWAK
2003
Springer
13 years 9 months ago
2003
Springer
Abstract. This paper describes the use of a concept hierarchy for improving the results of association rule mining. Given a large set of tuples with demographic information and per...
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...
KDD
1999
ACM
13 years 8 months ago
1999
ACM
Several algorithms have been proposed for finding the “best,” “optimal,” or “most interesting” rule(s) in a database according to a variety of metrics including confid...
PAKDD
2004
ACM
13 years 9 months ago
2004
ACM
GRD is an algorithm for k-most interesting rule discovery. In contrast to association rule discovery, GRD does not require the use of a minimum support constraint. Rather, the user...
DIS
2006
Springer
13 years 6 months ago
2006
Springer
Abstract. One important challenge in data mining is to extract interesting knowledge and useful information for expert users. Since data mining algorithms extracts a huge quantity ...