期刊文献+

一种基于加速迭代的大数据集谱聚类方法 被引量:7

Spectral Clustering Algorithm for Large Scale Data Set Based on Accelerating Iterative Method
下载PDF
导出
摘要 传统谱聚类算法的诸多优点只适合小数据集。根据Laplacian矩阵的特点重新构造新的Gram矩阵,输入新构造矩阵的若干列,然后利用加速迭代法解决大数据集的谱聚类特征提取问题,使得在大数据集条件下,谱聚类算法只需要很小的空间复杂度就可达到非常快的计算速度。 The advantage of the traditional spectral clustering algorithm is applicable in the small scale data set.A new method was proposed in the light of the laplacian matrix characteristics.First,a new Gram matrix was reconstructed and some lies of the new matrix were needed,then the eigen-decomposition based on accelerating iterative method was solved.The calculation speed of the proposed method is very fast and the space complexity is small for large scale data set.
出处 《计算机科学》 CSCD 北大核心 2012年第5期172-176,共5页 Computer Science
基金 国家自然科学基金(60873037 61073041 61073043) 牡丹江市科技攻关项目(G2009b328)资助
关键词 聚类 谱聚类 大规模数据集 加速迭代法 LAPLACIAN矩阵 Clustering Spectral clustering Large-scale data set Accelerating iterative method Laplacian matrix
  • 相关文献

参考文献12

  • 1Von Luxburg U. A tutorial on spectral clustering[R]. TR-149. Max Planck Institute for Biological Cybernetics, 2006.
  • 2Shi J, Malik J. Normalized cuts and image segmentation [J]. IEEE Transactions on Pattern Analysis and Machine Intelli- gence,2000,22(8) :888-905.
  • 3Ng A, Jordan M, Weiss Y. On spectral clustering: Analysis and an algorithm[C]//Advances in Neural Information Processing Systems. MIT Press, 2002:849-856.
  • 4Von Luxburg U. A tutorial on spectral clustering[J]. Statistics and Computing, 2007,17 (4) : 395-416.
  • 5Weng J, Zhang Y, Huang W S. Candid covariance-free incremental principal component analysis[J]. IEEE Trans. on Pattern Analysis Machine Intelligence, 2003,25 (8) : 1034 1040.
  • 6史卫亚,郭跃飞,薛向阳.一种解决大规模数据集问题的核主成分分析算法[J].软件学报,2009,20(8):2153-2159. 被引量:19
  • 7Zhang Y, Weng J. Convergence analysis of complementary candid incremental principal component analysis[R]. MSU-CSE-01- 23. East Lansing: Michigan State University, 2001.
  • 8Chung F. Spectral graph theory(Vol. 92 of the CBMS Regional Conference Series in Mathematics)[C]//Conference Board of the Mathematical Sciences. Washington, 1997.
  • 9Fiedler M. Algebraic connectivity of graphs[J]. Czechoslovak Mathematical Journal, 1973,23 (98) : 298-305.
  • 10Aitken A C. The evaluation of the latent roota and latent vectors of a matrix[C]//Proc, roy. Soc. Eedinb. 1937,57:269-304.

二级参考文献29

  • 1Jain A, Murty M, Flynn P. Data clustering.. A Review[J]. ACM Computing Surveys, 1999,31 (3) : 264-323.
  • 2Fiedler M. Algebraic connectivity of graphs. Czech, Math. J. , 1973,23: 298-305.
  • 3Malik J,Belongie S,Leung T, et al. Contour and texture analysis for image segmentation In Perceptual Organization for Artificial Vision Systems. Kluwer, 2000.
  • 4Weiss Y. Segmentation using eigenvectors: A unified view//International Conference on Computer Vision 1999.
  • 5Shi J,Malik J. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2000,22 (8) : 888-905.
  • 6Wu Z, Leahy R. An optimal graph theoretic approach to data clustering: theory and its application to image segmentation [J]. IEEE Trans on PAMI,1993, 15(11):1101-1113.
  • 7Hagen L, Kahng A 13. New spectral methods for ratio cut partitioning and clustering. IEEE Trans. Computer-Aided Design, 1992,11 (9) : 1074-1085.
  • 8Sarkar S, Soundararajan P. Supervised learning of large perceptual organization: Graph spectral partitioning and learning automata. IEEE Transaction on Pattern Analysis and Machine Intelligence, 2000,22(5) : 504- 525.
  • 9Ding C, He X, Zha H, et al. Spectral Min Max cut for Graph Partitioning and Data Clustering[C]//Proc. of the IEEE Intl Conf. on Data Mining. 2001 : 107-114.
  • 10Meila M , Xu L. Multiway cuts and spectral clustering. U. Washington Tech Report. 2003.

共引文献203

同被引文献76

  • 1Gang MU,Mao YANG,Dong WANG,Gangui YAN,Yue QI.Spatial dispersion of wind speeds and its influence on the forecasting error of wind power in a wind farm[J].Journal of Modern Power Systems and Clean Energy,2016,4(2):265-274. 被引量:12
  • 2么枕生.用于数值分类的聚类分析[J].海洋湖沼通报,1994(2):1-12. 被引量:34
  • 3康传明,高学敏,芮晓明,刘衍平.我国风电产业发展中存在的问题与解决策略[J].中国能源,2006,28(6):27-30. 被引量:4
  • 4Belkin M, Niyog P. Laplacian eigen mapsfor dimensionality reduc- tion and data representation [J]. Neural Comput, 2002,6(15) : 1373-1396.
  • 5Rowels S, Saul L. Nonlinear dimensionality reduction by locally 1,inear emheddng [J]. Science, 20(30,290 (5500) : 2323-2326.
  • 6Tenenbaum J, Silva V, Langford J. Aglobal geometric frame- work for nonlinear dimensionality reduction [J]. Science, 2000, 290(5500) : 2319-2323.
  • 7Shi J B, Malik J. Motion segmentation and tracking using nor- realized cuts [C]//IEEE International Conference on Computer Vision (ICCV). 1998:1154-1160.
  • 8Shi J B, Malik J. Normalized cuts and image segmentation [J]. IEEE Transactions on Pattern Analysis and Machine Intelli- gence, 2000,22(8) : 888-905.
  • 9Agarwal S, Branson K, Belongie K. Higher order learning with graphs [C]//Int. Conf. Mach. Learn. Pittsburgh, PA, 2006 : 17- 24.
  • 10Agarwal S, Lira J, Zelnik M L, et al. Beyond pairwise clustering [C]//Int. Conf. Comput. Vis. Pattern Recog. San Diego, CA, 2005 : 838-845.

引证文献7

二级引证文献32

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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