<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE root>
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" article-type="research-article" dtd-version="1.2" xml:lang="en"><front><journal-meta><journal-id journal-id-type="publisher-id">Discrete and Continuous Models and Applied Computational Science</journal-id><journal-title-group><journal-title xml:lang="en">Discrete and Continuous Models and Applied Computational Science</journal-title><trans-title-group xml:lang="ru"><trans-title>Discrete and Continuous Models and Applied Computational Science</trans-title></trans-title-group></journal-title-group><issn publication-format="print">2658-4670</issn><issn publication-format="electronic">2658-7149</issn><publisher><publisher-name xml:lang="en">Peoples' Friendship University of Russia named after Patrice Lumumba (RUDN University)</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">17894</article-id><article-id pub-id-type="doi">10.22363/2312-9735-2018-26-1-58-73</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>Modeling and Simulation</subject></subj-group><subj-group subj-group-type="toc-heading" xml:lang="ru"><subject>Математическое моделирование</subject></subj-group><subj-group subj-group-type="article-type"><subject>Research Article</subject></subj-group></article-categories><title-group><article-title xml:lang="en">On a Method of Multivariate Density Estimate Basedon Nearest Neighbours Graphs</article-title><trans-title-group xml:lang="ru"><trans-title>Об одном методе оценки многомерной плотности на основеближайших соседей</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Beliakov</surname><given-names>Gleb</given-names></name><name xml:lang="ru"><surname>Беляков</surname><given-names>Глеб</given-names></name></name-alternatives><bio xml:lang="en"><p>Beliakov Gleb - professor, Candidate of Physical and Mathematical Sciences, professor of School of Information Technology of Deakin University, Australia</p></bio><bio xml:lang="ru"><p>Беляков Глеб - профессор, кандидат физико-математических наук, профессор кафедры вычислительных технологий Университета Дикин, Австралия</p></bio><email>gleb@deakin.edu.au</email><xref ref-type="aff" rid="aff1"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">Deakin University</institution></aff><aff><institution xml:lang="ru">Университет Дикин</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2018-12-15" publication-format="electronic"><day>15</day><month>12</month><year>2018</year></pub-date><volume>26</volume><issue>1</issue><issue-title xml:lang="en">VOL 26, NO1 (2018)</issue-title><issue-title xml:lang="ru">ТОМ 26, №1 (2018)</issue-title><fpage>58</fpage><lpage>73</lpage><history><date date-type="received" iso-8601-date="2018-02-28"><day>28</day><month>02</month><year>2018</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2018, Beliakov G.</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2018, Беляков Г.</copyright-statement><copyright-year>2018</copyright-year><copyright-holder xml:lang="en">Beliakov G.</copyright-holder><copyright-holder xml:lang="ru">Беляков Г.</copyright-holder><ali:free_to_read xmlns:ali="http://www.niso.org/schemas/ali/1.0/"/><license><ali:license_ref xmlns:ali="http://www.niso.org/schemas/ali/1.0/">http://creativecommons.org/licenses/by/4.0</ali:license_ref></license></permissions><self-uri xlink:href="https://journals.rudn.ru/miph/article/view/17894">https://journals.rudn.ru/miph/article/view/17894</self-uri><abstract xml:lang="en"><p>A method of multivariate density estimation based on the reweighted nearest neighbours,mimicking the natural neighbours techniques, is presented. Estimation of multivariate densityis important for machine learning, astronomy, biology, physics and econometrics. A 2-additivefuzzy measure is constructed based on proxies for pairwise interaction indices. The neighboursof a point lying in nearly the same direction are treated as redundant, and the contributionof the farthest neighbour is transferred to the nearer neighbour. The calculation of the localpoint density estimate is performed by the discrete Choquet integral, so that the contributionsof the neighbours all around that point are accounted for. This way an approximation to theSibson’s natural neighbours is computed. The method relieves the computational burden of theDelaunay tessellation-based natural neighbours approach in higher dimensions, whose complexityis exponential in the dimension of the data. This method is suitable for density estimates ofstructured data (possibly lying on lower dimensional manifolds), as the nearest neighbours diﬀersigniﬁcantly from the natural neighbours in this case.</p></abstract><trans-abstract xml:lang="ru"><p>Представлен метод оценки многомерной плотности, основанный на взвешенном методе ближайших соседей и имитирующий метод естественных соседей. Оценка многомерной плотности важна в машинном обучении, астрономии, биологии, физике и эконометрике.Строится 2-аддитивная нечёткая мера на основе аппроксимации индексов парных взаимодействий. Соседи, лежащие примерно в одном направлении, рассматриваются как излишние,и вклад дальнего соседа передаётся ближнему соседу. Расчёт локальной оценки плотности осуществляется с помощью дискретного интеграла Шоке таким образом, что учитывается вклад соседей, расположенных со всех сторон точки, где производятся вычисления. Однако вклад соседей, расположенных с одной и той же стороны, занижается с помощью выбора подходящей нечёткой меры. Таким образом вычисляется приближение к множеству естественных соседей Сибсона. Этот метод значительно снижает вычислительную нагрузку методов на базе естественных соседей, которые лежат на основе тесселяции Делоне, в высокой размерности, для которых вычислительная сложность растёт как экспонента раз-мерности. Описанный метод подходит для оценки плотности структурированных данных(возможно, лежащих на многообразии более низкой размерности), так как в этом случае ближайшие соседи могут значительно отличаться от естественных соседей.</p></trans-abstract><kwd-group xml:lang="en"><kwd>density estimate</kwd><kwd>nearest neighbours</kwd><kwd>Choquet integral</kwd><kwd>fuzzymeasure</kwd><kwd>natural neighbour</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>оценка плотности</kwd><kwd>метод ближайших соседей</kwd><kwd>интеграл Шоке</kwd><kwd>нечёт-кая мера</kwd><kwd>метод естественных соседей</kwd></kwd-group><funding-group/></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><citation-alternatives><mixed-citation xml:lang="en">D. W. Scott, Multivariate Density Estimation, John Wiley and Sons, New York, 2015.</mixed-citation><mixed-citation xml:lang="ru">Scott D. W. Multivariate Density Estimation. - New York: John Wiley and Sons, 2015.</mixed-citation></citation-alternatives></ref><ref id="B2"><label>2.</label><citation-alternatives><mixed-citation xml:lang="en">G. Beliakov, M. King, Density Based Fuzzy C-Means Clustering of Non-Convex Patterns, Europ. J. Oper. Res. 173 (2006) 717–728.</mixed-citation><mixed-citation xml:lang="ru">Beliakov G., King M. Density Based Fuzzy C-Means Clustering of Non-Convex Patterns // Europ. J. Oper. Res. - 2006. - Vol. 173. - Pp. 717-728.</mixed-citation></citation-alternatives></ref><ref id="B3"><label>3.</label><citation-alternatives><mixed-citation xml:lang="en">P. Angelov, R. R. Yager, Density-Based Averaging — a New Operator for Data Fusion, Information Sciences 222 (2013) 163–174.</mixed-citation><mixed-citation xml:lang="ru">Angelov P., Yager R. R. Density-Based Averaging - a New Operator for Data Fusion // Information Sciences. - 2013. - Vol. 222. - Pp. 163-174.</mixed-citation></citation-alternatives></ref><ref id="B4"><label>4.</label><citation-alternatives><mixed-citation xml:lang="en">G. Beliakov, T. Wilkin, On Some Properties of Weighted Averaging with Variable Weights, Information Sciences 281 (2014) 1–7.</mixed-citation><mixed-citation xml:lang="ru">Beliakov G., Wilkin T. On Some Properties of Weighted Averaging with Variable Weights // Information Sciences. - 2014. - Vol. 281. - Pp. 1-7.</mixed-citation></citation-alternatives></ref><ref id="B5"><label>5.</label><citation-alternatives><mixed-citation xml:lang="en">E. Parzen, On the Estimation of a Probability Density Function and the Mode, Annals of Math. Stats. 33 (1962) 1065–1076.</mixed-citation><mixed-citation xml:lang="ru">Parzen E. On the Estimation of a Probability Density Function and the Mode // Annals of Math. Stats. - 1962. - Vol. 33. - Pp. 1065-1076.</mixed-citation></citation-alternatives></ref><ref id="B6"><label>6.</label><citation-alternatives><mixed-citation xml:lang="en">C. Abraham, G. Biau, B. Cadre, Simple Estimation of the Mode of a Multivariate Density, The Canadian Journal of Statistics 31 (2003) 23–34.</mixed-citation><mixed-citation xml:lang="ru">Abraham C., Biau G., Cadre B. Simple Estimation of the Mode of a Multivariate Density // The Canadian Journal of Statistics. - 2003. - Vol. 31. - Pp. 23-34.</mixed-citation></citation-alternatives></ref><ref id="B7"><label>7.</label><citation-alternatives><mixed-citation xml:lang="en">W. E. Schaap, R. van de Weygaert, Continuous Fields and Discrete Samples: Reconstruction Through Delaunay Tessellations, Astronomy and Astrophysics 363 (2000) L29–L32.</mixed-citation><mixed-citation xml:lang="ru">Schaap W. E., van de Weygaert R. Continuous Fields and Discrete Samples: Reconstruction Through Delaunay Tessellations // Astronomy and Astrophysics. - 2000. - Vol. 363. - Pp. L29-L32.</mixed-citation></citation-alternatives></ref><ref id="B8"><label>8.</label><citation-alternatives><mixed-citation xml:lang="en">E. Schubert, J. Sander, M. Ester, H. P. Kriegel, X. Xu, DBSCAN Revisited, Revisited: Why and How You Should (Still) Use DBSCAN, ACM Trans. Database Syst. 42 (2017) 19:1–19:21. doi:10.1145/3068335.</mixed-citation><mixed-citation xml:lang="ru">DBSCAN Revisited, Revisited: Why and How You Should (Still) Use DBSCAN / E. Schubert, J. Sander, M. Ester, H. P. Kriegel, X. Xu // ACM Trans. Database Syst. - 2017. - Vol. 42. - Pp. 19:1-19:21.</mixed-citation></citation-alternatives></ref><ref id="B9"><label>9.</label><citation-alternatives><mixed-citation xml:lang="en">N.-B. Heidenreich, A. Schindler, S. Sperlich, Bandwidth Selection for Kernel Density Estimation: a Review of Fully Automatic Selectors, AStA Adv. Stat. 97 (2013) 403–433.</mixed-citation><mixed-citation xml:lang="ru">Heidenreich N.-B., Schindler A., Sperlich S. Bandwidth Selection for Kernel Density Estimation: a Review of Fully Automatic Selectors // AStA Adv. Stat. - 2013. - Vol. 97. - Pp. 403-433.</mixed-citation></citation-alternatives></ref><ref id="B10"><label>10.</label><citation-alternatives><mixed-citation xml:lang="en">G. Voronoi, Nouvelles applications des parametres continus a la theorie des formes quadratiques, Journal fur die Reine und Angewandte Mathematik 133 (1908) 97–178.</mixed-citation><mixed-citation xml:lang="ru">Voronoi G. Nouvelles applications des parametres continus a la theorie des formes quadratiques // Journal fur die Reine und Angewandte Mathematik. - 1908. - Vol. 133. - Pp. 97-178.</mixed-citation></citation-alternatives></ref><ref id="B11"><label>11.</label><citation-alternatives><mixed-citation xml:lang="en">B. Delaunay, Sur la sph`ere vide, Bulletin de l’Academie des Sciences de l’URSS, Classe des sciences mathematiques et naturelles 6 (1934) 793–800.</mixed-citation><mixed-citation xml:lang="ru">Delaunay B. Sur la sph`ere vide // Bulletin de l’Academie des Sciences de l’URSS, Classe des sciences mathematiques et naturelles. - 1934. - Vol. 6. - Pp. 793-800.</mixed-citation></citation-alternatives></ref><ref id="B12"><label>12.</label><citation-alternatives><mixed-citation xml:lang="en">R. Sibson, Brief Description of Natural Neighbor Interpolation, in: V. Barnett (Ed.), Interpreting Multivariate Data, John Wiley and Sons, New York, 1981, pp. 21–36.</mixed-citation><mixed-citation xml:lang="ru">Sibson R. Brief Description of Natural Neighbor Interpolation // Interpreting Multivariate Data / Ed. by V. Barnett. - New York: John Wiley and Sons, 1981. - Pp. 21-36.</mixed-citation></citation-alternatives></ref><ref id="B13"><label>13.</label><citation-alternatives><mixed-citation xml:lang="en">W. Stuetzle, Estimating the Cluster Tree of a Density by Analyzing the Minimal Spanning Tree of a Sample, Journal of Classiﬁcation 20 (2003) 25–47.</mixed-citation><mixed-citation xml:lang="ru">Stuetzle W. Estimating the Cluster Tree of a Density by Analyzing the Minimal Spanning Tree of a Sample // Journal of Classiﬁcation. - 2003. - Vol. 20. - Pp. 25-47.</mixed-citation></citation-alternatives></ref><ref id="B14"><label>14.</label><citation-alternatives><mixed-citation xml:lang="en">H. Samet, Foundations of Multidimensional and Metric Data Structures, Elsevier, Boston, 2006.</mixed-citation><mixed-citation xml:lang="ru">Samet H. Foundations of Multidimensional and Metric Data Structures. - Boston: Elsevier, 2006.</mixed-citation></citation-alternatives></ref><ref id="B15"><label>15.</label><citation-alternatives><mixed-citation xml:lang="en">T. Hastie, R. Tibshirani, J. Friedman, The Elements of Statistical Learning, Springer- Verlag, New York, Berlin, Heidelberg, 2001.</mixed-citation><mixed-citation xml:lang="ru">Hastie T., Tibshirani R., Friedman J. The Elements of Statistical Learning. - New York, Berlin, Heidelberg: Springer-Verlag, 2001.</mixed-citation></citation-alternatives></ref><ref id="B16"><label>16.</label><citation-alternatives><mixed-citation xml:lang="en">B. Dasarathy, Nearest Neighbor Norms: NN Pattern Classiﬁcation Techniques, IEEE Computer Society Press, Los Alamitos, CA, 1991.</mixed-citation><mixed-citation xml:lang="ru">Dasarathy B. Nearest Neighbor Norms: NN Pattern Classiﬁcation Techniques. - Los Alamitos, CA: IEEE Computer Society Press, 1991.</mixed-citation></citation-alternatives></ref><ref id="B17"><label>17.</label><citation-alternatives><mixed-citation xml:lang="en">S. Cost, S. Salzberg, A Weighted Nearest Neighbor Algorithm for Learning with Symbolic Features, Machine Learning 10 (1993) 57–78.</mixed-citation><mixed-citation xml:lang="ru">Cost S., Salzberg S. A Weighted Nearest Neighbor Algorithm for Learning with Symbolic Features // Machine Learning. - 1993. - Vol. 10. - Pp. 57-78.</mixed-citation></citation-alternatives></ref><ref id="B18"><label>18.</label><citation-alternatives><mixed-citation xml:lang="en">R. Yager, Using Fuzzy Methods to Model Nearest Neighbor Rules, IEEE Trans. on Syst., Man, and Cybernetics 32 (2002) 512–525.</mixed-citation><mixed-citation xml:lang="ru">Yager R. Using Fuzzy Methods to Model Nearest Neighbor Rules // IEEE Trans. on Syst., Man, and Cybernetics. - 2002. - Vol. 32. - Pp. 512-525.</mixed-citation></citation-alternatives></ref><ref id="B19"><label>19.</label><citation-alternatives><mixed-citation xml:lang="en">E. H¨ullermeier, The Choquet-Integral as an Aggregation Operator in Case-Based Learning, in: B. Reusch (Ed.), Computational Intelligence, Theory and Applications, Springer, Berlin, Heidelberg, 2006, pp. 615–627.</mixed-citation><mixed-citation xml:lang="ru">Hullermeier E. The Choquet-Integral as an Aggregation Operator in Case-Based Learning // Computational Intelligence, Theory and Applications / Ed. by B. Reusch. - Berlin, Heidelberg: Springer, 2006. - Pp. 615-627.</mixed-citation></citation-alternatives></ref><ref id="B20"><label>20.</label><citation-alternatives><mixed-citation xml:lang="en">D. Watson, Contouring: A Guide to the Analysis and Display of Spatial Data, Pergamon Press, Oxford, 1992.</mixed-citation><mixed-citation xml:lang="ru">Watson D. Contouring: A Guide to the Analysis and Display of Spatial Data. - Oxford: Pergamon Press, 1992.</mixed-citation></citation-alternatives></ref><ref id="B21"><label>21.</label><citation-alternatives><mixed-citation xml:lang="en">J.-D. Boissonnat, F. Cazals, Smooth Surface Reconstruction Via Natural Neighbour Interpolation of Distance Functions, Proc. of the 16th Annual Symposium on Computational Geometry (2000) 223–232.</mixed-citation><mixed-citation xml:lang="ru">Boissonnat J.-D., Cazals F. Smooth Surface Reconstruction Via Natural Neighbour Interpolation of Distance Functions // Proc. of the 16th Annual Symposium on Computational Geometry. - 2000. - Pp. 223-232.</mixed-citation></citation-alternatives></ref><ref id="B22"><label>22.</label><citation-alternatives><mixed-citation xml:lang="en">V. V. Belikov, V. D. Ivanov, V. K. Kontorovich, S. A. Korytnik, A. Y. Semenov, The Non-Sibsonian Interpolation: a New Method of Interpolation of the Values of a Function on an Arbitrary Set of Points, Computational Mathematics and Mathematical Physics 37 (1997) 9–15.</mixed-citation><mixed-citation xml:lang="ru">The Non-Sibsonian Interpolation: a New Method of Interpolation of the Values of a Function on an Arbitrary Set of Points / V. V. Belikov, V. D. Ivanov, V. K. Kontorovich, S. A. Korytnik, A. Y. Semenov // Computational Mathematics and Mathematical Physics. - 1997. - Vol. 37. - Pp. 9-15.</mixed-citation></citation-alternatives></ref><ref id="B23"><label>23.</label><citation-alternatives><mixed-citation xml:lang="en">G. Beliakov, A. Pradera, T. Calvo, Aggregation Functions: A Guide for Practitioners, Springer, Heidelberg, 2007.</mixed-citation><mixed-citation xml:lang="ru">Beliakov G., Pradera A., Calvo T. Aggregation Functions: A Guide for Practitioners. - Heidelberg: Springer, 2007.</mixed-citation></citation-alternatives></ref><ref id="B24"><label>24.</label><citation-alternatives><mixed-citation xml:lang="en">M. Grabisch, J.-L. Marichal, R. Mesiar, E. Pap, Aggregation Functions, Cambridge University press, Cambridge, 2009.</mixed-citation><mixed-citation xml:lang="ru">Aggregation Functions / M. Grabisch, J.-L. Marichal, R. Mesiar, E. Pap. - Cambridge: Cambridge University press, 2009.</mixed-citation></citation-alternatives></ref><ref id="B25"><label>25.</label><citation-alternatives><mixed-citation xml:lang="en">M. Grabisch, T. Murofushi, M. Sugeno (Eds.), Fuzzy Measures and Integrals. Theory and Applications, Physica-Verlag, Heidelberg, 2000.</mixed-citation><mixed-citation xml:lang="ru">Fuzzy Measures and Integrals. Theory and Applications / Ed. by M. Grabisch, T. Murofushi, M. Sugeno. - Heidelberg: Physica-Verlag, 2000.</mixed-citation></citation-alternatives></ref><ref id="B26"><label>26.</label><citation-alternatives><mixed-citation xml:lang="en">M. Grabisch, k-Order Additive Discrete Fuzzy Measures and Their Representation, Fuzzy Sets and Systems 92 (1997) 167–189.</mixed-citation><mixed-citation xml:lang="ru">Grabisch M. k-Order Additive Discrete Fuzzy Measures and Their Representation // Fuzzy Sets and Systems. - 1997. - Vol. 92. - Pp. 167-189.</mixed-citation></citation-alternatives></ref><ref id="B27"><label>27.</label><citation-alternatives><mixed-citation xml:lang="en">B. Mayag, M. Grabisch, C. Labreuche, A Characterization of the 2-additive Choquet Integral, in: Proc. of IPMU, Malaga, Spain, 2008, pp. 1512–1518.</mixed-citation><mixed-citation xml:lang="ru">Mayag B., Grabisch M., Labreuche C. A Characterization of the 2-additive Choquet Integral // Proc. of IPMU. - Malaga, Spain: 2008. - Pp. 1512-1518.</mixed-citation></citation-alternatives></ref><ref id="B28"><label>28.</label><citation-alternatives><mixed-citation xml:lang="en">J. W. Harris, H. Stocker, Spherical Segment (Spherical Cap), in: Handbook of Mathematics and Computational Science, Springer, New York, 1998.</mixed-citation><mixed-citation xml:lang="ru">Harris J. W., Stocker H. Spherical Segment (Spherical Cap) // Handbook of Mathematics and Computational Science. - New York: Springer, 1998. - 107 p.</mixed-citation></citation-alternatives></ref></ref-list></back></article>
