Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 535932, 9 pages
http://dx.doi.org/10.1155/2015/535932
Research Article

-Nearest Neighbor Intervals Based AP Clustering Algorithm for Large Incomplete Data

1Department of Automation, Tsinghua University, Beijing 100084, China
2Army Aviation Institute, Beijing 101123, China

Received 15 January 2015; Accepted 2 March 2015

Academic Editor: Hui Zhang

Copyright © 2015 Cheng Lu 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. D. Lazer, R. Kennedy, G. King, and A. Vespignani, “The parable of Google flu: traps in big data analysis,” Science, vol. 343, no. 6176, pp. 1203–1205, 2014. View at Publisher · View at Google Scholar
  2. B. J. Frey and D. Dueck, “Clustering by passing messages between data points,” Science, vol. 315, no. 5814, pp. 972–976, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. B. J. Frey and D. Dueck, “Response to comment on ‘clustering by passing messages between data points’,” Science, vol. 319, no. 5864, p. 726d, 2008. View at Google Scholar
  4. K. Wang, J. Zhang, D. Li, X. Zhang, and T. Guo, “Adaptive affinity propagation clustering,” Acta Automatica Sinica, vol. 33, no. 12, pp. 1242–1246, 2007. View at Google Scholar
  5. Y. He, Q. Chen, X. Wang, R. Xu, X. Bai, and X. Meng, “An adaptive affinity propagation document clustering,” in Proceedings of the 7th International Conference on Informatics and Systems (INFOS '10), pp. 1–7, IEEE, March 2010. View at Scopus
  6. R. J. Little and D. B. Rubin, Statistical Analysis with Nissing Data, John Wiley & Sons, New York, NY, USA, 2nd edition, 2002. View at Publisher · View at Google Scholar · View at MathSciNet
  7. J. K. Dixon, “Pattern recognition with partly missing data,” IEEE Transactions on Systems, Man and Cybernetics, vol. 9, no. 10, pp. 617–621, 1979. View at Publisher · View at Google Scholar · View at Scopus
  8. A. P. Dempster, N. M. Laird, and D. B. Rubin, “Maximum likelihood from incomplete data via the EM algorithm,” Journal of the Royal Statistical Society. Series B. Methodological, vol. 39, no. 1, pp. 1–38, 1977. View at Google Scholar · View at MathSciNet
  9. J. C. Bezdek, Pattern Recognition with Fuzzy Objective Function Algorithms, Kluwer Academic Publishers, 1981. View at MathSciNet
  10. S. Miyamoto, O. Takata, and K. Umayahara, “Handling missing values in fuzzy c-means,” in Proceedings of the 3rd Asian Fuzzy Systems Symposium, pp. 139–142, 1998.
  11. R. J. Hathaway and J. C. Bezdek, “Fuzzy c-means clustering of incomplete data,” IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 31, no. 5, pp. 735–744, 2001. View at Publisher · View at Google Scholar · View at Scopus
  12. R. J. Hathaway and J. C. Bezdek, “Clustering incomplete relational data using the non-Euclidean relational fuzzy c-means algorithm,” Pattern Recognition Letters, vol. 23, no. 1–3, pp. 151–160, 2002. View at Publisher · View at Google Scholar · View at Scopus
  13. D. Li, H. Gu, and L. Zhang, “A fuzzy c-means clustering algorithm based on nearest-neighbor intervals for incomplete data,” Expert Systems with Applications, vol. 37, no. 10, pp. 6942–6947, 2010. View at Publisher · View at Google Scholar · View at Scopus
  14. D.-Q. Zhang and S.-C. Chen, “Clustering incomplete data using kernel-based fuzzy C-means algorithm,” Neural Processing Letters, vol. 18, no. 3, pp. 155–162, 2003. View at Publisher · View at Google Scholar · View at Scopus
  15. C. Lu, S. Song, and C. Wu, “Afinity propagation clustering with incomplete data,” in Computational Intelligence, Networked Systems and Their Applications, pp. 239–248, Springer, Berlin, Germany, 2014. View at Google Scholar
  16. J. L. Ohmann and M. J. Gregory, “Predictive mapping of forest composition and structure with direct gradient analysis and nearest-neighbor imputation in coastal Oregon, U.S.A.,” Canadian Journal of Forest Research, vol. 32, no. 4, pp. 725–741, 2002. View at Publisher · View at Google Scholar · View at Scopus
  17. E. Acuna and C. Rodriguez, “The treatment of missing values and its effect on classifier accuracy,” in Classification, Clustering, and Data Mining Applications, pp. 639–647, Springer, Berlin, Germany, 2004. View at Google Scholar
  18. P. J. García-Laencina, J.-L. Sancho-Gómez, and A. R. Figueiras-Vidal, “Pattern classification with missing data: a review,” Neural Computing and Applications, vol. 19, no. 2, pp. 263–282, 2010. View at Publisher · View at Google Scholar · View at Scopus
  19. X. Huang and Q. Zhu, “A pseudo-nearest-neighbor approach for missing data recovery on Gaussian random data sets,” Pattern Recognition Letters, vol. 23, no. 13, pp. 1613–1622, 2002. View at Publisher · View at Google Scholar · View at Scopus
  20. “UCI machine learning repository,” 2014, http://archive.ics.uci.edu/ml/datasets.html.
  21. M. Halkidi, Y. Batistakis, and M. Vazirgiannis, “Cluster validity methods: part I,” ACM SIGMOD Record, vol. 31, no. 2, pp. 40–45, 2002. View at Publisher · View at Google Scholar · View at Scopus