CAJ | 학술논문

为解决二维平面上存在障碍约束的聚类问题，在量子粒子群聚类算法的基础上，提出一种新的带障碍约束的模糊聚类算法，该算法引入隶属度的概念，提出了粒子逃逸原则以避免聚类中心点陷入障碍物中，采用绕过障碍物距离的新定义函数extdistance （），重新定义数据点绕过障碍的聚类目标函数，替代了模糊C-均值算法的基于梯度下降的迭代过程，在很大程度上克服了FCM算法易陷入局部极小值和对初值敏感的缺陷。
위해결이유평면상존재장애약속적취류문제，재양자입자군취류산법적기출상，제출일충신적대장애약속적모호취류산법，해산법인입대속도적개념，제출료입자도일원칙이피면취류중심점함입장애물중，채용요과장애물거리적신정의함수extdistance （），중신정의수거점요과장애적취류목표함수，체대료모호C-균치산법적기우제도하강적질대과정，재흔대정도상극복료FCM산법역함입국부겁소치화대초치민감적결함。
In order to solve the clustering problem of obstacles exist in two-dimensions ,a new fuzzy cluste-ring algorithm with obstructed constraints was proposed based on OPSO algorithm .It adopted the member-ship grade in the object function of QPSO , applied the Escaping Principle to avoid the updated cluster center particles sinking into the area of the obstacles ,redefined the Clustering objective function of data points bypassing obstacles instead of FCM iterative process based on gradient descent ,and it overcame the problems of FCM algorithm which is apt to fall into local extremum and be sensitive to initial parameters .