Algorithms Implemented for Cancer Gene Searching and Classifications

Understanding the gene expression is an important factor to cancer diagnosis. One target of this understanding is implementing cancer gene search and classification methods. However, cancer gene search and classification is a challenge in that there is no an obvious exact algorithm that can be implemented individually for various cancer cells. In this paper a research is con-ducted through the most common top ranked algorithms implemented for cancer gene search and classification, and how they are implemented to reach a better performance. The paper will distinguish algorithms implemented for Bio image analysis for cancer cells and algorithms implemented based on DNA array data. The main purpose of this paper is to explore a road map towards presenting the most current algorithms implemented for cancer gene search and classification

IMPLEMENTATION OF PARTICLE SWARM OPTIMIZATION BASED MACHINE LEARNING ALGORITHM FOR STUDENT PERFORMANCE PREDICTION

Education plays an important role in the development of a country, especially educational institutions as places where the educational process has an important goal to create quality education in improving student performance. Based on research conducted in the last few decades the quality of education in Portugal has improved, but statistics show that the failure rate of students in Portugal is high, especially in the fields of Mathematics and Portuguese. On the other hand, machine learning which is part of Artificial Intelligence is considered to be helpful in the field of education, one of which is in predicting student performance. However, measuring student performance becomes a challenge since student performance has several factors, one of which is the relationship of variables and factors for predicting the performance of participating in an orderly manner. This study aims to find out how the application of machine learning algorithms based on particle sworm optimization to predict student performance. By using experimental research methods and the results of empirical studies shown in each model, namely random forest, decision tree, support vector machine and particle swarm optimization based neural network can improve the accuracy of student performance predictions

Automation of motor dexterity assessment

Motor dexterity assessment is regularly performed in rehabilitation wards to establish patient status and automatization for such routinary task is sought. A system for automatizing the assessment of motor dexterity based on the Fugl-Meyer scale and with loose restrictions on sensing technologies is presented. The system consists of two main elements: 1) A data representation that abstracts the low level information obtained from a variety of sensors, into a highly separable low dimensionality encoding employing t-distributed Stochastic Neighbourhood Embedding, and, 2) central to this communication, a multi-label classifier that boosts classification rates by exploiting the fact that the classes corresponding to the individual exercises are naturally organized as a network. Depending on the targeted therapeutic movement class labels i.e. exercises scores, are highly correlated-patients who perform well in one, tends to perform well in related exercises-; and critically no node can be used as proxy of others - an exercise does not encode the information of other exercises. Over data from a cohort of 20 patients, the novel classifier outperforms classical Naive Bayes, random forest and variants of support vector machines (ANOVA: p <; 0.001). The novel multi-label classification strategy fulfills an automatic system for motor dexterity assessment, with implications for lessening therapist's workloads, reducing healthcare costs and providing support for home-based virtual rehabilitation and telerehabilitation alternatives

Optimized Naïve Bayesian Algorithm for Efficient Performance

Naïve Bayesian algorithm is a data mining algorithm that depicts relationship between data objects using probabilistic method. Classification using Bayesian algorithm is usually done by finding the class that has the highest probability value. Data mining is a popular research area that consists of algorithm development and pattern extraction from database using different algorithms. Classification is one of the major tasks of data mining which aimed at building a model (classifier) that can be used to predict unknown class labels. There are so many algorithms for classification such as decision tree classifier, neural network, rule induction and naïve Bayesian. This paper is focused on naïve Bayesian algorithm which is a classical algorithm for classifying categorical data. It easily converged at local optima. Particle Swarm Optimization (PSO) algorithm has gained recognition in many fields of human endeavours and has been applied to enhance efficiency and accuracy in different problem domain. This paper proposed an optimized naïve Bayesian classifier using particle swarm optimization to overcome the problem of premature convergence and to improve the efficiency of the naïve Bayesian algorithm. The classification result from the optimized naïve Bayesian when compared with the traditional algorithm showed a better performance Keywords: Data Mining, Classification, Particle Swarm Optimization, Naïve Bayesian

Accurate angle-of-arrival measurement using particle swarm optimization

As one of the major methods for location positioning, angle-of-arrival (AOA) estimation is a significant technology in radar, sonar, radio astronomy, and mobile communications. AOA measurements can be exploited to locate mobile units, enhance communication efficiency and network capacity, and support location-aided routing, dynamic network management, and many location-based services. In this paper, we propose an algorithm for AOA estimation in colored noise fields and harsh application scenarios. By modeling the unknown noise covariance as a linear combination of known weighting matrices, a maximum likelihood (ML) criterion is established, and a particle swarm optimization (PSO) paradigm is designed to optimize the cost function. Simulation results demonstrate that the paired estimator PSO-ML significantly outperforms other popular techniques and produces superior AOA estimates

Source bearing and steering-vector estimation using partially calibrated arrays

