Weighted least square projection twin support vector clustering with neighborhood information
DOI:
CSTR:
Author:
Affiliation:

1.School of Data Science and Information Engineering, Guizhou Minzu University,Guiyang 550025, China; 2.Engineering Training Center, Guizhou Minzu University,Guiyang 550025, China

Clc Number:

TP181;TN014

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    In order to solve the problem that the least square projection twin support vector clustering (LSPTSVC) algorithm fails to make full use of the potential information among sample neighborhoods and is not practical, this paper proposes an efficient weighted least square projection twin support vector clustering algorithm with neighborhood information. Firstly, the algorithm introduces the concept of relative density to fully extract local similarity information between data points of the same class. Then, the algorithm calculates the relative weight of the point. Finally, in order to better reflect the geometric structure of similar samples, the algorithm calculates the weighted average value of the data points by using the relative weight. These experimental results verify the effectiveness of the algorithm. The results show that the proposed algorithm achieves better clustering accuracy than the existing methods under the similar computational complexity and good clustering performance in the practical application of medical datasets in the real world.

    Reference
    Related
    Cited by
Get Citation
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:
  • Adopted:
  • Online: November 04,2024
  • Published:
Article QR Code