Skip to main content
SpringerLink
Log in

Case Study of Network-Based Unsupervised Learning: Stochastic Competitive Learning in Networks

  • Chapter
Machine Learning in Complex Networks

  • 6090 Accesses

Abstract

Many business and day-to-day problems that arise in our lives must be dealt with under several constraints, such as the prohibition of external interventions of human beings. This may be due to high operational costs or physical or economical impossibilities that are inherently involved in the process. The unsupervised learning—one of the existing machine learning paradigms—can be employed to address these issues and is the main topic discussed in this chapter. For instance, a possible unsupervised task would be to discover communities in social networks, find out groups of proteins with the same biological functions, among many others. In this chapter, the unsupervised learning is investigated with a focus on methods relying on the complex networks theory. In special, a type of competitive learning mechanism based on a stochastic nonlinear dynamical system is discussed. This model possesses interesting properties, runs roughly in linear time for sparse networks, and also has good performance on artificial and real-world networks. In the initial setup, a set of particles is released into vertices of a network in a random manner. As time progresses, they move across the network in accordance with a convex stochastic combination of random and preferential walks, which are related to the offensive and defensive behaviors of the particles, respectively. The competitive walking process reaches a dynamic equilibrium when each community or data cluster is dominated by a single particle. Straightforward applications are in community detection and data clustering. In essence, data clustering can be considered as a community detection problem once a network is constructed from the original data set. In this case, each vertex corresponds to a data item and pairwise connections are established using a suitable network formation process.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Recall the evaluation of each entry of the domination matrix in (9.7).

  2. 2.

    Recall that all particles are active at the initial state in view of (9.26).

