Computational method for the point cluster analysis on networks

Authors:
Kokichi Sugihara;Atsuyuki Okabe;Toshiaki Satoh
Affiliations:
Meiji University, Tamaku, Japan 214-8571;Aoyama Gakuin University, Tokyo, Japan;PASCO Corp., Tokyo, Japan
Venue:
Geoinformatica
Year:
2011

Citing 7
Cited 0

Algorithms for clustering data

Algorithms for clustering data
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Introduction to Algorithms

Introduction to Algorithms
Clustering objects on a spatial network

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Performance guarantees for hierarchical clustering

Journal of Computer and System Sciences - Special issue on COLT 2002
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters

IEEE Transactions on Computers
Mining outliers in spatial networks

DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a general framework of hierarchical methods for point cluster analysis on networks, and then consider individual clustering procedures and their time complexities defined by typical variants of distances between clusters. The distances considered here are the closest-pair distance, the farthest-pair distance, the average distance, the median-pair distance and the radius distance. This paper will offer a menu for users to choose hierarchical clustering algorithms on networks from a time complexity point of view.