Giter VIP home page Giter VIP logo

Comments (6)

sshimizu2006 avatar sshimizu2006 commented on August 21, 2024 5

Now in v1.5.2, you can FORCE prior knowledge on causal ORDERS into estimation, e.g., x1 cannot cause x2.

from lingam.

sshimizu2006 avatar sshimizu2006 commented on August 21, 2024

Hi, this prior knowledge option does not necessarily force the estimated graph to satisfy the prior knowledge given by users. DirectLiNGAM algorithm implemented in this library estimates the causal orders of variables one by one. Therefore, for example, if esimation of the causal orders of some variables fails before the causal orders of the variables about which prior knowledge is available are estimated, then sometimes the prior knowledge cannot be used or sometimes the algorithm might have to estimate some causal orders that might be wrong. Prior knowledge about exogenous variables and sink variables are more likely to be reflected to the output in DirectLiNGAM. Though this "soft" way of using prior knowledge might be different from what some users expect, we thought this option is still helpful to make the estimation better.

from lingam.

kargo113 avatar kargo113 commented on August 21, 2024

Thank you for your answer.
I understand the soft way "no_paths" doesn't force the value to zero.

In addition, is there a better solution that some path values will be zero or quite small value?

Because, some value should be zero when LINGAM was applied to a business problem.
In other words, even though the causal effect between variable A and variable B obviously does not exist, LINGAN sometimes estimates the value is not zero but high.

from lingam.

sshimizu2006 avatar sshimizu2006 commented on August 21, 2024
  1. DirectLiNGAM roughly consists of two steps. First, it estimates causal orders of variables. Second, it estimates the coefficients. If the estimated causal orders are acceptable, putting the coefficient from A to B to be zero and estimating the other coefficients based on the estimated causal orders might be a compromise. This can be done using traditional path analysis or structural equation modeling code package.

  2. Another way might be to compute the bootstrapp probability of the directed edge from A to B. The bootstrap probability might be not quite large.

from lingam.

kargo113 avatar kargo113 commented on August 21, 2024

Thanks for your suggestion. I understand these solutions.

Thank you so much.

from lingam.

kargo113 avatar kargo113 commented on August 21, 2024

Thank you for applying "FORCE prior knowledge".
I'll try to use this method when analyzing our data.

from lingam.

Related Issues (20)

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.