Search

Human identity recognition and protection of information security are current global concerns in this age of increasing information growth. Biometrics approach of defining identity is considered as one of the highly potential approaches due to its internal feature that is difficult to be artificially recreated, stolen and/or forgotten. The new recognition system based on finger vein is a unique method depending on physiological traits and parameters of the vein patterns for the human. Published works on finger vein identification have hitherto ignored the power of aggregating different types of features and classifiers in improving the performance of the biometric recognition system. In this paper, we developed a novel feature approach named as straight line approximator (SLA) for extending the feature space of vein pattern using a public data set SDUMLA-HMT comprising about 3,816 images of finger vein for 160 persons. Furthermore, we applied a set of extreme learning machine (ELM) and support vector machine (SVM) classifier in different kernels. Then, we used the combination rules to improve the performance of the system. The experiment result of the proposed method achieved an accuracy of 87% using (DS and GWAR) rules at rank 1, while the accuracy of DS rule 93% and GWAR rule 92% at rank 5.

Iron Deficiency Anemia (IDA) and Thalassemia is a common disease in the world population. In hospital routine, those diseases are being recognized based on level of hemoglobin in Complete Blood Count (CBC) result. Then, visual experts will conduct examination under the light microscope which is subjected to human error. In this research, we suggested a methodology via machine learning to classify and characterize erythrocyte related with IDA and Thalassemia. We employ some image pre-processing techniques on the blood smear images to enhance edges and reduce image noise such as gamma correction and morphological processing. Then, every single erythrocyte image will segment the background and foreground by using Otsu’s threshold method. Here, we have considered nine types of erythrocyte such as teardrop, echinocyte, elliptocyte, microcytic, hypochromic, target cell, acanthocyte, sickle cell and normal cell to be classified and portray based on their morphological features. Later, these 24 and 31 features from Hue’s moment, Zernike moment, Fourier descriptor and geometrical features are confirmed as potential features for each condition by calculating one-way ANOVA. Next, the rank of subset features is done based on their information gain value from maximum to minimum. Each of subset is separated by incremental of five features. Here, we compare the performance for each subset with five selected classifiers namely logistic regression, radial basis function network, multilayer perceptron, Naive Bayes Classifier and Classification and Regression Tree. The best subsets from 31 features provide the highest result of classification with 83.5% accuracy, 83.5% sensitivity and 83.3% positive predictive value respectively via logistic regression compared to other classifiers. This study could be extended by using image dataset from other blood based disease for future work.

A recommender system is becoming a popular platform that predicts the ratings or preferences in studying human behaviors and habits. The predictive system is widely used especially in marketing, retailing and product development. The system responds to users preferences in goods and services and gives recommendations via Machine Learning algorithms deployed catered specifically for such services. The same recommender system can be built for predicting botnets attack. Via our Integrated Cyber-Evidence (ICE) Big Data system, we build a recommender system based on collected data on telemetric Botnets networks traffics. The recommender system is trained periodically on cyber-threats enriched data from Coordinated Malware Eradication & Remedial Platform system (CMERP), specifically the geolocations and the timestamp of the attacks. The machine learning is based on K-Means and DBSCAN clustering. The result is a recommendation of top potential attacks based on ranks from a given geolocations coordinates. The recommendation also includes alerts on locations with high density of certain botnets types.

In mammogram, masses are primary indication of breast cancer; and it is necessary to classify them as malignant or benign. In this classification task, Computer Aided Diagnostic (CAD) system by using ensemble learning is able to assist radiologists to have better diagnosis of mammogram images. Ensemble learning consists of two steps, generating multiple base classifiers and then combining them together. However, combining all base classifier in the ensemble model increases the computational cost and time. Therefore, ensemble pruning is an important step in ensemble learning to select the ensemble’s members. Due to huge subsets of combination in the ensemble, selecting the proper ensemble subset is desirable. The objective of this paper is to select the optimal ensemble subset by using Bee Algorithm (BA). A pool of different classifier models such as Support vector machine, k-nearest neighbour and linear discriminant analysis classifiers have been trained using different samples of training data and 12 groups of features. Then, by using this pool of classifier models, BA was used to exploit and explore random uniform combination subsets of the trained classifiers. As a result, the best subset will be selected as the optimal ensemble. The mammogram image dataset that was used to test the model has been collected from Hospital Kuala Lumpur (HKL) and consists of 263 benign and malignant masses. The proposed method gives 77 % of Area Under Curve(AUC), 83% of accuracy, 93% of specificity and 60% of sensitivity.

The Bring Your Own Device (BYOD) initiative has been implemented widely in developed countries as a mechanism to prepare the students for the 4th industrial revolution. Success stories of the initiative vary depending on factors pertaining to its implementation. This study aims to identify the key factors to implement BYOD in schools for educational purposes. The research employed a mix-method approach by means of a survey. The data was collected from teachers through questionnaires and and from the school management through interviews. The respondents included 204 teachers from 5 schools in Putrajaya and Dengkil. Principals, senior assistants, ICT teachers and technicians from three schools were interviewed. They represented the school management group. A descriptive statistical analysis is conducted using SPSS statistical software. The research has identified four key factors for the successful implementation of BYOD in Malaysian schools. Two of the factors are related to the Cyber Security Policy at the schools - enforcing a secure network infrastructure and safety control requirement in the implementation of BYOD at schools. These security-related factors are important for the schools from the very beginning. They can be further categorized according to the implementation stages: pre-, during and post-adoption; cost allocation, preparation of controls and training to support BYOD's implementation at schools are the corresponding factors to each stage. On the other hand, the other two key factors are related to the schools’ readiness - ensuring the successful implementation of BYOD whereby the school management group is willing and prepared to tackle any arising BYOD-related issues in the future.

