Linear causal model discovery using the MML criterion
Li, Gang, Dai, Honghua and Tu, Yiqing 2002, Linear causal model discovery using the MML criterion, in Proceedings of the 2002 IEEE International Conference on Data Mining, IEEE Computer Society, Los Alamitos, Calif., pp. 274-281.
(Some files may be inaccessible until you login with your Deakin Research Online credentials)
Proceedings of the 2002 IEEE International Conference on Data Mining
Kumar, Vipin Tsumoto, S. Zhong, N. Yu, P. Wu, X.
IEEE Computer Society
Place of publication
Los Alamitos, Calif.
Determining the causal structure of a domain is a key task in the area of Data Mining and Knowledge Discovery.The algorithm proposed by Wallace et al.  has demonstrated its strong ability in discovering Linear Causal Models from given data sets. However, some experiments showed that this algorithm experienced difficulty in discovering linear relations with small deviation, and it occasionally gives a negative message length, which should not be allowed. In this paper, a more efficient and precise MML encoding scheme is proposed to describe the model structure and the nodes in a Linear Causal Model. The estimation of different parameters is also derived. Empirical results show that the new algorithm outperformed the previous MML-based algorithm in terms of both speed and precision.
Unless expressly stated otherwise, the copyright for items in Deakin Research Online is owned by the author, with all rights reserved.
Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO.
If you believe that your rights have been infringed by this repository, please contact email@example.com.