Magazine et Edition

Volume 12 (2022): Edition 3 (July 2022)

Volume 12 (2022): Edition 2 (April 2022)

Volume 12 (2022): Edition 1 (January 2022)

Volume 11 (2021): Edition 4 (October 2021)

Volume 11 (2021): Edition 3 (July 2021)

Volume 11 (2021): Edition 2 (April 2021)

Volume 11 (2021): Edition 1 (January 2021)

Volume 10 (2020): Edition 4 (October 2020)

Volume 10 (2020): Edition 3 (July 2020)

Volume 10 (2020): Edition 2 (April 2020)

Volume 10 (2020): Edition 1 (January 2020)

Volume 9 (2019): Edition 4 (October 2019)

Volume 9 (2019): Edition 3 (July 2019)

Volume 9 (2019): Edition 2 (April 2019)

Volume 9 (2019): Edition 1 (January 2019)

Volume 8 (2018): Edition 4 (October 2018)

Volume 8 (2018): Edition 3 (July 2018)

Volume 8 (2018): Edition 2 (April 2018)

Volume 8 (2018): Edition 1 (January 2018)

Volume 7 (2017): Edition 4 (October 2017)

Volume 7 (2017): Edition 3 (July 2017)

Volume 7 (2017): Edition 2 (April 2017)

Volume 7 (2017): Edition 1 (January 2017)

Volume 6 (2016): Edition 4 (October 2016)

Volume 6 (2016): Edition 3 (July 2016)

Volume 6 (2016): Edition 2 (April 2016)

Volume 6 (2016): Edition 1 (January 2016)

Volume 5 (2015): Edition 4 (October 2015)

Volume 5 (2015): Edition 3 (July 2015)

Volume 5 (2015): Edition 2 (April 2015)

Volume 5 (2015): Edition 1 (January 2015)

Volume 4 (2014): Edition 4 (October 2014)

Volume 4 (2014): Edition 3 (July 2014)

Volume 4 (2014): Edition 2 (April 2014)

Volume 4 (2014): Edition 1 (January 2014)

Volume 3 (2013): Edition 4 (October 2013)

Volume 3 (2013): Edition 3 (July 2013)

Volume 3 (2013): Edition 2 (April 2013)

Volume 3 (2013): Edition 1 (January 2013)

Détails du magazine
Format
Magazine
eISSN
2449-6499
Première publication
30 Dec 2014
Période de publication
4 fois par an
Langues
Anglais

Chercher

Volume 9 (2019): Edition 3 (July 2019)

Détails du magazine
Format
Magazine
eISSN
2449-6499
Première publication
30 Dec 2014
Période de publication
4 fois par an
Langues
Anglais

Chercher

5 Articles
access type Accès libre

Score Level and Rank Level Fusion for Kinect-Based Multi-Modal Biometric System

Publié en ligne: 09 May 2019
Pages: 167 - 176

Résumé

Abstract

Computational intelligence firmly made its way into the areas of consumer applications, banking, education, social networks, and security. Among all the applications, biometric systems play a significant role in ensuring an uncompromised and secure access to resources and facilities. This article presents a first multimodal biometric system that combines KINECT gait modality with KINECT face modality utilizing the rank level and the score level fusion. For the KINECT gait modality, a new approach is proposed based on the skeletal information processing. The gait cycle is calculated using three consecutive local minima computed for the distance between left and right ankles. The feature distance vectors are calculated for each person’s gait cycle, which allows extracting the biometric features such as the mean and the variance of the feature distance vector. For Kinect face recognition, a novel method based on HOG features has been developed. Then, K-nearest neighbors feature matching algorithm is applied as feature classification for both gait and face biometrics. Two fusion algorithms are implemented. The combination of Borda count and logistic regression approaches are used in the rank level fusion. The weighted sum method is used for score level fusion. The recognition accuracy obtained for multi-modal biometric recognition system tested on KINECT Gait and KINECT Eurocom Face datasets is 93.33% for Borda count rank level fusion, 96.67% for logistic regression rank-level fusion and 96.6% for score level fusion.

Mots clés

  • Lane-Emden equations
  • simulated annealing
  • legendre polynomials
  • neural network
access type Accès libre

Applying a Neural Network Ensemble to Intrusion Detection

Publié en ligne: 09 May 2019
Pages: 177 - 188

Résumé

Abstract

An intrusion detection system (IDS) is an important feature to employ in order to protect a system against network attacks. An IDS monitors the activity within a network of connected computers as to analyze the activity of intrusive patterns. In the event of an ‘attack’, the system has to respond appropriately. Different machine learning techniques have been applied in the past. These techniques fall either into the clustering or the classification category. In this paper, the classification method is used whereby a neural network ensemble method is employed to classify the different types of attacks. The neural network ensemble method consists of an autoencoder, a deep belief neural network, a deep neural network, and an extreme learning machine. The data used for the investigation is the NSL-KDD data set. In particular, the detection rate and false alarm rate among other measures (confusion matrix, classification accuracy, and AUC) of the implemented neural network ensemble are evaluated.

