期刊文献+

基于聚类算法实现信号盲分类 被引量:1

Blind Signals Classification Based on Clustering Algorithms
在线阅读 下载PDF
导出
摘要 本文解决了信号处理、工业控制等领域存在的非平稳信号盲分类问题。在聚类中广泛应用的K-Means算法及其它基于中心的聚类算法有两个共同的缺陷—需要预先确定类数目且随机初始化中心引起性能不稳定。本文提出的算法较好地解决了这两个问题,提高了算法稳定性,实现了非平稳信号盲分类。提取非平稳信号的小波系数作为聚类的样本空间,分析聚类结果的统计偏差以估计类的数目,采用调和均值准则进行分类。最后给出的仿真结果表明本文提出的方法较传统的K-Means算法明显降低分类错误率。 A method is proposed to deal with the problem of blind classification of non-stationary transients, which usually occur in the field of signal processing and industrial control. There are two well-known shortcomings within K-Means algorithm prevailingly used in data clustering and other center-based clustering algorithms-the number of clusters must be known beforehand and the dependence of the algorithm performance on the initialization of the initial centers. By means of the method proposed here, above two problems can be solved as to improve the stability and classify the non-stationary transients. The wavelet coefficients of the transients are extracted to form the clustering sample space. The number of clusters is estimated through analyzing the gap statistics of clustering results, and then using harmonic means criterion to perform further classifying. Simulation result shows that the proposed method can be used to greatly reduce the misclassification probability.
出处 《电路与系统学报》 CSCD 2004年第1期31-35,共5页 Journal of Circuits and Systems
基金 国家自然科学基金资助项目(60002003)
关键词 聚类 非平稳暂态信号 信号分类 K-MEANS 统计偏差 clustering non-stationary transient signal classification K-Means gap statistic
  • 相关文献

参考文献8

  • 1[1]Davidson Ian. Understanding K-Means No-hierarchical clustering [R]. Suny Albany-Technical Report 02-2.
  • 2[2]Faber Vance. Clustering and the Continuous k-Means Algorithm [Z]. Los Alamos Science, 1994, 22.
  • 3[3]Bradley P, Fayyad U M, C A. Refining Initial Points for KM Clustering [R]. MS Technical Report MSR-TR-98-36, 1998-05.
  • 4[4]Duda R O, Hart P E. Pattern Classification and Scene Analysis [M]. New York:John Wiley and Sons, 1973.
  • 5[5]Thiesson B, Meek C, Chickering D, Heckerman P. Learning Mixture of Bayesian Networks [R]. Microsoft Reserarch Technical Report TR-97-30, Redmond, WA, 1997.
  • 6[6]Bradley P S, Mangasarian O L, Street W N. Clustering via Concave Minimization [A]. In: Advances in Neural Information Processing System[C]. MIT Press, 1997, 368-374.
  • 7[7]Ray Siddheswar, Turi Rose H. Determination of Number of Clusters in K-Means Clustering and Application in Colour Image Segmentation [R]. Technical Report of Helsiniki University of Technology, Finland.
  • 8[8]Berkhin Pavel. Survey of Clustering Data Mining Techniques [R]. Technical Report of Accrue Software, Inc.

同被引文献5

  • 1李双虎,张风海.一个新的聚类有效性分析指标[J].计算机工程与设计,2007,28(8):1772-1774. 被引量:14
  • 2牛琨,张舒博,陈俊亮.采用属性聚类的高维子空间聚类算法[J].北京邮电大学学报,2007,30(3):1-5. 被引量:13
  • 3Eric M, Dukic M L, Ohradovic M. Frequency hopping signal separation by spatio-frequeney analysis based on music method[J]. Spread Spectrum Techniques and Applications, 2000: 78-82.
  • 4Liu Xiangqian, Sidiropoulos N D, Swami A. Code blind reception of fh signals over multipath fading channels[ C]// Acoustics Speech and Signal Processing. Hong Kong, [s. n. ], 2003: 592-595.
  • 5Zhang Bin. Generalized k-harmonic means boosting in unsupervised learning[EB/OL]. (2000-10-12). http:// www. hpl. hp. com/techreports/2000/HPL-2000-137. pdf.

引证文献1

二级引证文献14

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部