基于改進(jìn)粒子群的密度聚類(lèi)算法混合矩陣估計(jì)

摘要： 針對(duì)混合矩陣估計(jì)算法中傳統(tǒng)的噪聲環(huán)境下基于密度的空間聚類(lèi)(density-based spatial clustering of applications with noise, DBSCAN)算法需要人為設(shè)定鄰域半徑以及核心點(diǎn)數(shù)這一問(wèn)題，提出雙約束粒子群優(yōu)化(double constrained particle swarm optimization, DCPSO)算法，對(duì)D...