Criteria for completeness of algorithms of fuzzy marking of point configurations
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 52 (2012) no. 8, pp. 1551-1568 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_2012_52_8_a14,
     author = {N. U. Dorofeev},
     title = {Criteria for completeness of algorithms of fuzzy marking of point configurations},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1551--1568},
     year = {2012},
     volume = {52},
     number = {8},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2012_52_8_a14/}
}
TY  - JOUR
AU  - N. U. Dorofeev
TI  - Criteria for completeness of algorithms of fuzzy marking of point configurations
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2012
SP  - 1551
EP  - 1568
VL  - 52
IS  - 8
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2012_52_8_a14/
LA  - ru
ID  - ZVMMF_2012_52_8_a14
ER  - 
%0 Journal Article
%A N. U. Dorofeev
%T Criteria for completeness of algorithms of fuzzy marking of point configurations
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2012
%P 1551-1568
%V 52
%N 8
%U http://geodesic.mathdoc.fr/item/ZVMMF_2012_52_8_a14/
%G ru
%F ZVMMF_2012_52_8_a14
N. U. Dorofeev. Criteria for completeness of algorithms of fuzzy marking of point configurations. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 52 (2012) no. 8, pp. 1551-1568. http://geodesic.mathdoc.fr/item/ZVMMF_2012_52_8_a14/

[1] Chekhovich Yu. V., “Ob obuchaemykh algoritmakh vydeleniya trendov”, Iskusstvennyi intellekt (nauchno-teoretich. zhurnal NAN Ukrainy), 2002, no. 2, 298–305

[2] Rudakov K. V., Chekhovich Yu. V., “Algebraicheskii podkhod k probleme sinteza obuchaemykh algoritmov vydeleniya trendov”, Dokl. RAN, 388:1 (2003), 33–36 | MR

[3] Rudakov K. V., “Ob algebraicheskoi teorii universalnykh i lokalnykh ogranichenii dlya zadach klassifikatsii”, Raspoznavanie, klassifikatsiya, prognoz, Nauka, M., 1989, 176–201 | MR

[4] Zhuravlev Yu. I., “Lokalnye algoritmy vychisleniya informatsii. I; II”, Kibernetika, 1965, no. 1, 12–19 ; 1966, No 2, 1–11 | MR | Zbl

[5] Rudakov K. V., Chekhovich Yu. V., “Kriterii polnoty modelei algoritmov i semeistv reshayuschikh pravil dlya zadach klassifikatsii s teoretiko-mnozhestvennymi ogranicheniyami”, Dokl. RAN, 394:4 (2003), 459–461 | MR

[6] Rudakov K. V., Chekhovich Yu. V., “Kriterii polnoty semeistv korrektiruyuschikh operatsii i modelei algoritmicheskikh operatorov dlya zadach klassifikatsii s teoretiko-mnozhestvennymi ogranicheniyami”, Dokl. RAN, 395:6 (2003), 749–750 | MR

[7] Rudakov K. V., Chekhovich Yu. V., “Kriterii polnoty dlya zadach klassifikatsii s teoretiko-mnozhestvennymi ogranicheniyami”, Zh. vychisl. matem. i matem. fiz., 45:2 (2005), 344–353 | MR | Zbl

[8] Sakoe H., Chiba S., “Dynamic programming algorithm optimization for spoken word recognition”, Transactions on acoustics, speech, and signal processing, 26:1 (1978), 43–49 | DOI | Zbl

[9] Wang K., Gasser Th., “Allignment of curves by dynamic time warping”, Ann. of statist., 25:3 (1997), 1251–1276 | DOI | MR | Zbl

[10] Berndt D., Clifford J., “Using dynamic time warping to find patterns in time series”, AAAI Workshop on Knowledge Discovery in Databases, 1994, 229–248