Method of particles in visual clustering of multi-dimensional and large data sets

被引:24
作者
Dzwinel, W [1 ]
Blasiak, J [1 ]
机构
[1] AGH Univ Min & Met, Inst Comp Sci, PL-30059 Krakow, Poland
来源
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF GRID COMPUTING AND ESCIENCE | 1999年 / 15卷 / 03期
关键词
visual clustering; multi-dimensional data sets; feature extraction; method of particles; parallel implementation;
D O I
10.1016/S0167-739X(98)00081-8
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
A method dedicated for visual clustering of N-dimensional data sets is presented. It is based on the classical feature extraction technique - the Sammon's mapping. This technique empowered by a particle approach used in the Sammon's criterion minimization makes the method more reliable, general and efficient. To show its reliability, the results of tests are presented, which were made to exemplify the algorithm 'immunity' from data errors. The general character of the method is emphasized and its role in multicriterial analysis discussed. Due to inherent parallelism of the methods, which are based on the particle approach, the visual clustering technique can be implemented easily in parallel environment. It is shown that parallel realization of the mapping algorithm enables the visualization of data sets consisting of more than 10(4) multi-dimensional data points. The method was tested in the PVM, MPI and data parallel environments on an HP/Convex SPP/1600. In this paper, the authors compare the parallel algorithm performance for these three interfaces. The approach to visual clustering, presented in the paper, can be used in visualization and analysis of large multi-dimensional data sets. (C) 1999 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:365 / 379
页数:15
相关论文
共 23 条
[1]   PARAMETRIC AND NONPARAMETRIC LINEAR MAPPINGS OF MULTIDIMENSIONAL DATA [J].
ALADJEM, M .
PATTERN RECOGNITION, 1991, 24 (06) :543-553
[2]   A TABU SEARCH APPROACH TO THE CLUSTERING PROBLEM [J].
ALSULTAN, KS .
PATTERN RECOGNITION, 1995, 28 (09) :1443-1451
[3]  
ANDENBERG MR, 1973, CLUSTER ANAL APPL
[4]  
Blasiak J, 1998, LECT NOTES COMPUT SC, V1401, P403, DOI 10.1007/BFb0037167
[5]   AN OPTIMIZED MD PROGRAM FOR THE VECTOR COMPUTER CYBER-205 [J].
BRODE, S ;
AHLRICHS, R .
COMPUTER PHYSICS COMMUNICATIONS, 1986, 42 (01) :51-57
[6]  
DZWINEL J, 1996, P 2 INT C APPL FUZZ
[7]   Virtual particles and search for global minimum [J].
Dzwinel, W .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 1997, 12 (05) :371-389
[8]   COMPARISON OF NOISE DIAGNOSTIC SYSTEMS BASED ON PATTERN-RECOGNITION AND DISCRIMINANT METHODS [J].
DZWINEL, W ;
PEPYOLYSHEV, Y ;
JIRSA, P ;
REJCHRT, J .
ANNALS OF NUCLEAR ENERGY, 1995, 22 (08) :543-551
[9]   HOW TO MAKE SAMMON MAPPING USEFUL FOR MULTIDIMENSIONAL DATA-STRUCTURES ANALYSIS [J].
DZWINEL, W .
PATTERN RECOGNITION, 1994, 27 (07) :949-959
[10]  
Dzwinel W, 1997, LECT NOTES COMPUT SC, V1225, P223, DOI 10.1007/BFb0031595