Abstract
The discovery of causal relationships between variables from a large number of nonlinear observations is an important research direction in the field of data mining. Extensive studies have highlighted the challenge of constructing accurate causal networks using existing algorithms using large-scale, nonlinear, and high-dimensional data. To address the challenge of this, we propose a general method for causal discovery algorithms applicable to handling large sample data, namely the subsample based reward and punishment mechanism (SRPM) method, which can handle nonlinear large sample data more effectively. We mainly made three contributions. First, we determine the size of the sample split based on experiments to obtain better learning results. Secondly, we developed a reward and punishment mechanism where each sub-sample dynamically changes its own weight in the process of learning the network skeleton, and proposed the SRPM, a subsample method based on the reward and punishment mechanism. Finally, we combine SRPM with three different additive noise model structure learning algorithms applicable to non-Gaussian nonlinear data respectively, and demonstrate the effectiveness of the method through experiments on data generated by a variety of nonlinear function dependencies. Compared with the existing algorithms, the causal network construction algorithm based on SRPM method has a great improvement in accuracy and time performance, and the effectiveness of the method is also verified in the real power plant data.
This work was supported by the National Natural Science Foundation of China (No. 62176082 and 61902068), Guangdong Basic and Applied Basic Research Foundation (No. 2020A1515011499).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Vowels, M.J., Camgoz, N.C., Bowden, R.: D’ya like dags? a survey on structure learning and causal discovery. ACM Comput. Surv. 55(4), 1–36 (2022)
Shen, X., Ma, S., Vemuri, P., Simon, G.: Challenges and opportunities with causal discovery algorithms: application to alzheimer’s pathophysiology. Sci. Rep. 10(1), 2975 (2020)
Zhu, J.Y., Sun, C., Li, V.O.: An extended spatio-temporal granger causality model for air quality estimation with heterogeneous urban big data. IEEE Trans. Big Data 3(3), 307–319 (2017)
Assaad, C.K., Devijver, E., Gaussier, E.: Survey and evaluation of causal discovery methods for time series. J. Artifi. Intell. Res. 73, 767–819 (2022)
Wermuth, N., Lauritzen, S.L.: R: Graphical and Recursive Models for Contingency Tables. Eksp. Aalborg Centerboghandel (1982)
Cooper, G.F., Herskovits, E.: A bayesian method for constructing bayesian belief networks from databases. In: Uncertainty Proceedings 1991, pp. 86–94. Elsevier (1991)
Gretton, A., Herbrich, R., Smola, A,J.: The kernel mutual information. In: 2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings (ICASSP 2003), vol. 4, pp. IV-880. IEEE (2003)
Duggento, A., Guerrisi, M., Toschi, N.: Recurrent neural networks for reconstructing complex directed brain connectivity. In: 2019 41st Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC), pp. 6418–6421. IEEE (2019)
Liu, F., Chan, L.-W.: Causal inference on multidimensional data using free probability theory. IEEE Trans. Neural Netw. Learn. Syst. 29(7), 3188–3198 (2017)
Zeng, Y., Hao, Z., Cai, R., Xie, F., Huang, L., Shimizu, S.: Nonlinear causal discovery for high-dimensional deterministic data. IEEE Trans. Neural Netw. Learn. Syst. (2021)
Freund, Y., Schapire, R.E.: A decision-theoretic generalization of on-line learning and an application to boosting. J. Comput. Syst. Sci. 55(1), 119–139 (1997)
Yang, J., An, N., Alterovitz, G.: A partial correlation statistic structure learning algorithm under linear structural equation models. IEEE Trans. Knowl. Data Eng. 28(10), 2552–2565 (2016)
Yang, J., Fan, G., Xie, K., Chen, Q., Wang, A.: Additive noise model structure learning based on rank correlation. Inf. Sci. 571, 499–526 (2021)
Yang, J., Jiang, L., Xie, K., Chen, Q., Wang, A.: Causal structure learning algorithm based on partial rank correlation under additive noise model. Appl. Artif. Intell. 36(1), 2023390 (2022)
Rissanen, J.: Modeling by shortest data description. Automatica 14(5), 465–471 (1978)
Teyssier, M., Koller, D.: Ordering-based search: A simple and effective algorithm for learning bayesian networks. arXiv preprint arXiv:1207.1429 (2012)
Zar, J.H.: Significance testing of the spearman rank correlation coefficient. Jo. Am. Stat. Assoc. 67(339), 578–580 (1972)
Friedman, N., Nachman, I., Pe’er, D.: Learning bayesian network structure from massive datasets: The" sparse candidate" algorithm. arXiv preprint arXiv:1301.6696 (2013)
Tsamardinos, I., Brown, L.E., Aliferis, C.F.: The max-min hill-climbing bayesian network structure learning algorithm. Mach. Learn. 65, 31–78 (2006)
Schmidt, M., Niculescu-Mizil, A., Murphy, K., et al.: Learning graphical model structure using l1-regularization paths. AAAI 7, 1278–1283 (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Yang, J., Lu, T., Kuai, F. (2024). Causal Discovery via the Subsample Based Reward and Punishment Mechanism. In: Liu, Q., et al. Pattern Recognition and Computer Vision. PRCV 2023. Lecture Notes in Computer Science, vol 14427. Springer, Singapore. https://doi.org/10.1007/978-981-99-8435-0_18
Download citation
DOI: https://doi.org/10.1007/978-981-99-8435-0_18
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-99-8434-3
Online ISBN: 978-981-99-8435-0
eBook Packages: Computer ScienceComputer Science (R0)