Methods for pattern selection, class-specific feature selection and classification for automated learning

Asim Roy, Patrick D. Mackin, Somnath Mukhopadhyay

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

This paper presents methods for training pattern (prototype) selection, class-specific feature selection and classification for automated learning. For training pattern selection, we propose a method of sampling that extracts a small number of representative training patterns (prototypes) from the dataset. The idea is to extract a set of prototype training patterns that represents each class region in a classification problem. In class-specific feature selection, we try to find a separate feature set for each class such that it is the best one to separate that class from the other classes. We then build a separate classifier for that class based on its own feature set. The paper also presents a new hypersphere classification algorithm. Hypersphere nets are similar to radial basis function (RBF) nets and belong to the group of kernel function nets. Polynomial time complexity of the methods is proven. Polynomial time complexity of learning algorithms is important to the field of neural networks. Computational results are provided for a number of well-known datasets. None of the parameters of the algorithm were fine tuned for any of the problems solved and this supports the idea of automation of learning methods. Automation of learning is crucial to wider deployment of learning technologies.

Original languageEnglish (US)
Pages (from-to)113-129
Number of pages17
JournalNeural Networks
Volume41
DOIs
StatePublished - 2013

Fingerprint

Feature extraction
Learning
Automation
Polynomials
Learning algorithms
Classifiers
Sampling
Neural networks
Technology
Datasets

Keywords

  • Automated learning
  • Classification algorithm
  • Complexity of learning
  • Feature selection
  • Hypersphere net
  • Polynomial time complexity
  • Training pattern selection

ASJC Scopus subject areas

  • Artificial Intelligence
  • Cognitive Neuroscience

Cite this

Methods for pattern selection, class-specific feature selection and classification for automated learning. / Roy, Asim; Mackin, Patrick D.; Mukhopadhyay, Somnath.

In: Neural Networks, Vol. 41, 2013, p. 113-129.

Research output: Contribution to journalArticle

@article{1894b436729c4e249a29aa8427cf235b,
title = "Methods for pattern selection, class-specific feature selection and classification for automated learning",
abstract = "This paper presents methods for training pattern (prototype) selection, class-specific feature selection and classification for automated learning. For training pattern selection, we propose a method of sampling that extracts a small number of representative training patterns (prototypes) from the dataset. The idea is to extract a set of prototype training patterns that represents each class region in a classification problem. In class-specific feature selection, we try to find a separate feature set for each class such that it is the best one to separate that class from the other classes. We then build a separate classifier for that class based on its own feature set. The paper also presents a new hypersphere classification algorithm. Hypersphere nets are similar to radial basis function (RBF) nets and belong to the group of kernel function nets. Polynomial time complexity of the methods is proven. Polynomial time complexity of learning algorithms is important to the field of neural networks. Computational results are provided for a number of well-known datasets. None of the parameters of the algorithm were fine tuned for any of the problems solved and this supports the idea of automation of learning methods. Automation of learning is crucial to wider deployment of learning technologies.",
keywords = "Automated learning, Classification algorithm, Complexity of learning, Feature selection, Hypersphere net, Polynomial time complexity, Training pattern selection",
author = "Asim Roy and Mackin, {Patrick D.} and Somnath Mukhopadhyay",
year = "2013",
doi = "10.1016/j.neunet.2012.12.007",
language = "English (US)",
volume = "41",
pages = "113--129",
journal = "Neural Networks",
issn = "0893-6080",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - Methods for pattern selection, class-specific feature selection and classification for automated learning

AU - Roy, Asim

AU - Mackin, Patrick D.

AU - Mukhopadhyay, Somnath

PY - 2013

Y1 - 2013

N2 - This paper presents methods for training pattern (prototype) selection, class-specific feature selection and classification for automated learning. For training pattern selection, we propose a method of sampling that extracts a small number of representative training patterns (prototypes) from the dataset. The idea is to extract a set of prototype training patterns that represents each class region in a classification problem. In class-specific feature selection, we try to find a separate feature set for each class such that it is the best one to separate that class from the other classes. We then build a separate classifier for that class based on its own feature set. The paper also presents a new hypersphere classification algorithm. Hypersphere nets are similar to radial basis function (RBF) nets and belong to the group of kernel function nets. Polynomial time complexity of the methods is proven. Polynomial time complexity of learning algorithms is important to the field of neural networks. Computational results are provided for a number of well-known datasets. None of the parameters of the algorithm were fine tuned for any of the problems solved and this supports the idea of automation of learning methods. Automation of learning is crucial to wider deployment of learning technologies.

AB - This paper presents methods for training pattern (prototype) selection, class-specific feature selection and classification for automated learning. For training pattern selection, we propose a method of sampling that extracts a small number of representative training patterns (prototypes) from the dataset. The idea is to extract a set of prototype training patterns that represents each class region in a classification problem. In class-specific feature selection, we try to find a separate feature set for each class such that it is the best one to separate that class from the other classes. We then build a separate classifier for that class based on its own feature set. The paper also presents a new hypersphere classification algorithm. Hypersphere nets are similar to radial basis function (RBF) nets and belong to the group of kernel function nets. Polynomial time complexity of the methods is proven. Polynomial time complexity of learning algorithms is important to the field of neural networks. Computational results are provided for a number of well-known datasets. None of the parameters of the algorithm were fine tuned for any of the problems solved and this supports the idea of automation of learning methods. Automation of learning is crucial to wider deployment of learning technologies.

KW - Automated learning

KW - Classification algorithm

KW - Complexity of learning

KW - Feature selection

KW - Hypersphere net

KW - Polynomial time complexity

KW - Training pattern selection

UR - http://www.scopus.com/inward/record.url?scp=84875883516&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84875883516&partnerID=8YFLogxK

U2 - 10.1016/j.neunet.2012.12.007

DO - 10.1016/j.neunet.2012.12.007

M3 - Article

C2 - 23391783

AN - SCOPUS:84875883516

VL - 41

SP - 113

EP - 129

JO - Neural Networks

JF - Neural Networks

SN - 0893-6080

ER -