Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Anna Panasenko"'
Autor:
Dmytro Olefir, Anna Panasenko
Publikováno v:
Eastern-European Journal of Enterprise Technologies, Vol 2, Iss 10 (110), Pp 6-17 (2021)
Economic losses from floods have become catastrophic due to the increase in the number and scale of their propagation. Existing procedures for passing floods and pre-preparing reservoirs for flood water acceptance are ineffective and need to be impro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a8c3a3f8c2acd466f8a58cfdf938d0c6
https://zenodo.org/record/4770090
https://zenodo.org/record/4770090
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030386283
LION
LION
We consider a problem of 2-partitioning a finite sequence of points in Euclidean space into two clusters of the given sizes with some additional constraints. The solution criterion is the minimum of the sum (over both clusters) of weighted intraclust
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6ab8958119f44d56fc49dfe66640b924
https://doi.org/10.1007/978-3-030-38629-0_11
https://doi.org/10.1007/978-3-030-38629-0_11
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030535513
LION
LION
We consider two problems of clustering a finite sequence of points in Euclidean space. In the first problem, we need to find a cluster minimizing intracluster sum of squared distances from cluster elements to its centroid. In the second problem, we n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c8f092d9aad6c355a023bbc6f9e47b0a
https://doi.org/10.1007/978-3-030-53552-0_11
https://doi.org/10.1007/978-3-030-53552-0_11
Autor:
Anna Panasenko, Valentina Andbaeva
Publikováno v:
VII Information school of a young scientist.
Autor:
Anna Panasenko
Publikováno v:
Mathematical Optimization Theory and Operations Research ISBN: 9783030226282
MOTOR
MOTOR
We consider one strongly NP-hard problem of clustering a finite set of points in Euclidean space. In this problem, we need to partition a finite set of points into two clusters minimizing the sum over both clusters of the weighted intracluster sums.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::00628ea8d1d255bb3c12a1b3dc8fc934
https://doi.org/10.1007/978-3-030-22629-9_41
https://doi.org/10.1007/978-3-030-22629-9_41
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030110260
AIST
AIST
We consider two problems of searching for the largest subset in a finite set of points in Euclidean space. Both problems have applications, in particular, in data analysis and data approximation. In each problem, an input set and a positive real numb
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::be8423adc399caee75956c1974e4b9c6
https://doi.org/10.1007/978-3-030-11027-7_28
https://doi.org/10.1007/978-3-030-11027-7_28
Publikováno v:
Communications in Computer and Information Science ISBN: 9783319937991
We consider two strongly NP-hard problems of clustering a finite set of points in Euclidean Space. Both problems have applications, in particular, in data analysis, data mining, pattern recognition, and machine learning. In the first problem, an inpu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b7ee9812962e132ce84b2d8f68f03f45
https://doi.org/10.1007/978-3-319-93800-4_9
https://doi.org/10.1007/978-3-319-93800-4_9