A New Node Centroid Algorithm for Bandwidth Minimization
暂无分享,去创建一个
Andrew Lim | Fei Xiao | Brian Rodrigues | A. Lim | B. Rodrigues | Fei Xiao
[1] J. A. Hartigan,et al. A k-means clustering algorithm , 1979 .
[2] E. Cuthill,et al. Reducing the bandwidth of sparse symmetric matrices , 1969, ACM '69.
[3] Inderjit S. Dhillon,et al. Clustering with Bregman Divergences , 2005, J. Mach. Learn. Res..
[4] Matthew J. Beal. Variational algorithms for approximate Bayesian inference , 2003 .
[5] Leonidas J. Guibas,et al. A metric for distributions with applications to image databases , 1998, Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271).
[6] Christos H. Papadimitriou,et al. The NP-Completeness of the bandwidth minimization problem , 1976, Computing.
[7] Vladimir N. Vapnik,et al. The Nature of Statistical Learning Theory , 2000, Statistics for Engineering and Information Science.
[8] Fred W. Glover,et al. Reducing the bandwidth of a sparse matrix with tabu search , 2001, Eur. J. Oper. Res..
[9] Rajeev Motwani,et al. Incremental clustering and dynamic information retrieval , 1997, STOC '97.
[10] Michael I. Jordan,et al. On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.
[11] William G. Poole,et al. An algorithm for reducing the bandwidth and profile of a sparse matrix , 1976 .
[12] Isaac Plana,et al. GRASP and path relinking for the matrix bandwidth minimization , 2004, Eur. J. Oper. Res..