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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Fasy, B.T., Lecci, F., Rinaldo, A., Wasserman, L., Balakrishnan, S., Singh, A.: Confidence sets for persistence diagrams. Ann. Stat. 6, 2301–2339 (2014)
Rucco, M., Castiglione, F., Merelli, E., Pettini, M.: Characterisation of the idiotypic immune network through persistent entropy. In: Proceedings Complex (2015)
Chintakunta, H., Gentimis, T., Gonzalez-Diaz, R., Jimenez, M.J., Krim, H.: An entropy-based persistence barcode. Pattern Recogn. 48(2), 391–401 (2015)
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)
Adams, H., Tausz, A.: Javaplex tutorial (2011)
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)
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)
Jonoska, N., Saito, M.: Discrete and Topological Models in Molecular Biology. Springer, Heidelberg (2013)
Bubenik, P.: Statistical topological data analysis using persistence landscapes. J. Mach. Learn. Res. 16(1), 77–102 (2015)
Hatcher, A.: Algebraic Topology. Cambridge University Press, Cambridge
Munkres, J.R.: Elements of Algebraic Topology, vol. 2. Addison-Wesley, Reading (1984)
Edelsbrunner, H., Harer, J.: Computational topology: an introduction. Am. Math. Soc. (2010)
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
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
Corresponding author
Editor information
Editors and Affiliations
Rights 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)