Geodesic
Computational complexity of two problems of~cognitive~data~analysis
Diskretnyj analiz i issledovanie operacij, Tome 29 (2022) no. 1, pp. 18-32.

Voir la notice de l'article provenant de la source Math-Net.Ru

The NP-hardness in the strong sense is proved for two problems of cognitive data analysis. One of them is the problem of taxonomy (clustering), i. e. splitting an unclassified sample of objects into disjoint subsets. The other is the problem of sampling a subset of typical representatives of a classified sample which consists of objects of two images. The first problem can be considered as a special case of the second problem, provided that one of the images consists of one object. To obtain a quantitative quality estimate for the set of selected typical representatives of the sample, the function of rival similarity (FRiS function) is used, which assesses the similarity of an object with the closest typical object. Illustr. 1, bibliogr. 18.
Keywords: NP-hardness, taxonomy (clustering), typical object (prototypes) selection, function of rival similarity. 
@article{DA_2022_29_1_a1,
     author = {O. A. Kutnenko},
     title = {Computational complexity of two problems of~cognitive~data~analysis},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {18--32},
     publisher = {mathdoc},
     volume = {29},
     number = {1},
     year = {2022},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2022_29_1_a1/}
}
TY  - JOUR
AU  - O. A. Kutnenko
TI  - Computational complexity of two problems of~cognitive~data~analysis
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2022
SP  - 18
EP  - 32
VL  - 29
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2022_29_1_a1/
LA  - ru
ID  - DA_2022_29_1_a1
ER  - 
%0 Journal Article
%A O. A. Kutnenko
%T Computational complexity of two problems of~cognitive~data~analysis
%J Diskretnyj analiz i issledovanie operacij
%D 2022
%P 18-32
%V 29
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2022_29_1_a1/
%G ru
%F DA_2022_29_1_a1
O. A. Kutnenko. Computational complexity of two problems of~cognitive~data~analysis. Diskretnyj analiz i issledovanie operacij, Tome 29 (2022) no. 1, pp. 18-32. http://geodesic.mathdoc.fr/item/DA_2022_29_1_a1/

[1] Zagoruiko N. G., Borisova I. A., Dyubanov V. V., Kutnenko O. A., “Methods of recognition based on the function of rival similarity”, Pattern Recognit. Image Anal., 18:1 (2008), 1–6

[2] I. A. Borisova, V. V. Dyubanov, N. G. Zagoruiko, O. A. Kutnenko, “Similarity and compactness”, Proc. 14th All-Russian Conf. “Mathematical Methods for Pattern Recognition” (Suzdal, Russia, Sept. 21–25, 2009), Maks Press, M., 2009, 89–92 (Russian)

[3] Burges C. J. C., “A tutorial on support vector machines for pattern recognition”, Data Mining Knowl. Discov., 2:2 (1998), 121–167

[4] Tipping M. E., “The relevance vector machine”, Advances in Neural Information Processing Systems 12, Proc. 1999 Conf. (Denver, CO, USA, Nov. 29–Dec. 4, 1999), MIT Press, Cambridge, MA, 2000, 652–658

[5] N. G. Zagoruiko, Applied Methods of Data and Knowledge Analysis, Izd. Inst. Mat., Novosibirsk, 1999 (Russian)

[6] K. V. Vorontsov, A. O. Koloskov, “Compactness profiles and prototype object selection in metric classification algorithms”, Iskusstv. Intell., 2006, no. 2, 30–33 (Russian)

[7] M. N. Ivanov, K. V. Vorontsov, “Prototypes selection based on minimization of a complete follow-control functional”, Proc. 14th All-Russian Conf. “Mathematical Methods for Pattern Recognition” (Suzdal, Russia, Sept. 21–25, 2009), Maks Press, M., 2009, 119–122 (Russian)

[8] Bermejo S., Cabestany J., “Learning with nearest neighbor classifiers”, Neural Proc. Lett., 13:2 (2001), 159–181

[9] V. N. Vapnik, The Task of Learning Pattern Recognition, Znanie, M., 1971 (Russian)

[10] N. G. Zagoruiko, I. A. Borisova, V. V. Dyubanov, O. A. Kutnenko, “A quantitative measure of compactness and similarity in a competitive space”, J. Appl. Ind. Math., 5:1 (2011), 144–154

[11] I. A. Borisova, “A taxonomy algorithm FRiS-Tax”, Nauchn. Vestn. NGTU, 2007, no. 3, 3–12 (Russian)

[12] I. A. Borisova, N. G. Zagoruiko, “A FRiS-TDR algorithm for solving a generalized taxonomy and recognition problem”, Proc. 2nd All-Russian Conf. “Knowledge–Ontology–Theory” (Novosibirsk, Russia, Oct. 22–24, 2009), v. 1, Inst. Mat., Novosibirsk, 2009, 93–102 (Russian)

[13] MacQueen J. B., “Some methods for classification and analysis of multivariate observations”, Proc. 5th Berkeley Symp. Math. Stat. Probab. (Berkeley, USA, June 21–July 18, 1965; Dec. 27, 1965–Jan. 7, 1966), v. 1, Univ. California Press, Berkeley, 1967, 281–297

[14] Zukhba A. V., “NP-completeness of the problem of prototype selection in the nearest neighbor method”, Pattern Recognit. Image Anal., 20:4 (2010), 484–494

[15] Borisova I. A., Dyubanov V. V., Kutnenko O. A., Zagoruiko N. G., “Use of the FRiS-function for taxonomy, attribute selection and decision rule construction”, Knowledge Processing and Data Analysis, Rev. Sel. Pap. 1st Int. Conf. KONT 2007 (Novosibirsk, Russia, Sept. 14–16, 2007), Lect. Notes Comput. Sci., 6581, Springer, Heidelberg, 2011, 256–270; 1st Int. Conf. KPP 2007 (Darmstadt, Germany, Sept. 28–30, 2007)

[16] N. G. Zagoruiko, I. A. Borisova, O. A. Kutnenko, V. V. Dyubanov, “A construction of a compressed description of data using a function of rival similarity”, J. Appl. Ind. Math., 7:2 (2013), 275–286

[17] I. A. Borisova, “Computational complexity of the problem of choosing typical representatives in a $2$-clustering of a finite set of points in a metric space”, J. Appl. Ind. Math., 14:2 (2020), 242–248

[18] M. R. Garey, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979