Table of Contents Author Guidelines Submit a Manuscript
Computational Intelligence and Neuroscience
Volume 2017, Article ID 2658707, 14 pages
https://doi.org/10.1155/2017/2658707
Research Article

Fast Constrained Spectral Clustering and Cluster Ensemble with Random Projection

1Guangxi Key Laboratory of Cryptogpraphy and Information Security, School of Computer Science and Information Security, Guilin University of Electronic Technology, Guilin 541004, China
2State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
3State Key Laboratory of Mathematical Engineering and Advanced Computing, Zhengzhou 450002, China
4National University of Defense Technology, Nanjing 210012, China

Correspondence should be addressed to Mao Ye; moc.361@cgxxoamey

Received 7 March 2017; Accepted 1 August 2017; Published 25 September 2017

Academic Editor: Diego Andina

Copyright © 2017 Wenfen Liu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. Shen, D. Liu, J. Shen, Q. Liu, and X. Sun, “A secure cloud-assisted urban data sharing framework for ubiquitous-cities,” Pervasive and Mobile Computing, 2017. View at Publisher · View at Google Scholar
  2. Q. Liu, W. Cai, J. Shen, Z. Fu, X. Liu, and N. Linge, “A speculative approach to spatial‐temporal efficiency with multi‐objective optimization in a heterogeneous cloud environment,” Security and Communication Networks, vol. 9, no. 17, pp. 4002–4012, 2016. View at Publisher · View at Google Scholar
  3. C. C. Aggarwal and C. K. Reddy, Eds., Data Classification: Algorithms and Applications, CRC Press, New York, NY, USA, 2014. View at MathSciNet
  4. Y. Zheng, B. Jeon, D. Xu, Q. M. J. Wu, and H. Zhang, “Image segmentation by generalized hierarchical fuzzy C-means algorithm,” Journal of Intelligent and Fuzzy Systems, vol. 28, no. 2, pp. 961–973, 2015. View at Publisher · View at Google Scholar · View at Scopus
  5. Z. Zhou, Q. J. Wu, F. Huang, and X. Sun, “Fast and accurate near-duplicate image elimination for visual sensor networks,” International Journal of Distributed Sensor Networks, vol. 13, no. 2, 2017. View at Publisher · View at Google Scholar · View at Scopus
  6. H. Rong, T. Ma, M. Tang, and J. Cao, “A novel subgraph K+-isomorphism method in social network based on graph similarity detection,” Soft Computing, pp. 1–19, 2017. View at Publisher · View at Google Scholar · View at Scopus
  7. T. Ma, Y. Wang, M. Tang et al., “LED: a fast overlapping communities detection algorithm based on structural clustering,” Neurocomputing, vol. 207, pp. 488–500, 2016. View at Publisher · View at Google Scholar · View at Scopus
  8. Z. Yu, H. Chen, J. You et al., “Adaptive fuzzy consensus clustering framework for clustering analysis of cancer data,” IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 12, no. 4, pp. 887–901, 2015. View at Publisher · View at Google Scholar · View at Scopus
  9. K. Wagstaff, C. Cardie, S. Rogers, and S. Schrödl, “Constrained k-means clustering with background knowledge,” in Proceedings of the 18th International Conference on Machine Learning (ICML '01), pp. 577–584, Williams College, Williamstown, Mass, USA, June 2001.
  10. E. P. Xing, A. Y. Ng, M. I. Jordan, and S. J. Russell, “Distance metric learning with application to clustering with side-information,” in Proceedings of the 15th International Conference on Neural Information Processing Systems (NIPS '02), pp. 505–512, Vancouver, Canada, December 2002.
  11. S. D. Kamvar, D. Klein, and C. D. Manning, “Spectral learning,” in Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI '03), pp. 561–566, Acapulco, Mexico, August 2003. View at Scopus
  12. Z. Lu and M. Á. Carreira-Perpiñán, “Constrained spectral clustering through affinity propagation,” in Proceedings of the 26th IEEE Conference on Computer Vision and Pattern Recognition (CVPR '08), Anchorage, Ala, USA, June 2008. View at Publisher · View at Google Scholar · View at Scopus
  13. Z. Li, J. Liu, and X. Tang, “Constrained clustering via spectral regularization,” in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops (CVPR '09), pp. 421–428, Miami, Fla, USA, June 2009. View at Publisher · View at Google Scholar · View at Scopus
  14. Z. Lu and H. H. Ip, “Constrained spectral clustering via exhaustive and efficient constraint propagation,” in Proceedings of the 11th European Conference on Computer Vision on Computer Vision (ECCV '10), vol. 6316, pp. 1–14, Crete, Greece, September 2010.
  15. X. Wang, B. Qian, and I. Davidson, “On constrained spectral clustering and its applications,” Data Mining and Knowledge Discovery, vol. 28, no. 1, pp. 1–30, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. J. Li, Y. Xia, Z. Shan, and Y. Liu, “Scalable constrained spectral clustering,” IEEE Transactions on Knowledge and Data Engineering, vol. 27, no. 2, pp. 589–593, 2015. View at Publisher · View at Google Scholar · View at Scopus
  17. M. Cucuringu, I. Koutis, S. Chawla, G. L. Miller, and R. Peng, “Simple and scalable constrained clustering: a generalized spectral method,” in Proceedings of the 19th International Conference on Artificial Intelligence and Statistics (AISTATS '16), pp. 445–454, Cadiz, Spain, May 2016.
  18. A. Y. Ng, M. I. Jordan, and Y. Weiss, “On spectral clustering: analysis and an algorithm,” in Proceedings of the 14th International Conference on Neural Information Processing Systems: Natural and Synthetic (NIPS '01), pp. 849–856, Vancouver, Canada, December 2001.
  19. J. Shi and J. Malik, “Normalized cuts and image segmentation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 22, no. 8, pp. 888–905, 2000. View at Publisher · View at Google Scholar · View at Scopus
  20. X. Chen and D. Cai, “Large scale spectral clustering with landmark-based representation,” in Proceedings of the 25th AAAI Conference on Artificial Intelligence and the 23rd Innovative Applications of Artificial Intelligence Conference, pp. 313–318, August 2011. View at Scopus
  21. D. Cai and X. Chen, “Large scale spectral clustering via landmark-based sparse representation,” IEEE Transactions on Cybernetics, vol. 45, no. 8, pp. 1669–1680, 2015. View at Publisher · View at Google Scholar · View at Scopus
  22. H. Liu, T. Liu, J. Wu, D. Tao, and Y. Fu, “Spectral ensemble clustering,” in Proceedings of the 21st ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '15), pp. 715–724, Sydney, Australia, August 2015. View at Publisher · View at Google Scholar · View at Scopus
  23. X. Z. Fern and C. E. Brodley, “Random projection for high dimensional data clustering: a cluster ensemble approach,” in Proceedings of the 20th International Conference on Machine Learning (ICML '03), vol. 3, pp. 186–193, August 2003. View at Scopus
  24. A. L. N. Fred and A. K. Jain, “Combining multiple clusterings using evidence accumulation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 27, no. 6, pp. 835–850, 2005. View at Publisher · View at Google Scholar · View at Scopus
  25. A. Strehl and J. Ghosh, “Cluster ensembles—a knowledge reuse framework for combining multiple partitions,” Journal of Machine Learning Research, vol. 3, no. 3, pp. 583–617, 2003. View at Publisher · View at Google Scholar · View at MathSciNet
  26. J. Wu, H. Liu, H. Xiong, and J. Cao, “A theoretic framework of K-means-based Consensus Clustering,” in Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI '13), pp. 1799–1805, Beijing, China, August 2013. View at Scopus
  27. Z. Yu, L. Li, J. Liu, J. Zhang, and G. Han, “Adaptive noise immune cluster ensemble using affinity propagation,” IEEE Transactions on Knowledge and Data Engineering, vol. 27, no. 12, pp. 3176–3189, 2015. View at Publisher · View at Google Scholar
  28. Z. Yu, P. Luo, J. You et al., “Incremental semi-supervised clustering ensemble for high dimensional data clustering,” IEEE Transactions on Knowledge and Data Engineering, vol. 28, no. 3, pp. 701–714, 2016. View at Publisher · View at Google Scholar · View at Scopus
  29. M. Ye, W. Liu, J. Wei, and X. Hu, “Fuzzy c-means and cluster ensemble with random projection for big data clustering,” Mathematical Problems in Engineering, vol. 2016, Article ID 6529794, 13 pages, 2016. View at Publisher · View at Google Scholar · View at MathSciNet
  30. W. B. Johnson and J. Lindenstrauss, “Extensions of lipschitz mappings into a hilbert space,” Contemporary Mathematics, vol. 26, pp. 189–206, 1984. View at Google Scholar
  31. P. Indyk and R. Motwani, “Approximate nearest neighbors: towards removing the curse of dimensionality,” in Proceedings of the 13th Annual ACM Symposium on Theory of Computing, pp. 604–613, ACM, 1998. View at MathSciNet
  32. D. Achlioptas, “Database-friendly random projections: Johnson-Lindenstrauss with binary coins,” Journal of Computer and System Sciences, vol. 66, no. 4, pp. 671–687, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  33. J. A. Tropp, “Improved analysis of the subsampled randomized Hadamard transform,” Advances in Adaptive Data Analysis. Theory and Applications, vol. 3, no. 1-2, pp. 115–126, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  34. D. M. Kane and J. Nelson, “Sparser Johnson-Lindenstrauss transforms,” Journal of the ACM, vol. 61, no. 1, article 4, 2014. View at Publisher · View at Google Scholar · View at MathSciNet
  35. S. Paul, C. Boutsidis, M. Magdon-Ismail, and P. Drineas, “Random projections for linear support vector machines,” ACM Transactions on Knowledge Discovery from Data, vol. 8, no. 4, article 22, 2014. View at Publisher · View at Google Scholar · View at Scopus
  36. C. Boutsidis, A. Zouzias, and P. Drineas, “Random projections for κ-means clustering,” in Proceedings of the 24th Annual Conference on Neural Information Processing Systems (NIPS '10), pp. 298–306, December 2010. View at Scopus
  37. C. Boutsidis, A. Zouzias, M. W. Mahoney, and P. Drineas, “Randomized dimensionality reduction for c-means clustering,” IEEE Transactions on Information Theory, vol. 61, no. 2, pp. 1045–1062, 2015. View at Publisher · View at Google Scholar · View at MathSciNet
  38. M. B. Cohen, S. Elder, C. Musco, C. Musco, and M. Persu, “Dimensionality reduction for k-means clustering and low rank approximation,” in Proceedings of the 47th Annual ACM Symposium on Theory of Computing (STOC '15), pp. 163–172, June 2015. View at Publisher · View at Google Scholar · View at Scopus
  39. Q. Ding and E. D. Kolaczyk, “A compressed PCA subspace method for anomaly detection in high-dimensional data,” IEEE Transactions on Information Theory, vol. 59, no. 11, pp. 7419–7433, 2013. View at Publisher · View at Google Scholar · View at Scopus
  40. H. Lee, A. Battle, R. Raina, and A. Y. Ng, “Efficient sparse coding algorithms,” in Proceedings of the 19th International Conference on Neural Information Processing Systems (NIPS'06), pp. 801–808, Vancouver, Canada, 2006.
  41. M. Popescu, J. Keller, J. Bezdek, and A. Zare, “Random projections fuzzy c-means (RPFCM) for big data clustering,” in Proceedings of the IEEE International Conference on Fuzzy Systems (FUZZ-IEEE '15), pp. 1–6, Istanbul, Turkey, August 2015. View at Publisher · View at Google Scholar
  42. J. Han, M. Kamber, and J. Pei, Data Mining: Concepts and Techniques: Concepts and Techniques, Elsevier, 2011.
  43. A. Kumar, Y. Sabharwal, and S. Sen, “A simple linear time (1+)-approximation algorithm for k-means clustering in any dimensions,” in Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS '04), pp. 454–462, Rome, Italy, October 2004.
  44. D. Arthur and S. Vassilvitskii, “k-means++: the advantages of careful seeding,” in Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms, pp. 1027–1035, 2007. View at MathSciNet
  45. A. Fahad, N. Alshatri, Z. Tari et al., “A survey of clustering algorithms for big data: taxonomy and empirical analysis,” IEEE Transactions on Emerging Topics in Computing, vol. 2, no. 3, pp. 267–279, 2014. View at Publisher · View at Google Scholar · View at Scopus