Table of Contents Author Guidelines Submit a Manuscript
Advances in Fuzzy Systems
Volume 2015, Article ID 404510, 7 pages
http://dx.doi.org/10.1155/2015/404510
Research Article

Quantitative Analyses and Development of a -Incrementation Algorithm for FCM with Tsallis Entropy Maximization

Department of Electrical and Computer Engineering, Gifu National College of Technology, 2236-2 Kamimakuwa, Motosu-shi, Gifu 501-0495, Japan

Received 4 March 2015; Revised 16 July 2015; Accepted 2 August 2015

Academic Editor: Ning Xiong

Copyright © 2015 Makoto Yasuda. 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. C. Bezdek, Pattern Recognition with Fuzzy Objective Function Algorithms, Prenum Press, New York, NY, USA, 1981.
  2. R.-P. Li and M. Mukaidono, “A maximum entropy approach to fuzzy clustering,” in Proceedings of the 4th IEEE International Conference on Fuzzy Systems (FUZZ-IEEE/IFES '95), pp. 2227–2232, 1995.
  3. S. Miyamoto and M. Mukaidono, “Fuzzy C-means as a regularization and maximum entropy approach,” in Proceedings of the 7th International Fuzzy Systems Association World Congress (IFSA '97), vol. 2, pp. 86–92, Prague, Czech Republic, June 1997.
  4. K. Rose, E. Gurewitz, and G. Fox, “A deterministic annealing approach to clustering,” Pattern Recognition Letters, vol. 11, no. 9, pp. 589–594, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  5. A. De Luca and S. Termini, “A definition of a nonprobabilistic entropy in the setting of fuzzy sets theory,” Information and Control, vol. 20, no. 4, pp. 301–312, 1972. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  6. M. Yasuda, T. Furuhashi, M. Matsuzaki, and S. Okuma, “Fuzzy clustering using deterministic annealing method and its statistical mechanical characteristics,” in Proceedings of the 10th IEEE International Conference on Fuzzy Systems, vol. 3, pp. 797–800, December 2001. View at Scopus
  7. C. Tsallis, “Possible generalization of Boltzmann-Gibbs statistics,” Journal of Statistical Physics, vol. 52, no. 1-2, pp. 479–487, 1988. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  8. S. Abe and Y. Okamoto, Eds., Nonextensive Statistical Mechanics and Its Applications, Springer, 2001.
  9. M. Gell-Mann and C. Tsallis, Eds., Nonextensive Entropy—Interdisciplinary Applications, Oxford University Press, New York, NY, USA, 2004.
  10. C. Tsallis, Ed., Introduction to Nonextensive Statistical Mechanics, Springer, 2009.
  11. C. F. L. Lima, F. M. Assis, and C. P. de Souza, “A comparative study of use of Shannon, Rényi and Tsallis entropy for attribute selecting in network intrusion detection,” in Proceedings of the IEEE International Workshop on Measurements and Networking, pp. 77–82, IEEE, Anacapri, Italy, October 2011. View at Publisher · View at Google Scholar · View at Scopus
  12. W. Wei, X. Lin, and G. Zhang, “Fast image segmentation based on two-dimensional minimum Tsallis-cross entropy,” in Proceedings of the 2nd International Conference on Image Analysis and Signal Processing (IASP '10), pp. 332–335, April 2010. View at Publisher · View at Google Scholar · View at Scopus
  13. M. Menard, V. Courboulay, and P.-A. Dardignac, “Possibilistic and probabilistic fuzzy clustering: unification within the framework of the non-extensive thermostatistics,” Pattern Recognition, vol. 36, no. 6, pp. 1325–1342, 2003. View at Publisher · View at Google Scholar · View at Scopus
  14. M. Menard, P. Dardignac, and C. C. Chibelushi, “Non-extensive thermostatistics and extreme physical information for fuzzy clustering,” International Journal of Computational Cognition, vol. 2, no. 4, pp. 1–63, 2004. View at Google Scholar
  15. M. Yasuda, “Entropy maximization and very fast deterministic annealing approach to fuzzy C-means clustering,” in Proceedings of the 5th Joint International Conference on Soft Computing and 11th International Symposium on Intelligent Systems, SU-B1-3, pp. 1515–1520, 2010.
  16. F. Rossi and N. Villa-Vialaneix, “Optimizing an organized modularity measure for topographic graph clustering: a deterministic annealing approach,” Neurocomputing, vol. 73, no. 7–9, pp. 1142–1163, 2010. View at Publisher · View at Google Scholar · View at Scopus
  17. W. Guo and S. Cui, “A q-Parameterized deterministic annealing EM algorithm based on nonextensive statistical mechanics,” IEEE Transactions on Signal Processing, vol. 56, no. 7, pp. 3069–3080, 2008. View at Publisher · View at Google Scholar · View at Scopus
  18. R. A. Fisher, “The use of multiple measurements in taxonomic problems,” Annals of Eugenics, vol. 7, no. 2, pp. 179–188, 1936. View at Publisher · View at Google Scholar
  19. L. E. Reichl, A Modern Course in Statistical Physics, John Wiley & Sons, New York, NY, USA, 1998.
  20. B. E. Rosen, “Function optimization based on advanced simulated annealing,” in Proceedings of the IEEE Workshop on Physics and Computation (PhysComp '92), pp. 289–293, IEEE, October 1992. View at Publisher · View at Google Scholar