732 search results - page 51 / 147 » Efficient Frequent Pattern Mining in Relational Databases |
KDD
2002
ACM
14 years 8 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...
PKDD
2005
Springer
14 years 1 months ago
2005
Springer
Considering the characteristics of biological sequence databases, which typically have a small alphabet, a very long length and a relative small size (several hundreds of sequences...
TKDE
2008
13 years 7 months ago
2008
In this paper, we present a new tree mining algorithm, DRYADEPARENT, based on the hooking principle first introduced in DRYADE. In the experiments, we demonstrate that the branchin...
DASFAA
2005
IEEE
14 years 1 months ago
2005
IEEE
Recently, several approaches that mine frequent XML query patterns and cache their results have been proposed to improve query response time. However, frequent XML query patterns m...
KDD
1995
ACM
13 years 11 months ago
1995
ACM
Data mining or knowledge discovery in databasesis the search for relationships and global patterns that exist but are hidden in large databases.Many different methodshave been pro...