99 search results - page 12 / 20 » Discovering Multi-head Attributional Rules in Large Database... |
ICTAI
2003
IEEE
15 years 5 months ago
2003
IEEE
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
90
Voted
PODS
2001
ACM
15 years 12 months ago
2001
ACM
Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape g...
113
click to vote
FLAIRS
2010
15 years 2 months ago
2010
Nowadays, graph-based knowledge discovery algorithms do not consider numeric attributes (they are discarded in the preprocessing step, or they are treated as alphanumeric values w...
105
click to vote
DKE
2007
14 years 11 months ago
2007
A well-known problem that limits the practical usage of association rule mining algorithms is the extremely large number of rules generated. Such a large number of rules makes the...
102
click to vote
BMCBI
2006
14 years 11 months ago
2006
Background: There has been an explosion in the number of single nucleotide polymorphisms (SNPs) within public databases. In this study we focused on non-synonymous protein coding ...