Modifiable Squeezer cluster algorithm used in large-scale matrix

  • Yan Li*
  • , Huiwen Wang
  • , Ming Ye
  • , Dan Liu
  • *Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

To solve the clustering method to the large-scale matrixes in the same dimension, the modifiable Squeezer cluster algorithm was proposed, based on the analysis of Squeezer cluster algorithm and the definition of the distance between the matrixes. The modifiable algorithm set a distance threshold, put forward a threshold of radius to control the accuracy of classification, and gave the detailed algorithm steps to realize cluster analysis for a large number of matrices. When the matrix cluster set was obtained, the modifiable algorithm provided the definition of center and radius to describe the properties of the matrix set. The proposed method could control the accuracy of classification in order to prevent chain effect in the course of clustering. The simulation experiment was addressed to validate the rationality and effectiveness of the modifiable algorithm.

Original languageEnglish
Pages (from-to)1499-1502
Number of pages4
JournalBeijing Hangkong Hangtian Daxue Xuebao/Journal of Beijing University of Aeronautics and Astronautics
Volume35
Issue number12
StatePublished - Dec 2009

Keywords

  • Cluster analysis
  • Matrix
  • Squeezer
  • Threshold

Fingerprint

Dive into the research topics of 'Modifiable Squeezer cluster algorithm used in large-scale matrix'. Together they form a unique fingerprint.

Cite this