{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T12:20:13Z","timestamp":1762604413954,"version":"build-2065373602"},"reference-count":22,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T00:00:00Z","timestamp":1703894400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","award":["2018\/04654-9","2023\/02538-0"],"award-info":[{"award-number":["2018\/04654-9","2023\/02538-0"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Analysis of the currently established Bayesian nearest neighbors classification model points to a connection between the computation of its normalizing constant and issues of NP-completeness. An alternative predictive model constructed by aggregating the predictive distributions of simpler nonlocal models is proposed, and analytic expressions for the normalizing constants of these nonlocal models are derived, ensuring polynomial time computation without approximations. Experiments with synthetic and real datasets showcase the predictive performance of the proposed predictive model.<\/jats:p>","DOI":"10.3390\/e26010039","type":"journal-article","created":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T06:00:21Z","timestamp":1704002421000},"page":"39","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Probabilistic Nearest Neighbors Classification"],"prefix":"10.3390","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-8218-516X","authenticated-orcid":false,"given":"Bruno","family":"Fava","sequence":"first","affiliation":[{"name":"Department of Economics, Northwestern University, Evanston, IL 60208, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9311-5979","authenticated-orcid":false,"given":"Paulo C. Marques","family":"F.","sequence":"additional","affiliation":[{"name":"Insper Institute of Education and Research, Rua Quat\u00e1 300, S\u00e3o Paulo 04546-042, Brazil"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8429-0353","authenticated-orcid":false,"given":"Hedibert F.","family":"Lopes","sequence":"additional","affiliation":[{"name":"Insper Institute of Education and Research, Rua Quat\u00e1 300, S\u00e3o Paulo 04546-042, Brazil"}]}],"member":"1968","published-online":{"date-parts":[[2023,12,30]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"238","DOI":"10.2307\/1403797","article-title":"Discriminatory analysis\u2014Nonparametric discrimination: Consistency properties","volume":"57","author":"Fix","year":"1989","journal-title":"Int. Stat. Rev."},{"key":"ref_2","unstructured":"Devroye, L., Gy\u00f6rfi, L., and Lugosi, G. (2013). A Probabilistic Theory of Pattern Recognition, Springer."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Biau, G., and Devroye, L. (2015). Lectures on the Nearest Neighbor Method, Springer.","DOI":"10.1007\/978-3-319-25388-6"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1111\/1467-9868.00338","article-title":"A probabilistic nearest neighbour method for statistical pattern recognition","volume":"64","author":"Holmes","year":"2002","journal-title":"J. R. Stat. Soc. B Stat. Methodol."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1198\/jasa.2009.0125","article-title":"A Bayesian Reassessment of Nearest-Neighbor Classification","volume":"104","author":"Cucala","year":"2009","journal-title":"J. Am. Stat. Assoc."},{"key":"ref_6","unstructured":"Garey, M.R., and Johnson, D.S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1111\/j.2517-6161.1974.tb00999.x","article-title":"Spatial Interaction and the Statistical Analysis of Lattice Systems","volume":"36","author":"Besag","year":"1974","journal-title":"J. R. Stat. Soc. B Stat. Methodol."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF01406511","article-title":"A Monte Carlo method for high dimensional integration","volume":"55","author":"Ogata","year":"1989","journal-title":"Numer. Math."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1214\/ss\/1028905934","article-title":"Simulating Normalizing Constants: From Importance Sampling to Bridge Sampling to Path Sampling","volume":"13","author":"Gelman","year":"1998","journal-title":"Stat. Sci."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1093\/biomet\/93.2.451","article-title":"An Efficient Markov Chain Monte Carlo Method for Distributions with Intractable Normalising Constants","volume":"93","author":"Pettitt","year":"2006","journal-title":"Biometrika"},{"key":"ref_11","unstructured":"Cook, S.A. (, January 3\u2013May). The Complexity of Theorem-Proving Procedures. Proceedings of the STOC \u201971: Third Annual ACM Symposium on Theory of Computing, Shaker Heights, OH, USA."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Miller, R., and Thatcher, J. (1972). Complexity of Computer Computations, Plenum Press.","DOI":"10.1007\/978-1-4684-2001-2"},{"key":"ref_13","unstructured":"Rivlin, T. (1969). An Introduction to the Approximation of Functions, Blaisdell Publishing Company."},{"key":"ref_14","unstructured":"Strang, G. (2006). Linear Algebra and Its Applications, Thomson, Brooks\/Cole."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Hastie, T., Tibshirani, R., and Friedman, J. (2009). The Elements of Statistical Learning: Data Mining, Inference, and Prediction, Springer. [2nd ed.].","DOI":"10.1007\/978-0-387-84858-7"},{"key":"ref_16","unstructured":"R Core Team (2017). R: A Language and Environment for Statistical Computing, R Foundation for Statistical Computing."},{"key":"ref_17","unstructured":"Stroustrup, B. (2013). The C++ Programming Language, Addison-Wesley Professional. [4th ed.]."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Eddelbuettel, D. (2013). Seamless R and C++ Integration with Rcpp, Springer.","DOI":"10.1007\/978-1-4614-6868-4"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Ripley, B.D. (1996). Pattern Recognition and Neural Networks, Cambridge University Press.","DOI":"10.1017\/CBO9780511812651"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Venables, W.N., and Ripley, B.D. (2002). Modern Applied Statistics with S, Springer. [4th ed.].","DOI":"10.1007\/978-0-387-21706-2"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1010933404324","article-title":"Random Forests","volume":"45","author":"Breiman","year":"2001","journal-title":"Mach. Learn."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.patrec.2022.04.031","article-title":"Confidence intervals for the random forest generalization error","volume":"158","year":"2022","journal-title":"Pattern Recognit. Lett."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/26\/1\/39\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T21:44:43Z","timestamp":1760132683000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/26\/1\/39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,30]]},"references-count":22,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,1]]}},"alternative-id":["e26010039"],"URL":"https:\/\/doi.org\/10.3390\/e26010039","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2023,12,30]]}}}