960 search results - page 136 / 192 » CURE: An Efficient Clustering Algorithm for Large Databases |
124
click to vote
KDD
2002
ACM
16 years 4 months ago
2002
ACM
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
140
Voted
IPMI
2005
Springer
16 years 4 months ago
2005
Springer
Abstract. In this paper, we propose an original and efficient tree matching algorithm for intra-patient hepatic vascular system registration. Vascular systems are segmented from CT...
114
click to vote
FLAIRS
2001
15 years 5 months ago
2001
When constructing a Bayesian network, it can be advantageous to employ structural learning algorithms to combine knowledge captured in databases with prior information provided by...
147
click to vote
TCSV
2008
15 years 3 months ago
2008
Recurring events are short temporal patterns that consist of multiple instances in the target database. Without any a priori knowledge of the recurring events, in terms of their le...
169
click to vote
ICDE
2011
IEEE
14 years 7 months ago
2011
IEEE
— The study of skylines and their variants has received considerable attention in recent years. Skylines are essentially sets of most interesting (undominated) tuples in a databa...