Sciweavers

42 search results - page 1 / 9
» Fast approximate hierarchical clustering using similarity he...
Sort
View
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
13 years 3 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo
CIARP
2010
Springer
13 years 2 months ago
Improving the Dynamic Hierarchical Compact Clustering Algorithm by Using Feature Selection
Abstract. Feature selection has improved the performance of text clustering. In this paper, a local feature selection technique is incorporated in the dynamic hierarchical compact ...
Reynaldo Gil-García, Aurora Pons-Porrata
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
13 years 5 months ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
David Eppstein
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
13 years 10 months ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl
CGF
2008
128views more  CGF 2008»
13 years 3 months ago
Hierarchical Convex Approximation of 3D Shapes for Fast Region Selection
Given a 3D solid model S represented by a tetrahedral mesh, we describe a novel algorithm to compute a hierarchy of convex polyhedra that tightly enclose S. The hierarchy can be b...
Marco Attene, Michela Mortara, Michela Spagnuolo, ...