%0 Journal Article
%A Borisova, Irina A.
%A Zagoruiko, Nikolay G.
%D 2008
%I Begell House
%N 4
%P 18-27
%R 10.1615/JAutomatInfScien.v40.i4.20
%T Problem *SDX* as the Extreme Case of Combined Type Recognition Problems
%U http://dl.begellhouse.com/journals/2b6239406278e43e,694389c86d308f10,5699dc214d36eafd.html
%V 40
%X The recognition problems of the basic types are described: an automatic classification (*S*), a selection of informative attributes (*X*) and constructions of decision rules (*D*). Methods of the combined problems solution when it is required to solve two of these three problems simultaneously are presented: problems *SD*, *SX* and *DX*. We have described a statement and a solution method of limiting complexity combined problem − *SDX* problem when one should select such subset of attributes *X* in space of which the analyzed objects are well separated into clusters *S* by means of the decision rules *D*. An essential role in such problems solution plays the application of the offered function of competitive similarity (FRiS-function). An example of a real *SDX* problem solution is given.
%8 2008-05-22