Evolutionary Modularity Optimization Clustering of Neuronal Spike Trains

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10637)

Abstract

We propose a method for automatic evolutionary clustering of multi neuronal spike trains on the basis of community detection in complex networks. We use a genetic algorithm for optimization to maximize the modularity for community partitioning and then automatically determine the number of clusters hidden in the multi neuronal spike trains. The number of clusters does not need to be specified in advance. Compared with the traditional graph partitioning method, the genetic evolutionary modularity optimization clustering algorithm can obtain the maximum value of modularity and, determine the number of communities. We evaluate the performance of this method on surrogate spike train datasets with ground truth. The results obtained showed improvement. We then apply this proposed method to raw real spike trains. We obtain a larger value for modularity and the results. This finding suggests that the proposed method can be used to detect the hidden firing pattern.

Keywords

Spike trains Modularity Genetic algorithm 

Notes

Acknowledgments

This study was supported by the National Natural Science Foundation of China (Project No. 61375122 and Project No. 61572239), China Postdoctoral Science Foundation (Project No. 2014M551324). Scientific Research Foundation for Advanced Talents of Jiangsu University (Project No. 14JDG040).

References

  1. 1.
    Stevenson, I.H., Kording, K.P.: How advances in neural recording affect data analysis. Nat. Neurosci. 14(2), 139–142 (2011)CrossRefGoogle Scholar
  2. 2.
    Hartigan, J.A.: Cluster Algorithms. Wiley, New York (1975)MATHGoogle Scholar
  3. 3.
    Ng, A., Jordan, M., Weiss, Y.: On spectral clustering: analysis and an algorithm. In: Advances in Neural Information Precessing Systems 14 (2001)Google Scholar
  4. 4.
    Humphries, M.D.: Spike-train communities: finding groups of similar spike trains. J. Neurosci. 31(6), 2321–2336 (2011)CrossRefGoogle Scholar
  5. 5.
    Newman, M.E.: Fast algorithm for detecting community structure in networks. Phys. Rev. E 69(6), 066133 (2004)CrossRefGoogle Scholar
  6. 6.
    Newman, M.E.: Modularity and community structure in networks. Proc. Nat. Acad. Sci. 103(23), 8577–8582 (2006)CrossRefGoogle Scholar
  7. 7.
    Hu, L., Hui, W.: Detecting community structure in networks based on community coefficients. Physica A Stat. Mech. Appl. 391, 6156–6164 (2012)CrossRefGoogle Scholar
  8. 8.
    Dauwels, J., Vialatte, F., Weber, T., Cichocki, A.: On similarity measures for spike trains. In: Köppen, M., Kasabov, N., Coghill, G. (eds.) ICONIP 2008. LNCS, vol. 5506, pp. 177–185. Springer, Heidelberg (2009). doi: 10.1007/978-3-642-02490-0_22 CrossRefGoogle Scholar
  9. 9.
    Paiva, A.R., Park, I., Prncipe, J.C.: A comparison of binless spike train measures. Neural Comput. Appl. 19(3), 405–419 (2010)CrossRefGoogle Scholar
  10. 10.
    Duch, J., Arenas, A.: Community detection in complex networks using extremal optimization. Phys. Rev. E 72(2), 027104 (2005)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.School of Computer Science and Communication EngineeringJiangsu UniversityZhenjiangChina
  2. 2.School of Computer ScienceFudan UniversityShanghaiChina

Personalised recommendations