960 search results - page 29 / 192 » CURE: An Efficient Clustering Algorithm for Large Databases |
169
click to vote
KDD
2004
ACM
15 years 9 months ago
2004
ACM
Using SQL has not been considered an efficient and feasible way to implement data mining algorithms. Although this is true for many data mining, machine learning and statistical a...
117
click to vote
KDD
2004
ACM
16 years 3 months ago
2004
ACM
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...
232
Voted
ICDE
2004
IEEE
16 years 4 months ago
2004
IEEE
Mining sequential patterns in large databases is an important research topic. The main challenge of mining sequential patterns is the high processing cost due to the large amount ...
166
Voted
KDD
2004
ACM
16 years 3 months ago
2004
ACM
Many real life sequence databases, such as customer shopping sequences, medical treatment sequences, etc., grow incrementally. It is undesirable to mine sequential patterns from s...
133
Voted
IDEAL
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we present PRICES, an efficient algorithm for mining association rules, which first identifies all large itemsets and then generates association rules. Our approach ...