Mots clés

  • Ensemble learning
  • Deep Neural Networks
  • NSL-KDD data set
access type Accès libre

Stability and Dissipativity Analysis for Neutral Type Stochastic Markovian Jump Static Neural Networks with Time Delays

Publié en ligne: 09 May 2019
Pages: 189 - 204

Résumé

Abstract

This paper studies the global asymptotic stability and dissipativity problem for a class of neutral type stochastic Markovian Jump Static Neural Networks (NTSMJSNNs) with time-varying delays. By constructing an appropriate Lyapunov-Krasovskii Functional (LKF) with some augmented delay-dependent terms and by using integral inequalities to bound the derivative of the integral terms, some new sufficient conditions have been obtained, which ensure that the global asymptotic stability in the mean square. The results obtained in this paper are expressed in terms of Strict Linear Matrix Inequalities (LMIs), whose feasible solutions can be verified by effective MATLAB LMI control toolbox. Finally, examples and simulations are given to show the validity and advantages of the proposed results.

Mots clés

  • Static neural networks
  • Dissipativity analysis
  • Markovian jump
  • Time-varying delays
access type Accès libre

Solution of Linear and Non-Linear Boundary Value Problems Using Population-Distributed Parallel Differential Evolution

Publié en ligne: 09 May 2019
Pages: 205 - 218

Résumé

Abstract

Cases where the derivative of a boundary value problem does not exist or is constantly changing, traditional derivative can easily get stuck in the local optima or does not factually represent a constantly changing solution. Hence the need for evolutionary algorithms becomes evident. However, evolutionary algorithms are compute-intensive since they scan the entire solution space for an optimal solution. Larger populations and smaller step sizes allow for improved quality solution but results in an increase in the complexity of the optimization process. In this research a population-distributed implementation for differential evolution algorithm is presented for solving systems of 2nd-order, 2-point boundary value problems (BVPs). In this technique, the system is formulated as an optimization problem by the direct minimization of the overall individual residual error subject to the given constraint boundary conditions and is then solved using differential evolution in the sense that each of the derivatives is replaced by an appropriate difference quotient approximation. Four benchmark BVPs are solved using the proposed parallel framework for differential evolution to observe the speedup in the execution time. Meanwhile, the statistical analysis is provided to discover the effect of parametric changes such as an increase in population individuals and nodes representing features on the quality and behavior of the solutions found by differential evolution. The numerical results demonstrate that the algorithm is quite accurate and efficient for solving 2nd-order, 2-point BVPs.

Mots clés

  • parallel evolutionary algorithms
  • differential evolution
  • boundary value problems
  • optimization
access type Accès libre

Swarm Algorithms for NLP - The Case of Limited Training Data

Publié en ligne: 09 May 2019
Pages: 219 - 234

Résumé

Abstract

The present article describes a novel phrasing model which can be used for segmenting sentences of unconstrained text into syntactically-defined phrases. This model is based on the notion of attraction and repulsion forces between adjacent words. Each of these forces is weighed appropriately by system parameters, the values of which are optimised via particle swarm optimisation. This approach is designed to be language-independent and is tested here for different languages.

The phrasing model’s performance is assessed per se, by calculating the segmentation accuracy against a golden segmentation. Operational testing also involves integrating the model to a phrase-based Machine Translation (MT) system and measuring the translation quality when the phrasing model is used to segment input text into phrases. Experiments show that the performance of this approach is comparable to other leading segmentation methods and that it exceeds that of baseline systems.

Mots clés

  • particle swarm optimisation
  • natural language processing
  • text phrasing
  • machine translation
5 Articles
access type Accès libre

Score Level and Rank Level Fusion for Kinect-Based Multi-Modal Biometric System

Publié en ligne: 09 May 2019
Pages: 167 - 176

Résumé

Abstract

Computational intelligence firmly made its way into the areas of consumer applications, banking, education, social networks, and security. Among all the applications, biometric systems play a significant role in ensuring an uncompromised and secure access to resources and facilities. This article presents a first multimodal biometric system that combines KINECT gait modality with KINECT face modality utilizing the rank level and the score level fusion. For the KINECT gait modality, a new approach is proposed based on the skeletal information processing. The gait cycle is calculated using three consecutive local minima computed for the distance between left and right ankles. The feature distance vectors are calculated for each person’s gait cycle, which allows extracting the biometric features such as the mean and the variance of the feature distance vector. For Kinect face recognition, a novel method based on HOG features has been developed. Then, K-nearest neighbors feature matching algorithm is applied as feature classification for both gait and face biometrics. Two fusion algorithms are implemented. The combination of Borda count and logistic regression approaches are used in the rank level fusion. The weighted sum method is used for score level fusion. The recognition accuracy obtained for multi-modal biometric recognition system tested on KINECT Gait and KINECT Eurocom Face datasets is 93.33% for Borda count rank level fusion, 96.67% for logistic regression rank-level fusion and 96.6% for score level fusion.

