图书馆订阅: Guest
自动化与信息科学期刊

每年出版 12 

ISSN 打印: 1064-2315

ISSN 在线: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

Problem SDX as the Extreme Case of Combined Type Recognition Problems

卷 40, 册 4, 2008, pp. 18-27
DOI: 10.1615/JAutomatInfScien.v40.i4.20
Get accessGet access

摘要

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.

Begell Digital Portal Begell 数字图书馆 电子图书 期刊 参考文献及会议录 研究收集 订购及政策 Begell House 联系我们 Language English 中文 Русский Português German French Spain