The AdaBoost algorithm enables weak classifiers to enhance their performance by establishing the set of multiple classifiers, and since it automatically adapts to the error rate of the basic algorithm ill training thr...
详细信息
ISBN:
(纸本)9783642181283
The AdaBoost algorithm enables weak classifiers to enhance their performance by establishing the set of multiple classifiers, and since it automatically adapts to the error rate of the basic algorithm ill training through dynamic regulation of the weight of each sample, a wide range of concern has been aroused. This paper primarily makes some relevant introduction of Adaboost, and conducts an analysis and research of several aspects of the algorithm itself.
In today's world there is a rising need for network attack analysis because of rising cyber threats and attacks worldwide. Network traffic, if monitored dynamically in real-time could prevent a big cyber attack or...
详细信息
ISBN:
(纸本)9781665419178
In today's world there is a rising need for network attack analysis because of rising cyber threats and attacks worldwide. Network traffic, if monitored dynamically in real-time could prevent a big cyber attack or even alert before. In this paper, UNSW-NB 15 dataset is used on Ensemble method to analyze the network traffic. The major contribution of this paper is the novel algorithms powered by boosting algorithm to come up with the best classifier from the list of classifiers. It compares the classifier in terms of accuracy as well as training time which is significant in real-time analysis of network traffic. We performed experiment in which we took 10 classifiers and our proposed algorithm came up with XGB Classifier as the best one from the set in terms of accuracy and training time combined. We have demonstrated the comparison between running time of complete experiment on Central Processing Unit (CPU) and Graphical Processing Unit GPU).
Aggregated Channel Features (ACF) proposed by Dollar [3] provide strong framework for pedestrian detection. In this paper we show that, fine tuning the parameters of the baseline ACF detector can achieve competitive p...
详细信息
ISBN:
(纸本)9783319699004;9783319698991
Aggregated Channel Features (ACF) proposed by Dollar [3] provide strong framework for pedestrian detection. In this paper we show that, fine tuning the parameters of the baseline ACF detector can achieve competitive performance without additional channels and filtering actions. We experimentally determined the optimized values of four parameters of ACF detector: (1) size of training dataset, (2) sliding window stride, (3) sliding window size and (4) number of bootstrapping stages. Accordingly, our optimized detector using pre learned eigen filters achieved state of the art performance compared with other variants of ACF detector on Caltech pedestrian dataset.
Purpose The purpose of this study is to compare the classification learning ability of our algorithm based on boosted support vector machine (B-SVM), against other classification techniques in predicting the credit ra...
详细信息
Purpose The purpose of this study is to compare the classification learning ability of our algorithm based on boosted support vector machine (B-SVM), against other classification techniques in predicting the credit ratings of banks. The key feature of this study is the usage of an imbalanced dataset (in the response variable/rating) with a smaller number of observations (number of banks). Design/methodology/approach In general, datasets in banking sector are small and imbalanced too. In this study, 23 Scheduled Commercial Banks (SCBs) have been chosen (in India), and their corresponding corporate ratings have been collated from the Indian subsidiary of reputed global rating agency. The top management of the rating agency provided 12 input (quantitative) variables that are considered essential for rating a bank within India. In order to overcome the challenge of dataset being imbalanced and having small number of observations, this study uses an algorithm, namely "Modified Boosted Support Vector Machines" (MBSVMs) proposed by Punniyamoorthy Murugesan and Sundar Rengasamy. This study also compares the classification ability of the aforementioned algorithm against other classification techniques such as multi-class SVM, back propagation neural networks, multi-class linear discriminant analysis (LDA) andk-nearest neighbors (k-NN) classification, on the basis of geometric mean (GM). Findings The performances of each algorithm have been compared based on one metric-the geometric mean, also known as GMean (GM). This metric typically indicates the class-wise sensitivity by using the values of products. The findings of the study prove that the proposed MBSVM technique outperforms the other techniques. Research limitations/implications This study provides an algorithm to predict ratings of banks where the dataset is small and imbalanced. One of the limitations of this research study is that subjective factors have not been included in our model;the sole focus is on the result
As a hot research topic over the last 25 years, face recognition still seems to be a difficult and largely problem. Distortions caused by variations in illumination, expression and pose are the main challenges to be d...
详细信息
As a hot research topic over the last 25 years, face recognition still seems to be a difficult and largely problem. Distortions caused by variations in illumination, expression and pose are the main challenges to be dealt with by researchers in this field. Efficient recognition algorithms, robust against such distortions, are the main motivations of this research. Based on a detailed review on the background and wide applications of Gabor wavelet, this powerful and biologically driven mathematical tool is adopted to extract features for face recognition. The features contain important local frequency information and have been proven to be robust against commonly encountered distortions. To reduce the computation and memory cost caused by the large feature dimension, a novel boosting based algorithm is proposed and successfully applied to eliminate redundant features. The selected features are further enhanced by kernel subspace methods to handle the nonlinear face variations. The efficiency and robustness of the proposed algorithm is extensively tested using the ORL, FERET and BANCA databases. To normalize the scale and orientation of face images, a generalized symmetry measure based algorithm is proposed for automatic eye location. Without the requirement of a training process, the method is simple, fast and fully tested using thousands of images from the BioID and BANCA databases. An automatic user identification system, consisting of detection, recognition and user management modules, has been developed. The system can effectively detect faces from real video streams, identify them and retrieve corresponding user information from the application database. Different detection and recognition algorithms can also be easily integrated into the framework.
Gaining a deeper understanding of weather and being able to predict its future conducts have always been considered important endeavors for the growth of our society. This research paper explores the advancements in u...
详细信息
Initial Coin Offerings (ICOs) have emerged as a groundbreaking method for blockchain startups to raise capital, allowing projects to generate significant funding through the issuance of digital tokens. Despite their p...
详细信息
Under the escalating pressures of worldwide energy and environmental challenges, to uphold sustainable progression, there's a swift advancement in the sector of alternative fuel vehicles. As the main power source ...
详细信息
Recently, the ASEF and MOSSE filters have exhibited impressive performance in facial keypoint localization, which is often a vital step in facial image analysis. Correlation outputs of training samples are first desig...
详细信息
ISBN:
(纸本)9781479923410
Recently, the ASEF and MOSSE filters have exhibited impressive performance in facial keypoint localization, which is often a vital step in facial image analysis. Correlation outputs of training samples are first designed as Gaussians, and the filters are reversely constructed via averaging and summed error minimization in Fourier domain, where correlation can be efficiently computed by element-wise multiplication. To further improve the performance, this paper proposes two kinds of techniques extended from ASEF and MOSSE: (1) add an error correction module, and increase the weights of inaccurately detected samples under the framework of boosting algorithm;(2) iteratively adjust the synthetic outputs to be more adaptive to image contents. Experimental results show the proposed methods are superior to ASEF and MOSSE in keypoint finding.
暂无评论