Coder Social home page Coder Social logo

kdevine's People

Contributors

tnagler avatar tvatter avatar

Stargazers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

Watchers

 avatar  avatar  avatar  avatar  avatar

kdevine's Issues

C stack usage is too close to limit.

This example creates a C stack issue:

library(kdevine, quietly = TRUE)
data(wdbc)  # load data
wdbc[wdbc == 0] <- .Machine$double.eps
fit <- kdevine(as.matrix(wdbc[sample(nrow(wdbc), 2e3, replace = TRUE), 2:3]),
                       xmin = rep(0, 2), cores = 1, info = F)

I tried this both on Mac and Ubuntu. If you reduce the number of samples from 2e3 to 1e3, error goes away. I traced it back to locfit, but not sure how to fix it.

memory performance

Hi again. I profiled

if (!require(profvis)) install.packages("profvis")
library(kdevine)

data(wdbc)
wdbc[wdbc == 0] <- .Machine$double.eps

profvis::profvis(
  kdevine(as.matrix(wdbc[sample(nrow(wdbc), 2e4, replace = TRUE), 2:6]),
                           xmin = rep(0, 5), cores = 1, info = FALSE)
)

with profvis and have noticed that ~82% of time is spent on garbage collection. For a dataset of ~2 Mb, ~100 Gb worth of objects was allocated and destroyed.

Do you have any insight into why that is happening and whether any fixes come to mind?

about the CDF of the kernel vinecopula

Dear Nagler

I need help in R, please.
usually, any package of any distribution in R contains three commands such as rname, dname and pname. I found a package called kdevine https://github.com/tnagler/kdevine

and it has dkdevinecop and rkdevinecop but it doesn't have the option pkdevinecop (the CDF). I tried to write it like this but it is wrong, could you see it, please

Regards

library(kdevine)
library(kdecopula)

data(wdbc)

fit <- kdevine(wdbc[, 5:7], xmin = rep(0, 3))
f<-dkdevine(wdbc[, 5:7], fit)

for(i in 1:length(f)){
p<-sum(dkdevinecop(c(wdbc[, 5],wdbc[,6],wdbc[,7]),fit))
}
print (p)

categorical variables

Hey again :) One issue I am running into is handling categorical variables in a principled manner - I jittered mine to get an approximate answer.

Are there any theoretical obstacles with adding something like Aitchison-Aitken kernel and the corresponding CDF to also handle unordered, categorical data, similar to np package, while still maintaining control of the curse of dimensionality?

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.