960 search results - page 113 / 192 » CURE: An Efficient Clustering Algorithm for Large Databases |
128
Voted
CVPR
2000
IEEE
16 years 6 months ago
2000
IEEE
There has recently been significant interest in using repions based on abstractions of Blum's skeleton into a graph, for qualitative shape matching. The application of these ...
128
Voted
DAWAK
2005
Springer
15 years 9 months ago
2005
Springer
This paper proposes the compression of data in Relational Database Management Systems (RDBMS) using existing text compression algorithms. Although the technique proposed is general...
262
click to vote
ICDE
2009
IEEE
16 years 5 months ago
2009
IEEE
Information extraction from text databases is a useful paradigm to populate relational tables and unlock the considerable value hidden in plain-text documents. However, information...
224
Voted
VLDB
2008
ACM
16 years 4 months ago
2008
ACM
In this paper we present extended definitions of k-anonymity and use them to prove that a given data mining model does not violate the k-anonymity of the individuals represented in...
224
Voted
SIGMOD
2008
ACM
16 years 4 months ago
2008
ACM
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...