Paket: r-cran-densityclust (0.3.3-1) [debports]

[ Källkod:  ]

GNU R clustering by fast search and find of density peaks

An improved implementation (based on k-nearest neighbors) of the density peak clustering algorithm, originally described by Alex Rodriguez and Alessandro Laio (Science, 2014 vol. 344). It can handle large datasets (> 100, 000 samples) very efficiently. It was initially implemented by Thomas Lin Pedersen, with inputs from Sean Hughes and later improved by Xiaojie Qiu to handle large datasets with kNNs.

Andra paket besläktade med r-cran-densityclust

• dep: libc6.1 (>= 2.29)

  GNU C-bibliotek: Delade bibliotek
  också ett virtuellt paket som tillhandahålls av libc6.1-udeb

• dep: libgcc-s1 (>= 3.0)

  GCC stödbibliotek

• dep: libstdc++6 (>= 5.2)

  GNU standardbibliotek v3 för C++

• dep: r-api-4.0

  virtuellt paket som tillhandahålls av r-base-core

• dep: r-cran-cpp11

  C++11 interface for GNU R's C interface

• dep: r-cran-fnn

  GNU R fast nearest neighbor search algorithms and applications

• dep: r-cran-ggplot2

  implementation of the Grammar of Graphics

• dep: r-cran-ggrepel

  auto-position non-overlapping text labels in plots

• dep: r-cran-gridextra

  GNU R package with extensions for the grid package

• dep: r-cran-rcolorbrewer

  GNU R package providing suitable color palettes

• dep: r-cran-rtsne

  GNU R T-Distributed Stochastic Neighbor Embedding using a Barnes-Hut

• rec: r-cran-covr

  test coverage for GNU R packages

• rec: r-cran-testthat

  GNU R testsuite

Hämta r-cran-densityclust

Hämtningar för alla tillgängliga arkitekturer

Arkitektur	Paketstorlek	Installerad storlek	Filer
alpha (inofficiell anpassning)	147,8 kbyte	251,0 kbyte	[filförteckning]