A sweep-line algorithm for spatial clustering

DOI10.1016/J.ADVENGSOFT.2008.06.003zbMATH Open1161.65311OpenAlexW1969188690MaRDI QIDQ1009933FDOQ1009933

Authors: Krista Rizman Žalik, Borut Žalik 

Publication date: 3 April 2009

Published in: Advances in Engineering Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.advengsoft.2008.06.003

Recommendations

• A practical algorithm for spatial agglomerative clustering
• Clustering of spatial point patterns
• A minimal spanning tree algorithm applied to spatial cluster analysis

zbMATH Keywords

clusteringnumerical examplesalgorithmspatial datasetsweep-line paradigm

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Data mining. Concepts and techniques
• Computational Geometry in C
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
• A clustering algorithm based on maximal \(\varTheta\)-distant subtrees
• Design and implementation of a practical parallel Delaunay algorithm
• Title not available (Why is that?)
• A new approach to clustering data with arbitrary shapes

Cited In (6)

• The use of linked line segments for cluster representation and data reduction
• Title not available (Why is that?)
• Title not available (Why is that?)
• Multi-objective evolutionary clustering for large-scale dynamic community detection
• DGDCT: A Distributed Grid-Density Based Algorithm for Intrinsic Cluster Detection over Massive Spatial Data
• A practical algorithm for spatial agglomerative clustering

This page was built for publication: A sweep-line algorithm for spatial clustering

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