scholarly journals Integration of Decision Trees Using Distance to Centroid and to Decision Boundary

2020 ◽  
Vol 26 (6) ◽  
pp. 720-733
Author(s):  
Jedrzej Biedrzycki ◽  
Robert Burduk
Keyword(s):  
Decision Trees ◽  
Center Of Mass ◽  
Score Function ◽  
Majority Voting ◽  
Decision Boundary ◽  
Class Label ◽  
Score Functions ◽  
Ensemble Techniques ◽  
Majority Voting Method ◽  
Classification Quality

Plethora of ensemble techniques have been implemented and studied in order to achieve better classification results than base classifiers. In this paper an algorithm for integration of decision trees is proposed, which means that homogeneous base classifiers will be used. The novelty of the presented approach is the usage of the simultaneous distance of the object from the decision boundary and the center of mass of objects belonging to one class label in order to determine the score functions of base classifiers. This means that the score function assigned to the class label by each classifier depends on the distance of the classified object from the decision boundary and from the centroid. The algorithm was evaluated using an open-source benchmarking dataset. The results indicate an improvement in the classification quality in comparison to the referential method - majority voting method.

scholarly journals Research on QoS Classification of Network Encrypted Traffic Behavior Based on Machine Learning

Electronics ◽  
2021 ◽  
Vol 10 (12) ◽  
pp. 1376
Author(s):  
Yung-Fa Huang ◽  
Chuan-Bi Lin ◽  
Chien-Min Chung ◽  
Ching-Mu Chen
Keyword(s):  
Machine Learning ◽  
Majority Voting ◽  
Deep Packet Inspection ◽  
Traffic Classification ◽  
K 13 ◽  
Packet Inspection ◽  
Majority Voting Method ◽  
Encrypted Traffic ◽  
Traffic Behavior

In recent years, privacy awareness is concerned due to many Internet services have chosen to use encrypted agreements. In order to improve the quality of service (QoS), the network encrypted traffic behaviors are classified based on machine learning discussed in this paper. However, the traditional traffic classification methods, such as IP/ASN (Autonomous System Number) analysis, Port-based and deep packet inspection, etc., can classify traffic behavior, but cannot effectively handle encrypted traffic. Thus, this paper proposed a hybrid traffic classification (HTC) method based on machine learning and combined with IP/ASN analysis with deep packet inspection. Moreover, the majority voting method was also used to quickly classify different QoS traffic accurately. Experimental results show that the proposed HTC method can effectively classify different encrypted traffic. The classification accuracy can be further improved by 10% with majority voting as K = 13. Especially when the networking data are using the same protocol, the proposed HTC can effectively classify the traffic data with different behaviors with the differentiated services code point (DSCP) mark.

scholarly journals Protein Sequence Classification with Improved Extreme Learning Machine Algorithms

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Jiuwen Cao ◽  
Lianglin Xiong
Keyword(s):  
Extreme Learning Machine ◽  
Protein Sequence ◽  
Protein Sequences ◽  
Activation Function ◽  
Majority Voting ◽  
Training Algorithms ◽  
Sequence Classification ◽  
Protein Sequence Classification ◽  
Learning Machine ◽  
Majority Voting Method

Precisely classifying a protein sequence from a large biological protein sequences database plays an important role for developing competitive pharmacological products. Comparing the unseen sequence with all the identified protein sequences and returning the category index with the highest similarity scored protein, conventional methods are usually time-consuming. Therefore, it is urgent and necessary to build an efficient protein sequence classification system. In this paper, we study the performance of protein sequence classification using SLFNs. The recent efficient extreme learning machine (ELM) and its invariants are utilized as the training algorithms. The optimal pruned ELM is first employed for protein sequence classification in this paper. To further enhance the performance, the ensemble based SLFNs structure is constructed where multiple SLFNs with the same number of hidden nodes and the same activation function are used as ensembles. For each ensemble, the same training algorithm is adopted. The final category index is derived using the majority voting method. Two approaches, namely, the basic ELM and the OP-ELM, are adopted for the ensemble based SLFNs. The performance is analyzed and compared with several existing methods using datasets obtained from the Protein Information Resource center. The experimental results show the priority of the proposed algorithms.

scholarly journals COVID-19 Patient Detection Based on Fusion of Transfer Learning and Fuzzy Ensemble Models Using CXR Images

2021 ◽  
Vol 11 (23) ◽  
pp. 11423
Author(s):  
Chandrakanta Mahanty ◽  
Raghvendra Kumar ◽  
Panagiotis G. Asteris ◽  
Amir H. Gandomi
Keyword(s):  
Transfer Learning ◽  
Ensemble Methods ◽  
Cost Effective ◽  
Majority Voting ◽  
Learning Models ◽  
Medical Practitioners ◽  
Healthcare Facilities ◽  
Ensemble Techniques ◽  
Effective Manner ◽  
Detection Strategies

