弹性图-图形与拓扑语.ppt

弹性图，图形与拓扑语法Elastic Maps, Graphs, and Topological Grammars Alexander Gorban, Leicester with Andrei Zinovyev, Paris and Neil Sumner, Leicester Plan of the talk INTRODUCTION Two paradigms for data analysis: statistics and modelling Clustering and K-means Self Organizing Maps PCA and local PCA Plan of the talk 1. Principal manifolds and elastic maps The notion of of principal manifold (PM) Constructing PMs: elastic maps Adaptation and grammars 2. Application technique Projection and regression Maps and visualization of functions 3. Implementation and examples Two basic paradigms for data analysis Statistical Analysis Existence of a Probability Distribution; Statistical Hypothesis about  Data Generation; Verification/Falsification of Hypothesises about Hidden Properties of Data Distribution Data Modelling We should find the Best Model for Data description; We know the Universe of Models; We know the Fitting Criteria; Learning Errors and Generalization Errors analysis for the Model Verification Example: Simplest Clustering K-means algorithm “Centers” can be lines, manifolds,… with the same algorithm SOM - Self Organizing Maps Set of nodes is a finite metric space with distance d(N,M); 0) Map set of nodes into dataspace N→f0(N); 1) Select a datapoint X (random); 2) Find a nearest fi(N) (N=NX); 3) fi+1(N) = fi(N) +wi(d(N, NX))(X- fi(N)),where wi(d) (0wi(d)1) is a decreasing cutting function. The closest node to X is moved the most in the direction of X, while other nodes are moved by smaller amounts depending on their distance from the closest node in the initial geometry. PCA and Local PCA A top secret: the difference between two basic paradigms is not crucial (Almost) Back to Statistics: Quasi-statistics: 1) delete one point from the dataset, 2) fitting,3) analysis of the error for the deleted data; The overfitting problem and smoothed data points (it is very close to non-parametric statistics) Principal manifoldsElastic maps framework Mean point P