The advance new digital era nowadays has led to the increasing cases of cyber romance scam in Malaysia. These technologies have offered both opportunities and challenge, depending on the purpose of the user. To face this challenge, the key factors that influence the susceptibility to cyber romance scam need to be identified. Therefore, this study proposed cyber romance scam models using statistical method and Apriori techniques to explore the key factors of cyber romance scam victimization based on the real police report lodged by the victims. The relationship between demographic variables such as age, education level, marital status, monthly income and independent variables such as level of computer skills and the level of cyber-fraud awareness has been investigated. Then, the result of this study was compared with Routine Activity Theory (RAT). This study found that those between the ages of 25 and 45 years were likely to be the victims of cyber romance scams in Malaysia. The majority of the victims are educated and having a Diploma. In addition, this research shows that married people are more likely to be the victims of cyber romance scams. Study shows that non-income individuals are also vulnerable to being the victims because the study shows that 17 percent of respondents who are the victims are from this group. As expected, those who work and have monthly income between RM2001 and above are more likely to be targeted and become a victim of cyber romance scams. The study also shows that those who lack computer skills and less levels of cyber-fraud awareness are more likely to be victims of cyber romance scams.

In this paper, a fully automatic 2.5D facial technique for forensic applications is presented. Feature extraction and classification are fundamental processes in any face identification technique. Two methods for feature extraction and classification are proposed in this paper subsequently. Active Appearance Model (AAM) is one of the familiar feature extraction methods but it has weaknesses in its fitting process. Artificial bee colony (ABC) is a fitting solution due to its fast search ability. However, it has drawback in its neighborhood search. On the other hand, PSO-SVM is one of the most recent classification approaches. However, its performance is weakened by the usage of random values for calculating velocity. To solve the problems, this research is conducted in three phases as follows: the first phase is to propose Maximum Resource Neighborhood Search (MRNS) which is an enhanced ABC algorithm to improve the fitting process in current AAM. Then, Adaptively Accelerated PSO-SVM (AAPSO-SVM) classification technique is proposed, by which the selection of the acceleration coefficient values is done using particle fitness values in finding the optimal parameters of SVM. The proposed methods AAM-MRNS, AAPSO-SVM and the whole 2.5D facial technique are evaluated by comparing them with the other methods using new 2.5D face image data set. Further, a sample of Malaysian criminal real case of CCTV facial investigation suspect has been tested in the proposed technique. Results from the experiment shows that the proposed techniques outperformed the conventional techniques. Furthermore, the 2.5D facial technique is able to recognize a sample of Malaysian criminal case called “Tepuk Bahu” using CCTV facial investigation.

The prediction of the next serial criminal time is important in the field of criminology for preventing the recurring actions of serial criminals. In the associated dynamic systems, one of the main sources of instability and poor performances is the time delay, which is commonly predicted based on nonlinear methods. The aim of this study is to introduce a dynamic neural network model by using nonlinear autoregressive time series with exogenous (external) input (NARX) and Back Propagation Through Time (BPTT), which is verified intensively with MATLAB to predict and model the crime times for the next distance of serial cases. Recurrent neural networks have been extensively used for modeling of nonlinear dynamic systems. There are different types of recurrent neural networks such as Time Delay Neural Networks (TDNN), layer recurrent networks, NARX, and BPTT. The NARX model for the two cases of input- output modeling of dynamic systems and time series prediction draw more attention. In this study, a comparison of two models of NARX and BPTT used for the prediction of the next serial criminal time illustrates that the NARX model exhibits better performance for the prediction of serial cases than the BPTT model. Our future work aims to improve the NARX model by combining objective functions.

The Bees Algorithm (BA) is a bee swarm-based search algorithm inspired by the foraging behavior of a swarm of honeybees. BA can be divided into four parts: the parameter tuning part, the initialization part, the local search part, and the global search part. Recently, BA based on Patch-Levy-based Initialization Algorithm (PLIA-BA) has been proposed. However, the initial stage remains an initial step, and its improvement is not enough for more challenging problem classes with different properties. The local and global search capabilities are also required to be enhanced to improve the quality of final solution and the convergence speed of PLIA-BA on such problems. Consequently, in this paper, a new local search algorithm has been adopted based on the Levy looping flights. Moreover, the mechanism of the global search has been enhanced to be closer to nature and based on the patch-Levy model adopted in the initialization algorithm (PLIA). The improvements in local and global search parts are incorporated into PLIA-BA to advise a new version of BA that is called Patch-Levy-based Bees Algorithm (PLBA). We investigate the performance of the proposed PLBA on a set of challenging benchmark functions. The results of the experiments indicate that PLBA significantly outperforms the other BA variants, including PLIA-BA and can produce comparable results with other state-of-the-art algorithms.