Distance geometry and data science
From MaRDI portal
Publication:2192022
DOI10.1007/s11750-020-00563-0OpenAlexW3033108960MaRDI QIDQ2192022
Publication date: 26 June 2020
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.08544
isometric embeddingmathematical programmingartificial neural networksmachine learningrandom projectionEuclidean distance
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Artificial neural networks and deep learning (68T07) Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) General theory of distance geometry (51K05) Randomized algorithms (68W20) Statistical aspects of big data and data science (62R07) Metric embeddings as related to computational problems and algorithms (68R12)
Related Items
A note on the Cayley-Menger determinant and the molecular distance geometry problem, Mathematical optimization in classification and regression trees, Maximum feasible subsystems of distance geometry constraints, The m-Bézout bound and distance geometry, Anomaly detection in the probability simplex under different geometries, Cycle-based formulations in distance geometry, A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems, A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances
Uses Software
Cites Work
- The Reformulation-Optimization Software Engine
- On Information and Sufficiency
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Mathematical programming: Turing completeness and applications to software analysis
- Improving heuristics for network modularity maximization using an exact algorithm
- Graph clustering
- Approximation bounds for sparse principal component analysis
- Angular synchronization by eigenvectors and semidefinite programming
- An improved column generation algorithm for minimum sum-of-squares clustering
- The discretizable molecular distance geometry problem
- Finding community structures in complex networks using mixed integer optimisation
- Edge-swapping algorithms for the minimum fundamental cycle basis problem
- Foundations of computational intelligence. Volume 3: Global optimization
- On Lipschitz embedding of finite metric spaces in Hilbert space
- A counterexample to the rigidity conjecture for polyhedra
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- Laplacian matrices of graphs: A survey
- Problems of distance geometry and convex properties of quadratic maps
- Neural networks and logistic regression: Part I
- Measure concentration in optimization
- Cluster analysis and mathematical programming
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Interior-point methods
- Gaussian random projections for Euclidean membership problems
- Alternating current optimal power flow with generator selection
- Recent advances on the interval distance geometry problem
- Distance geometry in linearizable norms
- Minimal NMR distance information for rigidity of protein graphs
- Cones of diagonally dominant matrices
- Principal component analysis.
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- The geometry of graphs and some of its algorithmic applications
- The discretizable distance geometry problem
- On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data
- When is `nearest neighbour' meaningful: A converse theorem and implications
- Random projections for quadratic programs over a Euclidean ball
- Barvinok's naive algorithm in distance geometry
- On the polynomiality of finding \(^K\text{DMDGP}\) re-orders
- Generalized principal component analysis
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
- A multiplicative weights update algorithm for MINLP
- On the number of realizations of certain Henneberg graphs arising in protein conformation
- An algorithmic theory of learning: Robust concepts and random projection
- Six mathematical gems from the history of distance geometry
- Diagonally Dominant Programming in Distance Geometry
- The Discretizable Molecular Distance Geometry Problem seems Easier on Proteins
- Is the Distance Geometry Problem in NP?
- Distance Geometry
- Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
- Distance Geometry on the Sphere
- Introduction to Stochastic Programming
- Molecular distance geometry methods: from continuous to discrete
- Algorithmic Aspects of Machine Learning
- Sparser Johnson-Lindenstrauss Transforms
- Extensions of Lipschitz mappings into a Hilbert space
- Branching and bounds tighteningtechniques for non-convex MINLP
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- On variants of the Johnson–Lindenstrauss lemma
- Nearest-neighbor-preserving embeddings
- Reformulations in Mathematical Programming: Definitions and Systematics
- Algorithms for Generating Fundamental Cycles in a Graph
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- The Rigidity of Graphs
- On a Relationship Between Graph Realizability and Distance Matrix Completion
- High-Dimensional Probability
- An elementary proof of a theorem of Johnson and Lindenstrauss
- Random Projections for Linear Programming
- The Johnson-Lindenstrauss Transform: An Empirical Study
- Euclidean Distance Geometry
- Undecidability and hardness in mixed-integer nonlinear programming
- DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
- Euclidean Distance Geometry and Applications
- Counting the Number of Solutions of KDMDGP Instances
- Computational Experience with the Molecular Distance Geometry Problem
- Machine Learning: ECML 2004
- Joint Spectral Radius and Path-Complete Graph Lyapunov Functions
- Flow diagrams, turing machines and languages with only two formation rules
- An algorithm for finding a fundamental set of cycles of a graph
- On the Betti Numbers of Real Varieties
