DijkstraSSSP

Dijkstra's SSSP (Single source shortest path) algorithm:
gets the shortest path (geodesic distance) from source vertice(point) to all other vertices(points) defined by 
 the edges of the adjasency matrix

Single source shortest path

Dijkstra's SSSP

Dijkstra

SSSP

A clustering approach applicable to every projection method is proposed here. The two-dimensional scatter plot of any projection method can construct a topographic map which displays unapparent data structures by using distance and density information of the data. The generalized U*-matrix renders this visualization in the form of a topographic map, which can be used to automatically define the clusters of high-dimensional data. The whole system is based on Thrun and Ultsch, "Using Projection based Clustering to Find Distance and Density based Clusters in High-Dimensional Data" <DOI:10.1007/s00357-020-09373-2>. Selecting the correct projection method will result in a visualization in which mountains surround each cluster. The number of clusters can be determined by counting valleys on the topographic map. Most projection methods are wrappers for already available methods in R. By contrast, the neighbor retrieval visualizer (NeRV) is based on C++ source code of the 'dredviz' software package, the t-SNE multicore version is based on C++ source code of Dmitry Ulyanov, and the Curvilinear Component Analysis (CCA) is translated from 'MATLAB' ('SOM Toolbox' 2.0) to R.

Michael Thrun

ProjectionBasedClustering

Projection Based Clustering

Quirin Stier

Brinkmann Luca

Florian Lerch

Felix Pape

Tim Schreier

Luis Winckelmann

Kristian Nybo

Jarkko Venna

Ulyanov Dimitry 

van der Maaten Laurens

DijkstraSSSP function

<dl> <dt>Adj</dt>
<dd>[1:n,1:n] 0/1 adjascency matrix, e.g. from delaunay graph or gabriel graph</dd> <dt>Costs</dt>
<dd>[1:n,1:n] matrix, distances between n points (normally euclidean)</dd> <dt>source</dt>
<dd>int, vertice(point) from which to calculate the geodesic distance to all other points</dd></dl>

Arguments

Author

Dijkstra SSSP — DijkstraSSSP

<dl>

 <dt>Adj</dt>
<dd>[1:n,1:n] 0/1 adjascency matrix, e.g. from delaunay graph or gabriel graph</dd>

 <dt>Costs</dt>
<dd>[1:n,1:n] matrix, distances between n points (normally euclidean)</dd>

 <dt>source</dt>
<dd>int, vertice(point) from which to calculate the geodesic distance to all other points</dd>

</dl>

Dijkstra SSSP

DijkstraSSSP: Dijkstra SSSP

Description

Usage

Value

Arguments

Author

Details

References