Mots clés

  • Lane-Emden equations
  • simulated annealing
  • legendre polynomials
  • neural network
access type Accès libre

Applying a Neural Network Ensemble to Intrusion Detection

Publié en ligne: 09 May 2019
Pages: 177 - 188

Résumé

Abstract

An intrusion detection system (IDS) is an important feature to employ in order to protect a system against network attacks. An IDS monitors the activity within a network of connected computers as to analyze the activity of intrusive patterns. In the event of an ‘attack’, the system has to respond appropriately. Different machine learning techniques have been applied in the past. These techniques fall either into the clustering or the classification category. In this paper, the classification method is used whereby a neural network ensemble method is employed to classify the different types of attacks. The neural network ensemble method consists of an autoencoder, a deep belief neural network, a deep neural network, and an extreme learning machine. The data used for the investigation is the NSL-KDD data set. In particular, the detection rate and false alarm rate among other measures (confusion matrix, classification accuracy, and AUC) of the implemented neural network ensemble are evaluated.

Mots clés

  • Ensemble learning
  • Deep Neural Networks
  • NSL-KDD data set
access type Accès libre

Stability and Dissipativity Analysis for Neutral Type Stochastic Markovian Jump Static Neural Networks with Time Delays

Publié en ligne: 09 May 2019
Pages: 189 - 204

Résumé

Abstract

This paper studies the global asymptotic stability and dissipativity problem for a class of neutral type stochastic Markovian Jump Static Neural Networks (NTSMJSNNs) with time-varying delays. By constructing an appropriate Lyapunov-Krasovskii Functional (LKF) with some augmented delay-dependent terms and by using integral inequalities to bound the derivative of the integral terms, some new sufficient conditions have been obtained, which ensure that the global asymptotic stability in the mean square. The results obtained in this paper are expressed in terms of Strict Linear Matrix Inequalities (LMIs), whose feasible solutions can be verified by effective MATLAB LMI control toolbox. Finally, examples and simulations are given to show the validity and advantages of the proposed results.

Mots clés

  • Static neural networks
  • Dissipativity analysis
  • Markovian jump
  • Time-varying delays
access type Accès libre

Solution of Linear and Non-Linear Boundary Value Problems Using Population-Distributed Parallel Differential Evolution

Publié en ligne: 09 May 2019
Pages: 205 - 218

Résumé

Abstract

Cases where the derivative of a boundary value problem does not exist or is constantly changing, traditional derivative can easily get stuck in the local optima or does not factually represent a constantly changing solution. Hence the need for evolutionary algorithms becomes evident. However, evolutionary algorithms are compute-intensive since they scan the entire solution space for an optimal solution. Larger populations and smaller step sizes allow for improved quality solution but results in an increase in the complexity of the optimization process. In this research a population-distributed implementation for differential evolution algorithm is presented for solving systems of 2nd-order, 2-point boundary value problems (BVPs). In this technique, the system is formulated as an optimization problem by the direct minimization of the overall individual residual error subject to the given constraint boundary conditions and is then solved using differential evolution in the sense that each of the derivatives is replaced by an appropriate difference quotient approximation. Four benchmark BVPs are solved using the proposed parallel framework for differential evolution to observe the speedup in the execution time. Meanwhile, the statistical analysis is provided to discover the effect of parametric changes such as an increase in population individuals and nodes representing features on the quality and behavior of the solutions found by differential evolution. The numerical results demonstrate that the algorithm is quite accurate and efficient for solving 2nd-order, 2-point BVPs.

Mots clés

  • parallel evolutionary algorithms
  • differential evolution
  • boundary value problems
  • optimization
access type Accès libre

Swarm Algorithms for NLP - The Case of Limited Training Data

Publié en ligne: 09 May 2019
Pages: 219 - 234

Résumé

Abstract

The present article describes a novel phrasing model which can be used for segmenting sentences of unconstrained text into syntactically-defined phrases. This model is based on the notion of attraction and repulsion forces between adjacent words. Each of these forces is weighed appropriately by system parameters, the values of which are optimised via particle swarm optimisation. This approach is designed to be language-independent and is tested here for different languages.

The phrasing model’s performance is assessed per se, by calculating the segmentation accuracy against a golden segmentation. Operational testing also involves integrating the model to a phrase-based Machine Translation (MT) system and measuring the translation quality when the phrasing model is used to segment input text into phrases. Experiments show that the performance of this approach is comparable to other leading segmentation methods and that it exceeds that of baseline systems.

Mots clés

  • particle swarm optimisation
  • natural language processing
  • text phrasing
  • machine translation

Planifiez votre conférence à distance avec Sciendo