Foundations of Data Science
From MaRDI portal
Recommendations
- Foundations of data science
- Data science. Foundations, statistics and machine learning
- Statistical foundations of data science
- Mathematical Foundations of Data Science
- Data science: theory and applications
- Principles and methods for data science
- Data science. Theory, analysis and applications
- Fundamentals of data analytics. With a view to machine learning
- Mathematical foundations of data science using R
Cited in
(42)- Foundations of data science
- Simplicial and minimal-variance distances in multivariate data analysis
- Equation of state of neutron-rich matter in \(d\)-dimensions
- Covering of high-dimensional cubes and quantization
- On the upper bound for the expectation of the norm of a vector uniformly distributed on the sphere and the phenomenon of concentration of uniform measure on the sphere
- The Nelder-Mead simplex algorithm with perturbed centroid for high-dimensional function optimization
- On the sample-mean method for computing hyper-volumes
- Why does Monte Carlo fail to work properly in high-dimensional optimization problems?
- DAS-PINNs: a deep adaptive sampling method for solving high-dimensional partial differential equations
- Algorithms for convex hull finding in undirected graphical models
- Mathematical problems in data science. Theoretical and practical methods
- Data science foundations. Geometry and topology of complex hierarchic systems and big data analytics
- Algorithmic aspects of machine learning
- Mathematical foundations for data analysis
- The mathematics of data. Lecture notes from the 26th IAS/Park City Mathematics Institute (PCMI) Summer School, Park City, UT, USA, July 2016
- A new perspective on Gaussian sigma-point Kalman filters
- Sampling in combinatorial and geometric set systems
- Edge deletion algorithms for minimizing spread in SIR epidemic models
- Algorithmic data science (invited talk)
- Statistical foundations of data science
- A counterexample to a conjecture of Larman and Rogers on sets avoiding distance 1
- Best Low-rank Approximations and Kolmogorov n-widths
- Mathematical pictures at a data science exhibition
- Nearly optimal stochastic approximation for online principal subspace estimation
- Low-Rank Binary Matrix Approximation in Column-Sum Norm.
- Polynomial whitening for high-dimensional data
- Performance modeling and analysis for randomly walking mobile users with Markov chains
- Recent Theoretical Advances in Non-Convex Optimization
- Mathematical Foundations of Data Science
- Minkowski-type distances in approximate query searches
- Normal approximation for statistics of randomly weighted complexes
- Extreme values of the Fiedler vector on trees
- Optimization on a finer scale: bounded local subgradient variation perspective
- Solving sparse linear systems faster than matrix multiplication
- A probabilistic diagnostic for Laplace approximations: introduction and experimentation
- Natural language-based synthetic data generation for cluster analysis
- Alignment and comparison of directed networks via transition couplings of random walks
- Private low-rank approximation for covariance matrices, Dyson Brownian motion, and eigenvalue-gap bounds for Gaussian perturbations
- Von Neumann entropy and quantum algorithmic randomness
- Clustering with minimum spanning trees: how good can it be?
- Transience of continuous-time conservative random walks
- Regularized spectral clustering in overlapping networks
This page was built for publication: Foundations of Data Science
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5215510)
