39,95 €
39,95 €
inkl. MwSt.
Sofort per Download lieferbar
payback
20 °P sammeln
39,95 €
39,95 €
inkl. MwSt.
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
payback
20 °P sammeln
Als Download kaufen
39,95 €
inkl. MwSt.
Sofort per Download lieferbar
payback
20 °P sammeln
Jetzt verschenken
39,95 €
inkl. MwSt.
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
payback
20 °P sammeln
  • Format: PDF

Topological data analysis (TDA) has emerged recently as a viable tool for analyzing complex data, and the area has grown substantially both in its methodologies and applicability. Providing a computational and algorithmic foundation for techniques in TDA, this comprehensive, self-contained text introduces students and researchers in mathematics and computer science to the current state of the field. The book features a description of mathematical objects and constructs behind recent advances, the algorithms involved, computational considerations, as well as examples of topological structures…mehr

  • Geräte: PC
  • mit Kopierschutz
  • eBook Hilfe
  • Größe: 13.71MB
  • FamilySharing(5)
Produktbeschreibung
Topological data analysis (TDA) has emerged recently as a viable tool for analyzing complex data, and the area has grown substantially both in its methodologies and applicability. Providing a computational and algorithmic foundation for techniques in TDA, this comprehensive, self-contained text introduces students and researchers in mathematics and computer science to the current state of the field. The book features a description of mathematical objects and constructs behind recent advances, the algorithms involved, computational considerations, as well as examples of topological structures or ideas that can be used in applications. It provides a thorough treatment of persistent homology together with various extensions - like zigzag persistence and multiparameter persistence - and their applications to different types of data, like point clouds, triangulations, or graph data. Other important topics covered include discrete Morse theory, the Mapper structure, optimal generating cycles, as well as recent advances in embedding TDA within machine learning frameworks.

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Autorenporträt
Tamal Krishna Dey is Professor of Computer Science at Purdue University. Before joining Purdue, he was a faculty in the CSE department of The Ohio State University. He has held academic positions at Indiana University-Purdue University at Indianapolis, Indian Institute of Technology Kharagpur, and Max Planck Institute. His research interests include computational geometry, computational topology and their applications to geometric modeling and data analysis. He has (co)authored two books Curve and Surface Reconstruction: Algorithms with Mathematical Analysis (Cambridge University Press) and Delaunay Mesh Generation (CRC Press), and (co)authored more than 200 scientific articles. Dey is a fellow of the IEEE, ACM, and Solid Modeling Association.