Novel Approach for Battery Type Determination: A Mere Electrical Alternative

2021 ◽  
Author(s):  
İsmail Can Dikmen ◽  
Teoman Karadağ
Keyword(s):  
Integrated Circuits ◽  
Decision Tree ◽  
Statistical Significance ◽  
High Capacity ◽  
Electrical Energy ◽  
Machine Learning Algorithms ◽  
Battery Management ◽  
Separation Function ◽  
Novel Approach ◽  
Tree Algorithms

Abstract Today, the storage of electrical energy is one of the most important technical challenges. The increasing number of high capacity, high-power applications, especially electric vehicles and grid energy storage, points to the fact that we will be faced with a large amount of batteries that will need to be recycled and separated in the near future. An alternative method to the currently used methods for separating these batteries according to their chemistry is discussed in this study. This method can be applied even on integrated circuits due to its ease of implementation and low operational cost. In this respect, it is also possible to use it in multi-chemistry battery management systems to detect the chemistry of the connected battery. For the implementation of the method, the batteries are connected to two different loads alternately. In this way, current and voltage values ​​are measured for two different loads without allowing the battery to relax. The obtained data is pre-processed with a separation function developed based on statistical significance. In machine learning algorithms, artificial neural network and decision tree algorithms are trained with processed data and used to determine battery chemistry with 100% accuracy. The efficiency and ease of implementation of the decision tree algorithm in such a categorization method are presented comparatively.

scholarly journals Near-Optimal Sparse Neural Trees for Supervised Learning

2021 ◽  
Author(s):  
Tanujit Chakraborty
Keyword(s):  
Neural Network ◽  
Machine Learning ◽  
Decision Tree ◽  
Classification Tree ◽  
Mathematical Formulation ◽  
Machine Learning Algorithms ◽  
Optimal Decision ◽  
Feed Forward ◽  
Feed Forward Network ◽  
Tree Algorithms

Decision tree algorithms have been among the most popular algorithms for interpretable (transparent) machine learning since the early 1980s. On the other hand, deep learning methods have boosted the capacity of machine learning algorithms and are now being used for non-trivial applications in various applied domains. But training a fully-connected deep feed-forward network by gradient-descent backpropagation is slow and requires arbitrary choices regarding the number of hidden units and layers. In this paper, we propose near-optimal neural regression trees, intending to make it much faster than deep feed-forward networks and for which it is not essential to specify the number of hidden units in the hidden layers of the neural network in advance. The key idea is to construct a decision tree and then simulate the decision tree with a neural network. This work aims to build a mathematical formulation of neural trees and gain the complementary benefits of both sparse optimal decision trees and neural trees. We propose near-optimal sparse neural trees (NSNT) that is shown to be asymptotically consistent and robust in nature. Additionally, the proposed NSNT model obtain a fast rate of convergence which is near-optimal up to some logarithmic factor. We comprehensively benchmark the proposed method on a sample of 80 datasets (40 classification datasets and 40 regression datasets) from the UCI machine learning repository. We establish that the proposed method is likely to outperform the current state-of-the-art methods (random forest, XGBoost, optimal classification tree, and near-optimal nonlinear trees) for the majority of the datasets.

IMPROVING STABILITY OF DECISION TREES

2002 ◽  
Vol 16 (02) ◽  
pp. 145-159 ◽  
Author(s):  
MARK LAST ◽  
ODED MAIMON ◽  
EINAT MINKOV
Keyword(s):  
Decision Tree ◽  
Predictive Accuracy ◽  
Statistical Significance ◽  
Training Data ◽  
Tree Level ◽  
Information Theoretic ◽  
Tree Algorithms ◽  
Tree Models ◽  
The Stability ◽  
Information Theoretic Method

Decision-tree algorithms are known to be unstable: small variations in the training set can result in different trees and different predictions for the same validation examples. Both accuracy and stability can be improved by learning multiple models from bootstrap samples of training data, but the "meta-learner" approach makes the extracted knowledge hardly interpretable. In the following paper, we present the Info-Fuzzy Network (IFN), a novel information-theoretic method for building stable and comprehensible decision-tree models. The stability of the IFN algorithm is ensured by restricting the tree structure to using the same feature for all nodes of the same tree level and by the built-in statistical significance tests. The IFN method is shown empirically to produce more compact and stable models than the "meta-learner" techniques, while preserving a reasonable level of predictive accuracy.

scholarly journals Near-optimal Sparse Neural Trees

2021 ◽  
Author(s):  
Tanujit Chakraborty ◽  
Tanmoy Chakraborty
Keyword(s):  
Neural Network ◽  
Machine Learning ◽  
Decision Tree ◽  
Classification Tree ◽  
Mathematical Formulation ◽  
Machine Learning Algorithms ◽  
Optimal Decision ◽  
Feed Forward ◽  
Feed Forward Network ◽  
Tree Algorithms

