Package: skm
Type: Package
Title: Selective k-Means
Version: 0.1.5.4
Author: Guang Yang
Maintainer: Guang Yang <gyang274@gmail.com>
Description: Algorithms for solving selective k-means problem,
    which is defined as finding k rows in an m x n matrix such that 
    the sum of each column minimal is minimized. 
    In the scenario when m == n and each cell value in matrix is a 
    valid distance metric, this is equivalent to a k-means problem. 
    The selective k-means extends the k-means problem in the sense 
    that it is possible to have m != n, often the case m < n which 
    implies the search is limited within a small subset of rows. 
    Also, the selective k-means extends the k-means problem in the 
    sense that the instance in row set can be instance not seen in 
    the column set, e.g., select 2 from 3 internet service provider
    (row) for 5 houses (column) such that minimize the overall cost 
    (cell value) - overall cost is the sum of the column minimal of
    the selected 2 service provider.
License: MIT + file LICENSE
LazyData: TRUE
URL: http://github.com/gyang274/skm
BugReports: http://github.com/gyang274/skm/issues
RoxygenNote: 5.0.1
Depends: R (>= 3.0.0), magrittr, data.table
Imports: methods, plyr, Rcpp (>= 0.12.5), RcppParallel
LinkingTo: Rcpp, RcppArmadillo, RcppParallel
SystemRequirements: GNU make
Suggests: knitr, rmarkdown
VignetteBuilder: knitr
NeedsCompilation: yes
Packaged: 2017-01-23 06:02:24 UTC; gyang
Repository: CRAN
Date/Publication: 2017-01-23 08:22:33
Built: R 4.2.3; x86_64-w64-mingw32; 2024-04-24 01:18:24 UTC; windows
ExperimentalWindowsRuntime: ucrt
Archs: x64