References

  1. Allinson, N., Yin, H., Allinson, L., Slack, J.: Advances in Self-Organising Maps. Springer, New York (2001)

    Book  MATH  Google Scholar 

  2. Amorim, D.G., Delgado, M.F., Ameneiro, S.B.: Polytope ARTMAP: pattern classification without vigilance based on general geometry categories. IEEE Trans. Neural Netw. 18(5), 1306–1325 (2007)

    Article  Google Scholar 

  3. Athinarayanan, R., Sayeh, M.R., Wood, D.A.: Adaptive competitive self-organizing associative memory. IEEE Trans. Syst. Man Cybern. Part A 32(4), 461–471 (2002)

    Article  Google Scholar 

  4. Bacciu, D., Starita, A.: Competitive repetition suppression (CoRe) clustering: a biologically inspired learning model with application to robust clustering. IEEE Trans. Neural Netw. 19(11), 1922–1940 (2008)

    Article  Google Scholar 

  5. Bishop, C.M.: Pattern Recognition and Machine Learning (Information Science and Statistics). Springer, New York (2007)

    Google Scholar 

  6. Carpenter, G.A., Grossberg, S.: Self-organization of stable category recognition codes for analog input patterns. Appl. Opt. 26(23), 4919–4930 (1987)

    Article  Google Scholar 

  7. Chen, M., Ghorbani, A.A., Bhavsar, V.C.: Incremental communication for adaptive resonance theory networks. IEEE Trans. Neural Netw. 16(1), 132–144 (2005)

    Article  Google Scholar 

  8. Çinlar, E.: Introduction to Stochastic Processes. Prentice-Hall, Englewood Cliffs (1975)

    MATH  Google Scholar 

  9. Deboeck, G.J., Kohonen, T.K.: Visual Explorations in Finance: With Self-Organizing Maps. Springer, New York (2010)

    MATH  Google Scholar 

  10. do Rêgo, R.L.M.E., Araújo, A.F.R., Neto, F.B.L.: Growing self-reconstruction maps. IEEE Trans. Neural Netw. 21(2), 211–223 (2010)

    Google Scholar 

  11. Fortunato, S.: Community detection in graphs. Phys. Rep. 486, 75–174 (2010)

    Article  MathSciNet  Google Scholar 

  12. Fu, X., Wang, L.: Data dimensionality reduction with application to simplifying rbf network structure and improving classification performance. IEEE Trans. Syst. Man Cybern., Part B: Cybern. 33(3), 399–409 (2003)

    Google Scholar 

  13. Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 99(12), 7821–7826 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  14. Grossberg, S.: Competitive learning: from interactive activation to adaptive resonance. Cogn. Sci. 11, 23–63 (1987)

    Article  Google Scholar 

  15. Hull, J.J.: A database for handwritten text recognition research. IEEE Trans. Pattern Anal. Mach. Intell. 16, 550–554 (1994)

    Article  Google Scholar 

  16. Jain, L.C., Lazzerini, B., Ugur, H.: Innovations in ART Neural Networks (Studies in Fuzziness and Soft Computing). Physica, Heidelberg (2010)

    Google Scholar 

  17. Kaylani, A., Georgiopoulos, M., Mollaghasemi, M., Anagnostopoulos, G.C., Sentelle, C., Zhong, M.: An adaptive multiobjective approach to evolving ART architectures. IEEE Trans. Neural Netw. 21(4), 529–550 (2010)

    Article  Google Scholar 

  18. Knuth, D.E.: The Stanford GraphBase: A Platform for Combinatorial Computing. ACM, New York (1993)

    MATH  Google Scholar 

  19. Kohonen, T.: The self-organizing map. Proc. IEEE 78(9), 1464–1480 (1990)

    Article  Google Scholar 

  20. Kosko, B.: Stochastic competitive learning. IEEE Trans. Neural Netw. 2(5), 522–529 (1991)

    Article  Google Scholar 

  21. Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Phys. Rev. E 78(4), 046,110(1–5) (2008)

    Google Scholar 

  22. Liu, D., Pang, Z., Lloyd, S.R.: A neural network method for detection of obstructive sleep apnea and narcolepsy based on pupil size and EEG. IEEE Trans. Neural Netw. 19(2), 308–318 (2008)

    Article  Google Scholar 

  23. Liu, J., Cai, D., He, X.: Gaussian mixture model with local consistency. In: AAAI’10, vol. 1, pp. 512–517 (2010)

    Google Scholar 

  24. López-Rubio, E., de Lazcano-Lobato, J.M.O., López-Rodríguez, D.: Probabilistic PCA self-organizing maps. IEEE Trans. Neural Netw. 20(9), 1474–1489 (2009)

    Article  Google Scholar 

  25. Lu, Z., Ip, H.H.S.: Generalized competitive learning of gaussian mixture models. IEEE Trans. Syst. Man Cybern., Part B: Cybern. 39(4), 901–909 (2009)

    Google Scholar 

  26. Lusseau, D.: The emergent properties of a dolphin social network. Proc. R. Soc. B Biol. Sci. 270(Suppl 2), S186–S188 (2003)

    Article  Google Scholar 

  27. MacQueen, J.B.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the fifth Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, pp. 281–297. University of California Press, Berkeley (1967)

    Google Scholar 

  28. Meyer-Bäse, A., Thümmler, V.: Local and global stability analysis of an unsupervised competitive neural network. IEEE Trans. Neural Netw. 19(2), 346–351 (2008)

    Article  Google Scholar 

  29. Newman, M.E.J.: Fast algorithm for detecting community structure in networks. Phys. Rev. E 69(6), 066,133 (2004)

    Google Scholar 

  30. Newman, M.E.J.: Modularity and community structure in networks. Proc. Natl. Acad. Sci. 103(23), 8577–8582 (2006)

    Article  Google Scholar 

  31. Príncipe, J.C., Miikkulainen, R.: Advances in Self-Organizing Maps - 7th International Workshop, WSOM 2009. Lecture Notes in Computer Science, vol. 5629. Springer, New York (2009)

    Google Scholar 

  32. Quiles, M.G., Zhao, L., Alonso, R.L., Romero, R.A.F.: Particle competition for complex network community detection. Chaos 18(3), 033,107 (2008)

    Google Scholar 

  33. Ratle, F., Weston, J., Miller, M.L.: Large-scale clustering through functional embedding. In: Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II, European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD), pp. 266–281. Springer, New York (2008)

    Google Scholar 

  34. Shi, J., Malik, J.: Normalized Cut and Image Segmentation. Tech. rep., University of California at Berkeley, Berkeley (1997)

    Google Scholar 

  35. Silva, T.C., Zhao, L.: Stochastic competitive learning in complex networks. IEEE Trans. Neural Netw. Learn. Syst. 23(3), 385–398 (2012)

    Article  Google Scholar 

  36. Silva, T.C., Zhao, L.: Uncovering overlapping cluster structures via stochastic competitive learning. Inf. Sci. 247, 40–61 (2013)

    Article  MathSciNet  Google Scholar 

  37. Silva, T.C., Zhao, L., Cupertino, T.H.: Handwritten data clustering using agents competition in networks. J. Math. Imaging Vision 45(3), 264–276 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  38. Sugar, C.A., James, G.M.: Finding the number of clusters in a data set: an information theoretic approach. J. Am. Stat. Assoc. 98, 750–763 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  39. Tan, A.H., Lu, N., Xiao, D.: Integrating temporal difference methods and self-organizing neural networks for reinforcement learning with delayed evaluative feedback. IEEE Trans. Neural Netw. 19(2), 230–244 (2008)

    Article  Google Scholar 

  40. Wang, Y., Li, C., Zuo, Y.: A selection model for optimal fuzzy clustering algorithm and number of clusters based on competitive comprehensive fuzzy evaluation. IEEE Trans. Fuzzy Syst. 17(3), 568–577 (2009)

    Article  Google Scholar 

  41. Xu, R., II, D.W.: Survey of clustering algorithms. IEEE Trans. Neural Netw. 16(3), 645–678 (2005)

    Google Scholar 

  42. Zachary, W.W.: An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33, 452–473 (1977)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departament of Research (Depep), Central Bank of Brazil, Brasília, Distrito Federal, Brazil

    Thiago Christiano Silva

  2. Computer Science and Mathematics, University of São Paulo (USP), Ribeirão Preto, São Paulo, Brazil

    Liang Zhao

Authors
  1. Thiago Christiano Silva
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Liang Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Silva, T.C., Zhao, L. (2016). Case Study of Network-Based Unsupervised Learning: Stochastic Competitive Learning in Networks. In: Machine Learning in Complex Networks. Springer, Cham. https://doi.org/10.1007/978-3-319-17290-3_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-17290-3_9

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-17289-7

  • Online ISBN: 978-3-319-17290-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation