Machine Learning is the study of methods for programming computers to learn. Computers are applied to a wide range of tasks, and for most of these it is relatively easy for programmers to design and implement the necessary software. However, there are many tasks for which this is difficult or impossible. These can be divided into four general categories. First, there are problems for which there exist no human experts. For example, in modern automated manufacturing facilities, there is a need to predict machine failures before they occur by analyzing sensor readings. Because the machines are new, there are no human experts who can be interviewed by a programmer to provide the knowledge necessary to build a computer system. A machine learning system can study recorded data and subsequent machine failures and learn prediction rules. Second, there are problems where human experts exist, but where they are unable to explain their expertise. This is the case in many perceptual tasks, such as speech recognition, hand-writing recognition, and natural language understanding. Virtually all humans exhibit expert-level abilities on these tasks, but none of them can describe the detailed steps that they follow as they perform them. Fortunately, humans can provide machines with examples of the inputs and correct outputs for these tasks, so machine learning algorithms can learn to map the inputs to the outputs. Third, there are problems where phenomena are changing rapidly. In finance, for example, people would like to predict the future behavior of the stock market, of consumer purchases, or of exchange rates. These behaviors change frequently, so that even if a programmer could construct a good predictive computer program, it would need to be rewritten frequently. A learning program can relieve the programmer of this burden by constantly modifying and tuning a set of learned prediction rules. Fourth, there are applications that need to be customized for each computer user separately. Consider, for example, a program to filter unwanted electronic mail messages. Different users will need different filters. It is unreasonable to expect each user to program his or her own rules, and it is infeasible to provide every user with a software engineer to keep the rules up-to-date. A machine learning system can learn which mail messages the user rejects and maintain the filtering rules automatically. Machine learning addresses many of the same research questions as the fields of statistics, data mining, and psychology, but with differences of emphasis. Statistics focuses on understanding the phenomena that have generated the data, often with the goal of testing different hypotheses about those phenomena. Data mining seeks to find patterns in the data that are understandable by people. Psychological studies of human learning aspire to understand the mechanisms underlying the various learning behaviors exhibited by people (concept learning, skill acquisition, strategy change, etc.).

Machine learning

/pdf/the-dance-language-and-orientation-of-bees-3jdlph0pp0.pdf

The Dance Language and Orientation of Bees

International Joint Conference on Neural Networks

Metaheuristic design of feedforward neural networks

Identification of significant features and data mining techniques in predicting heart disease

Meta-heuristic algorithms inspired by biological species have become very popular in recent years. Collective intelligence of various social insects such as ants, bees, wasps, termites, birds, fish, has been investigated to develop a number of meta-heuristic algorithms in the general domain of swarm intelligence (SI). The developed SI algorithms are found effective in solving different optimization tasks. Travelling Salesman Problem (TSP) is the combinatorial optimization problem where a salesman starting from a home city travels all the other cities and returns to home city in the shortest possible path. TSP is a popular problem due to the fact that the instances of TSP can be applied to solve real-world problems, implication of which turns TSP into a standard test bench for performance evaluation of new algorithms. Spider Monkey Optimization (SMO) is a recent addition to SI algorithms based on the social behaviour of spider monkeys. SMO implicitly adopts grouping and regrouping for the interactions to improve solutions; such multi-population approach is the motivation of this study to develop an effective method for TSP. This paper presents an effective variant of SMO to solve TSP called discrete SMO (DSMO). In DSMO, every spider monkey represents a TSP solution where Swap Sequence (SS) and Swap Operator (SO) based operations are employed, which enables interaction among monkeys in obtaining the optimal TSP solution. The SOs are generated using the experience of a specific spider monkey as well as the experience of other members (local leader, global leader, or a randomly selected spider monkey) of the group. The performance and effectiveness of the proposed method have been verified on a large set of TSP instances and the outcomes are compared to other well-known methods. Experimental results demonstrate the effectiveness of the proposed DSMO for solving TSP.

/pdf/discrete-spider-monkey-optimization-for-travelling-salesman-4szs1jd9r6.pdf

Discrete Spider Monkey Optimization for Travelling Salesman Problem

Human facial emotion recognition (FER) has attracted the attention of the research community for its promising applications. Mapping different facial expressions to the respective emotional states are the main task in FER. The classical FER consists of two major steps: feature extraction and emotion recognition. Currently, the Deep Neural Networks, especially the Convolutional Neural Network (CNN), is widely used in FER by virtue of its inherent feature extraction mechanism from images. Several works have been reported on CNN with only a few layers to resolve FER problems. However, standard shallow CNNs with straightforward learning schemes have limited feature extraction capability to capture emotion information from high-resolution images. A notable drawback of the most existing methods is that they consider only the frontal images (i.e., ignore profile views for convenience), although the profile views taken from different angles are important for a practical FER system. For developing a highly accurate FER system, this study proposes a very Deep CNN (DCNN) modeling through Transfer Learning (TL) technique where a pre-trained DCNN model is adopted by replacing its dense upper layer(s) compatible with FER, and the model is fine-tuned with facial emotion data. A novel pipeline strategy is introduced, where the training of the dense layer(s) is followed by tuning each of the pre-trained DCNN blocks successively that has led to gradual improvement of the accuracy of FER to a higher level. The proposed FER system is verified on eight different pre-trained DCNN models (VGG-16, VGG-19, ResNet-18, ResNet-34, ResNet-50, ResNet-152, Inception-v3 and DenseNet-161) and well-known KDEF and JAFFE facial image datasets. FER is very challenging even for frontal views alone. FER on the KDEF dataset poses further challenges due to the diversity of images with different profile views together with frontal views. The proposed method achieved remarkable accuracy on both datasets with pre-trained models. On a 10-fold cross-validation way, the best achieved FER accuracies with DenseNet-161 on test sets of KDEF and JAFFE are 96.51% and 99.52%, respectively. The evaluation results reveal the superiority of the proposed FER system over the existing ones regarding emotion detection accuracy. Moreover, the achieved performance on the KDEF dataset with profile views is promising as it clearly demonstrates the required proficiency for real-life applications.

https://www.mdpi.com/2079-9292/10/9/1036/pdf

Facial Emotion Recognition Using Transfer Learning in the Deep CNN

The University Course Scheduling Problem (UCSP) is a highly constrained real-world combinatorial optimization task. Solving UCSP means creating an optimal course schedule by assigning courses to specific rooms, instructors, students, and timeslots by taking into account the given constraints. Several studies have reported different metaheuristic approaches for solving UCSP including Genetic Algorithm (GA) and Harmony Search (HS) algorithm. Various Swarm Intelligence (SI) optimization methods have also been investigated for UCSP in recent times and a few Particle Swarm Optimization (PSO) based methods among them with different adaptations are shown to be effective. In this study, a novel PSO-based method is investigated for solving highly constrained UCSP in which basic PSO operations are transformed to tackle combinatorial optimization task of UCSP and a few new operations are introduced to PSO to solve UCSP efficiently. In the proposed method, swap sequence-based velocity computation and its application are developed to transform individual particles in order to improve them. Selective search and forceful swap operation with repair mechanism are the additional new operations in the proposed method for updating particles with calculated swap sequences as velocities. The proposed PSO with selective search (PSOSS) method has been tested on an instance of UCSP for the Computer Science and Engineering Department of Khulna University of Engineering & Technology which has many hard and soft constraints. Experimental results revealed the effectiveness and the superiority of the proposed method compared to other prominent metaheuristic methods (e.g., GA, HS).

https://pure.ulster.ac.uk/ws/files/76764440/accepted_version_Optimization_of_University_Course_Scheduling_Problem_NSiddique.pdf

Optimization of University Course Scheduling Problem using Particle Swarm Optimization with Selective Search

Decision in medical diagnosis is mostly taken by expert's experiences. In many cases, not all the expert's experiences contribute towards effective diagnosis of a disease. Researchers have taken multiple approaches like attribute reduction, rule extraction, fuzzy model optimization, etc. But noisy data in datasets, irrelevant attributes, and lack of effective fuzzy rules are major hindrances to provide best decision. In this study, we propose genetic algorithm based fuzzy decision support system for predicting the risk level of heart disease. Our proposed fuzzy decision support system (FDSS) works as follows: i) Preprocess the dataset, ii) Effective attributes are selected based on different methods, iii) Weighted fuzzy rules are generated on the basis of selected attributes using GA, iv) Build the FDSS from the generated fuzzy knowledge base, v) Predict the heart disease. The experiments carried out with real-life data set show the effectiveness of this proposed innovative approach.

Genetic algorithm based fuzzy decision support system for the diagnosis of heart disease

Recognition of handwritten numerals has gained much interest in recent years due to its various application potentials. The progress of handwritten Bangla numeral is well behind Roman, Chinese and Arabic scripts although it is a major language in Indian subcontinent and is the first language of Bangladesh. Handwritten numeral classification is a high-dimensional complex task and existing methods use distinct feature extraction techniques and various classification tools in their recognition schemes. Recently, convolutional neural network (CNN) is found efficient for image classification with its distinct features. In this study, a CNN based method has been investigated for Bangla handwritten numeral recognition. A moderated pre-processing has been adopted to produce patterns from handwritten scan images. On the other hand, CNN has been trained with the patterns plus a number of artificial patterns. A simple rotation based approach is employed to generate artificial patterns. The proposed CNN with artificial pattern is shown to outperform other existing methods while tested on a popular Bangla benchmark handwritten dataset.

/pdf/convolutional-neural-network-training-with-artificial-1elcxbtil5.pdf

M. A. H. Akhand

Papers

Discrete Spider Monkey Optimization for Travelling Salesman Problem

Facial Emotion Recognition Using Transfer Learning in the Deep CNN

Optimization of University Course Scheduling Problem using Particle Swarm Optimization with Selective Search

Genetic algorithm based fuzzy decision support system for the diagnosis of heart disease

Convolutional neural network training with artificial pattern for Bangla handwritten numeral recognition