732 search results - page 93 / 147 » Efficient Frequent Pattern Mining in Relational Databases |
KDD
1995
ACM
13 years 11 months ago
1995
ACM
The information age is characterizedby a rapid growth in the amountof information availablein electronicmedia. Traditional data handling methods are not adequate to cope with this...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
We present a family of algorithms to uncover tribes--groups of individuals who share unusual sequences of affiliations. While much work inferring community structure describes lar...
GCB
1997
Springer
13 years 12 months ago
1997
Springer
Motivation: Database search programs such as FASTA, BLAST or a rigorous Smith–Waterman algorithm produce lists of database entries, which are assumed to be related to the query....
BIBM
2007
IEEE
13 years 8 months ago
2007
IEEE
Clinical databases store large amounts of information about patients and their medical conditions. Data mining techniques can extract relationships and patterns holding in this we...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...