Decision tree algorithms have been among the most popular algorithms for interpretable (transparent) machine learning since the early 1980s. On the other hand, deep learning methods have boosted the capacity of machine learning algorithms and are now being used for non-trivial applications in various applied domains. But training a fully-connected deep feed-forward network by gradient-descent backpropagation is slow and requires arbitrary choices regarding the number of hidden units and layers. In this paper, we propose near-optimal neural regression trees, intending to make it much faster than deep feed-forward networks and for which it is not essential to specify the number of hidden units in the hidden layers of the neural network in advance. The key idea is to construct a decision tree and then simulate the decision tree with a neural network. This work aims to build a mathematical formulation of neural trees and gain the complementary benefits of both sparse optimal decision trees and neural trees. We propose near-optimal sparse neural trees (NSNT) that is shown to be asymptotically consistent and robust in nature. Additionally, the proposed NSNT model obtain a fast rate of convergence which is near-optimal upto some logarithmic factor. We comprehensively benchmark the proposed method on a sample of 80 datasets (40 classification datasets and 40 regression datasets) from the UCI machine learning repository. We establish that the proposed method is likely to outperform the current state-of-the-art methods (random forest, XGBoost, optimal classification tree, and near-optimal nonlinear trees) for the majority of the datasets.

scholarly journals Examination of Assorted Social Engineering Attack by Different Types of Machine Learning Algorithms

2021 ◽  
Vol 10 (7) ◽  
pp. 56-60
Author(s):  
Amal Alhamad ◽  
Dalal Aldablan ◽  
Raghad Albahlal
Keyword(s):  
Machine Learning ◽  
Social Network ◽  
Decision Tree ◽  
Learning Algorithms ◽  
Social Engineering ◽  
Machine Learning Algorithms ◽  
Privacy And Security ◽  
Different Types ◽  
Tree Algorithms

The most powerful attack on the systems is Social Engineering Attack because of this attack deals with Psychology so that there is no hardware or software can prevent it or even can defend it and hence people need to be trained to defend against it.[1] Social engineering is mostly done by phone or email. In this research, which is based on previous research we have conducted, the aim of it was of it was to highlight the different social engineering attacks and how they can prevent in social network because social engineering is one of the biggest problems in social network, a concern the privacy and security. This project is using a set of data then analysis it uses the Weka tool, to defend against these attacks we have evaluated three decision tree algorithms, RandomForest, REPTree and RandomTree. It was also related to an J48 algorithm, On the contrary, here contains a complete overview of social engineering attacks, also more than one algorithm was searched.

Fraud Detection for Metered Costumers in Power Distribution Companies Using C5.0 Decision Tree Algorithm

2020 ◽  
Vol 17 (2) ◽  
pp. 1318-1325 ◽  
Author(s):  
Muhammad Salman Saeed ◽  
Mohd. Wazir Bin Mustafa ◽  
Usman Ullah Sheikh ◽  
Sani Salisu ◽  
Olatunji Obalowu Mohammed
Keyword(s):  
Energy Consumption ◽  
Decision Tree ◽  
Power Distribution ◽  
Machine Learning Algorithms ◽  
Support Vector ◽  
Main Concern ◽  
Classification Rate ◽  
Electricity Theft ◽  
Tree Algorithms ◽  
Power Utilities

Non-technical Losses mainly Electricity theft has been a main concern for power utilities from last many years. Power utilities are estimated to lose billion dollars annually because of illegal usage of electricity by fraudulent consumers. Researchers are trying different methods for proficiently recognizing fraudster costumers. This research suggests a new approach based on C5 algorithm for efficiently identifying consumers involved in electricity theft. The C5.0 algorithm is a modified form of the C4.5 algorithm. It is also one of the decision tree algorithms but with a much-improved classification rate. The C5.0 algorithm relies on monthly energy consumption data to identify any anomaly in consumer energy usage data associated with NTL behavior. There are many types of fraud committed by fraudulent consumers but this research is focused on fraudulent consumers who have a unexpected deviation from their usual load profile. The motivation of this research is to aid Power distribution companies in Pakistan to decrease there NTL’s due to pilfering in energy consumption by fraudulent consumers. The accuracy of the C5.0 algorithm is 94.61% which is much higher when compared to some state of the art machine learning algorithms like Random forest, Support Vector Machine, K-NN and other decision trees.

scholarly journals COLOR RECOGNITION WEARABLE DEVICE USING MACHINE LEARNING FOR VISUALY IMPAIRED PERSON

