{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:38:00Z","timestamp":1742978280682,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":20,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819984343"},{"type":"electronic","value":"9789819984350"}],"license":[{"start":{"date-parts":[[2023,12,24]],"date-time":"2023-12-24T00:00:00Z","timestamp":1703376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,24]],"date-time":"2023-12-24T00:00:00Z","timestamp":1703376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-99-8435-0_18","type":"book-chapter","created":{"date-parts":[[2023,12,23]],"date-time":"2023-12-23T08:02:17Z","timestamp":1703318537000},"page":"224-238","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Causal Discovery via\u00a0the\u00a0Subsample Based Reward and\u00a0Punishment Mechanism"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3922-299X","authenticated-orcid":false,"given":"Jing","family":"Yang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0008-3231-2849","authenticated-orcid":false,"given":"Ting","family":"Lu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0008-3083-9540","authenticated-orcid":false,"given":"Fan","family":"Kuai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,24]]},"reference":[{"issue":"4","key":"18_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3527154","volume":"55","author":"MJ Vowels","year":"2022","unstructured":"Vowels, M.J., Camgoz, N.C., Bowden, R.: D\u2019ya like dags? a survey on structure learning and causal discovery. ACM Comput. Surv. 55(4), 1\u201336 (2022)","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"18_CR2","doi-asserted-by":"publisher","first-page":"2975","DOI":"10.1038\/s41598-020-59669-x","volume":"10","author":"X Shen","year":"2020","unstructured":"Shen, X., Ma, S., Vemuri, P., Simon, G.: Challenges and opportunities with causal discovery algorithms: application to alzheimer\u2019s pathophysiology. Sci. Rep. 10(1), 2975 (2020)","journal-title":"Sci. Rep."},{"issue":"3","key":"18_CR3","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1109\/TBDATA.2017.2651898","volume":"3","author":"JY Zhu","year":"2017","unstructured":"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\u2013319 (2017)","journal-title":"IEEE Trans. Big Data"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1613\/jair.1.13428","volume":"73","author":"CK Assaad","year":"2022","unstructured":"Assaad, C.K., Devijver, E., Gaussier, E.: Survey and evaluation of causal discovery methods for time series. J. Artifi. Intell. Res. 73, 767\u2013819 (2022)","journal-title":"J. Artifi. Intell. Res."},{"doi-asserted-by":"crossref","unstructured":"Wermuth, N., Lauritzen, S.L.: R: Graphical and Recursive Models for Contingency Tables. Eksp. Aalborg Centerboghandel (1982)","key":"18_CR5","DOI":"10.2307\/2336490"},{"doi-asserted-by":"crossref","unstructured":"Cooper, G.F., Herskovits, E.: A bayesian method for constructing bayesian belief networks from databases. In: Uncertainty Proceedings 1991, pp. 86\u201394. Elsevier (1991)","key":"18_CR6","DOI":"10.1016\/B978-1-55860-203-8.50015-2"},{"doi-asserted-by":"crossref","unstructured":"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)","key":"18_CR7","DOI":"10.1109\/ICASSP.2003.1202784"},{"doi-asserted-by":"crossref","unstructured":"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\u20136421. IEEE (2019)","key":"18_CR8","DOI":"10.1109\/EMBC.2019.8856721"},{"issue":"7","key":"18_CR9","first-page":"3188","volume":"29","author":"F Liu","year":"2017","unstructured":"Liu, F., Chan, L.-W.: Causal inference on multidimensional data using free probability theory. IEEE Trans. Neural Netw. Learn. Syst. 29(7), 3188\u20133198 (2017)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"unstructured":"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)","key":"18_CR10"},{"issue":"1","key":"18_CR11","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y Freund","year":"1997","unstructured":"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\u2013139 (1997)","journal-title":"J. Comput. Syst. Sci."},{"issue":"10","key":"18_CR12","doi-asserted-by":"publisher","first-page":"2552","DOI":"10.1109\/TKDE.2016.2578315","volume":"28","author":"J Yang","year":"2016","unstructured":"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\u20132565 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1016\/j.ins.2021.05.061","volume":"571","author":"J Yang","year":"2021","unstructured":"Yang, J., Fan, G., Xie, K., Chen, Q., Wang, A.: Additive noise model structure learning based on rank correlation. Inf. Sci. 571, 499\u2013526 (2021)","journal-title":"Inf. Sci."},{"issue":"1","key":"18_CR14","doi-asserted-by":"publisher","first-page":"2023390","DOI":"10.1080\/08839514.2021.2023390","volume":"36","author":"J Yang","year":"2022","unstructured":"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)","journal-title":"Appl. Artif. Intell."},{"issue":"5","key":"18_CR15","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J Rissanen","year":"1978","unstructured":"Rissanen, J.: Modeling by shortest data description. Automatica 14(5), 465\u2013471 (1978)","journal-title":"Automatica"},{"unstructured":"Teyssier, M., Koller, D.: Ordering-based search: A simple and effective algorithm for learning bayesian networks. arXiv preprint arXiv:1207.1429 (2012)","key":"18_CR16"},{"issue":"339","key":"18_CR17","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1080\/01621459.1972.10481251","volume":"67","author":"JH Zar","year":"1972","unstructured":"Zar, J.H.: Significance testing of the spearman rank correlation coefficient. Jo. Am. Stat. Assoc. 67(339), 578\u2013580 (1972)","journal-title":"Jo. Am. Stat. Assoc."},{"unstructured":"Friedman, N., Nachman, I., Pe\u2019er, D.: Learning bayesian network structure from massive datasets: The\" sparse candidate\" algorithm. arXiv preprint arXiv:1301.6696 (2013)","key":"18_CR18"},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10994-006-6889-7","volume":"65","author":"I Tsamardinos","year":"2006","unstructured":"Tsamardinos, I., Brown, L.E., Aliferis, C.F.: The max-min hill-climbing bayesian network structure learning algorithm. Mach. Learn. 65, 31\u201378 (2006)","journal-title":"Mach. Learn."},{"key":"18_CR20","first-page":"1278","volume":"7","author":"M Schmidt","year":"2007","unstructured":"Schmidt, M., Niculescu-Mizil, A., Murphy, K., et al.: Learning graphical model structure using l1-regularization paths. AAAI 7, 1278\u20131283 (2007)","journal-title":"AAAI"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition and Computer Vision"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8435-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,6]],"date-time":"2024-11-06T19:34:04Z","timestamp":1730921644000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8435-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,24]]},"ISBN":["9789819984343","9789819984350"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8435-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,24]]},"assertion":[{"value":"24 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRCV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chinese Conference on Pattern Recognition and Computer Vision (PRCV)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xiamen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ccprcv2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/prcv2023.xmu.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1420","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"532","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,78","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,69","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}