Data complexity measured by principal graphs

DOI10.1016/j.camwa.2012.12.009zbMath1364.62142arXiv1212.5841OpenAlexW2115990376WikidataQ56999227 ScholiaQ56999227MaRDI QIDQ2629455

Andrei Zinovyev, Evgeny M. Mirkes

Publication date: 6 July 2016

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1212.5841

zbMATH Keywords

data structuresdata analysisapproximation algorithmsdata complexity

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (3)

Editorial: Grasping complexity ⋮ Overcoming Complexity of Biological Systems: from Data Analysis to Mathematical Modeling ⋮ Blessing of dimensionality: mathematical foundations of the statistical physics of data

Uses Software

• UCI-ml
• elmap

Cites Work

• Unnamed Item
• Topological grammars for data approximation
• Modeling by shortest data description
• Ordered risk minimization. I
• Formal languages of labelled graphs
• Principal manifolds for data visualization and dimension reduction. Reviews and original papers presented partially at the workshop `Principal manifolds for data cartography and dimension reduction', Leicester, UK, August 24--26, 2006.
• Neural network iterative method of principal curves for data with gaps
• Elastic principal graphs and manifolds and their practical applications
• Principal points
• Topology for Computing
• An Algorithm for Finding Intrinsic Dimensionality of Data
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
• A new look at the statistical model identification

This page was built for publication: Data complexity measured by principal graphs