Abstract
Unsupervised learning is a broad topic in machine learning with many diverse sub-disciplines. Within the field of unsupervised learning we will consider three major topics: dimension reduction; clustering; and anomaly detection. We seek to use the languages of topology and category theory to provide a unified mathematical approach to these three major problems in unsupervised learning.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Barr, M.: Fuzzy set theory and topos theory. Canad. Math. Bull 29(4), 501–508 (1986)
Campello, R.J.G.B., Moulavi, D., Sander, J.: Density-based clustering based on hierarchical density estimates. In: Pei, J., Tseng, V.S., Cao, L., Motoda, H., Xu, G. (eds.) PAKDD 2013. LNCS (LNAI), vol. 7819, pp. 160–172. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-37456-2_14
Carlsson, G., Mémoli, F.: Classifying clustering schemes. Found. Comput. Math. 13(2), 221–252 (2013)
Chaudhuri, K., Dasgupta, S.: Rates of convergence for the cluster tree. In: Proceedings of the 23rd International Conference on Neural Information Processing Systems. NIPS 2010, pp. 343–351. Curran Associates Inc., USA (2010)
Goerss, P.G., Jardine, J.F.: Simplicial Homotopy Theory. Springer, Basel (2009). https://doi.org/10.1007/978-3-0346-0189-4
Hartigan, J.A.: Consistency of single linkage for high-density clusters. J. Am. Stat. Assoc. 76(374), 388–394 (1981)
Lee, J.A., Verleysen, M.: Shift-invariant similarities circumvent distance concentration in stochastic neighbor embedding and variants. Procedia Comput. Sci. 4, 538–547 (2011)
McInnes, L., Healy, J.: Accelerated hierarchical density clustering. arXiv preprint arXiv:1705.07321 (2017)
McInnes, L., Healy, J.: Umap: uniform manifold approximation and projection for dimension reduction. arXiv preprint arXiv:1802.03426 (2018)
Spivak, D.I.: Metric realization of fuzzy simplicial sets. Self published notes http://math.mit.edu/~dspivak/files/metric_realization.pdf
Stuetzle, W.: Estimating the cluster tree of a density by analyzing the minimal spanning tree of a sample. J. Classif. 20(1), 025–047 (2003)
Wishart, D.: Mode analysis: a generalization of nearest neighbor which reduces chaining effects. Numer. Taxonomy 76(282–311), 17 (1969)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
McInnes, L. (2019). Topological Methods for Unsupervised Learning. In: Nielsen, F., Barbaresco, F. (eds) Geometric Science of Information. GSI 2019. Lecture Notes in Computer Science(), vol 11712. Springer, Cham. https://doi.org/10.1007/978-3-030-26980-7_35
Download citation
DOI: https://doi.org/10.1007/978-3-030-26980-7_35
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-26979-1
Online ISBN: 978-3-030-26980-7
eBook Packages: Computer ScienceComputer Science (R0)