𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Determination of the levels of complexity of a linear classifier

✍ Scribed by I.I. Dzegëlenok; M.M. Medetov

Publisher
Elsevier Science
Year
1978
Weight
633 KB
Volume
18
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Classifier performance as a function of
Classifier performance as a function of distributional complexity
✍ Sanju N. Attoor; Edward R. Dougherty 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 283 KB

When choosing a classiÿcation rule, it is important to take into account the amount of sample data available. This paper examines the performances of classiÿers of di ering complexities in relation to the complexity of feature-label distributions in the case of small samples. We deÿne the distributi

The Computational Complexity of Some Pro
The Computational Complexity of Some Problems of Linear Algebra
✍ Jonathan F Buss; Gudmund S Frandsen; Jeffrey O Shallit 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 330 KB

We consider the computational complexity of some problems dealing with matrix rank. Let E, S be subsets of a commutative ring R. Let x 1 , x 2 , ..., x t be variables. Given a matrix M=M(x 1 , x 2 , ..., x t ) with entries chosen from E \_ [x 1 , x 2 , ..., x t ], we want to determine maxrank S (M)=

A group of knowledge-incorporated multip
A group of knowledge-incorporated multiple criteria linear programming classifiers
✍ Dongling Zhang; Yingjie Tian; Yong Shi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 492 KB

Classification is a main data mining task, which aims at predicting the class label of new input data on the basis of a set of pre-classified samples. Multiple criteria linear programming (MCLP) is used as a classification method in the data mining area, which can separate two or more classes by fin