@article{ZVMMF_2010_50_11_a15,
author = {A. V. Kel'manov},
title = {On the complexity of some data analysis problems},
journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
pages = {2045--2051},
year = {2010},
volume = {50},
number = {11},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZVMMF_2010_50_11_a15/}
}
A. V. Kel'manov. On the complexity of some data analysis problems. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 50 (2010) no. 11, pp. 2045-2051. http://geodesic.mathdoc.fr/item/ZVMMF_2010_50_11_a15/
[1] Aloise D., Hansen P., On the complexity of minimum sum-of-squares clustering, Les Cahiers du GERAD, G-2007-50, 2007, 12 pp.
[2] Aloise D., Deshpande A., Hansen P., Popat P., NP-hardness of Euclidean sum-of-squares clustering, Les Cahiers du GERAD, G-2008-33, 2008, 4 pp.
[3] Mahajan M., Nimbhorkar P., Varadarajan K., “The planar $k$-means problem is NP-hard”, Lect. Notes Comput. Sci., 5431, 2009, 284–285
[4] Dolgushev A. V., Kelmanov A. V., “K voprosu ob algoritmicheskoi slozhnosti odnoi zadachi klasternogo analiza”, Diskretnyi analiz i issl. operatsii, 17:2 (2010), 39–45 | MR
[5] MacQueen J. B., “Some methods for classification and analysis of multivariate observations”, Proc. 5-th Berkeley Symp. Math. Statistics and Probability, v. 1, 1967, 281–297 | MR | Zbl
[6] Gimadi E. Kh., Kelmanov A. V., Kelmanova M. A., Khamidullin S. A., “Aposteriornoe obnaruzhenie v chislovoi posledovatelnosti kvaziperiodicheskogo fragmenta pri zadannom chisle povtorov”, Sibirskii zhurnal industr. matem., 9:1(25) (2006), 55–74 | MR
[7] Baburin A. E., Gimadi E. Kh., Glebov N. I., Pyatkin A. V., “Zadacha otyskaniya podmnozhestva vektorov s maksimalnym summarnym vesom”, Diskretnyi analiz i issl. operatsii. Ser. 2, 14:1 (2007), 32–42 | MR
[8] Kelmanov A. V., Pyatkin A. V., “O slozhnosti odnogo iz variantov zadachi vybora podmnozhestva “pokhozhikh” vektorov”, Dokl. RAN, 421:5 (2008), 590–592
[9] Kelmanov A. V., Pyatkin A. V., “Ob odnom variante zadachi vybora podmnozhestva vektorov”, Diskretnyi analiz i issl. operatsii, 15:5 (2008), 25–40 | MR
[10] Kelmanov A. V., Pyatkin A. V., “O slozhnosti nekotorykh zadach poiska podmnozhestv vektorov i klasternogo analiza”, Zh. vychisl. matem. i matem. fiz., 49:11 (2009), 2059–2067 | MR
[11] Kel'manov A. V., Jeon B., “A posteriori joint detection and discrimination of pulses in a quasiperiodic pulse train”, IEEE Trans. Signal Processing, 52:3 (2004), 1–12 | MR
[12] Kelmanov A. V., Khamidullin S. A., “Aposteriornoe obnaruzhenie zadannogo chisla odinakovykh podposledovatelnostei v kvaziperiodicheskoi posledovatelnosti”, Zh. vychisl. matem. i matem. fiz., 41:5 (2001), 807–820 | MR
[13] Kelmanov A. V., Mikhailova L. V., “Sovmestnoe obnaruzhenie v kvaziperiodicheskoi posledovatelnosti zadannogo chisla fragmentov iz etalonnogo nabora i ee razbienie na uchastki, vklyuchayuschie serii odinakovykh fragmentov”, Zh. vychisl. matem. i matem. fiz., 46:1 (2006), 172–189 | MR
[14] Kelmanov A. V., Mikhailova L. V., Khamidullin S. A., “Aposteriornoe obnaruzhenie v kvaziperiodicheskoi posledovatelnosti povtoryayuschegosya nabora etalonnykh fragmentov”, Zh. vychisl. matem. i matem. fiz., 48:12 (2008), 168–184 | MR
[15] Kelmanov A. V., “Polinomialno razreshimye i NP-trudnye varianty zadachi optimalnogo obnaruzheniya v chislovoi posledovatelnosti povtoryayuschegosya fragmenta”, Diskretnaya optimizatsiya i issledovanie operatsii, Materialy Ros. konf. (Vladivostok, 7–14 sentyabrya 2007), In-t matem. SO RAN, Novosibirsk, 2007, 46–50 http://math.nsc.ru/conference/door07/DOOR_abstracts.pdf