The COVID-19 pandemic has claimed the lives of millions of people and put a significant strain on healthcare facilities. To combat this disease, it is necessary to monitor affected patients in a timely and cost-effective manner. In this work, CXR images were used to identify COVID-19 patients. We compiled a CXR dataset with equal number of 2313 COVID positive, pneumonia and normal CXR images and utilized various transfer learning models as base classifiers, including VGG16, GoogleNet, and Xception. The proposed methodology combines fuzzy ensemble techniques, such as Majority Voting, Sugeno Integral, and Choquet Fuzzy, and adaptively combines the decision scores of the transfer learning models to identify coronavirus infection from CXR images. The proposed fuzzy ensemble methods outperformed each individual transfer learning technique and several state-of-the-art ensemble techniques in terms of accuracy and prediction. Specifically, VGG16 + Choquet Fuzzy, GoogleNet + Choquet Fuzzy, and Xception + Choquet Fuzzy achieved accuracies of 97.04%, 98.48%, and 99.57%, respectively. The results of this work are intended to help medical practitioners achieve an earlier detection of coronavirus compared to other detection strategies, which can further save millions of lives and advantageously influence society.

scholarly journals EVALUATING EFFECTIVENESS OF ENSEMBLE CLASSIFIERS WHEN DETECTING FUZZERS ATTACKS ON THE UNSW-NB15 DATASET

2020 ◽  
Vol 36 (2) ◽  
pp. 173-185
Author(s):  
Hoang Ngoc Thanh ◽  
Tran Van Lang
Keyword(s):  
Random Forest ◽  
Decision Tree ◽  
Cyber Security ◽  
Experimental Results ◽  
Ensemble Classifiers ◽  
Research Results ◽  
Ensemble Techniques ◽  
F Measure ◽  
Classification Quality

The UNSW-NB15 dataset was created by the Australian Cyber Security Centre in 2015 by using the IXIA tool to extract normal behaviors and modern attacks, it includes normal data and 9 types of attacks with 49 features. Previous research results show that the detection of Fuzzers attacks in this dataset gives the lowest classification quality. This paper analyzes and evaluates the performance of using known ensemble techniques such as Bagging, AdaBoost, Stacking, Decorate, Random Forest and Voting to detect FUZZERS attacks on UNSW-NB15 dataset to create models. The experimental results show that the AdaBoost technique with the component classifiers using decision tree for the best classification quality with F-Measure is 96.76% compared to 94.16%, which is the best result obtained by using single classifiers and 96.36% by using the Random Forest technique.

scholarly journals Minkowski Weighted Score Functions of Intuitionistic Fuzzy Values

Mathematics ◽  
2020 ◽  
Vol 8 (7) ◽  
pp. 1143
Author(s):  
Feng Feng ◽  
Yujuan Zheng ◽  
José Carlos R. Alcantud ◽  
Qian Wang
Keyword(s):  
Decision Making ◽  
Score Function ◽  
Soft Sets ◽  
Score Functions ◽  
Intuitionistic Fuzzy ◽  
Geometric Point ◽  
Weighted Score ◽  
Fuzzy Soft Sets ◽  
Intuitionistic Fuzzy Value ◽  
Intuitionistic Fuzzy Soft Sets

In multiple attribute decision-making in an intuitionistic fuzzy environment, the decision information is sometimes given by intuitionistic fuzzy soft sets. In order to address intuitionistic fuzzy decision-making problems in a more efficient way, many scholars have produced increasingly better procedures for ranking intuitionistic fuzzy values. In this study, we further investigate the problem of ranking intuitionistic fuzzy values from a geometric point of view, and we produce related applications to decision-making. We present Minkowski score functions of intuitionistic fuzzy values, which are natural generalizations of the expectation score function and other useful score functions in the literature. The rationale for Minkowski score functions lies in the geometric intuition that a better score should be assigned to an intuitionistic fuzzy value farther from the negative ideal intuitionistic fuzzy value. To capture the subjective attitude of decision makers, we further propose the Minkowski weighted score function that incorporates an attitudinal parameter. The Minkowski score function is a special case corresponding to a neutral attitude. Some fundamental properties of Minkowski (weighted) score functions are examined in detail. With the aid of the Minkowski weighted score function and the maximizing deviation method, we design a new algorithm for solving decision-making problems based on intuitionistic fuzzy soft sets. Moreover, two numerical examples regarding risk investment and supplier selection are employed to conduct comparative analyses and to demonstrate the feasibility of the approach proposed in this article.

Estimation of different ripening stages of Fuji apples using image processing and spectroscopy based on the majority voting method

2020 ◽  
Vol 176 ◽  
pp. 105643 ◽  
Author(s):  
Razieh Pourdarbani ◽  
Sajad Sabzi ◽  
Davood Kalantari ◽  
Jitendra Paliwal ◽  
Brahim Benmouna ◽  
...  
Keyword(s):  
Image Processing ◽  
Majority Voting ◽  
Ripening Stages ◽  
Majority Voting Method ◽  
Voting Method

