GroupLiNGAM: Linear non-Gaussian acyclic models for sets of variables

Computer Science – Artificial Intelligence

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Finding the structure of a graphical model has been received much attention in many fields. Recently, it is reported that the non-Gaussianity of data enables us to identify the structure of a directed acyclic graph without any prior knowledge on the structure. In this paper, we propose a novel non-Gaussianity based algorithm for more general type of models; chain graphs. The algorithm finds an ordering of the disjoint subsets of variables by iteratively evaluating the independence between the variable subset and the residuals when the remaining variables are regressed on those. However, its computational cost grows exponentially according to the number of variables. Therefore, we further discuss an efficient approximate approach for applying the algorithm to large sized graphs. We illustrate the algorithm with artificial and real-world datasets.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

GroupLiNGAM: Linear non-Gaussian acyclic models for sets of variables does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with GroupLiNGAM: Linear non-Gaussian acyclic models for sets of variables, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and GroupLiNGAM: Linear non-Gaussian acyclic models for sets of variables will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-676620

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.