✦ LIBER ✦

Classification of relational patterns as a decomposition problem

✍ Scribed by Witold Pedrycz

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 503 KB
Volume: 17
Category: Article
ISSN: 0167-8655
DOI: 10.1016/0167-8655(95)00092-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Prototype construction and evaluation as

Prototype construction and evaluation as inverse problems in pattern classification

✍ K. Hirota; W. Pedrycz 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 583 KB

Ontology mapping: as a binary classifica

Ontology mapping: as a binary classification problem

✍ Ming Mao; Yefei Peng; Michael Spring 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 483 KB

The systematic error detection as a clas

The systematic error detection as a classification problem

✍ G. Gluhchev; S. Shalev 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 396 KB

A new nearest-neighbor rule in the patte

A new nearest-neighbor rule in the pattern classification problem

✍ Kazuo Hattori; Masahito Takahashi 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 102 KB

A new nearest-neighbor (NN) rule is proposed. In this rule, the k-nearest neighbors of an input sample are obtained in each class. Two classification examples are presented to test the NN rule proposed. The number of samples misclassified N is evaluated. The minimum of N in the the NN rule proposed

Overlap as a problem in atlas classifica

Overlap as a problem in atlas classification of MMPI profiles

✍ Raymond D. Fowler Jr.; F. A. Coyle Jr. 📂 Article 📅 1968 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB 👁 3 views

A new edited k-nearest neighbor rule in

A new edited k-nearest neighbor rule in the pattern classification problem

✍ Kazuo Hattori; Masahito Takahashi 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 109 KB