You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Recursive DBPSO for computationally efficient electronic nose system

Authors:

Atiq Ur Rehman, Amine Bermak

Publication Type:

Journal article

Venue:

IEEE Sensors Journal


Abstract

Feature-rank-code-based classifiers have been proposed recently in order to reduce the complexity for electronic nose system (ENS). The performance of these classifiers is degraded when the discriminatory information of gases lie in the actual feature values not in the ranks of features. To overcome the problem, a gas identification system based on a simple distance measure in combination with different type of features is proposed. In order to improve the computational cost of the existing ENS, a novel combination of optimum subset of features is proposed. To achieve the aim of low computational cost, a large feature vector is recursively reduced to a small number of features without compromising the classification accuracy of the system. Discrete binary particle swarm optimization, a metaheuristic for global search is used in a recursive setup to select the optimum subset of features for classification. Euclidian distance is used as a similarity measure for identification of different industrial gases. The proposed system is tested for the identification of 13 different industrial gases, namely, C 3 H 8 , Cl 2 , CO, CO 2 , SO 2 , NO 2 , NH 3 , C 2 H 4 O, C 3 H 6 O, C 2 H 4 , C 2 H 6 O, C 7 H 8 , and CH 4 . These gases are contained in three different data sets; two among these data sets are acquired experimentally in a laboratory setup, while one of these data sets is taken from the University of California at Irvine machine learning repository. Results reveal that the computational cost and the memory requirement of an ENS can be significantly reduced by combining different type of features. An average classification accuracy of 98.17% is achieved by the proposed system with an average 69.04% reduction in memory requirement using only three to five features.

Bibtex

@article{Rehman6608,
author = {Atiq Ur Rehman and Amine Bermak},
title = {Recursive DBPSO for computationally efficient electronic nose system},
volume = { },
number = { },
pages = {320--327},
month = {September},
year = {2017},
journal = {IEEE Sensors Journal},
url = {http://www.es.mdu.se/publications/6608-}
}