The problem of source direction-of-arrival (DOA) estimation using a sensor array is addressed, where some of the sensors are perfectly calibrated, while others are uncalibrated. An algorithm is proposed for estimating the source directions in addition to the estimation of unknown array parameters such as sensor gains and phases, as a way of performing array self-calibration. The cost function is an extension of the maximum likelihood (ML) criteria that were originally developed for DOA estimation with a perfectly calibrated array. A particle swarm optimization (PSO) algorithm is used to explore the high-dimensional problem space and find the global minimum of the cost function. The design of the PSO is a combination of the problem-independent kernel and some newly introduced problem-specific features such as search space mapping, particle velocity control, and particle position clipping. This architecture plus properly selected parameters make the PSO highly flexible and reusable, while being sufficiently specific and effective in the current application. Simulation results demonstrate that the proposed technique may produce more accurate estimates of the source bearings and unknown array parameters in a cheaper way as compared with other popular methods, with the root-mean-squared error (RMSE) approaching and asymptotically attaining the Cramer Rao bound (CRB) even in unfavorable conditions

Swarm intelligence-based model for improving prediction performance of low-expectation teams in educational software engineering projects

Software engineering is one of the most significant areas, which extensively used in educational and industrial fields. Software engineering education plays an essential role in keeping students up to date with software technologies, products, and processes that are commonly applied in the software industry. The software development project is one of the most important parts of the software engineering course, because it covers the practical side of the course. This type of project helps strengthening students' skills to collaborate in a team spirit to work on software projects. Software project involves the composition of software product and process parts. Software product part represents software deliverables at each phase of Software Development Life Cycle (SDLC) while software process part captures team activities and behaviors during SDLC. The low-expectation teams face challenges during different stages of software project. Consequently, predicting performance of such teams is one of the most important tasks for learning process in software engineering education. The early prediction of performance for low-expectation teams would help instructors to address difficulties and challenges related to such teams at earliest possible phases of software project to avoid project failure. Several studies attempted to early predict the performance for low-expectation teams at different phases of SDLC. This study introduces swarm intelligence -based model which essentially aims to improve the prediction performance for low-expectation teams at earliest possible phases of SDLC by implementing Particle Swarm Optimization-K Nearest Neighbours (PSO-KNN), and it attempts to reduce the number of selected software product and process features to reach higher accuracy with identifying less than 40 relevant features. Experiments were conducted on the Software Engineering Team Assessment and Prediction (SETAP) project dataset. The proposed model was compared with the related studies and the state-of-the-art Machine Learning (ML) classifiers: Sequential Minimal Optimization (SMO), Simple Linear Regression (SLR), Naïve Bayes (NB), Multilayer Perceptron (MLP), standard KNN, and J48. The proposed model provides superior results compared to the traditional ML classifiers and state-of-the-art studies in the investigated phases of software product and process development

Student Performance Prediction Using A Cascaded Bi-level Feature Selection Approach

Features in educational data are ambiguous which leads to noisy features and curse of dimensionality problems. These problems are solved via feature selection. There are existing models for features selection. These models were created using either a single-level embedded, wrapperbased or filter-based methods. However single-level filter-based methods ignore feature dependencies and ignore the interaction with the classifier. The embedded and wrapper based feature selection methods interact with the classifier, but they can only select the optimal subset for a particular classifier. So their selected features may be worse for other classifiers. Hence this research proposes a robust Cascade Bi-Level (CBL) feature selection technique for student performance prediction that will minimize the limitations of using a single-level technique. The proposed CBL feature selection technique consists of the Relief technique at first-level and the Particle Swarm Optimization (PSO) at the second-level. The proposed technique was evaluated using the UCI student performance dataset. In comparison with the performance of the single-level feature selection technique the proposed technique achieved an accuracy of 94.94% which was better than the values achieved by the single-level PSO with an accuracy of 93.67% for the binary classification task. These results show that CBL can effectively predict student performance

HEALTH CLAIM INSURANCE PREDICTION USING SUPPORT VECTOR MACHINE WITH PARTICLE SWARM OPTIMIZATION

The number of claims plays an important role the profit achievement of health insurance companies. Prediction of the number of claims could give the significant implications in the profit margins generated by the health insurance company. Therefore, the prediction of claim submission by insurance users in that year needs to be done by insurance companies. Machine learning methods promise the great solution for claim prediction of the health insurance users.&nbsp; There are several machine learning methods that can be used for claim prediction, such as the Naïve Bayes method, Decision Tree (DT), Artificial Neural Networks (ANN) and Support Vector Machine (SVM). The previous studies show that the SVM has some advantages over the other methods. However, the performance of the SVM is determined by some parameters. Parameter selection of SVM is normally done by trial and error so that the performance is less than optimal. Some optimization algorithms based heuristic optimization can be used to determine the best parameter values of SVM, for example Particle Swarm Optimization (PSO) and Genetic Algorithm (GA). They are able to search the global optimum, easy to be implemented. The derivatives aren’t needed in its computation. Several researches show that PSO give the better solutions if it is compared with GA. All particles in the PSO are able to find the solution near global optimal. For these reasons, this article proposes the health claim insurance prediction using SVM with PSO. The experimental results show that the SVM with PSO gives the great performance in the health claim insurance prediction and it has been proven that the SVM with PSO give better performance than the SVM standard