1810 search results - page 36 / 362 » Similarity estimation techniques from rounding algorithms |
SODA
2012
ACM
11 years 10 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
ICPR
2006
IEEE
14 years 9 months ago
2006
IEEE
Each clustering algorithm induces a similarity between given data points, according to the underlying clustering criteria. Given the large number of available clustering technique...
PODS
2001
ACM
14 years 8 months ago
2001
ACM
The dimensionality curse has profound e ects on the effectiveness of high-dimensional similarity indexing from the performance perspective. One of the well known techniques for im...
BIODATAMINING
2008
13 years 8 months ago
2008
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
BMCBI
2007
13 years 8 months ago
2007
Background: Clustering methods are widely used on gene expression data to categorize genes with similar expression profiles. Finding an appropriate (dis)similarity measure is crit...