{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T00:42:24Z","timestamp":1760402544047,"version":"build-2065373602"},"reference-count":13,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2022,1,9]],"date-time":"2022-01-09T00:00:00Z","timestamp":1641686400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>The properties of decays that take place during jet formation cannot be easily deduced from the final distribution of particles in a detector. In this work, we first simulate a system of particles with well-defined masses, decay channels, and decay probabilities. This presents the \u201ctrue system\u201d for which we want to reproduce the decay probability distributions. Assuming we only have the data that this system produces in the detector, we decided to employ an iterative method which uses a neural network as a classifier between events produced in the detector by the \u201ctrue system\u201d and some arbitrary \u201ctest system\u201d. In the end, we compare the distributions obtained with the iterative method to the \u201ctrue\u201d distributions.<\/jats:p>","DOI":"10.3390\/e24010104","type":"journal-article","created":{"date-parts":[[2022,1,9]],"date-time":"2022-01-09T20:29:26Z","timestamp":1641760166000},"page":"104","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Introduction and Analysis of a Method for the Investigation of QCD-like Tree Data"],"prefix":"10.3390","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1849-8583","authenticated-orcid":false,"given":"Marko","family":"Jercic","sequence":"first","affiliation":[{"name":"Department of Physics, Faculty of Science, University of Zagreb, 10000 Zagreb, Croatia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5020-6179","authenticated-orcid":false,"given":"Ivan","family":"Jercic","sequence":"additional","affiliation":[{"name":"Department of Physics, Faculty of Science, University of Zagreb, 10000 Zagreb, Croatia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4512-9620","authenticated-orcid":false,"given":"Nikola","family":"Poljak","sequence":"additional","affiliation":[{"name":"Department of Physics, Faculty of Science, University of Zagreb, 10000 Zagreb, Croatia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,1,9]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1088\/1126-6708\/2008\/04\/063","article-title":"The anti-kt jet clustering algorithm","volume":"4","author":"Cacciari","year":"2008","journal-title":"J. High Energy Phys."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Sjostrand, T., Mrenna, S., and Skands, P. (2006). PYTHIA 6.4 Physics and Manual. arXiv.","DOI":"10.1088\/1126-6708\/2006\/05\/026"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1146\/annurev-nucl-101917-021019","article-title":"Deep Learning and Its Application to LHC Physics","volume":"68","author":"Guest","year":"2018","journal-title":"Annu. Rev. Nucl. Part. Sci."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1140\/epjc\/s10052-019-6607-9","article-title":"Junipr: A framework for unsupervised machine learning in particle physics","volume":"79","author":"Andreassen","year":"2019","journal-title":"Eur. Phys. J. C"},{"key":"ref_5","unstructured":"Chollet, F. (2021, January 01). Keras. Available online: https:\/\/keras.io."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Streit, R.L. (1990, January 17\u201321). A neural network for optimum Neyman-Pearson classification. Proceedings of the 1990 IJCNN International Joint Conference on Neural Networks, San Diego, CA, USA.","DOI":"10.1109\/IJCNN.1990.137648"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Tong, X., Feng, Y., and Li, J.J. (2018). Neyman-Pearson classification algorithms and NP receiver operating characteristics. Sci. Adv., 4.","DOI":"10.1126\/sciadv.aao1659"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Jercic, M., and Poljak, N. (2020). Exploring the Possibility of a Recovery of Physics Process Properties from a Neural Network Model. Entropy, 22.","DOI":"10.3390\/e22090994"},{"key":"ref_9","first-page":"694","article-title":"On the problem of the most efficient tests of statistical hypotheses","volume":"231","author":"Neyman","year":"1933","journal-title":"Phil. Trans. R. Soc. Lond. A."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Bishop, C.M. (1995). Neural Networks for Pattern Recognition, Oxford University Press.","DOI":"10.1093\/oso\/9780198538493.001.0001"},{"key":"ref_11","unstructured":"Kingma, D., and Ba, J. (2014). A Method for Stochastic Optimization. arXiv."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1214\/aoms\/1177729694","article-title":"On Information and Sufficiency","volume":"22","author":"Kullback","year":"1951","journal-title":"Ann. Math. Stat."},{"key":"ref_13","unstructured":"Nielsen, M.A. (2021, January 01). Neural Networks and Deep Learning. Available online: http:\/\/neuralnetworksanddeeplearning.com\/."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/1\/104\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T13:38:20Z","timestamp":1760362700000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/1\/104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,9]]},"references-count":13,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,1]]}},"alternative-id":["e24010104"],"URL":"https:\/\/doi.org\/10.3390\/e24010104","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2022,1,9]]}}}