2018 ◽  
Vol 19 (2) ◽  
pp. 213-220
Author(s):  
NIK NUR WAHIDAH NIK HASHIM ◽  
TAREK MOHAMED BOLAD ◽  
Noor Hazrin Hany Mohamad Hanif
Keyword(s):  
Neural Network ◽  
Machine Learning ◽  
Computer Vision ◽  
Decision Tree ◽  
Open Source ◽  
Machine Learning Algorithms ◽  
Raspberry Pi ◽  
Tree Algorithms ◽  
Impaired Person ◽  
Color Conversion

ABSTRACT: Recognizing colors is a concerning problem for the visually impaired person. The aim of this paper is to convert colors to sound and vibration in order to allow fully/partially blind people to have a ‘feeling’ or better understanding of the different colors around them. The idea is to develop a device that can produce vibration for colors. The user can also hear the name of the color along with ‘feeling’ the vibration. Two algorithms were used to distinguish between colors;  RGB to HSV color conversion in comparison with neural network and decision tree based machine learning algorithms. Raspberry Pi 3 with Open Source Computer Vision (OpenCV) software handles the image processing. The results for RGB to HSV color conversion algorithm were performed with 3 different colors (red, blue, and green). In addition, neural network and decision tree algorithms were trained and tested with eight colors (red, green, blue, orange, yellow, purple, white, and black) for the conversion to sound and vibration. Neural network and decision tree algorithms achieved higher accuracy and efficiency for the majority of tested colors as compared to the RGB to HSV. ABSTRAK: Membezakan antara warna adalah masalah yang merunsingkan terutamanya kepada mereka yang buta, separa buta atau buta warna. Tujuan kertas penyelidikan ini adalah untuk membentangkan kaedah menukar warna kepada bunyi dan getaran bagi membolehkan individu yang buta, separa buta atau buta warna untuk mendapat ‘perasaan’ atau pemahaman yang lebih baik tentang warna-warna yang berbeza disekeliling mereka. Idea yang dicadangkan adalah dengan membuat sebuah alat yang dapat menghasilkan getaran bagi setiap warna yang berbeza. Disamping itu, pengguna juga dapat mendengar nama warna tersebut. Algoritma yang digunakan untuk membezakan antara warna adalah penukaran warna RGB kepada HSV yang dibandingkan dengan rangkaian neural dan algoritma pembelajaran mesin berasaskan pokok keputusan. Raspberry Pi 3 bersaiz kad kredit dengan perisian Open Source Computer Vision (OpenCV) mengendalikan pemprosesan imej. Hasil algoritma penukaran warna RGB kepada HSV telah dilakukan dengan tiga warna yang berbeza (merah, biru, dan hijau). Tambahan pula, hasil rangkaian neural dan algoritma berasaskan pokok keputusan telah dilakukan dengan lapan warna (merah, hijau, biru, oren, kuning, ungu, putih, dan hitam) dengan penukaran warna tersebut kepada bunyi dan getaran. Selain itu, hasil rangkaian neural dan algoritma berasaskan pokok keputusan mencapai hasil dapatan yang baik dengan ketepatan dan kecekapan yang tinggi bagi kebanyakan warna yang diuji berbanding RGB kepada HSV.

scholarly journals Machine learning (decision tree analysis) identifies ecological selectivity patterns across the end-Permian mass extinction

2020 ◽  
Author(s):  
William J. Foster ◽  
Georgy Ayzel ◽  
Terry T. Isson ◽  
Maria Mutti ◽  
Martin Aberhan
Keyword(s):  
Machine Learning ◽  
Decision Tree ◽  
Mass Extinction ◽  
Extinction Risk ◽  
Machine Learning Algorithms ◽  
Stationary Mode ◽  
Mass Extinctions ◽  
Tree Algorithms ◽  
Extinction Selectivity ◽  
Permian Mass Extinction

AbstractDecision tree algorithms are rarely utilized in paleontological research, and here we show that machine learning algorithms can be used to identify determinants of extinction as well as predict extinction risk. This application of decision tree algorithms is important because the ecological selectivity of mass extinctions can reveal critical information on organismic traits as key determinants of extinction and hence the causes of extinction. To understand which factors led to the mass extinction of life during an extreme global warming event, we quantified the ecological selectivity of marine extinctions in the well-studied South China region during the end-Permian mass extinction using the categorized gradient boosting algorithm. We find that extinction selectivity varies between different groups of organisms and that a synergy of multiple environmental stressors best explains the overall end-Permian extinction selectivity pattern. Extinction risk was greater for genera that were limited to deep-water habitats, had a stationary mode of life, possessed a siliceous skeleton or, less critically, had calcitic skeletons. These selective losses directly link the extinction to the environmental effects of rapid injections of carbon dioxide into the ocean-atmosphere system, specifically the combined effects of expanded oxygen minimum zones, rapid warming, and ocean acidification.

