<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">SDHM</journal-id>
<journal-id journal-id-type="nlm-ta">SDHM</journal-id>
<journal-id journal-id-type="publisher-id">SDHM</journal-id>
<journal-title-group>
<journal-title>Structural Durability &#x0026; Health Monitoring</journal-title>
</journal-title-group>
<issn pub-type="epub">1930-2991</issn>
<issn pub-type="ppub">1930-2983</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">271</article-id>
<article-id pub-id-type="doi">10.32604/sdhm.2022.0271</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Single Point Cutting Tool Fault Diagnosis in Turning Operation Using Reduced Error Pruning Tree Classifier</article-title><alt-title alt-title-type="left-running-head">Single Point Cutting Tool Fault Diagnosis in Turning Operation Using Reduced Error Pruning Tree Classifier</alt-title><alt-title alt-title-type="right-running-head">Single Point Cutting Tool Fault Diagnosis in Turning Operation Using Reduced Error Pruning Tree Classifier</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Akshay</surname><given-names>E.</given-names></name>
<xref ref-type="aff" rid="aff-1">1</xref>
</contrib>
<contrib id="author-2" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Sugumaran</surname><given-names>V.</given-names></name>
<xref ref-type="aff" rid="aff-1">1</xref><email>v_sugu@yahoo.com</email>
</contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Elangovan</surname><given-names>M.</given-names></name>
<xref ref-type="aff" rid="aff-2">2</xref>
</contrib>
<aff id="aff-1"><label>1</label><institution>School of Mechanical Engineering (SMEC), VIT University</institution>, <addr-line>Chennai, 600127</addr-line>, <country>India</country></aff>
<aff id="aff-2"><label>2</label><institution>Department of Mechanical Engineering, SNS College of Technology</institution>, <addr-line>Coimbatore, 641035</addr-line>, <country>India</country></aff>
</contrib-group><author-notes><corresp id="cor1"><label>&#x002A;</label>Corresponding Author: V. Sugumaran. Email: <email>v_sugu@yahoo.com</email></corresp></author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2022-07-15"><day>15</day>
<month>07</month>
<year>2022</year></pub-date>
<volume>16</volume>
<issue>3</issue>
<fpage>255</fpage>
<lpage>270</lpage>
<history>
<date date-type="received"><day>23</day><month>2</month><year>2018</year></date>
<date date-type="accepted"><day>02</day><month>8</month><year>2018</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2022 Akshay et al.</copyright-statement>
<copyright-year>2022</copyright-year>
<copyright-holder>Akshay et al.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_SDHM_271.pdf"></self-uri>
<abstract>
<p>Tool wear is inevitable in daily machining process since metal cutting process involves the chip rubbing the tool surface after it has been cut by the tool edge. Tool wear dominantly influences the deterioration of surface finish, geometric and dimensional tolerances of the workpiece. Moreover, for complete utilization of cutting tools and reduction of machine downtime during the machining process, it becomes necessary to understand the development of tool wear and predict its status before happening. In this study, tool condition monitoring system was used to monitor the behavior of a single point cutting tool to predict flank wear. A uniaxial accelerometer was attached to a single point cutting tool under study. The accelerometer acquires vibrational signals during turning operation on a lathe machine. The acquired signals were then used to extract statistical features such as standard error, variance, skewness, etc. The substantial features were recognized to reduce the utilization of computing resources. They were used to classify the signals as good and three different measures of flank wear by a decision tree algorithm. Frequency domain features were also extracted and shown to be less effective in classification in comparison to statistical features. REPTree (Reduced Error Pruning Tree) algorithm was used in this study. REPTree decision tree algorithm achieved a maximum classification accuracy of 72.77&#x0025; for all signals combined. When spindle speed and feed rate are considered as the variables the accuracy is about 86.25&#x0025;. When spindle speed is the only variable parameter the accuracy is about 82.71&#x0025;. When depth of cut, feed rate and speed of the spindle are considered as variable parameters, the accuracy of the decision tree is around 93.51&#x0025;. This study demonstrates the performance of REPTree classifier in tool condition monitoring. It can be utilized for tool wear identification and thus improve surface finish, dimensional accuracy of the work piece and reduce machine downtime. Any additional research on the work may involve analysis of different classifier algorithms which could potentially predict tool wear with greater accuracy.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Fault diagnosis</kwd>
<kwd>tool condition monitoring</kwd>
<kwd>REPTree</kwd>
<kwd>decision tree</kwd>
<kwd>statistical feature extraction</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>Manufacturing industries are constantly looking for ways that can boost their production without affecting any output factors negatively. This can prove fruitful for the economy of a developing nation. Conventional metal cutting and machining processes are a vital part in production systems [<xref ref-type="bibr" rid="ref-1">1</xref>]. In mass production, the machine tool tends to shear or wear off due to abrasion and fatigue under long machining periods inevitably. Nearly 79.6&#x0025; of machine downtime is instigated because of such tool failures [<xref ref-type="bibr" rid="ref-2">2</xref>]. Researchers have suggested employing tool condition monitoring systems which can detect cutting tool wear prior any damage to the work piece. It would decrease machine downtime, reduce the chance for dimensional errors, improve tolerance and surface finish and also improve productivity. This can also achieve manufacturing automation. Flank wear is a common kind of tool wear seen in turning operations and leads to several disadvantages like loss of dimensional accuracy and surface finish. Tool condition monitoring can be used to identify and predict such failure and hence prevent the hindrances it would post [<xref ref-type="bibr" rid="ref-3">3</xref>].</p>
<p>Many scientists, engineers and analysts have attempted to design a condition monitoring system with high accuracy. Past research on tool condition monitoring for milling operation was reported by Zhou et al. [<xref ref-type="bibr" rid="ref-4">4</xref>]. Hocheng et al. [<xref ref-type="bibr" rid="ref-5">5</xref>] found the correlation between the scattering intensity of light when laser is incident on the workpiece and the nose radius of a single point cutting tool. Bhuiyan et al. [<xref ref-type="bibr" rid="ref-6">6</xref>] inferred that acoustic and vibration signals can effectively change with respect to tool wear in turning operation. Flank wear was predicted in a single point cutting tool using acoustic emissions by Sundaram et al. [<xref ref-type="bibr" rid="ref-7">7</xref>]. The condition monitoring of tool by examining surface roughness, vibration and material removed from the specimen was presented in [<xref ref-type="bibr" rid="ref-8">8</xref>]. Measuring the vibration of a process is one of the most valuable in tool condition monitoring. Krishnakumar et al. [<xref ref-type="bibr" rid="ref-9">9</xref>] has used vibration signals from the high-speed machining of titanium alloy to predict the tool wear condition. They have used J48 decision tree classifier and artificial neural network algorithm to diagnose the tool wear. Teli et al. [<xref ref-type="bibr" rid="ref-10">10</xref>] surveyed several decision tree based approaches in data mining. A different study inferred that acoustical data is useful for sub-surface irregularities and tool tip breakages while vibration signals is a better choice for tool wear studies [<xref ref-type="bibr" rid="ref-11">11</xref>]. The estimation of remaining healthy tool life using support vector regression is presented in a paper [<xref ref-type="bibr" rid="ref-12">12</xref>]. Wang et al. [<xref ref-type="bibr" rid="ref-13">13</xref>] found that the use of SVM can make the training faster without losing the classification accuracy. The prediction of sharp or worn tool by utilization of wavelet packet decomposition feature extraction technique on the vibration and sound signals of machining process was presented in another paper [<xref ref-type="bibr" rid="ref-14">14</xref>].</p>
<p>The use of statistical features like mean, median, mode, variance, etc. extracted from the vibration signal of turning operation and K-star classification algorithm was found to be helpful in predicting the blunt tool [<xref ref-type="bibr" rid="ref-15">15</xref>]. Gangadhar et al. [<xref ref-type="bibr" rid="ref-16">16</xref>] studied the vibration signal in a turning operation by using Decision Tree Algorithm for feature reduction as well as classification. In another study, Gangadhar et al. [<xref ref-type="bibr" rid="ref-17">17</xref>] investigated vibration signals by obtaining descriptive statistical features for classification purpose. Gierlak et al. [<xref ref-type="bibr" rid="ref-18">18</xref>] devised a method for the processing and analyzing of signals during diagnosing the state of a manipulator&#x2019;s tool of a robot. The usage of REPTree proves to be best among the many other popular classifiers for the detection of a user in a social network system [<xref ref-type="bibr" rid="ref-19">19</xref>]. Here accelerometer was used to acquire the cutting tool vibration during the machining in lathe machine. The statistical features are extracted from the acquired vibration signal and unwanted features are removed from the dataset. Then the dataset is classified with REPTree algorithm to evaluate the performance of the classifier on the prediction of the tool wear level. REPTree stands for Reduced Error Pruning Tree. It belongs to one of the two standard classes of pruning methods, specifically backward or post pruning. Post-pruning initially over-fits the data followed by pruning of the tree [<xref ref-type="bibr" rid="ref-20">20</xref>]. Reduced Error Pruning is a post-pruning method decision tree [<xref ref-type="bibr" rid="ref-21">21</xref>].</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Experimental Arrangement</title>
<p>A lathe machine performing a turning operation was used to conduct the experimental study. The workpiece used was a steel bar of diameter 25 mm and a brazed carbide tip cutting tool was used as cutting tool. A Dytran Uniaxial accelerometer was mounted on a single point cutting tool using adhesive mounting. A data acquisition device manufactured by National Instruments (USB type) NIVIB 4432, was connected to the accelerometer in which the analog signal was converted into digital signal. LABVIEW software was used to obtain the signals. The experimental setup comprising of the cutting tool, accelerometer and work piece is presented in <xref ref-type="fig" rid="fig-1">Figs. 1</xref> and <xref ref-type="fig" rid="fig-2">2</xref> depicts the data acquisition device and computer. <xref ref-type="table" rid="table-1">Table 1</xref> describes the machining parameters taken into consideration for this experimental study. Vibration signals corresponding to all combinations of feed rate (FR), speed of the spindle (SS), flank wear (FW) and depth of cut (DC) are acquired.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Adopted experimental setup comprising of work piece, cutting tool and accelerometer</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="SDHM_271-fig-1.png"/>
</fig>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Overall setup for experimentation</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="SDHM_271-fig-2.png"/>
</fig>
<table-wrap id="table-1"><label>Table 1</label>
<caption>
<title>Process parameter variations in the study</title></caption>
<table><colgroup><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left" rowspan="2">Levels</th>
<th align="center" colspan="4">Process parameters</th>
</tr>
<tr>
<th align="left">DC (mm)</th>
<th align="left">FR (mm/rev)</th>
<th align="left">SS (rpm)</th>
<th align="left">FW (mm)</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">1</td>
<td align="left">0.5</td>
<td align="left">0.109</td>
<td align="left">510</td>
<td align="left">0</td>
</tr>
<tr>
<td align="left">2</td>
<td align="left">0.8</td>
<td align="left">0.122</td>
<td align="left">770</td>
<td align="left">0.2</td>
</tr>
<tr>
<td align="left">3</td>
<td align="left">1.0</td>
<td align="left">0.135</td>
<td align="left">900</td>
<td align="left">0.4</td>
</tr>
<tr>
<td align="left">4</td>
<td align="left">-</td>
<td align="left">-</td>
<td align="left">-</td>
<td align="left">0.6</td>
</tr>
</tbody>
</table>
</table-wrap>
<sec id="s2_1">
<label>2.1</label>
<title>Experimental Studies</title>
<sec id="s2_1_1">
<label>2.1.1</label>
<title>Baseline Signal Acquisition</title>
<p>Vibrational signals are acquired from the single point cutting tool through the accelerometer attached over the tool. The maximum frequency that was obtained was 6&#x2005;kHz. Based on Nyquist sampling theorem, the frequency during sampling must be twice or thrice the observed maximum frequency of the system. Agreeing to this theorem, the sampling signal was taken as 20&#x2005;kHz. The specimen was securely affixed to the chuck of the lathe. To remove any irregularities on the surface of the work specimen, a rough turning operation was done. After this, a uniform turning was done to record the signal but the first few seconds are dropped to eliminate randomness in the vibration signals. When the turning operation was stable, the vibration signals were collected.</p>
</sec>
<sec id="s2_1_2">
<label>2.1.2</label>
<title>Simulation of Faults</title>
<p>Flank wear fault was induced manually on the single point cutting tool with the aid of cutter grinding machine and tool. Before inducing the flank wear, line for reference was marked tangential to the cutting tool nose radius and the intermediate distance from the line and the foremost tip of the nose radius was recorded. The same procedure was repeated after fault simulation and the difference between the two lengths gives the actual wear of the cutting tool.</p>
</sec>
<sec id="s2_1_3">
<label>2.1.3</label>
<title>Acceleration Signal Acquisition</title>
<p>The accelerometer acquires the vibration signals from the lathe during the machining operation after stabilization. The signal acquisition parameters were fixed at 2000 sample length and 20&#x2005;kHz sampling frequency for all machining conditions. <xref ref-type="fig" rid="fig-3 fig-4 fig-5 fig-6">Figs. 3&#x2013;6</xref> represent plots of time domain corresponding to different tool wear condition.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Plot representing 0.2&#x2005;mm tool wear</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="SDHM_271-fig-3.png"/>
</fig>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Plot representing 0.4&#x2005;mm tool wear</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="SDHM_271-fig-4.png"/>
</fig>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Plot representing 0.6&#x2005;mm tool wear</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="SDHM_271-fig-5.png"/>
</fig>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Plot representing healthy tool</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="SDHM_271-fig-6.png"/>
</fig>
</sec>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Feature Extraction</title>
<p>Feature extraction was implemented to extract features that has some significance and is useful for classification from the measured data. These features include important information which can be used to reduce the initial set of data and classification can be done on this reduced data. Here, data corresponds to the acceleration signals obtained using the data acquisition device. Statistical features such as mean, median, mode, maximum, minimum, range, sum, standard error, standard deviation, kurtosis and skewness were taken into consideration for this experiment. Statistical features allow us to compute a huge range of phenomena or attributes, allowing the study of fault diagnosis from an objective perspective. Statistical methods possess the ability to predict deviations in a particular problem as they are classified with different constraints. Features that possessed no or irrelevant information for the classification were discarded. A decision tree classifier was used to reduce the data and REPTree classifier was used for classification of the same. Frequency domain features were also extracted and used for classification to compare and validate the choice of statistical features for the particular problem. The Fast Fourier Transform (FFT) of a signal is visualized in <xref ref-type="fig" rid="fig-7">Fig. 7</xref>. Imaginary parts of the transform are neglected. The absolute value of the transform is shown in <xref ref-type="fig" rid="fig-8">Fig. 8</xref>, where four peaks of frequency is observed. The value of each of the peak is taken as a distinct frequency domain feature. These features were used to classify tool wear using REPTree and their corresponding classification accuracy is discussed in a following section.</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Fast fourier transform plot of good tool signal</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="SDHM_271-fig-7.png"/>
</fig>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>Absolute fast fourier transform plot of good tool signal</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="SDHM_271-fig-8.png"/>
</fig>
<sec id="s3_1">
<label>3.1</label>
<title>Decision Tree Based Feature Reduction</title>
<p>The extracted features (statistical) were arranged in order of their significance by the decision tree classifier. The features present at the topmost position carries vital information whilst the feature in the lower portion offers relatively less amount of relevant information. The features at the lowest position in the tree can be neglected to increase accuracy during classification.</p>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Brief Description of Machine Learning Classifiers</title>
<sec id="s4_1">
<label>4.1</label>
<title>Decision Tree</title>
<p>A decision tree is a common tool used for data mining. It creates a tree structure based on classification factors or regression models. This tree comprises of several nodes, leaves and a single root linked together through branches. The structure of the tree decomposes the dataset into smaller subsets and develops an association decision tree. It can handle both numerical and categorical data. The resulting tree structure comprises of decision nodes and leaf nodes. A decision node can divide into two or more branches while a leaf node represents a decision. A relevant estimation criterion forms the basis for classification at each node. Processes like information gain and entropy reduction is the main principle behind selecting the most significant feature for classification. The decision tree flow descends from the most significant to the least significant feature initiating from the root node. The root node handles the division of data into homogeneous subsets. Homogeneity of the data set can be calculated from entropy. Zero entropy denotes a completely homogenous and entropy value of one denotes a uniformly and equally divided set.<disp-formula id="ueqn-1">
<mml:math id="mml-ueqn-1" display="block"><mml:mi>E</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi><mml:mi>y</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>s</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mspace width="thinmathspace" /><mml:mo>&#x2212;</mml:mo><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:msub><mml:mi>g</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math>
</disp-formula></p>
<p>where <italic>p</italic><sub><italic>i</italic></sub> is the division of <italic>s</italic> belonging to class <italic>i</italic> and <italic>n</italic> is the number of classes.</p>
<p>The division of the data set based on a feature or attribute decreases the entropy and becomes a ground for information gain. Information gain calculates the difference of entropy before and after the system acquires information. Information gain <inline-formula id="ieqn-1">
<mml:math id="mml-ieqn-1"><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>x</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula> of a feature corresponding to build various objects s is computed using,<disp-formula id="ueqn-2">
<mml:math id="mml-ueqn-2" display="block"><mml:mi>G</mml:mi><mml:mi>a</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>x</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mi>E</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi><mml:mi>y</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>s</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mspace width="thinmathspace" /><mml:mo>&#x2212;</mml:mo><mml:mspace width="thinmathspace" /><mml:munder><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>v</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>&#x03F5;</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>V</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>u</mml:mi><mml:mi>e</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:munder><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mi>v</mml:mi></mml:msub></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mi>s</mml:mi><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow></mml:mfrac></mml:mrow><mml:mspace width="thickmathspace" /><mml:mi>E</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi><mml:mi>y</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mi>v</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mstyle></mml:math>
</disp-formula></p>
<p>where <italic>Value</italic>(<italic>x</italic>) corresponds to all attribute values <italic>x</italic> and feature <italic>x</italic> has a value of <inline-formula id="ieqn-2">
<mml:math id="mml-ieqn-2"><mml:mi>v</mml:mi></mml:math>
</inline-formula> in <italic>s</italic><sub><italic>v</italic></sub> a subset representation of <italic>s</italic>. <italic>Entropy</italic>(<italic>s</italic>) signifies the entropy of the original collection <italic>s</italic> and <inline-formula id="ieqn-3">
<mml:math id="mml-ieqn-3"><mml:munder><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>v</mml:mi><mml:mrow><mml:mspace width="thickmathspace" /></mml:mrow><mml:mi>&#x03B5;</mml:mi><mml:mrow><mml:mspace width="thickmathspace" /></mml:mrow><mml:mi>V</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>u</mml:mi><mml:mi>e</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:munder><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mi>v</mml:mi></mml:msub></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mi>s</mml:mi><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow></mml:mfrac></mml:mrow><mml:mrow><mml:mspace width="thickmathspace" /><mml:mtext>&#xA0;</mml:mtext></mml:mrow><mml:mi>E</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi><mml:mi>y</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mi>v</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mstyle></mml:math>
</inline-formula> signifies the anticipated entropy value after <italic>s</italic> is divided from feature <italic>x</italic>.</p>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>REPTree Classifier</title>
<p>REPTree or Reduced Error Pruning Tree is a fast decision tree learning algorithm. REPTree is a decision tree classifier that uses regression tree logic and concludes in a final predicted function value than a classification. A decision tree along with linear regression is called a regression tree. It gives piecewise relationship between dependent and independent variables [<xref ref-type="bibr" rid="ref-22">22</xref>]. REPTree creates multiple regression trees based on the given model in various iterations and then selects the best one out of the lot by utilizing entropy as a measure of impurity [<xref ref-type="bibr" rid="ref-23">23</xref>]. The selected tree is considered as the representative. The measure used is the mean square error on the predictions when pruning the tree. It performs reduced error pruning on a decision tree made based on information gain. It only sort values of numeric attributes once. C4.5&#x2019;s method of fractional instances is used to work with missing values, that is by splitting the corresponding instances into pieces. The example of REP Tree algorithm is applied on UCI repository and the confusion matrix is generated [<xref ref-type="bibr" rid="ref-24">24</xref>].</p>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Results and Discussions</title>
<p>The performance of REPTree classifier in classifying single point cutting tool wear level was done as follows:<list list-type="bullet"><list-item>
<p>Reduction of the data obtained from the monitoring the machining operation by selecting relevant and significant statistical features</p></list-item><list-item>
<p>Determination of classification accuracy using REPTree classifier for the acquired signals</p></list-item><list-item>
<p>Classifier validation through thorough analysis of confusion matrices</p></list-item></list></p>
<sec id="s5_1">
<label>5.1</label>
<title>Feature Reduction</title>
<p>Feature selection methods are used to decrease the dimensionality of the data by removing unnecessary and irrelevant attributes in the data set [<xref ref-type="bibr" rid="ref-25">25</xref>]. Reduction of initial data was carried out using J48. The statistical features with less or no contributing data were discarded and the rest were arranged in order of their significance. Initially, the decision tree returned a classification accuracy of 71.11&#x0025; with 680 leaves. Post reducing the errors on the same, the classification accuracy increased to 72.86&#x0025; with 186 leaves. Additionally, the classification accuracy reached 72.31&#x0025; during adjustments made in the minimum number of objects corresponding to 34 leaves.</p>
<p>The effect of feature combination on the accuracy is displayed in <xref ref-type="table" rid="table-2">Table 2</xref>. The features skewness, standard deviation, sum, range, variance, maximum and kurtosis were significant for the classification while other features were neglected in future calculations. This reduced the computational burden required for classifying the signals. From <xref ref-type="fig" rid="fig-9">Fig. 9</xref>, one can observe the classification accuracy to be maximum for a combination with five features. This combination was chosen for further classification. <xref ref-type="table" rid="table-3">Table 3</xref> shows the formulae for extracting the features whose combination gave the best results.</p>
<table-wrap id="table-2"><label>Table 2</label>
<caption>
<title>Effect of feature combination on classification accuracy</title></caption>
<table><colgroup><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">No. of features</th>
<th align="left">1</th>
<th align="left">2</th>
<th align="left">3</th>
<th align="left">4</th>
<th align="left">5</th>
<th align="left">6</th>
<th align="left">7</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Classification accuracy (&#x0025;)</td>
<td align="left">64.34</td>
<td align="left">68.35</td>
<td align="left">68.74</td>
<td align="left">72.07</td>
<td align="left">72.42</td>
<td align="left">72.21</td>
<td align="left">72.21</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>Effect of features on classification accuracy</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="SDHM_271-fig-9.png"/>
</fig>
<table-wrap id="table-3"><label>Table 3</label>
<caption>
<title>Statistical features</title></caption>
<table><colgroup><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Name of the statistical feature</th>
<th align="left">Formula</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Standard deviation</td>
<td align="left"><inline-formula id="ieqn-4">
<mml:math id="mml-ieqn-4"><mml:mstyle displaystyle="true" scriptlevel="0"><mml:msqrt><mml:mrow><mml:mfrac><mml:mrow><mml:mi>n</mml:mi><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mo>&#x2061;</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mo>&#x2212;</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mi>x</mml:mi></mml:msup></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:mrow></mml:msqrt></mml:mstyle></mml:math>
</inline-formula></td>
</tr>
<tr>
<td align="left">Skewness</td>
<td align="left"><inline-formula id="ieqn-5">
<mml:math id="mml-ieqn-5"><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mi>n</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>2</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:mrow><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mo>&#x2061;</mml:mo><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mrow><mml:mfrac><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mover><mml:mi>x</mml:mi><mml:mo stretchy="false">&#x00AF;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>d</mml:mi></mml:msub></mml:mrow></mml:mfrac></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mspace width="thickmathspace" /></mml:mrow></mml:msup></mml:mstyle></mml:math>
</inline-formula></td>
</tr>
<tr>
<td align="left">Variance</td>
<td align="left"><inline-formula id="ieqn-6">
<mml:math id="mml-ieqn-6"><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mi>n</mml:mi><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mo>&#x2061;</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mo>&#x2212;</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mo>&#x2061;</mml:mo><mml:mi>x</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:math>
</inline-formula></td>
</tr>
<tr>
<td align="left">Sum</td>
<td align="left"><inline-formula id="ieqn-7">
<mml:math id="mml-ieqn-7"><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mo>&#x2061;</mml:mo><mml:mi>x</mml:mi></mml:mstyle></mml:math>
</inline-formula></td>
</tr>
<tr>
<td align="left">Kurtosis</td>
<td align="left"><inline-formula id="ieqn-8">
<mml:math id="mml-ieqn-8"><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mrow><mml:mfrac><mml:mrow><mml:mi>n</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>2</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>3</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:mrow><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mo>&#x2061;</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mrow><mml:mfrac><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mover><mml:mi>x</mml:mi><mml:mo stretchy="false">&#x00AF;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>d</mml:mi></mml:msub></mml:mrow></mml:mfrac></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow><mml:mn>4</mml:mn></mml:msup></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mn>3</mml:mn><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">n</mml:mi></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>2</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">n</mml:mi></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>3</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:math>
</inline-formula></td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s5_2">
<label>5.2</label>
<title>Performance Evaluation of REPTree Classifier</title>
<p>The overall accuracy for classifying tool wear during turning operation using lathe for different combinations of spindle speed (SS), feed rate (FR) and depth of cut (DC) combined was found to be 72.77&#x0025; using REPTree classifier. By reducing the complexity or fixing one or two of the variables, the classification accuracy can be improved. When spindle speed was fixed as a constant, the classification accuracy obtained was 8%&#x2013;14&#x0025; better than the combined accuracy of classification (all signals combined) as presented in <xref ref-type="table" rid="table-4">Table 4</xref>. The same is graphically represented in <xref ref-type="fig" rid="fig-10">Fig. 10</xref>.</p>
<table-wrap id="table-4"><label>Table 4</label>
<caption>
<title>Performance of REPTree classifier with variation in spindle speed</title></caption>
<table><colgroup><col align="left"/><col align="left"/><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Spindle speed <italic>(rpm)</italic></th>
<th align="left">510</th>
<th align="left">770</th>
<th align="left">900</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Classification accuracy <italic>(&#x0025;)</italic></td>
<td align="left">80.61</td>
<td align="left">81.50</td>
<td align="left">86.02</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="fig-10">
<label>Figure 10</label>
<caption>
<title>Performance of REPTree classifier with variation in spindle speed</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="SDHM_271-fig-10.png"/>
</fig>
<p>We can achieve better classification accuracy if the complexity is reduced more by making feed rate and spindle speed as distinct factors. The accuracy for classifying tool wear thus obtained is given in <xref ref-type="table" rid="table-5">Table 5</xref> and a graphical comparison is given in <xref ref-type="fig" rid="fig-11">Fig. 11</xref>.</p>
<table-wrap id="table-5"><label>Table 5</label>
<caption>
<title>Performance of REPTree using FR and SS as distinct factors</title></caption>
<table><colgroup><col align="left"/><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Feed rate <italic>(mm/rev)</italic></th>
<th align="left">Spindle speed <italic>(rpm)</italic></th>
<th align="left">Classification accuracy <italic>(&#x0025;)</italic></th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">0.109</td>
<td align="left">510</td>
<td align="left">90.16</td>
</tr>
<tr>
<td align="left">0.122</td>
<td align="left">510</td>
<td align="left">84.33</td>
</tr>
<tr>
<td align="left">0.135</td>
<td align="left">510</td>
<td align="left">82.5</td>
</tr>
<tr>
<td align="left">0.109</td>
<td align="left">770</td>
<td align="left">85.33</td>
</tr>
<tr>
<td align="left">0.122</td>
<td align="left">770</td>
<td align="left">90.5</td>
</tr>
<tr>
<td align="left">0.135</td>
<td align="left">770</td>
<td align="left">80.75</td>
</tr>
<tr>
<td align="left">0.109</td>
<td align="left">900</td>
<td align="left">82.66</td>
</tr>
<tr>
<td align="left">0.122</td>
<td align="left">900</td>
<td align="left">89</td>
</tr>
<tr>
<td align="left">0.135</td>
<td align="left">900</td>
<td align="left">91</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="fig-11">
<label>Figure 11</label>
<caption>
<title>Performance of REPTree using FR and SS as distinct factors</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="SDHM_271-fig-11.png"/>
</fig>
<p>Similarly, by considering DC, FR and SS as distinct factors, the classification accuracy is improved by around 7&#x0025;. But for some combinations the classification accuracy obtained was less than the previous observations. The accuracy for classifying tool wear is displayed in <xref ref-type="table" rid="table-6">Table 6</xref> along with comparison in <xref ref-type="fig" rid="fig-12">Fig. 12</xref>.</p>
<table-wrap id="table-6"><label>Table 6</label>
<caption>
<title>Performance of REPTree classifier with DC, FR and SS as separate factors</title></caption>
<table><colgroup><col align="left"/><col align="left"/><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Spindle speed <italic>(rpm)</italic></th>
<th align="left">Depth of cut <italic>(mm)</italic></th>
<th align="left">Feed rate <italic>(mm/rev)</italic></th>
<th align="left">Classification accuracy <italic>(&#x0025;)</italic></th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">510</td>
<td align="left">0.5</td>
<td align="left">0.109</td>
<td align="left">98.75</td>
</tr>
<tr>
<td align="left">510</td>
<td align="left">0.8</td>
<td align="left">0.109</td>
<td align="left">97</td>
</tr>
<tr>
<td align="left">510</td>
<td align="left">1</td>
<td align="left">0.109</td>
<td align="left">97.25</td>
</tr>
<tr>
<td align="left">510</td>
<td align="left">0.5</td>
<td align="left">0.122</td>
<td align="left">94.75</td>
</tr>
<tr>
<td align="left">510</td>
<td align="left">0.8</td>
<td align="left">0.122</td>
<td align="left">91</td>
</tr>
<tr>
<td align="left">510</td>
<td align="left">1</td>
<td align="left">0.122</td>
<td align="left">87.75</td>
</tr>
<tr>
<td align="left">510</td>
<td align="left">0.5</td>
<td align="left">0.135</td>
<td align="left">92</td>
</tr>
<tr>
<td align="left">510</td>
<td align="left">0.8</td>
<td align="left">0.135</td>
<td align="left">88.25</td>
</tr>
<tr>
<td align="left">510</td>
<td align="left">1</td>
<td align="left">0.135</td>
<td align="left">96.5</td>
</tr>
<tr>
<td align="left">770</td>
<td align="left">0.5</td>
<td align="left">0.109</td>
<td align="left">84</td>
</tr>
<tr>
<td align="left">770</td>
<td align="left">0.8</td>
<td align="left">0.109</td>
<td align="left">100</td>
</tr>
<tr>
<td align="left">770</td>
<td align="left">1</td>
<td align="left">0.109</td>
<td align="left">88.75</td>
</tr>
<tr>
<td align="left">770</td>
<td align="left">0.5</td>
<td align="left">0.122</td>
<td align="left">97.25</td>
</tr>
<tr>
<td align="left">770</td>
<td align="left">0.8</td>
<td align="left">0.122</td>
<td align="left">99</td>
</tr>
<tr>
<td align="left">770</td>
<td align="left">1</td>
<td align="left">0.122</td>
<td align="left">99.5</td>
</tr>
<tr>
<td align="left">770</td>
<td align="left">0.5</td>
<td align="left">0.135</td>
<td align="left">79</td>
</tr>
<tr>
<td align="left">770</td>
<td align="left">0.8</td>
<td align="left">0.135</td>
<td align="left">91.75</td>
</tr>
<tr>
<td align="left">770</td>
<td align="left">1</td>
<td align="left">0.135</td>
<td align="left">88.5</td>
</tr>
<tr>
<td align="left">900</td>
<td align="left">0.5</td>
<td align="left">0.109</td>
<td align="left">84.75</td>
</tr>
<tr>
<td align="left">900</td>
<td align="left">0.8</td>
<td align="left">0.109</td>
<td align="left">92.5</td>
</tr>
<tr>
<td align="left">900</td>
<td align="left">1</td>
<td align="left">0.109</td>
<td align="left">98.5</td>
</tr>
<tr>
<td align="left">900</td>
<td align="left">0.5</td>
<td align="left">0.122</td>
<td align="left">91</td>
</tr>
<tr>
<td align="left">900</td>
<td align="left">0.8</td>
<td align="left">0.122</td>
<td align="left">98.5</td>
</tr>
<tr>
<td align="left">900</td>
<td align="left">1</td>
<td align="left">0.122</td>
<td align="left">98</td>
</tr>
<tr>
<td align="left">900</td>
<td align="left">0.5</td>
<td align="left">0.135</td>
<td align="left">98.5</td>
</tr>
<tr>
<td align="left">900</td>
<td align="left">0.8</td>
<td align="left">0.135</td>
<td align="left">93.5</td>
</tr>
<tr>
<td align="left">900</td>
<td align="left">1</td>
<td align="left">0.135</td>
<td align="left">98.75</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="fig-12">
<label>Figure 12</label>
<caption>
<title>Performance of REPTree classifier with DC, SS and FR as separate factors</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="SDHM_271-fig-12.png"/>
</fig>
<p>If frequency domain features are used instead of statistical domain features while considering DC, FR and SS as distinct factors, the classification accuracies were observed to be less than the statistical feature model in majority of the cases. The comparison between the classification accuracies of the statistical feature model and the frequency domain model is shown in <xref ref-type="fig" rid="fig-13 fig-14 fig-15">Figs. 13&#x2013;15</xref>.</p>
<fig id="fig-13">
<label>Figure 13</label>
<caption>
<title>Classification accuracy comparison of REPTree classifier using statistical features and frequency domain features considering DC, FR as distinct factors and 510&#x2005;rpm SS</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="SDHM_271-fig-13.png"/>
</fig>
<fig id="fig-14">
<label>Figure 14</label>
<caption>
<title>Classification accuracy comparison of REPTree classifier using statistical features and frequency domain features considering DC, FR as distinct factors and 770&#x2005;rpm SS</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="SDHM_271-fig-14.png"/>
</fig>
<fig id="fig-15">
<label>Figure 15</label>
<caption>
<title>Classification accuracy comparison of REPTree classifier using statistical features and frequency domain features considering DC, FR as distinct factors and 900&#x2005;rpm SS</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="SDHM_271-fig-15.png"/>
</fig>
<p>It can be observed that the classification accuracies from the classifier trained with statistical features are considerably higher than that trained with frequency domain features, hence they are advantageous. It can be observed that when separate models are considered, the classification accuracy of REPTree classifier shows an increasing trend. Therefore, REPTree classifier can be used for monitoring and classification of various depth of cut, speed of spindle and feed rate while the accuracy for classifying tool wear of 72.77&#x0025; is acceptable (for all signals combined).</p>
</sec>
<sec id="s5_3">
<label>5.3</label>
<title>Validation of Classifier</title>
<p>The conventional method to predict fault rate of a learning procedure given a singular, fixed sample of data is a stratified tenfold cross-validation. Every class is embodied in about the same amounts as in the complete dataset with the data being divided into ten parts. Each part is granted orderly and the learning structure is trained on the residual parts. The error rate is calculated on the holdout set. Therefore, the learning technique is executed 10 times on different training sets giving 10 error estimates. An average of the error estimates is taken to get overall error estimate. This makes sure that the fault rate is calculated resourcefully in an unbiased way. The performance of REPTree classifier can be evaluated with the aid of a confusion matrix as represented in <xref ref-type="table" rid="table-7">Table 7</xref>. The tool wear conditions that are correctly (diagonal elements) and incorrectly (non-diagonal elements) classified are represented as the rows and columns of the matrix. The first element of the confusion matrix denotes the number of signals that were obtained from a tool having good condition being classified as GOOD. The second element corresponds to the number of signals obtained from a tool of good condition misclassified as a tool having 0.2&#x2005;mm flank wear (FLW1). Likewise, the third and fourth element of the first row are the number of signals that were obtained from a tool that should be classified as GOOD but is misclassified as 0.4&#x2005;mm (FLW2) and 0.6&#x2005;mm (FLW3) respectively. The others rows are interpreted in the same way. The diagonal elements of the confusion matrix show the correctly classified instances and the other elements signify misclassified instances. The presence of misclassified instances might be due to signals resembling that of the other conditions for some machining parameters.</p>
<table-wrap id="table-7"><label>Table 7</label>
<caption>
<title>REPTree classifier confusion matrix</title></caption>
<table><colgroup><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Class</th>
<th align="left">GOOD</th>
<th align="left">FLW1</th>
<th align="left">FLW2</th>
<th align="left">FLW3</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">GOOD</td>
<td align="left"><bold>2033</bold></td>
<td align="left">0</td>
<td align="left">400</td>
<td align="left">267</td>
</tr>
<tr>
<td align="left">FLW1</td>
<td align="left">7</td>
<td align="left"><bold>2388</bold></td>
<td align="left">103</td>
<td align="left">202</td>
</tr>
<tr>
<td align="left">FLW2</td>
<td align="left">326</td>
<td align="left">202</td>
<td align="left"><bold>1741</bold></td>
<td align="left">431</td>
</tr>
<tr>
<td align="left">FLW3</td>
<td align="left">357</td>
<td align="left">176</td>
<td align="left">470</td>
<td align="left"><bold>1697</bold></td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The class wise accuracy is expressed by measures such as the true positive rate (TPR), false positive rate (FPR), precision, recall and F-measure. The amount of cases following the rule that were correctly classified is True Positives (TP). The number of cases following the rule that were wrongly classified is called False Positives (FP). The cases not following the rule but whose class does not meet the expected result class constitute True Negatives (TN). Cases not following the rule but whose class meets the expected result class constitute False Negatives (FN). For a good classifier, the true positive (TP) rate should approach 1 and the false positive (FP) rate should approach 0. From <xref ref-type="table" rid="table-8">Table 8</xref>, most TP rates are close to 1 and most FP rates are close to 0. This confirms the result presented by confusion matrix in <xref ref-type="table" rid="table-7">Table 7</xref>. Precision is the likelihood of retrieved cases that are suited for the class. Mathematically, precision is the ratio of true positive (TP) to the retrieved instances (TP&#x002B;FP). Precision or the positive predictive value can be called a measure of correctness or quality. Recall which is a measure of completeness or quantity is the information retrieval portraying the likelihood of the errors related to the classification which were retrieved. It is the ratio of true positive (TP) to the overall cases (TP&#x002B;FN). False negative (FN) is considered as type 2 error, meaning the cases indicate misclassification but is actually correctly classified. F-measure is the harmonic mean of recall and precision.</p>
<table-wrap id="table-8"><label>Table 8</label>
<caption>
<title>Table showing detailed accuracy by class for all signals combined</title></caption>
<table><colgroup><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Precision</th>
<th align="left">Recall</th>
<th align="left">TP rate</th>
<th align="left">FP rate</th>
<th align="left">F-measure</th>
<th align="left">Class</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">0.747</td>
<td align="left">0.753</td>
<td align="left">0.753</td>
<td align="left">0.085</td>
<td align="left">0.750</td>
<td align="left">GOOD</td>
</tr>
<tr>
<td align="left">0.863</td>
<td align="left">0.884</td>
<td align="left">0.884</td>
<td align="left">0.047</td>
<td align="left">0.874</td>
<td align="left">FLW1</td>
</tr>
<tr>
<td align="left">0.641</td>
<td align="left">0.645</td>
<td align="left">0.645</td>
<td align="left">0.120</td>
<td align="left">0.643</td>
<td align="left">FLW2</td>
</tr>
<tr>
<td align="left">0.653</td>
<td align="left">0.629</td>
<td align="left">0.629</td>
<td align="left">0.111</td>
<td align="left">0.641</td>
<td align="left">FLW3</td>
</tr>
<tr>
<td align="left">0.726</td>
<td align="left">0.728</td>
<td align="left">0.728</td>
<td align="left">0.091</td>
<td align="left">0.727</td>
<td align="left">Weighted avg.</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
<sec id="s6">
<label>6</label>
<title>Conclusion</title>
<p>This study analyses the efficiency of REPTree classifier for monitoring and classifying the tool wear conditions of single point carbide cutting tool. Statistical features and frequency domain features were drawn from the signals obtained for various machining parameters and J48 decision tree algorithm was used to select features significant for the classification. This feature reduction resulted in reduction of computing time and effort. REPTree classifier yielded a classification accuracy of 72.77&#x0025; for all signals combined and hence can be used for all DC, SS and FR. The classification accuracy was greatly improved when the complexity was reduced by considering the said parameters separately. Misclassifications can be reduced by increasing the training data, so as to prepare the classifier to have better accuracy when classifying a newly acquired signal.</p>
</sec>
</body>
<back>
<glossary content-type="abbreviations" id="glossary-1">
<def-list>
<title>Nomenclature</title>
<def-item>
<term>REPTree</term>
<def>
<p>Reduced Error Pruning Tree</p>
</def>
</def-item>
<def-item>
<term>FFT</term>
<def>
<p>Fast Fourier Transform</p>
</def>
</def-item>
<def-item>
<term>TP</term>
<def>
<p>True Positive</p>
</def>
</def-item>
<def-item>
<term>FP</term>
<def>
<p>False Positive</p>
</def>
</def-item>
<def-item>
<term>TPR</term>
<def>
<p>True Positive Rate</p>
</def>
</def-item>
<def-item>
<term>FPR</term>
<def>
<p>False Positive Rate</p>
</def>
</def-item>
</def-list>
</glossary>
<fn-group>
<fn fn-type="other">
<p><bold>Funding Statement:</bold> The authors received no specific funding for this study.</p>
</fn>
<fn fn-type="conflict">
<p><bold>Conflicts of Interest:</bold> The authors declare that they have no conflicts of interest to report regarding the present study.</p>
</fn>
</fn-group>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>1.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Rehorn</surname>, <given-names>A. G.</given-names></string-name>, <string-name><surname>Jiang</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Orban</surname>, <given-names>P. E.</given-names></string-name></person-group> (<year>2005</year>). <article-title>State-of-the-art in methods and results in tool condition monitoring: A review</article-title>. <source>The International Journal of Advanced Manufacturing Technology</source><italic>,</italic> <volume>26</volume><italic>,</italic> <fpage>693</fpage>&#x2013;<lpage>710</lpage>. DOI <pub-id pub-id-type="doi">10.1007/s00170-004-2038-2</pub-id>.</mixed-citation></ref>
<ref id="ref-2"><label>2.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Teti</surname>, <given-names>R.</given-names></string-name>, <string-name><surname>Jemielniak</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>O&#x2019;Donnell</surname>, <given-names>G.</given-names></string-name>, <string-name><surname>Dornfield</surname>, <given-names>D.</given-names></string-name></person-group> (<year>2010</year>). <article-title>Advanced monitoring of machining operations</article-title>. <source>CIRP Annals</source><italic>,</italic> <volume>59</volume><italic>,</italic> <fpage>717</fpage>&#x2013;<lpage>739</lpage>.</mixed-citation></ref>
<ref id="ref-3"><label>3.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Siddhpura</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Paurobally</surname>, <given-names>R.</given-names></string-name></person-group> (<year>2013</year>). <article-title>A review of flank wear prediction methods for tool condition monitoring in a turning process</article-title>. <source>The International Journal of Advanced Manufacturing Technology</source><italic>,</italic> <volume>65</volume>
<issue>(1&#x2013;4)</issue><italic>,</italic> <fpage>371</fpage>&#x2013;393. DOI <pub-id pub-id-type="doi">10.1007/s00170-012-4177-1</pub-id>.</mixed-citation></ref>
<ref id="ref-4"><label>4.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhou</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Xue</surname>, <given-names>W.</given-names></string-name></person-group> (<year>2018</year>). <article-title>Review of tool condition monitoring methods in milling processes</article-title>. <source>The International Journal of Advance Manufacturing Technology</source><italic>,</italic> <volume>96</volume>
<issue>(5&#x2013;8)</issue><italic>,</italic> <fpage>2509</fpage>&#x2013;<lpage>2523</lpage>. DOI <pub-id pub-id-type="doi">10.1007/s00170-018-1768-5</pub-id>.</mixed-citation></ref>
<ref id="ref-5"><label>5.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Hocheng</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Tseng</surname>, <given-names>H. C.</given-names></string-name>, <string-name><surname>Hsieh</surname>, <given-names>M. L.</given-names></string-name>, <string-name><surname>Lin</surname>, <given-names>Y. H.</given-names></string-name></person-group> (<year>2018</year>). <article-title>Tool wear monitoring in single-point diamond turning using laser scattering from machined workpiece</article-title>. <source>Journal of Manufacturing Processes</source><italic>,</italic> <volume>31</volume><italic>,</italic> <fpage>405</fpage>&#x2013;<lpage>415</lpage>. DOI <pub-id pub-id-type="doi">10.1016/j.jmapro.2017.12.007</pub-id>.</mixed-citation></ref>
<ref id="ref-6"><label>6.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Bhuiyan</surname>, <given-names>M. S. H.</given-names></string-name>, <string-name><surname>Choudhury</surname>, <given-names>I. A.</given-names></string-name>, <string-name><surname>Dahari</surname>, <given-names>M.</given-names></string-name></person-group> (<year>2014</year>). <article-title>Monitoring the tool wear, surface roughness and chip formation occurances using multiple sensors in turning</article-title>. <source>Journal of Manufacturing Systems</source><italic>,</italic> <volume>33</volume>
<issue>(4)</issue><italic>,</italic> <fpage>476</fpage>&#x2013;487. DOI <pub-id pub-id-type="doi">10.1016/j.jmsy.2014.04.005</pub-id>.</mixed-citation></ref>
<ref id="ref-7"><label>7.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Sundaram</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Senthilkumar</surname>, <given-names>P.</given-names></string-name>, <string-name><surname>Kumaravel</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Manoharan</surname>, <given-names>N.</given-names></string-name></person-group> (<year>2008</year>). <article-title>Study of flank wear in single point cutting tool using acoustic emission sensor techniques</article-title>. <source>ARPN Journal of Engineering and Applied Sciences</source><italic>,</italic> <volume>3</volume>
<issue>(4)</issue>.</mixed-citation></ref>
<ref id="ref-8"><label>8.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Rao</surname>, <given-names>K. V.</given-names></string-name>, <string-name><surname>Murthy</surname>, <given-names>B. S.</given-names></string-name>, <string-name><surname>Rao</surname>, <given-names>N. M.</given-names></string-name></person-group> (<year>2013</year>). <article-title>Cutting tool condition monitoring by analyzing surface roughness, work piece vibration and volume of metal removed for AISI 1040 steel in boring</article-title>. <source>Measurement</source><italic>,</italic> <volume>46</volume>
<issue>(10)</issue><italic>,</italic> <fpage>4075</fpage>&#x2013;4084. DOI <pub-id pub-id-type="doi">10.1016/j.measurement.2013.07.021</pub-id>.</mixed-citation></ref>
<ref id="ref-9"><label>9.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Krishnakumar</surname>, <given-names>P.</given-names></string-name>, <string-name><surname>Rameshkumar</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Ramachandran</surname>, <given-names>K. I.</given-names></string-name></person-group> (<year>2015</year>). <article-title>Tool wear condition prediction using vibration signals in high speed machining (HSM) of titanium (Ti-6Al-4&#x2005;V) alloy</article-title>. <source>Procedia Computer Science</source><italic>,</italic> <volume>50</volume><italic>,</italic> <fpage>270</fpage>&#x2013;<lpage>275</lpage>. DOI <pub-id pub-id-type="doi">10.1016/j.procs.2015.04.049</pub-id>.</mixed-citation></ref>
<ref id="ref-10"><label>10.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Teli</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Kanikar</surname>, <given-names>P.</given-names></string-name></person-group> (<year>2015</year>). <article-title>A survey on decision tree-based approaches in data mining</article-title>. <source>International Journal of Advanced Research in Computer Science and Software Engineering</source><italic>,</italic> <volume>5</volume>
<issue>(4)</issue>.</mixed-citation></ref>
<ref id="ref-11"><label>11.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Elangovan</surname>, .</string-name>, <string-name><surname>Ramachandran</surname>, <given-names>K. I.</given-names></string-name>, <string-name><surname>Sugumaran</surname>, <given-names>V.</given-names></string-name></person-group> (<year>2010</year>). <article-title>Studies on Bayes classifier for condition monitoring of single point carbide tipped tool based on statistical and histogram features</article-title>. <source>Expert Systems with Applications</source><italic>,</italic> <volume>37</volume>
<issue>(3)</issue><italic>,</italic> <fpage>2059</fpage>&#x2013;<lpage>2065</lpage> DOI <pub-id pub-id-type="doi">10.1016/j.eswa.2009.06.103</pub-id>.</mixed-citation></ref>
<ref id="ref-12"><label>12.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Benkedjouh</surname>, <given-names>T.</given-names></string-name>, <string-name><surname>Medjaher</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Zerhouni</surname>, <given-names>N.</given-names></string-name>, <string-name><surname>Rechak</surname>, <given-names>S.</given-names></string-name></person-group> (<year>2015</year>). <article-title>Health assessment and life prediction of cutting tools based on support vector regression</article-title>. <source>Journal of Intelligent Manufacturing</source><italic>,</italic> <volume>26</volume>
<issue>(2)</issue><italic>,</italic> <fpage>213</fpage>&#x2013;223. DOI <pub-id pub-id-type="doi">10.1007/s10845-013-0774-6</pub-id>.</mixed-citation></ref>
<ref id="ref-13"><label>13.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname>, <given-names>G. F.</given-names></string-name>, <string-name><surname>Yang</surname>, <given-names>Y. W.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>Y. C.</given-names></string-name>, <string-name><surname>Xie</surname>, <given-names>Q. L.</given-names></string-name></person-group> (<year>2014</year>). <article-title>Vibration sensor-based tool condition monitoring using &#x03BD; support vector machine and locality preserving projection</article-title>. <source>Sensors and Actuators A: Physical</source><italic>,</italic> <volume>209</volume><italic>,</italic> <fpage>24</fpage>&#x2013;<lpage>32</lpage>. DOI <pub-id pub-id-type="doi">10.1016/j.sna.2014.01.004</pub-id>.</mixed-citation></ref>
<ref id="ref-14"><label>14.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Rafezi</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Akbari</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Behzad</surname>, <given-names>M.</given-names></string-name></person-group> (<year>2012</year>). <article-title>Tool condition monitoring based on sound and vibration analysis and wavelet packet decomposition</article-title>. <conf-name>8th International Symposium in Mechatronics and its Applications (ISMA)</conf-name>, pp. 1&#x2013;4. American University of Sharjah, Sh&#x0101;riqah, United Arab Emirates.</mixed-citation></ref>
<ref id="ref-15"><label>15.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Painuli</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Elangovan</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Sugumaran</surname>, <given-names>V.</given-names></string-name></person-group> (<year>2012</year>). <article-title>Tool condition monitoring using K-star algorithm</article-title>. <source>Expert Systems with Applications</source><italic>,</italic> <volume>41</volume>
<issue>(6)</issue><italic>,</italic> <fpage>2638</fpage>&#x2013;2643. DOI <pub-id pub-id-type="doi">10.1016/j.eswa.2013.11.005</pub-id>.</mixed-citation></ref>
<ref id="ref-16"><label>16.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Gangadhar</surname>, <given-names>N.</given-names></string-name>, <string-name><surname>Kumar</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Narendranath</surname>, <given-names>S.</given-names></string-name></person-group> (<year>2014</year>). <article-title>Fault diagnosis of single point cutting tool through vibration signal using decision tree algorithm</article-title>. <source>Procedia Material Science</source><italic>,</italic> <volume>5</volume><italic>,</italic> <fpage>1434</fpage>&#x2013;<lpage>1441</lpage>. DOI <pub-id pub-id-type="doi">10.1016/j.mspro.2014.07.462</pub-id>.</mixed-citation></ref>
<ref id="ref-17"><label>17.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Gangadhar</surname>, <given-names>N.</given-names></string-name>, <string-name><surname>Kumar</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Narendranath</surname>, <given-names>S.</given-names></string-name></person-group> (<year>2015</year>). <article-title>Condition monitoring of a single point cutting tool through vibration signals using decision tree algorithm</article-title>. <source>Journal of Vibration Analysis</source><italic>,</italic> <volume>3</volume>
<issue>(1)</issue><italic>,</italic> <fpage>34</fpage>&#x2013;<lpage>43</lpage>.</mixed-citation></ref>
<ref id="ref-18"><label>18.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Gierlak</surname>, <given-names>P.</given-names></string-name>, <string-name><surname>Burghardt</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Szybicki</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Szuster</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Muszynska</surname>, <given-names>M.</given-names></string-name></person-group> (<year>2017</year>). <article-title>Online manipulator tool condition monitoring based on vibration analysis</article-title>. <source>Mechanical Systems and Signal Processing</source><italic>,</italic> <volume>8</volume><italic>,</italic> <fpage>14</fpage>&#x2013;<lpage>26</lpage>.</mixed-citation></ref>
<ref id="ref-19"><label>19.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Dev</surname>, <given-names>P.</given-names></string-name>, <string-name><surname>Singh</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Dhawan</surname>, <given-names>S.</given-names></string-name></person-group> (<year>2015</year>). <article-title>Classification of malicious and legitimate nodes for analysing the users&#x2019; behaviour in heterogeneous online social networks</article-title>. <conf-name>2015 International Conference in Futuristic Trends on Computational Analysis and Knowledge Management (ABLAZE)</conf-name>, pp. <fpage>359</fpage>&#x2013;<lpage>363</lpage>. Institute of Electrical and Electronics Engineers, Noida, India.</mixed-citation></ref>
<ref id="ref-20"><label>20.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Mohamed</surname>, <given-names>W. N. H. W.</given-names></string-name>, <string-name><surname>Salleh</surname>, <given-names>M. N. M.</given-names></string-name>, <string-name><surname>Omar</surname>, <given-names>A. H.</given-names></string-name></person-group> (<year>2012</year>). <article-title>A comparative study of reduced error pruning method in decision tree algortihms</article-title>. <conf-name>International Conference on Control System, Computing and Engineering</conf-name>, Penang, Malaysia.</mixed-citation></ref>
<ref id="ref-21"><label>21.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Esposito</surname>, <given-names>F.</given-names></string-name>, <string-name><surname>Malerba</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Semeraro</surname>, <given-names>G.</given-names></string-name>, <string-name><surname>Tamma</surname>, <given-names>V.</given-names></string-name></person-group> (<year>1999</year>). <article-title>The effects of pruning methods on the predictive accuracy of induced decision trees</article-title>. <source>Applied Stochastic Models in Business and Industry</source><italic>,</italic> <volume>15</volume>
<issue>(4)</issue><italic>,</italic> <fpage>277</fpage>&#x2013;<lpage>299</lpage>. DOI <pub-id pub-id-type="doi">10.1002/(ISSN)1526-4025</pub-id>.</mixed-citation></ref>
<ref id="ref-22"><label>22.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Surendar</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Elangovan</surname>, <given-names>M.</given-names></string-name></person-group> (<year>2017</year>). <article-title>Comparison of surface roughness prediction with regression and tree-based regressions during boring operation</article-title>. <source>Indonesian Journal of Electrical Engineering and Computer Science</source><italic>,</italic> <volume>7</volume><italic>,</italic> <fpage>887</fpage>&#x2013;<lpage>892</lpage>. DOI <pub-id pub-id-type="doi">10.11591/ijeecs.v7.i3.pp887-892</pub-id>.</mixed-citation></ref>
<ref id="ref-23"><label>23.</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Witten</surname>, <given-names>I. H.</given-names></string-name>, <string-name><surname>Frank</surname>, <given-names>E.</given-names></string-name></person-group> (<year>2005</year>). <source>Data mining: practical machine learning tools and techniques</source><italic>,</italic> 2<sup>nd</sup> ed. <publisher-name>Morgan Kaufmann Publishers Inc.</publisher-name>, <publisher-loc>San Francisco, CA, USA</publisher-loc>.</mixed-citation></ref>
<ref id="ref-24"><label>24.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Srinivasan</surname>, <given-names>B.</given-names></string-name>, <string-name><surname>Mekala</surname>, <given-names>P.</given-names></string-name></person-group> (<year>2014</year>). <article-title>Mining social networking data for classification using reptree</article-title>. <source>International Journal of Advance Research in Computer Science and Management Studies</source><italic>,</italic> <volume>2</volume>
<issue>(10)</issue>.</mixed-citation></ref>
<ref id="ref-25"><label>25.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Al Janabi</surname>, <given-names>K. B. S.</given-names></string-name>, <string-name><surname>Kadhim</surname>, <given-names>R.</given-names></string-name></person-group> (<year>2018</year>). <article-title>Data reduction techniques</article-title>. <source>A comparative study for attribute selection methods. International Journal of Advanced Computer Science and Technology</source><italic>,</italic> <volume>8</volume>
<issue>(1)</issue><italic>,</italic> <fpage>1</fpage>&#x2013;<lpage>13</lpage>.</mixed-citation></ref>
</ref-list>
</back>
</article>