340 search results - page 17 / 68 » Clustering with Lower Bound on Similarity |
SSDBM
2010
IEEE
15 years 2 months ago
2010
IEEE
With the growing focus on semantic searches and interpretations, an increasing number of standardized vocabularies and ontologies are being designed and used to describe data. We ...
101
click to vote
KDD
2012
ACM
12 years 12 months ago
2012
ACM
Most time series data mining algorithms use similarity search as a core subroutine, and thus the time taken for similarity search is the bottleneck for virtually all time series d...
NIPS
2007
14 years 11 months ago
2007
We present a novel linear clustering framework (DIFFRAC) which relies on a linear discriminative cost function and a convex relaxation of a combinatorial optimization problem. The...
RT
1995
Springer
15 years 1 months ago
1995
Springer
We present a simple and inexpensive method for computing the estimates of error in a hierarchical linear radiosity method. Similar to the approach used in 1 for constant radiosity ...
82
Voted
ADHOC
2007
14 years 9 months ago
2007
We present a clustering technique addressing redundancy for bounded-distance clusters, which means being able to determine the minimum number of cluster-heads per node, and the ma...