Skip to main content
Have a personal or library account? Click to login
Accumulative Information Enhancement In The Self-Organizing Maps And Its Application To The Analysis Of Mission Statements Cover

Accumulative Information Enhancement In The Self-Organizing Maps And Its Application To The Analysis Of Mission Statements

Open Access
|Sep 2015

References

  1. [1] R. Linsker, “Self-organization in a perceptual network,”, vol. 21, pp. 105–117, 1988.
  2. [2] R. Linsker, “How to generate ordered maps by maximizing the mutual information between input and output,”, vol. 1, pp. 402–411, 1989.
  3. [3] R. Linsker, “Local synaptic rules suffice to maximize mutual information in a linear network,”, vol. 4, pp. 691–702, 1992.
  4. [4] R. Linsker, “Improved local learning rule for information maximization and related applications,”, vol. 18, pp. 261–265, 2005.
  5. [5] Z. Nenadic, “Information discriminant analysis: Feature extraction with an information-theoretic objective,”, vol. 29, no. 8, pp. 1394–1407, 2007.
  6. [6] K. Torkkola, “Feature extraction by non-parametric mutual information maximization,”, vol. 3, pp. 1415–1438, 2003.
  7. [7] J. M. Leiva-Murillo and A. Artes-Rodriguez, “Maximization of mutual information for supervised linear feature extraction,”, vol. 18, no. 5, pp. 1433–1441, 2007.
  8. [8] D. E. Rumelhart and D. Zipser, “Feature discovery by competitive learning,” in(D. E. Rumelhart and G. E. H. et al., eds.), vol. 1, pp. 151–193, Cambridge: MIT Press, 1986.
  9. [9] T. Kohonen,. New York: Springer-Verlag, 1988.
  10. [10] T. Kohonen,. Springer-Verlag, 1995.
  11. [11] R. Kamimura and T. Kamimura, “Structural information and linguistic rule extraction,” in, pp. 720–726, 2000.
  12. [12] R. Kamimura, T. Kamimura, and O. Uchida, “Flexible feature discovery and structural information control,”, vol. 13, no. 4, pp. 323–347, 2001.
  13. [13] R. Kamimura, “Information-theoretic competitive learning with inverse Euclidean distance output units,”, vol. 18, pp. 163–184, 2003.
  14. [14] R. Kamimura, “Teacher-directed learning: information-theoretic competitive learning in supervised multi-layered networks,”, vol. 15, pp. 117–140, 2003.
  15. [15] R. Kamimura, “Progressive feature extraction by greedy network-growing algorithm,”, vol. 14, no. 2, pp. 127–153, 2003.
  16. [16] R. Kamimura, “Information theoretic competitive learning in self-adaptive multi-layered networks,”, vol. 13, no. 4, pp. 323–347, 2003.
  17. [17] R. Kamimura, “Feature discovery by enhancement and relaxation of competitive units,” in, vol. LNCS5326, pp. 148–155, Springer, 2008.
  18. [18] R. Kamimura, “Information-theoretic enhancement learning and its application to visualization of self-organizing maps,”, vol. 73, no. 13-15, pp. 2642–2664, 2010.
  19. [19] R. Kamimura, “Information-theoretic enhancement learning and its application to visualization of self-organizing maps,”, vol. 73, no. 13-15, pp. 2642–2664, 2010.
  20. [20] R. Kamimura, “Double enhancement learning for explicit internal representations: unifying self-enhancement and information enhancement to incorporate information on input variables,”, pp. 1–23, 2011.
  21. [21] R. Kamimura, “Selective information enhancement learning for creating interpretable representations in competitive learning,”, vol. 24, no. 4, pp. 387–405, 2011.
  22. [22] B. Bartkus, M. Glassman, and B. McAFEE, “Mission statement quality and financial performance,”, vol. 24, no. 1, pp. 86–94, 2006.
  23. [23] B. R. Bartkus, M. Glassman, and R. B. McAfee, “A comparison of the quality of european, japanese and us mission statements:: A content analysis,”, vol. 22, no. 4, pp. 393–401, 2004.
  24. [24] E. Oda and H. Mitsuhashi, “Experimental study of management principle and company performance by text mining(in japanese),”, vol. 7, no. 2, pp. 22–37, 2010.
  25. [25] K. Ryozo and K. Ryotaro, “Company policy analysis by information theoretical neural networks,” in, pp. 13–14, 2014.
  26. [26] R. Kamimura, T. Kamimura, and T. R. Shultz, “Information theoretic competitive learning and linguistic rule acquisition,”, vol. 16, no. 2, pp. 287–298, 2001.
  27. [27] D. E. Rumelhart and D. Zipser, “Feature discovery by competitive learning,”, vol. 9, pp. 75–112, 1985.
  28. [28] M. Van Hulle, “Topographic map formation by maximizing unconditional entropy: a plausible strategy for ’on-line’ unsupervised competitive learning and nonparametric density estimation,”, vol. 7, no. 5, pp. 1299–1305, 1996.
  29. [29] M. M. Van Hulle, “The formation of topographic maps that maximize the average mutual information of the output responses to noiseless input signals,”, vol. 9, no. 3, pp. 595–606, 1997.
  30. [30] M. M. Van Hulle, “Topology-preserving map formation achieved with a purely local unsupervised competitive learning rule,”, vol. 10, no. 3, pp. 431–446, 1997.
  31. [31] M. M. Van Hulle, “Faithful representations with topographic maps,”, vol. 12, no. 6, pp. 803–823, 1999.
  32. [32] M. M. Van Hulle, “Entropy-based kernel modeling for topographic map formation,”, vol. 15, no. 4, pp. 850–858, 2004.
  33. [33] M. M. V. Hulle, “The formation of topographic maps that maximize the average mutual information of the output responses to noiseless input signals,”, vol. 9, no. 3, pp. 595–606, 1997.
  34. [34] S. C. Ahalt, A. K. Krishnamurthy, P. Chen, and D. E. Melton, “Competitive learning algorithms for vector quantization,”, vol. 3, pp. 277–290, 1990.
  35. [35] L. Xu, “Rival penalized competitive learning for clustering analysis, RBF net, and curve detection,”, vol. 4, no. 4, pp. 636–649, 1993.
  36. [36] A. Luk and S. Lien, “Properties of the generalized lotto-type competitive learning,” in, (San Mateo: CA), pp. 1180–1185, Morgan Kaufmann Publishers, 2000.
  37. [37] Y. J. Zhang and Z. Q. Liu, “Self-splitting competitive learning: a new on-line clustering paradigm,”, vol. 13, no. 2, pp. 369–380, 2002.
  38. [38] H. Xiong, M. N. S. Swamy, and M. O. Ahmad, “Competitive splitting for codebook initialization,”, vol. 11, pp. 474–477, 2004.
  39. [39] J. C. Yen, J. I. Guo, and H. C. Chen, “A new k-winners-take-all neural networks and its array architecture,”, vol. 9, no. 5, pp. 901–912, 1998.
  40. [40] S. Ridella, S. Rovetta, and R. Zunino, “K-winner machines for pattern classification,”, vol. 12, no. 2, pp. 371–385, 2001.
  41. [41] S. Kurohashi and D. Kawata, “,”
  42. [42] E. Merényi, K. Tasdemir, and L. Zhang, “Learning highly structured manifolds: harnessing the power of soms,” in, pp. 138–168, Springer, 2009.
  43. [43] K. Tasdemir and E. Merényi, “Exploiting data topology in visualization and clustering of self-organizing maps,”, vol. 20, no. 4, pp. 549–562, 2009.
  44. [44] I. Guyon and A. Elisseeff, “An introduction to variable and feature selection,”, vol. 3, pp. 1157–1182, 2003.
  45. [45] A. Rakotomamonjy, “Variable selection using SVM-based criteria,”, vol. 3, pp. 1357–1370, 2003.
  46. [46] S. Perkins, K. Lacker, and J. Theiler, “Grafting: Fast, incremental feature selection by gradient descent in function space,”, vol. 3, pp. 1333–1356, 2003.
Language: English
Page range: 161 - 176
Published on: Sep 23, 2015
Published by: SAN University
In partnership with: Paradigm Publishing Services

© 2015 Ryozo Kitajima, Ryotaro Kamimura, published by SAN University
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.