[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

Separating Topological Noise from Features Using Persistent Entropy

  • Conference paper
  • First Online:
Software Technologies: Applications and Foundations (STAF 2016)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 9946))

Abstract

Topology is the branch of mathematics that studies shapes and maps among them. From the algebraic definition of topology a new set of algorithms have been derived. These algorithms are identified with “computational topology” or often pointed out as Topological Data Analysis (TDA) and are used for investigating high-dimensional data in a quantitative manner. Persistent homology appears as a fundamental tool in Topological Data Analysis. It studies the evolution of \(k-\)dimensional holes along a sequence of simplicial complexes (i.e. a filtration). The set of intervals representing birth and death times of \(k-\)dimensional holes along such sequence is called the persistence barcode. \(k-\)dimensional holes with short lifetimes are informally considered to be topological noise, and those with a long lifetime are considered to be topological feature associated to the given data (i.e. the filtration). In this paper, we derive a simple method for separating topological noise from topological features using a novel measure for comparing persistence barcodes called persistent entropy.

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

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook
GBP 13.99
Price includes VAT (United Kingdom)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 44.99
Price includes VAT (United Kingdom)
  • Compact, lightweight 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

Similar content being viewed by others

References

  1. Fasy, B.T., Lecci, F., Rinaldo, A., Wasserman, L., Balakrishnan, S., Singh, A.: Confidence sets for persistence diagrams. Ann. Stat. 6, 2301–2339 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  2. Rucco, M., Castiglione, F., Merelli, E., Pettini, M.: Characterisation of the idiotypic immune network through persistent entropy. In: Proceedings Complex (2015)

    Google Scholar 

  3. Chintakunta, H., Gentimis, T., Gonzalez-Diaz, R., Jimenez, M.J., Krim, H.: An entropy-based persistence barcode. Pattern Recogn. 48(2), 391–401 (2015)

    Article  Google Scholar 

  4. Binchi, J., Merelli, E., Rucco, M., Petri, G., Vaccarino, F.: jHoles: a tool for understanding biological complex networks via clique weight rank persistent homology. Electron. Notes Theoret. Comput. Sci. 306, 5–18 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  5. Adams, H., Tausz, A.: Javaplex tutorial (2011)

    Google Scholar 

  6. Mamuye, A., Merelli, E., Rucco, M.: Persistent homology analysis of the RNA folding space. In: Proceedings of 9th EAI Conference on Bio-inspired Information and Communications Technologies (BICT 2015) (2015)

    Google Scholar 

  7. Rucco, M., Concettoni, E., Cristalli, C., Ferrante, A., Merelli, E., Topological classification of small DC motors. In: 1st International Forum on Research and Technologies for Society and Industry (RTSI), pp. 192–197. IEEE (2015)

    Google Scholar 

  8. Jonoska, N., Saito, M.: Discrete and Topological Models in Molecular Biology. Springer, Heidelberg (2013)

    MATH  Google Scholar 

  9. Bubenik, P.: Statistical topological data analysis using persistence landscapes. J. Mach. Learn. Res. 16(1), 77–102 (2015)

    MathSciNet  MATH  Google Scholar 

  10. Hatcher, A.: Algebraic Topology. Cambridge University Press, Cambridge

    Google Scholar 

  11. Munkres, J.R.: Elements of Algebraic Topology, vol. 2. Addison-Wesley, Reading (1984)

    MATH  Google Scholar 

  12. Edelsbrunner, H., Harer, J.: Computational topology: an introduction. Am. Math. Soc. (2010)

    Google Scholar 

  13. Rucco, M., Gonzalez-Diaz, R., Jimenez, M.J., Atienza, N., Cristalli, C., Concettoni, E., Ferrante, A., Merelli, E.: A new topological entropy-based approach for measuring similarities among piecewise linear functions. CoRR abs/1512.07613

    Google Scholar 

Download references

Acknowledgments

Authors are partially supported by IMUS, University of Seville under grant VPPI-US and Spanish Government under grant MTM2015-67072-P (MINECO/FEDER, UE). We also thank the reviewers for their valuable and constructive comments.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nieves Atienza .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Atienza, N., Gonzalez-Diaz, R., Rucco, M. (2016). Separating Topological Noise from Features Using Persistent Entropy. In: Milazzo, P., Varró, D., Wimmer, M. (eds) Software Technologies: Applications and Foundations. STAF 2016. Lecture Notes in Computer Science(), vol 9946. Springer, Cham. https://doi.org/10.1007/978-3-319-50230-4_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-50230-4_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-50229-8

  • Online ISBN: 978-3-319-50230-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics