{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T13:58:12Z","timestamp":1767707892232,"version":"3.41.0"},"reference-count":64,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T00:00:00Z","timestamp":1552435200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1747751"],"award-info":[{"award-number":["1747751"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"King Abdullah Scholarship Program"},{"name":"U.S. Air Force Summer Faculty Fellowship Program and the University of Missouri Research Board"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2019,4,30]]},"abstract":"<jats:p>In this article, we focus on the problem of learning a Bayesian network over distributed data stored in a commodity cluster. Specifically, we address the challenge of computing the scoring function over distributed data in an efficient and scalable manner, which is a fundamental task during learning. While exact score computation can be done using the MapReduce-style computation, our goal is to compute approximate scores much faster with probabilistic error bounds and in a scalable manner. We propose a novel approach, which is designed to achieve the following: (a) decentralized score computation using the principle of gossiping; (b) lower resource consumption via a probabilistic approach for maintaining scores using the properties of a Markov chain; and (c) effective distribution of tasks during score computation (on large datasets) by synergistically combining well-known hashing techniques. We conduct theoretical analysis of our approach in terms of convergence speed of the statistics required for score computation, and memory and network bandwidth consumption. We also discuss how our approach is capable of efficiently recomputing scores when new data are available. We conducted a comprehensive evaluation of our approach and compared with the MapReduce-style computation using datasets of different characteristics on a 16-node cluster. When the MapReduce-style computation provided exact statistics for score computation, it was nearly 10 times slower than our approach. Although it ran faster on randomly sampled datasets than on the entire datasets, it performed worse than our approach in terms of accuracy. Our approach achieved high accuracy (below 6% average relative error) in estimating the statistics for approximate score computation on all the tested datasets. In conclusion, it provides a feasible tradeoff between computation time and accuracy for fast approximate score computation on large-scale distributed data.<\/jats:p>","DOI":"10.1145\/3301304","type":"journal-article","created":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T17:11:58Z","timestamp":1552583518000},"page":"1-40","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Fast Approximate Score Computation on Large-Scale Distributed Data for Learning Multinomial Bayesian Networks"],"prefix":"10.1145","volume":"13","author":[{"given":"Anas","family":"Katib","sequence":"first","affiliation":[{"name":"University of Missouri-Kansas City, MO"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1859-0438","authenticated-orcid":false,"given":"Praveen","family":"Rao","sequence":"additional","affiliation":[{"name":"University of Missouri-Kansas City, MO"}]},{"given":"Kobus","family":"Barnard","sequence":"additional","affiliation":[{"name":"University of Arizona, Tucson, AZ"}]},{"given":"Charles","family":"Kamhoua","sequence":"additional","affiliation":[{"name":"Army Research Lab, Adelphi, MD"}]}],"member":"320","published-online":{"date-parts":[[2019,3,13]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"{n.d.}. 2010. Java-Gossip. Retrieved from https:\/\/code.google.com\/archive\/p\/java-gossip\/.  {n.d.}. 2010. Java-Gossip. Retrieved from https:\/\/code.google.com\/archive\/p\/java-gossip\/."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1561\/1300000014"},{"key":"e_1_2_1_3_1","unstructured":"2017. CloudLab. Retrieved from https:\/\/www.cloudlab.us\/.  2017. CloudLab. Retrieved from https:\/\/www.cloudlab.us\/."},{"key":"e_1_2_1_4_1","unstructured":"2017. Kyro. Retrieved from https:\/\/github.com\/EsotericSoftware\/kryo.  2017. Kyro. Retrieved from https:\/\/github.com\/EsotericSoftware\/kryo."},{"key":"e_1_2_1_5_1","unstructured":"2017. LZ4 - Extremely Fast Compression. Retrieved from https:\/\/github.com\/lz4\/lz4.  2017. LZ4 - Extremely Fast Compression. Retrieved from https:\/\/github.com\/lz4\/lz4."},{"key":"e_1_2_1_6_1","unstructured":"2017. Snappy a Fast Compressor\/Decompressor. Retrieved from https:\/\/github.com\/google\/snappy.  2017. Snappy a Fast Compressor\/Decompressor. Retrieved from https:\/\/github.com\/google\/snappy."},{"key":"e_1_2_1_7_1","unstructured":"2017. UCI Machine Learning Repository. Retrieved from https:\/\/archive.ics.uci.edu\/ml\/datasets.html.  2017. UCI Machine Learning Repository. Retrieved from https:\/\/archive.ics.uci.edu\/ml\/datasets.html."},{"volume-title":"Proc. 12th USENIX Symp. Oper. Syst. Des. Implement. (OSDI\u201916)","year":"2016","author":"Abadi Mart\u00edn","key":"e_1_2_1_8_1"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.06.013"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms5308"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2351316.2351330"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/3007263.3007279"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498447"},{"volume-title":"Proc. of Int. Joint Conf. Neural Netw. 1--5.","author":"Chen W.","key":"e_1_2_1_15_1"},{"volume-title":"Learning from Data: Artificial Intelligence and Statistics V","author":"Chickering D. M.","key":"e_1_2_1_16_1"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1093\/jamia\/ocv059"},{"volume-title":"Frontiers in Massive Data Analysis","author":"National Research Council. 2013.","key":"e_1_2_1_18_1"},{"volume-title":"Proc. 6th OSDI Conf. 137--150","year":"2004","author":"Dean Jeffrey","key":"e_1_2_1_19_1"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294281"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/41840.41841"},{"volume-title":"Proc. 2013 APWeb Conf. 697--708","author":"Fang Q.","key":"e_1_2_1_22_1"},{"key":"e_1_2_1_23_1","unstructured":"Apache Flink. 2017. https:\/\/flink.apache.org.  Apache Flink. 2017. https:\/\/flink.apache.org."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400751.1400771"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767930"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015339"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/511446.511502"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102389"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367510"},{"key":"e_1_2_1_30_1","unstructured":"Hyperledger. 2017. Retrieved from http:\/\/hyperledger-fabric.readthedocs.io\/en\/release-1.0\/gossip.html.  Hyperledger. 2017. Retrieved from http:\/\/hyperledger-fabric.readthedocs.io\/en\/release-1.0\/gossip.html."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1082469.1082470"},{"volume-title":"Proc. IEEE Symp. Found. Comput. Sci. 565--574","author":"Karp R.","key":"e_1_2_1_33_1"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142395"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946317"},{"volume-title":"Probabilistic Graphical Models: Principles and Techniques","author":"Koller Daphne","key":"e_1_2_1_36_1"},{"volume-title":"Handbook of Parallel Computing and Statistics","author":"Kontoghiorghes Erricos John","key":"e_1_2_1_37_1","doi-asserted-by":"crossref","DOI":"10.1201\/9781420028683"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1582716.1582722"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735488"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/2685048.2685095"},{"volume-title":"Proc. NIPS 2013 Topic Model Workshop. Australia, 1--5.","year":"2013","author":"Lim Kar Wai","key":"e_1_2_1_41_1"},{"volume-title":"Proc. 26th Conf. Uncertain. Artif. Intell. (UAI\u201910)","year":"2010","author":"Low Yucheng","key":"e_1_2_1_42_1"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"volume-title":"Madsen","year":"2017","author":"Masegosa Andr\u00e9s R.","key":"e_1_2_1_44_1"},{"key":"e_1_2_1_45_1","unstructured":"Patrick McQuighan. 2010. Simulating the Poisson Process. Retrieved from http:\/\/www.math.uchicago.edu\/may\/VIGRE\/VIGRE2010\/REUPapers\/Mcquighan.pdf.  Patrick McQuighan. 2010. Simulating the Poisson Process. Retrieved from http:\/\/www.math.uchicago.edu\/may\/VIGRE\/VIGRE2010\/REUPapers\/Mcquighan.pdf."},{"key":"e_1_2_1_46_1","first-page":"1","article-title":"MLlib: Machine learning in apache spark","volume":"17","author":"Meng Xiangrui","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2014.43"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.924648"},{"volume-title":"Proc. Int. Conf. High Perform. Comput., Netw., Storage Anal. 1--9.","author":"Nikolova O.","key":"e_1_2_1_49_1"},{"volume-title":"Causality: Models, Reasoning, and Inference","year":"2000","author":"Pearl Judea","key":"e_1_2_1_50_1"},{"volume-title":"Big Data: Seizing Opportunities, Preserving Values.","year":"2014","author":"Podesta John","key":"e_1_2_1_51_1"},{"volume-title":"Proc. 2017 AAAI Workshop Distrib. Mach. Learn. (DML\u201917)","year":"2017","author":"Rao Praveen","key":"e_1_2_1_52_1"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05118-0_45"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816758"},{"volume-title":"Proc. 6th Int. Workshop Netw. Meets Databases","year":"2011","author":"Slavov Vasil","key":"e_1_2_1_55_1"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-013-0314-1"},{"key":"e_1_2_1_57_1","unstructured":"SMILE-WIDE. 2014. Retrieved from http:\/\/smilewide.github.io\/main.  SMILE-WIDE. 2014. Retrieved from http:\/\/smilewide.github.io\/main."},{"key":"e_1_2_1_58_1","unstructured":"Apache Spark. 2017. Retrieved from https:\/\/spark.apache.org.  Apache Spark. 2017. Retrieved from https:\/\/spark.apache.org."},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383071"},{"volume-title":"Blei","year":"2016","author":"Tran Dustin","key":"e_1_2_1_60_1"},{"volume-title":"Proc. 9th Int. AAAI Conf. Web Soc. Media.","year":"2015","author":"Wei Wei","key":"e_1_2_1_61_1"},{"key":"e_1_2_1_62_1","volume-title":"Hadoop: The Definitive Guide","author":"White Tom","year":"2009","edition":"1"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783323"},{"volume-title":"Proc. 2nd USENIX Conf. Hot Topics Cloud Comput","year":"2010","author":"Zaharia Matei","key":"e_1_2_1_64_1"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2013.81"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3301304","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3301304","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3301304","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:04Z","timestamp":1750208524000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3301304"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,13]]},"references-count":64,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,4,30]]}},"alternative-id":["10.1145\/3301304"],"URL":"https:\/\/doi.org\/10.1145\/3301304","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"type":"print","value":"1556-4681"},{"type":"electronic","value":"1556-472X"}],"subject":[],"published":{"date-parts":[[2019,3,13]]},"assertion":[{"value":"2018-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-03-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}