On distance measures for the fuzzy K-means algorithm for joint data

被引:96
作者
Hammah, RE [1 ]
Curran, JH [1 ]
机构
[1] Univ Toronto, Dept Civil Engn, Rock Engn Grp, Toronto, ON M5S 1A4, Canada
关键词
Cluster Algorithm; Euclidean Space; Distance Measure; Statistical Tool; Cluster Technique;
D O I
10.1007/s006030050041
中图分类号
P5 [地质学];
学科分类号
0709 ; 081803 ;
摘要
The analysis of data collected on rock discontinuities often requires that the data be separated into joint sets or groups. A statistical tool that facilitates the automatic identification of groups of clusters of observations in a data set is cluster analysis. The fuzzy K-means cluster technique has been successfully applied to the analysis of joint survey data. As is the case with all clustering algorithms, the results of an analysis performed with the fuzzy K-means algorithm for discontinuity data are highly dependent on the distance metric employed in the analysis. This paper explores the significant issues surrounding the choice and use of various distance measures for clustering joint survey data. It also proposes an analogue of the Mahalanobis distance norm (used for data in Euclidean space) for clustering spherical data. Sample applications showing the greater flexibility and power of the new distance measure over the originally proposed distance metric for spherical data are given in the paper.
引用
收藏
页码:1 / 27
页数:27
相关论文
共 25 条
  • [1] Anderberg M.R., 1973, Probability and Mathematical Statistics
  • [2] [Anonymous], P IEEE CDC SAN DIEG
  • [3] [Anonymous], 1987, Statistical Analysis of Spherical Data
  • [4] [Anonymous], 1980, CLUSTER ANAL
  • [5] [Anonymous], Pattern Recognition With Fuzzy Objective Function Algorithms
  • [6] Bezdek JC., 1992, FUZZY MODELS PATTERN
  • [7] BOW ST, 1992, PATTERN RECOGNITION
  • [8] DERSHOWITZ W, 1996, P 2 NARMS ROCK MECH, P1809
  • [9] DIEDERICHS M, DIPS USERS GUIDE VER, P97
  • [10] UNSUPERVISED OPTIMAL FUZZY CLUSTERING
    GATH, I
    GEVA, AB
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1989, 11 (07) : 773 - 781