Table of Contents Author Guidelines Submit a Manuscript
Journal of Sensors
Volume 2014 (2014), Article ID 824904, 12 pages
http://dx.doi.org/10.1155/2014/824904
Research Article

Nonnegative Matrix Factorization-Based Spatial-Temporal Clustering for Multiple Sensor Data Streams

1Key Laboratory of Dependable Service Computing in Cyber Physical Society of Ministry of Education, Chongqing University, Chongqing 400030, China
2College of Automation, Chongqing University, Chongqing 400030, China

Received 10 March 2014; Revised 30 June 2014; Accepted 2 July 2014; Published 17 July 2014

Academic Editor: Athanasios V. Vasilakos

Copyright © 2014 Di-Hua Sun and Chun-Yan Sang. 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. Sztipanovits, X. Koutsoukos, G. Karsai et al., “Toward a science of cyber-physical system integration,” Proceedings of the IEEE, vol. 100, no. 1, pp. 29–44, 2012. View at Publisher · View at Google Scholar · View at Scopus
  2. L. Xiang, J. Luo, and A. Vasilakos, “Compressed data aggregation for energy efficient wireless sensor networks,” in Proceedings of the 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON '11), pp. 46–54, June 2011. View at Publisher · View at Google Scholar · View at Scopus
  3. L. Mo, L. Zhenjiang, and A. V. Vasilakos, “A survey on topology control in wireless sensor networks: taxonomy, comparative study, and open issues,” Proceedings of the IEEE, vol. 101, no. 12, pp. 2538–2557, 2013. View at Google Scholar
  4. S. Geisler, C. Quix, S. Schiffer, and M. Jarke, “An evaluation framework for traffic information systems based on data streams,” Transportation Research C: Emerging Technologies, vol. 23, pp. 29–55, 2012. View at Publisher · View at Google Scholar · View at Scopus
  5. L.-A. Tang, X. Yu, S. Kim et al., “Multidimensional sensor data analysis in cyber-physical system: an atypical cube approach,” International Journal of Distributed Sensor Networks, vol. 2012, Article ID 724846, 19 pages, 2012. View at Publisher · View at Google Scholar · View at Scopus
  6. J. Beringer and E. Hüllermeier, “Online clustering of parallel data streams,” Data and Knowledge Engineering, vol. 58, no. 2, pp. 180–204, 2006. View at Publisher · View at Google Scholar · View at Scopus
  7. Z. A. Aghbari, I. Kamel, and T. Awad, “On clustering large number of data streams,” Intelligent Data Analysis, vol. 16, no. 1, pp. 69–91, 2012. View at Publisher · View at Google Scholar · View at Scopus
  8. B. Dai, J. Huang, M. Yeh, and M. Chen, “Adaptive clustering for multiple evolving streams,” IEEE Transactions on Knowledge and Data Engineering, vol. 18, no. 9, pp. 1166–1180, 2006. View at Publisher · View at Google Scholar · View at Scopus
  9. M. Yeh, B. R. Dai, and M. S. Chen, “Clustering over multiple evolving streams by events and correlations,” IEEE Transactions on Knowledge and Data Engineering, vol. 19, no. 10, pp. 1349–1362, 2007. View at Publisher · View at Google Scholar · View at Scopus
  10. C. C. Aggarwal and P. S. Yu, “Online analysis of community evolution in data streams,” in Proceedings of the 5th SIAM International Conference on Data Mining (SDM '05), pp. 56–67, April 2005. View at Scopus
  11. D. Chakrabarti, R. Kumar, and A. Tomkins, “Evolutionary clustering,” in Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '06), pp. 554–560, August 2006. View at Scopus
  12. Y.-R. Lin, Y. Chi, S. Zhu, H. Sundaram, and B. L. Tseng, “Analyzing communities and their evolutions in dynamic social networks,” ACM Transactions on Knowledge Discovery from Data (TKDD), vol. 3, p. 8, 2009. View at Google Scholar
  13. M. E. J. Newman and M. Girvan, “Finding and evaluating community structure in networks,” Physical Review E, vol. 69, no. 2, Article ID 026113, 2004. View at Publisher · View at Google Scholar · View at Scopus
  14. H. Ning, W. Xu, Y. Chi, Y. Gong, and T. S. Huang, “Incremental spectral clustering by efficiently updating the eigen-system,” Pattern Recognition, vol. 43, no. 1, pp. 113–127, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  15. L. Wang, M. Rege, M. Dong, and Y. Ding, “Low-rank kernel matrix factorization for large-scale evolutionary clustering,” IEEE Transactions on Knowledge and Data Engineering, vol. 24, no. 6, pp. 1036–1050, 2012. View at Publisher · View at Google Scholar · View at Scopus
  16. Y. Chi, X. Song, D. Zhou, K. Hino, and B. L. Tseng, “Evolutionary spectral clustering by incorporating temporal smoothness,” in Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '07), pp. 153–162, August 2007. View at Publisher · View at Google Scholar · View at Scopus
  17. Y. J. Ma, Y. K. Guo, X. C. Tian, and M. Ghanem, “Distributed clustering-based aggregation algorithm for spatial correlated sensor networks,” IEEE Sensors Journal, vol. 11, no. 3, pp. 641–648, 2011. View at Publisher · View at Google Scholar · View at Scopus
  18. L.-Y. Wei and W.-C. Peng, “An incremental algorithm for clustering spatial data streams: exploring temporal locality,” Knowledge and Information Systems, vol. 37, pp. 453–483, 2013. View at Publisher · View at Google Scholar · View at Scopus
  19. C. Ding, T. Li, W. Peng, and H. Park, “Orthogonal nonnegative matrix tri-factorizations for clustering,” in Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '06), pp. 126–135, August 2006. View at Scopus
  20. D. Cai, X. He, J. Han, and T. S. Huang, “Graph regularized nonnegative matrix factorization for data representation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 33, no. 8, pp. 1548–1560, 2011. View at Publisher · View at Google Scholar · View at Scopus
  21. Z. He, S. Xie, R. Zdunek, G. Zhou, and A. Cichocki, “Symmetric nonnegative matrix factorization: algorithms and applications to probabilistic clustering,” IEEE Transactions on Neural Networks, vol. 22, no. 12, pp. 2117–2131, 2011. View at Publisher · View at Google Scholar · View at Scopus
  22. B. Vanluyten, J. C. Willems, and B. De Moor, “Structured nonnegative matrix factorization with applications to hidden Markov realization and clustering,” Linear Algebra and its Applications, vol. 429, no. 7, pp. 1409–1424, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  23. N. D. Ho and P. Van Dooren, “Non-negative matrix factorization with fixed row and column sums,” Linear Algebra and its Applications, vol. 429, no. 5-6, pp. 1020–1025, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  24. D. Kuang, C. Ding, and H. Park, “Symmetric nonnegative matrix factorization for graph clustering,” in Proceedings of the 12th SIAM International Conference on Data Mining (SDM '12), pp. 106–117, April 2012. View at Scopus
  25. A. Cichocki, R. Zdunek, A. H. Phan, and S. Amari, Nonnegative Matrix and Tensor Factorizations: Applications to Exploratory Multi-Way Data Analysis and Blind Source Separation, Wiley Publishing, 2009.
  26. C. Ding, X. F. He, and H. D. Simon, “On the equivalence of nonnegative matrix factorization and spectral clustering,” in Proceedings of the 5th SIAM International Conference on Data Mining (SDM '05), pp. 606–610, April 2005. View at Scopus
  27. G. H. Golub and C. F. Van Loan, Matrix Computations, 2012.
  28. D. D. Lee and H. S. Seung, “Learning the parts of objects by non-negative matrix factorization,” Nature, vol. 401, no. 6755, pp. 788–791, 1999. View at Publisher · View at Google Scholar · View at Scopus
  29. C. Ding, T. Li, and M. I. Jordan, “Convex and semi-nonnegative matrix factorizations,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 32, no. 1, pp. 45–55, 2010. View at Publisher · View at Google Scholar · View at Scopus
  30. P. Drineas, R. Kannan, and M. W. Mahoney, “Fast Monte Carlo algorithms for matrices III: computing a compressed approximate matrix decomposition,” The SIAM Journal on Computing, vol. 36, no. 1, pp. 184–206, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  31. J. Sun, Y. Xie, H. Zhang, and C. Faloutsos, “Less is more: compact matrix decomposition for large sparse graphs,” in Proceedings of the 7th SIAM International Conference on Data Mining, pp. 366–377, April 2007. View at Scopus
  32. H. Tong, S. Papadimitriou, J. Sun, P. S. Yu, and C. Faloutsos, “Colibri: fast mining of large static and dynamic graphs,” in Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '08), pp. 686–694, August 2008. View at Publisher · View at Google Scholar · View at Scopus
  33. S. Boyd and L. Vandenberghe, Convex Optimization, Cambridge University Press, Cambridge, UK, 2004. View at Publisher · View at Google Scholar · View at MathSciNet
  34. J. B. 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
  35. A. Strehl and J. Ghosh, “Cluster ensembles—a knowledge reuse framework for combining multiple partitions,” The Journal of Machine Learning Research, vol. 3, no. 3, pp. 583–617, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  36. Q. Gu and J. Zhou, “Co-clustering on manifolds,” in Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '09), pp. 359–367, July 2009. View at Publisher · View at Google Scholar · View at Scopus