File: control

package info (click to toggle)
r-cran-densityclust 0.3-2
  • links: PTS, VCS
  • area: main
  • in suites: bullseye, sid
  • size: 188 kB
  • sloc: cpp: 158; sh: 12; makefile: 2
file content (36 lines) | stat: -rw-r--r-- 1,419 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
Source: r-cran-densityclust
Maintainer: Debian R Packages Maintainers <r-pkg-team@alioth-lists.debian.net>
Uploaders: Andreas Tille <tille@debian.org>
Section: gnu-r
Testsuite: autopkgtest-pkg-r
Priority: optional
Build-Depends: debhelper-compat (= 13),
               dh-r,
               r-base-dev,
               r-cran-rcpp,
               r-cran-fnn,
               r-cran-rtsne,
               r-cran-ggplot2,
               r-cran-ggrepel,
               r-cran-gridextra,
               r-cran-rcolorbrewer
Standards-Version: 4.5.0
Vcs-Browser: https://salsa.debian.org/r-pkg-team/r-cran-densityclust
Vcs-Git: https://salsa.debian.org/r-pkg-team/r-cran-densityclust.git
Homepage: https://cran.r-project.org/package=densityClust
Rules-Requires-Root: no

Package: r-cran-densityclust
Architecture: any
Depends: ${R:Depends},
         ${shlibs:Depends},
         ${misc:Depends}
Recommends: ${R:Recommends}
Suggests: ${R:Suggests}
Description: 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.