Metric geometry | Graph distance | Matrices

Distance matrix

In mathematics, computer science and especially graph theory, a distance matrix is a square matrix (two-dimensional array) containing the distances, taken pairwise, between the elements of a set. Depending upon the application involved, the distance being used to define this matrix may or may not be a metric. If there are N elements, this matrix will have size N×N. In graph-theoretic applications the elements are more often referred to as points, nodes or vertices. (Wikipedia).

Distance matrix
Video thumbnail

The Distance Formula

This video show how to use the distance formula to determine the distance between two points. It also shows how it is derived from the Pythagorean theorem. http://mathispower4u.yolasite.com/

From playlist Using the Distance Formula / Midpoint Formula

Video thumbnail

Example: Determine the Distance Between Two Points

This video shows an example of determining the length of a segment on the coordinate plane by using the distance formula. Complete Video List: http://www.mathispower4u.yolasite.com or http://www.mathispower4u.wordpress.com

From playlist Using the Distance Formula / Midpoint Formula

Video thumbnail

The distance formula in multidimensional spaces... and vectors too -- Calculus III

This lecture is on Calculus III. It follows Part III of the book Calculus Illustrated by Peter Saveliev. The text of the book can be found at http://calculus123.com.

From playlist Calculus III

Video thumbnail

Distance Formula given two points

In this video, we review how to calculate the distance if we are given the value of two points

From playlist Geometry

Video thumbnail

k-NN 4: which distance function?

[http://bit.ly/k-NN] The nearest-neighbour algorithm is sensitive to the choice of distance function. Euclidean distance (L2) is a common choice, but it may lead to sub-optimal performance. We discuss Minkowski (p-norm) distance functions, which generalise the Euclidean distance, and can a

From playlist Nearest Neighbour Methods

Video thumbnail

Distance Formula given a graph

An example using the distance formula when given a graph to analyze

From playlist Geometry

Video thumbnail

Determine the distance between two points using distance formula ex 1, A(3, 2) and B(6, 3)

👉 Learn how to find the distance between two points. The distance between two points is the length of the line joining the two points in the coordinate plane. To find the distance between two points in the coordinate plane, we make use of the formula d = sqrt((x2 - x1)^2 + (y2 - y1)^2). 👏

From playlist Find the Distance of the Line Segment

Video thumbnail

Determine the distance between two points on a coordinate axis

👉 Learn how to find the distance between two points. The distance between two points is the length of the line joining the two points in the coordinate plane. To find the distance between two points in the coordinate plane, we make use of the formula d = sqrt((x2 - x1)^2 + (y2 - y1)^2). 👏

From playlist Find the Distance of the Line Segment

Video thumbnail

ML Tutorial: Probabilistic Dimensionality Reduction, Part 2/2 (Neil Lawrence)

Machine Learning Tutorial at Imperial College: Probabilistic Dimensionality Reduction, Part 2/2 Neil Lawrence (University of Sheffield) October 21, 2015

From playlist Machine Learning Tutorials

Video thumbnail

Multidimensional Scaling - An EXTREMELY POWERFUL algorithm

Entry to #some2 Multidimensional scaling is also similar to PCA and has other names as well. I hope this video informs you of the basics. You can probably analyse a clean dataset using it now if you know some R or Python. Top 1000 Instagram Influencer dataset: https://www.kaggle.com/d

From playlist Summer of Math Exposition 2 videos

Video thumbnail

Lieven Vandenberghe: "Bregman proximal methods for semidefinite optimization."

Intersections between Control, Learning and Optimization 2020 "Bregman proximal methods for semidefinite optimization." Lieven Vandenberghe - University of California, Los Angeles (UCLA) Abstract: We discuss first-order methods for semidefinite optimization, based on non-Euclidean projec

From playlist Intersections between Control, Learning and Optimization 2020

Video thumbnail

Modern Time Series Analysis with STUMPY || Sean Law

Traditional time series analysis techniques have found success in a variety of data mining tasks. However, they often require years of experience to master and the recent development of straightforward, easy-to-use analysis tools has been lacking. STUMPY is a scientific Python library for

From playlist Python

Video thumbnail

6.4.3 R6. Segmenting Images - Video 2: Clustering Pixels

MIT 15.071 The Analytics Edge, Spring 2017 View the complete course: https://ocw.mit.edu/15-071S17 Instructor: Nataly Youssef Understanding how to find the distance matrix to compute pairwise distances between pixel intensity values. License: Creative Commons BY-NC-SA More information at

From playlist MIT 15.071 The Analytics Edge, Spring 2017

Video thumbnail

Lecture 23 - Distance-Based Phylogeny

This is Lecture 23 of the CSE549 (Computational Biology) course taught by Professor Steven Skiena [http://www.cs.sunysb.edu/~skiena/] at Stony Brook University in 2010. The lecture slides are available at: http://www.algorithm.cs.sunysb.edu/computationalbiology/pdf/lecture23.pdf More inf

From playlist CSE549 - Computational Biology - 2010 SBU

Video thumbnail

Statistical Rethinking Winter 2019 Lecture 19

Lecture 19 of the Dec 2018 through March 2019 edition of Statistical Rethinking: A Bayesian Course with R and Stan.

From playlist Statistical Rethinking Winter 2019

Video thumbnail

Metric and manifold repair for missing data - Anna Gilbert

Virtual Workshop on Missing Data Challenges in Computation Statistics and Applications Topic: Metric and manifold repair for missing data Speaker: Anna Gilbert Date: September 11, 2020 For more video please visit http://video.ias.edu

From playlist Mathematics

Video thumbnail

Pre-Calculus - Using the Distance Formula

This video explains how to use the distance formula on two points. Time is also taken to explain the exact answer it returns vs the decimal approximation which can be a bit more useful. For kore videos visit http://www.mysecretmathtutor.com

From playlist Pre-Calculus - Linear Functions

Video thumbnail

Stanford EE104: Introduction to Machine Learning | 2020 | Lecture 19 - principal components analysis

Professor Sanjay Lall Electrical Engineering To follow along with the course schedule and syllabus, visit: http://ee104.stanford.edu To view all online courses and programs offered by Stanford, visit: https://online.stanford.edu/ 0:00 Introduction 0:12 Distance to a subspace 8:06 PCA

From playlist Stanford EE104: Introduction to Machine Learning Full Course

Related pages

Graph (discrete mathematics) | Hamming distance | Coding theory | Multiple sequence alignment | Fish School Search | Distance | Cluster analysis | Hierarchical clustering | Star network | Min-plus algebra | Wiener index | Pixel | Least squares | Cosine similarity | Min-plus matrix multiplication | Graph theory | Isomap | Adjacency matrix | Block code | Mathematics | Square matrix | Symmetric matrix | Fast Fourier transform | Sequence alignment | Neighbor joining | Distance correlation | Dynamic time warping | Nearest neighbor search | Hollow matrix | Matrix multiplication | Euclidean distance | Chemical graph theory | UPGMA | Directed graph | Distance set | Nonnegative matrix | Euclidean distance matrix