Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"Nearest Neighbors Graph"”.

  1. K-NEAREST NEIGHBORS DENSITY-BASED CLUSTERING

    … scale of the distances). Connectivity by k-nearest neighbors and density by the number of reverse k-nearest neighbors (i.e., vertex in-degree in the directed k-nearest neighbors graph). Two novel density-based clustering algorithms are proposed, the non-hierarchical RNN-DBSCAN and its …

    vcu Repository record for K-NEAREST NEIGHBORS DENSITY-BASED CLUSTERING (opens in a new tab)

  2. Numerical linear algebra techniques for effective data analysis.

    … scenario, we consider the construction of a nearest-neighbors graph. Under the framework of divide and conquer and via the use of the Lanczos procedure, two algorithms are designed with sub-quadratic (and close to linear) costs, way more efficient than existing practical algorithms when the …

    umn Repository record for Numerical linear algebra techniques for effective data analysis. (opens in a new tab)