Improved Object Recognition with Decision Trees Using Subspace Clustering

2016 ◽  
Vol 20 (1) ◽  
pp. 41-48 ◽  
Author(s):  
Billy Peralta ◽  
◽  
Luis Alberto Caro
Keyword(s):  
Object Recognition ◽  
Decision Trees ◽  
Clustering Algorithm ◽  
Comprehensive Evaluation ◽  
Recognition Performance ◽  
Clustering Algorithms ◽  
Subspace Clustering ◽  
Visual Words ◽  
Ensemble Techniques ◽  
Standard Object

Generic object recognition algorithms usually require complex classificationmodels because of intrinsic difficulties arising from problems such as changes in pose, lighting conditions, or partial occlusions. Decision trees present an inexpensive alternative for classification tasks and offer the advantage of being simple to understand. On the other hand, a common scheme for object recognition is given by the appearances of visual words, also known as the bag-of-words method. Although multiple co-occurrences of visual words are more informative regarding visual classes, a comprehensive evaluation of such combinations is unfeasible because it would result in a combinatorial explosion. In this paper, we propose to obtain the multiple co-occurrences of visual words using a variant of the CLIQUE subspace-clustering algorithm for improving the object recognition performance of simple decision trees. Experiments on standard object datasets show that our method improves the accuracy of the classification of generic objects in comparison to traditional decision tree techniques that are similar, in terms of accuracy, to ensemble techniques. In future we plan to evaluate other variants of decision trees, and apply other subspace-clustering algorithms.

scholarly journals Multiwinner Voting with Fairness Constraints

2018 ◽  
Author(s):  
L. Elisa Celis ◽  
Lingxiao Huang ◽  
Nisheeth K. Vishnoi
Keyword(s):  
Group Structure ◽  
Score Function ◽  
Political Orientation ◽  
Hardness Of Approximation ◽  
Score Functions ◽  
Voting Rule ◽  
Representative Subset ◽  
Fairness Constraints ◽  
And Gender ◽  
Ethnicity And Gender

Multiwinner voting rules are used to select a small representative subset of candidates or items from a larger set given the preferences of voters. However, if candidates have sensitive attributes such as gender or ethnicity (when selecting a committee), or specified types such as political leaning (when selecting a subset of news items), an algorithm that chooses a subset by optimizing a multiwinner voting rule may be unbalanced in its selection -- it may under or over represent a particular gender or political orientation in the examples above. We introduce an algorithmic framework for multiwinner voting problems when there is an additional requirement that the selected subset should be ``fair'' with respect to a given set of attributes. Our framework provides the flexibility to (1) specify fairness with respect to multiple, non-disjoint attributes (e.g., ethnicity and gender) and (2) specify a score function. We study the computational complexity of this constrained multiwinner voting problem for monotone and submodular score functions and present several approximation algorithms and matching hardness of approximation results for various attribute group structure and types of score functions. We also present simulations that suggest that adding fairness constraints may not affect the scores significantly when compared to the unconstrained case.

scholarly journals A Novel Portfolio Based on Interval-Valued Intuitionistic Fuzzy AHP with Improved Combination Weight Method and New Score Function

2021 ◽  
Author(s):  
Xue Deng ◽  
Fengting Geng ◽  
Jianxin Yang
Keyword(s):  
Mathematical Proof ◽  
Fuzzy Ahp ◽  
Score Function ◽  
Decision Matrix ◽  
Entropy Weight ◽  
Analytic Hierarchy ◽  
Weighting Method ◽  
Score Functions ◽  
Intuitionistic Fuzzy ◽  
Interval Valued

Abstract The classical Analytic Hierarchy Process (AHP) requires an exact value to compare the relative importance of two attributes, but experts often can not obtain an accurate assessment of every attribute in the decision-making process, there are always some uncertainty and hesitation. Compared with classical AHP, our new defined interval-valued intuitionistic fuzzy AHP has accurately descripted the vagueness and uncertainty. In decision matrix, the real numbers are substituted by fuzzy numbers. In addition, each expert will make different evaluations according to different experiences for each attribute in the subjective weighting method, which neglects objective factors and then generates some deviations in some cases. This paper provides two ways to make up for this disadvantage. On the one hand, by combining the interval-valued intuitionistic fuzzy AHP with entropy weight, an improved combination weighting method is proposed, which can overcome the limitations of unilateral weighted method only considering the objective or subjective factors. On the other hand, a new score function is presented by adjusting the parameters, which can overcome the invalidity of some existing score functions. In theory, some theorems and properties for the new score functions are given with strictly mathematical proof to validate its rationality and effectiveness. In application, a novel fuzzy portfolio is proposed based on the improved combination weighted method and new score function. A numerical example shows that these results of our new score function are consistent with those of most existing score functions, which verifies that our model is feasible and effective.

Sign in / Sign up

Export Citation Format

Share Document