Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Sergey A. Khamidullin"'
Publikováno v:
Computational Mathematics and Mathematical Physics. 61:1153-1161
A previously unstudied optimization problem induced by noise-proof recognition of a quasi-periodic sequence, namely, by the recognition of a sequence $$Y$$ of length $$N$$ generated by a sequence $$U$$ belonging to a given finite set $$W$$ (alphabet)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::038291746517284631b4f9a4bace3f2c
https://doi.org/10.1134/s0965542521070095
https://doi.org/10.1134/s0965542521070095
Publikováno v:
Annals of Mathematics and Artificial Intelligence. 88:157-168
The following two strongly NP-hard problems are considered. In the first problem, we need to find in the given finite set of points in Euclidean space the subset of largest size. The sum of squared distances between the elements of this subset and it
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::27f969a39b6a901d50f090f3b7a08f37
https://doi.org/10.1007/s10472-019-09623-z
https://doi.org/10.1007/s10472-019-09623-z
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:
Sergey A. Khamidullin, Artem V. Pyatkin, Alexander Kel'manov, Alexander A. Ageev, V. V. Shenmaier
Publikováno v:
Pattern Recognition and Image Analysis. 27:365-370
The work considers the mathematical aspects of one of the most fundamental problems of data analysis: search (choice) among a collection of objects for a subset of similar ones. In particular, the problem appears in connection with data editing and c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ae12ea10dc8fe1a823f8c995c0474d7a
https://doi.org/10.1134/s1054661817030038
https://doi.org/10.1134/s1054661817030038
Publikováno v:
Communications in Computer and Information Science ISBN: 9783030109332
A problem of partitioning a finite sequence of points in Euclidean space into two subsequences (clusters) maximizing the size of the first cluster subject to two constraints is considered. The first constraint deals with every two consecutive indices
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::74aa023571fb3fb01d386ce96d08c994
https://doi.org/10.1007/978-3-030-10934-9_10
https://doi.org/10.1007/978-3-030-10934-9_10
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030053475
LION
LION
The following two strongly NP-hard problems are considered. In the first problem, we need to find in the given finite set of points in Euclidean space the subset of largest size such that the sum of squared distances between the elements of this subs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::556e16bc983a8f081027d1300b0765d5
https://doi.org/10.1007/978-3-030-05348-2_28
https://doi.org/10.1007/978-3-030-05348-2_28
Publikováno v:
Journal of Applied and Industrial Mathematics. 10:209-219
We consider a strongly NP-hard problem of partitioning a finite sequence of points in Euclidean space into the two clustersminimizing the sum over both clusters of intra-cluster sums of squared distances from the clusters elements to their centers. T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::99247ac4e0144624a63c755723d28e26
https://doi.org/10.1134/s199047891602006x
https://doi.org/10.1134/s199047891602006x
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319730127
AIST
AIST
In the paper we consider one strongly NP-hard problem of partitioning a finite Euclidean sequence into two clusters minimizing the sum over both clusters of intracluster sum of squared distances from clusters elements to their centers. The cardinalit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b4e7345db4793b2ff05e3e351e32f92d
https://doi.org/10.1007/978-3-319-73013-4_29
https://doi.org/10.1007/978-3-319-73013-4_29
Autor:
Artem V. Pyatkin, Sergey A. Khamidullin, Alexander Kel'manov, Alexander A. Ageev, V. V. Shenmaier
Publikováno v:
2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON).
The work considers the mathematical aspects of one of the most fundamental problems of data analysis: search (choice) among a collection of objects for a subset of similar ones. In particular, the problem appears in connection with data editing and c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a61fb02cd33f8560840a0cc1f9595d8
https://doi.org/10.1109/sibircon.2017.8109827
https://doi.org/10.1109/sibircon.2017.8109827