340 search results - page 26 / 68 » Clustering with Lower Bound on Similarity |
251
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
A variety of techniques currently exist for measuring the similarity between time series datasets. Of these techniques, the methods whose matching criteria is bounded by a specifi...
178
click to vote
CIBB
2008
2008
Unsupervised Stability-Based Ensembles to Discover Reliable Structures in Complex Bio-molecular Data
15 years 8 months ago
The assessment of the reliability of clusters discovered in bio-molecular data is a central issue in several bioinformatics problems. Several methods based on the concept of stabil...
167
click to vote
SLS
2009
Springer
16 years 18 days ago
2009
Springer
Stochastic local search algorithms can now successfully solve MAXSAT problems with thousands of variables or more. A key to this success is how effectively the search can navigate...
143
click to vote
INFOCOM
1995
IEEE
15 years 9 months ago
1995
IEEE
Many network applications that require Quality-ofService QoS support, such as transmission of digital voice and video, tolerate a certain level of service degradation. In this s...
159
click to vote
IDA
2003
Springer
15 years 11 months ago
2003
Springer
The segmentation of time-series is a constrained clustering problem: the data points should be grouped by their similarity, but with the constraint that all points in a cluster mus...