scholarly journals CNFE-SE: a novel approach combining complex network-based feature engineering and stacked ensemble to predict the success of intrauterine insemination and ranking the features

2021 ◽  
Vol 21 (1) ◽  
Author(s):  
Sima Ranjbari ◽  
Toktam Khatibi ◽  
Ahmad Vosough Dizaji ◽  
Hesamoddin Sajadi ◽  
Mehdi Totonchi ◽  
...  
Keyword(s):  
Complex Networks ◽  
Complex Network ◽  
Semen Quality ◽  
Intrauterine Insemination ◽  
Machine Learning Algorithms ◽  
Semen Parameters ◽  
Feature Engineering ◽  
Operating Characteristics ◽  
Scoring Method ◽  
Novel Approach

Abstract Background Intrauterine Insemination (IUI) outcome prediction is a challenging issue which the assisted reproductive technology (ART) practitioners are dealing with. Predicting the success or failure of IUI based on the couples' features can assist the physicians to make the appropriate decision for suggesting IUI to the couples or not and/or continuing the treatment or not for them. Many previous studies have been focused on predicting the in vitro fertilization (IVF) and intracytoplasmic sperm injection (ICSI) outcome using machine learning algorithms. But, to the best of our knowledge, a few studies have been focused on predicting the outcome of IUI. The main aim of this study is to propose an automatic classification and feature scoring method to predict intrauterine insemination (IUI) outcome and ranking the most significant features. Methods For this purpose, a novel approach combining complex network-based feature engineering and stacked ensemble (CNFE-SE) is proposed. Three complex networks are extracted considering the patients' data similarities. The feature engineering step is performed on the complex networks. The original feature set and/or the features engineered are fed to the proposed stacked ensemble to classify and predict IUI outcome for couples per IUI treatment cycle. Our study is a retrospective study of a 5-year couples' data undergoing IUI. Data is collected from Reproductive Biomedicine Research Center, Royan Institute describing 11,255 IUI treatment cycles for 8,360 couples. Our dataset includes the couples' demographic characteristics, historical data about the patients' diseases, the clinical diagnosis, the treatment plans and the prescribed drugs during the cycles, semen quality, laboratory tests and the clinical pregnancy outcome. Results Experimental results show that the proposed method outperforms the compared methods with Area under receiver operating characteristics curve (AUC) of 0.84 ± 0.01, sensitivity of 0.79 ± 0.01, specificity of 0.91 ± 0.01, and accuracy of 0.85 ± 0.01 for the prediction of IUI outcome. Conclusions The most important predictors for predicting IUI outcome are semen parameters (sperm motility and concentration) as well as female body mass index (BMI).

scholarly journals Performance Improvement of Decision Tree: A Robust Classifier Using Tabu Search Algorithm

2021 ◽  
Vol 11 (15) ◽  
pp. 6728
Author(s):  
Muhammad Asfand Hafeez ◽  
Muhammad Rashid ◽  
Hassan Tariq ◽  
Zain Ul Abideen ◽  
Saud S. Alotaibi ◽  
...  
Keyword(s):  
Machine Learning ◽  
Tabu Search ◽  
Decision Tree ◽  
Decision Trees ◽  
Search Algorithm ◽  
Learning Algorithms ◽  
Performance Comparison ◽  
Machine Learning Algorithms ◽  
Supervised Machine Learning ◽  
Tabu Search Algorithm

Classification and regression are the major applications of machine learning algorithms which are widely used to solve problems in numerous domains of engineering and computer science. Different classifiers based on the optimization of the decision tree have been proposed, however, it is still evolving over time. This paper presents a novel and robust classifier based on a decision tree and tabu search algorithms, respectively. In the aim of improving performance, our proposed algorithm constructs multiple decision trees while employing a tabu search algorithm to consistently monitor the leaf and decision nodes in the corresponding decision trees. Additionally, the used tabu search algorithm is responsible to balance the entropy of the corresponding decision trees. For training the model, we used the clinical data of COVID-19 patients to predict whether a patient is suffering. The experimental results were obtained using our proposed classifier based on the built-in sci-kit learn library in Python. The extensive analysis for the performance comparison was presented using Big O and statistical analysis for conventional supervised machine learning algorithms. Moreover, the performance comparison to optimized state-of-the-art classifiers is also presented. The achieved accuracy of 98%, the required execution time of 55.6 ms and the area under receiver operating characteristic (AUROC) for proposed method of 0.95 reveals that the proposed classifier algorithm is convenient for large datasets.

Sign in / Sign up

Export Citation Format

Share Document