Forthcoming articles

International Journal of Computational Intelligence Studies

International Journal of Computational Intelligence Studies (IJCIStudies)

These articles have been peer-reviewed and accepted for publication but are pending final changes, are not yet published and may not appear here in their final order of publication until they are assigned to issues. Therefore, the content conforms to our standards but the presentation (e.g. typesetting and proof-reading) is not necessarily up to the Inderscience standard. Additionally, titles, authors, abstracts and keywords may change before publication. Articles will not be published until the final proofs are validated by their authors.

Forthcoming articles must be purchased for the purposes of research, teaching and private study only. These articles can be cited using the expression "in press". For example: Smith, J. (in press). Article Title. Journal Title.

Articles marked with this shopping trolley icon are available for purchase - click on the icon to send an email request to purchase.

Register for our alerting service, which notifies you by email when new issues are published online.

Open AccessArticles marked with this Open Access icon are freely available and openly accessible to all without any restriction except the ones stated in their respective CC licenses.
We also offer which provide timely updates of tables of contents, newly published articles and calls for papers.

International Journal of Computational Intelligence Studies (13 papers in press)

Regular Issues

  • Wolf : A framework for digital workplace - Architecture and models -   Order a copy of this article
    by Khadija ELAMRANI, Noureddine Chenfour, Mohamed LAHMER, Ghita Daoudi 
    Abstract: The main purpose of the digital workplace (DW) is to ensure to the organizations different contributors or actors a portal of digital services, which are accessible through a virtual desktop covering all its business services. During our studies, we were able to identify five major problems. First of all, we note a great confusion in the related definitions because most of them are restricted to the teaching sector. Secondly, most existing DWs are summarized as a simple gateway to pre-existing digital tools collection that covers the organizations business domains, without any means of communication between them. Another problem is the lack of a reference architecture. Moreover, we could not identify any logical or physical model to represent the different DWs entities. Lastly, there is a total absence of a standard or even an appropriate vocabulary.rnFaced with these shortfalls, we propose in this paper a set of fundamentals that is composed by a definition encapsulating the different domains, as well as a naming system and a vocabulary that identify both the entities that compose the virtual desktop and their connections and flows. Based on these fundamentals, we also propose our framework WOLF (Digital Workplace based on Open and Light architecture Framework) that generate automatically customized digital workplaces, and is distinguished from other existing DWs solutions by its generic and extensible character. The generated DW encapsulates all of the organizations domains, services, flows and a collaboration system between the different actors. Our proposed frameworks architecture allows us to classify and organize the various entities into a tree representation whilst data nodes are modelled using XML files.
    Keywords: Digital workplace; Digital workspace; Collaboration; Digital work environment.

  • Empirical Estimation of Various Data Stream Mining Methods   Order a copy of this article
    by Ritesh Srivastava, Veena Tayal 
    Abstract: The online learning is done in order to work in dynamic environments in which concept tend to change with time and the accuracy of classifiers decreases. The current and previous research is done in static environments, but there is a need of real time data streaming due to the potentially larger number of applications available in the scientific and business domains. There are several methods used in learning in the presence of dynamic environments like single classifier methods such as batch and incremental learning approaches, classification methods with explicit drift detection method, windowing techniques and ensemble approaches. This paper, investigates these approaches for determining the best suitable method among them. We utilized light emitting diode (LED) data generator for evaluating the performance of the methods.
    Keywords: Concept drifts; online learning; data stream mining; machine learning; classification; drift detection methods.

  • Alzheimer's disease prediction using Regression models and SVM   Order a copy of this article
    by Rohini M 
    Abstract: Alzheimer's disease (AD) and cognitive impairment due to aging are the recently prevailing diseases among aged inhabitants because of an increase in the aging population. Several demographic characters, structural and functional neuroimaging investigations, cardio-vascular studies, neuropsychiatric symptoms, cognitive performances and biomarkers in cerebrospinal fluids are the various predictors for AD. We can consider these input features for the prediction of symptoms whether they belong to AD or normal cognitive impairment for aging. In the proposed study, the hypothesis is derived for supervised learning methods such as multivariate linear regression, logistic regression, and SVM. We perform feature scaling and normalization with features as an initial step for applying the parameters to derive the hypothesis. We analyze performance metrics with the implementation results. The present work is applied to 1000 baseline assessment data from Alzheimers disease Neuro-Imaging Initiative studies (ADNI) that give conversion prediction. The comparison of results in literature studies suggests that the efficiency of the proposed study is highly helpful in differentiating AD pathology from cognitive impairment because of aging.
    Keywords: Multivariate linear regression; logistic regression; Support Vector Machine(SVM);Feature scaling; Normalization;ADNI.

  • Detection of various categories of Fruit and vegetable through various descriptor using machine learning techniques   Order a copy of this article
    by Mukesh Kumar Tripathi, Dhananjay D. Maktedar 
    Abstract: An accurate and efficient recognition system for fruits and vegetables is one major challenges. To solve this challenges, we have examined various feature descriptor based on colour and texture such as RGB, CMH, CCV, CDH, LBP, CSLBP and SEH. All process of proposed framework consists three phase 1) background subtraction 2) Feature extraction 3) training and classification. In this paper, Otsus thresholding is used for background subtraction. Further all segmented image is used in feature extraction phase. Finally, C4.5 and KNN is used for training and classification. The various performance metric such as CA, Precision, Recall, F-measure, MCC, PRC and FPR are used to evaluate the proposed system for recognition problem. We, also analysis performance accuracy of both classifiers. In that C4.5, KNN classifier produce CA with value 94.63 %, 90.25 % respectively.
    Keywords: detection; fruits; vegetables; descriptor; performance metric; C4.5; k-nearest neighbour; KNN; SVM.

    by Neeyati Anand, Riya Sehgal, Sanchit Anand, Ajay Kaushik 
    Abstract: Data Mining in education deals with formulating strategies for students with the aim to increase the parameters affecting the learning and employability. It also helps the educational institutes in maintaining their reputation as it is directly linked to the students grades. We need to identify the parameters involved in learning and the relationship among those parameters. In EDM, Feature Selection (FS) is one of the most important and needed method in EDM. As it removes the features which has no direct link with the students performance. For example, Date of Birth of a student doesnt impact his/her performance. In this paper an attempt has been made to improve the performance of the classifiers for undergraduate students at Maharaja Agrasen Institute Of Technology. We have applied several techniques of Data Mining to make some rules that increases the learning and employability of students. The results of our study has shown a significant increase of accuracy, recall, precision and F-measure for Na
    Keywords: Classifiers; Educational Data mining; Feature Selection; Performance.

  • Deep Learning for Apple Diseases: Classification and Identification   Order a copy of this article
    by Asif Iqbal Khan, S.M.K. Quadri, Saba Banday 
    Abstract: Diseases and pests cause huge economic loss to the apple industry every year. Precise identification of various apple diseases is challenging for the farmers due to their similar appearance in some stages. This paper is an attempt to provide the timely and accurate detection and identification of apple diseases. In this study, we propose a deep learning based approach for identification and classification of apple diseases. The first part of the study is dataset creation which includes data collection and data labeling. Next, we train a Convolutional Neural Network (CNN) model on the prepared dataset for automatic classification of apple diseases. CNNs are end-to-end learning algorithms which perform automatic feature extraction and learn complex features directly from raw images, making them suitable for wide variety of tasks like image classification, object detection, segmentation etc. We applied transfer learning to initialize the parameters of the proposed deep model. Data augmentation techniques like rotation, translation, reflection and scaling was also applied to prevent overfitting. The proposed CNN model obtained encouraging results, reaching around 97.18% of accuracy on our prepared dataset. The results validate that the proposed method is effective in classifying various types of apple diseases and can be used as a practical tool by farmers
    Keywords: Apple Diseases; Deep Learning; Apple disease classification; Convolutional Neural Networks.
    DOI: 10.1504/IJCISTUDIES.2021.10033513
  • Performance of Convolutional Neural Networks Optimizers: An Extensive Evaluation on Glaucoma Prediction   Order a copy of this article
    by Kishore Balasubramanian 
    Abstract: Purpose: To assess the performance of Convolutional Neural Networks (CNN) Optimizers in predicting glaucoma on retinal fundus images. CNN model was opted owing to its capability in handling raw digital image data avoiding handcrafted feature extractionrnDesign: Fundus images - locally collected database. The performance of CNN depends on quality of the data, tuning of the algorithm that include learning rate, number of epochs and batches, weight initialization, activation function, optimization, loss function and models combination. This paper focuses on improving the CNN performance by the way of optimizing the architecture parameter selection through optimizers and loss function. In this work, 4 gradient descent-based optimizers were compared, i.e., Stochastic Gradient Descent (SGD), Adaptive Gradient (Adagrad), Adaptive Delta (Adadelta) and Adaptive Momentum (Adam). Mean Square Error (MSE) and Binary Cross Entropy (BCE) were the loss functions chosen. Gradient descent optimizers were considered because of their high convergence speed on large volume of datasets.rnMethod: The dataset was divided into 60% training and 40% testing. Two CNN architectures, AlexNet, and ResNet were developed and trained on the dataset with 0.01 learning rate. Batch size was 60. The number of epochs set was 50, 100 and 200. The methods were evaluated in terms of mean square error and accuracy. rnResults: Lowest training loss and appreciable accuracy with ADAM; Adam works well comparatively and also outperforms other adaptive techniques. rnConclusion: The assessment demonstrated that ADAM based optimization in CNN was able to diagnose glaucoma accurately with less loss and better convergence speed. rn
    Keywords: Glaucoma; Fundus Image; Convolutional Neural Networks; Deep Learning; Optimization.

