917 search results - page 94 / 184 » Mining interesting sets and rules in relational databases |
KDD
2002
ACM
15 years 10 months ago
2002
ACM
Text clustering methods can be used to structure large sets of text or hypertext documents. The well-known methods of text clustering, however, do not really address the special p...
DAWAK
2001
Springer
15 years 2 months ago
2001
Springer
Data mining has been defined as the non- trivial extraction of implicit, previously unknown and potentially useful information from data. Association mining is one of the important...
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
Recently there has been increasing interest in the problem of transfer learning, in which the typical assumption that training and testing data are drawn from identical distributi...
KDD
1998
ACM
15 years 2 months ago
1998
ACM
In many data mining problems the definition of what structures in the database are to be regarded as interesting or valuable is given only loosely. Typically this is regarded as a...
NAR
2007
14 years 9 months ago
2007
The PEDANT genome database provides exhaustive annotation of 468 genomes by a broad set of bioinformatics algorithms. We describe recent developments of the PEDANT Web server. The...