SAHN Clustering in Arbitrary Metric Spaces Using Heuristic Nearest Neighbor Search

DOI10.1007/978-3-319-04657-0_11MaRDI QIDQ5746249zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Nils Kriege, Petra Mutzel, Till Schäfer

Publication date 18 February 2014

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-04657-0_11

zbMATH Keywords

data miningnearest neighbor heuristicSAHN clustering

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Practical SAHN clustering for very large data sets and expensive distance metrics
• Clustering-Based Similarity Search in Metric Spaces with Sparse Spatial Centers
• Approximating min-sum k -clustering in metric spaces
• Clustering for metric and nonmetric distance measures
• Nearest neighbor clustering: a baseline method for consistent clustering with arbitrary objective functions
• Approximate clustering via metric partitioning
• Clustering for metric graphs using the p-Laplacian
• Approximation schemes for clustering problems

Cited in

(3)

• Efficient algorithms for agglomerative hierarchical clustering methods
• Practical SAHN clustering for very large data sets and expensive distance metrics
• An efficient and effective generic agglomerative hierarchical clustering approach

This page was built for publication: SAHN Clustering in Arbitrary Metric Spaces Using Heuristic Nearest Neighbor Search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5746249)