Special Issue on: IEEE IWCIA2019 Innovative Computational Intelligence for Deep Learning and Knowledge Acquisition

  • Code Completion for Programming Education based on Deep Learning   Order a copy of this article
    by Kenta Terada, Yutaka Watanobe 
    Abstract: In solving programming problems, it is difficult for beginners to create a program from scratch. One way to navigate this difficulty is to suggest the next word following an incomplete program. In the present study, we propose a method for code completion characterized by two principal elements: the prediction of the next within-vocabulary word and the prediction of the next referenceable identifier. For the prediction of within-vocabulary words, a neural language model based on an LSTM network with an attention mechanism is proposed. Additionally, for the prediction of referenceable identifiers, a model based on a pointer network to a given incomplete program is proposed. For evaluation of the proposed method, source code accumulated in an online judge system is used. The results of the experiment demonstrate that in both statically and dynamically typed languages, the proposed method can predict the next word to a high degree of accuracy.
    Keywords: Programming education; Code completion; Deep learning; LSTM; Pointer network.

  • Multi-objective optimization of allocations and locations of incineration facilities with Voronoi diagram and genetic algorithm: Case study of Hiroshima city and Aki county   Order a copy of this article
    by Taketo Kamikawa, Takashi Hasuike 
    Abstract: This research focuses on the two objectives of maximizing the amount of heat generated by incineration and minimizing the waste collection distances divided by population densities, in determining allocations and locations of general waste incineration facilities as a case study of Hiroshima city and Aki county in Japan. For these objectives, we propose the version 2 of Multi-Objective optimization with Voronoi diagram and Genetic Algorithm (MOVGA2). As for the maximization of the amount of generated heat, we predict the amount by the regression equation of multiple linear regression analysis using 2013 to 2017 panel data and formulate it as the set partitioning problem (SPP) to maximize the prediction value. As for the minimization of waste collection distances divided by population densities, we formulate it as the multi-Weber problem. To solve these two problems, we use MOVGA2, which has the seeds and weights of the Laguerre Voronoi diagram as a gene. As a result of the survey using data of the year 2017 of Hiroshima city and Aki county, in the case of 2 existing facilities, 2 new facilities and 3 closed facilities it was found that the calorific value increased enough to cover the power of 1,233 households (converted to housing complex) per year despite the increase of only 9% t-km for waste collection distances.
    Keywords: genetic algorithm; Voronoi diagram; thermal energy; incineration facility; combustible waste.

  • Efficient Parameter-Free Adaptive Penalty Method with Balancing the Objective Function Value and the Constraint Violation   Order a copy of this article
    by Takeshi Kawachi, Jun-ichi Kushida, Akira Hara, Tetsuyuki Takahama 
    Abstract: Real world problems are often formularized as constrained optimization problems (COPs). Constraint handling techniques are important for efficient search, and various approaches such as penalty methods or feasibility rule have been studied. The penalty methods deal with a single fitness function by combining an objective function value and a constraint violation with a penalty factor. Moreover, the penalty factor can be flexibly adapted by feeding back information on search process in adaptive penalty methods. However, setting parameters properly and keeping the good balance between the objective function value and the constraint violation are difficult. In this paper, we propose a new parameter-free adaptive penalty method with balancing the objective function value and the constraint violation. L-SHADE is adopted as a base search algorithm, and the optimization results of 28 benchmark functions provided by the CEC2017 and CEC2018 competitions on constrained single-objective numerical optimizations are compared with other methods.
    Keywords: Evolutionary Algorithms; Differential Evolution; Constraint Handling Techniques; Penalty Method;.

  • Detecting Audio Adversarial Examples for Protecting Speech-to-Text Transcription Neural Network   Order a copy of this article
    by Keiichi Tamura, Akitada Omagari, Hajime Ito, Shuichi Hashida 
    Abstract: With the increasing use of deep learning techniques in real-world applications, their vulnerabilities have received significant attention from deep-learning researchers and practitioners. In particular, adversarial examples for deep neural networks and protection methods against them have been well-studied in recent years because they have serious vulnerabilities that threatens safety in real-world. Audio adversarial examples, which are targeted attacks, are designed such that the deep neural network-based speech-to-text systems misunderstand input voice sound. In this study, we propose a new protection method against audio adversarial examples. The proposed protection method is based on a sandbox approach, where an input voice sound is checked in the system to determine if it is an audio adversarial example. To evaluate the proposed protection method, we used actual audio adversarial examples created on Deep Speech, which is a typical speech-to-text transcription neural network. The experimental results show that our protection method can detect audio adversarial examples with high accuracy.
    Keywords: Adversarial Example; Deep Learning; Computer Security; Data Representation; Speech-to-Text; Sandbox Method.

  • Using Term Similarity Measures for Classifying Short Document Data   Order a copy of this article
    by Hirohisa Seki, Shuhei Toriyama 
    Abstract: Term expansion (a.k.a. document expansion), proposed by Carpineto et al., is a method used for text classification. When handling short text data like social media and blogs, we can apply the term expansion method to expand the sparse information in them. While the prior works on term expansion use an FCA (Formal Concept Analysis)-based similarity measure defined between terms (or words), this paper studies the effectiveness of using two kinds of measures for term expansion: one is weighted similarity measures studied in FCA, and the other is some correlation measures, like cosine and all-conf, often employed in data mining. We also present some properties on the relationship between these term similarity/correlation measures and the notion of relevancy in classification. We show empirically that cosine correlation measure outperforms the prior methods in our two short document data. We also make a comparison of our approach with an LDA (Latent Dirichlet Allocation)-based term expansion approach by Rogers et al.
    Keywords: term expansion; similarity measure,; correlation; formal concepts; LDA; short document data; classification.

  • A Video Prediction Method by using Long Short Term Memory based Adaptive Structural Learning of Deep Belief Network and its Investigation of Input Sequence Length for Data Structure   Order a copy of this article
    by Shin Kamada, Takumi Ichimura 
    Abstract: Artificial Intelligence (AI) with sophisticated technologies has become an essential technique in our life. Especially, deep learning has been a successful model which can effectively represent several features of input space and remarkably improve image recognition performance on the deep architectures. In our research, Adaptive RBM and Adaptive DBN have been developed as a deep learning model. The adaptive structural learning can find a suitable size of network structure for given input space during its training. This is, the neuron generation and annihilation algorithms were implemented on Restricted Boltzmann Machine (RBM), and layer generation algorithm was implemented on Deep Belief Network (DBN). Moreover, the learning algorithm of Adaptive RBM and Adaptive DBN was extended to the time-series prediction by using the idea of LSTM (Long Short Term Memory). Our previous research tackled the problems for supervised learning, in this paper, we challenge to reveal the power of our proposed method in the video recognition research field by using Moving MNIST for unsupervised learning, since video includes rich source of visual information. Moving MNIST is a benchmark data set for video recognition where two digits are moving for randomly determined direction in time sequence. Adaptive LSTM-DBN trained the time-series movement or features from the video data and it showed higher future prediction performance than the existing LSTM models (more than 90\ for test data). Moreover, the detailed prediction results were investigated by training Adaptive LSTM-DBN with various length of input sequence. As a result, we found some cases that the models represented multiple time-series movements of not only short-term simple movements but also long-term complicated features, according to the length of input sequence.
    Keywords: Deep learning; Deep Belief Network; Adaptive structural learning method; Video recognition.