<?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" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</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">63146</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2025.063146</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Machine Learning for Smart Soil Monitoring</article-title>
<alt-title alt-title-type="left-running-head">Machine Learning for Smart Soil Monitoring</alt-title>
<alt-title alt-title-type="right-running-head">Machine Learning for Smart Soil Monitoring</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Abdellafou</surname><given-names>Khaoula Ben</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Zidi</surname><given-names>Kamel</given-names></name><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Aljuhani</surname><given-names>Ahamed</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-4" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Taouali</surname><given-names>Okba</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><email>otawali@ut.edu.sa</email></contrib>
<contrib id="author-5" contrib-type="author">
<name name-style="western"><surname>Harkat</surname><given-names>Mohamed Faouzi</given-names></name><xref ref-type="aff" rid="aff-3">3</xref></contrib>
<aff id="aff-1"><label>1</label><institution>Faculty of Computers and Information Technology, University of Tabuk</institution>, <addr-line>Tabuk, 71491</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-2"><label>2</label><institution>Applied College, University of Tabuk</institution>, <addr-line>Tabuk, 71491</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-3"><label>3</label><institution>Department of Electronics, Faculty of Engineering Annaba, Badji Mokhtar BP. 12</institution>, <addr-line>Annaba, 23000</addr-line>, <country>Algeria</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Okba Taouali. Email: <email>otawali@ut.edu.sa</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic">
<year>2025</year></pub-date>
<pub-date date-type="pub" publication-format="electronic">
<day>16</day>
<month>04</month>
<year>2025</year></pub-date>
<volume>83</volume>
<issue>2</issue>
<fpage>3007</fpage>
<lpage>3023</lpage>
<history>
<date date-type="received">
<day>06</day>
<month>1</month>
<year>2025</year>
</date>
<date date-type="accepted">
<day>19</day>
<month>3</month>
<year>2025</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2025 The Authors.</copyright-statement>
<copyright-year>2025</copyright-year>
<copyright-holder>Published by Tech Science Press.</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_CMC_63146.pdf"></self-uri>
<abstract>
<p>Environmental protection requires identifying, investigating, and raising awareness about safeguarding nature from the harmful effects of both anthropogenic and natural events. This process of environmental protection is essential for maintaining human well-being. In this context, it is critical to monitor and safeguard the personal environment, which includes maintaining a healthy diet and ensuring plant safety. Living in a balanced environment and ensuring the safety of plants for green spaces and a healthy diet require controlling the nature and quality of the soil in our environment. To ensure soil quality, it is imperative to monitor and assess the levels of various soil parameters. Therefore, an Optimized Reduced Kernel Partial Least Squares (ORKPLS) method is proposed to monitor and control soil parameters. This approach is designed to detect increases or deviations in soil parameter quantities. A Tabu search approach was used to select the appropriate kernel parameter. Subsequently, soil analyses were conducted to evaluate the performance of the developed techniques. The simulation results were analyzed and compared. Through this study, deficiencies or exceedances in soil parameter quantities can be identified. The proposed method involves determining whether each soil parameter falls within a normal range. This allows for the assessment of soil parameter conditions based on the principle of fault detection.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Systems security</kwd>
<kwd>soil analyses</kwd>
<kwd>kernel partial least squares (KPLS)</kwd>
<kwd>optimized reduced kernel partial least squares (ORKPLS)</kwd>
<kwd>tabu search</kwd>
<kwd>process monitoring</kwd>
<kwd>machine learning</kwd>
<kwd>fault detection (FD)</kwd>
</kwd-group>
<funding-group>
<award-group id="awg1">
<funding-source>Deputyship for Research and Innovation, Ministry of Education in Saudi Arabia</funding-source>
<award-id>0226-1443-S</award-id>
</award-group>
</funding-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>Ensuring a healthy environment, access to green spaces, and a nutritious diet are among the key necessities for well-being. To maintain control over our living conditions, it is critical to protect our environment from harmful chemicals and the negative effects predominantly found in the soil [<xref ref-type="bibr" rid="ref-1">1</xref>]. Therefore, the objective of this study was to control soil quality, focusing on the parameters that significantly impact plant nutrition [<xref ref-type="bibr" rid="ref-2">2</xref>]. Machine learning applications in agriculture can be divided into four primary areas: soil, water, crop, and livestock management. In [<xref ref-type="bibr" rid="ref-3">3</xref>], the authors used an optimized extreme learning machine to predict and classify soil attributes. Various machine learning techniques, such as random forests, extreme learning machines, and support vector machines, have been utilized in the study of water management [<xref ref-type="bibr" rid="ref-4">4</xref>]. Crop management, which is crucial for farmers, has benefited from numerous machine-learning techniques aimed at enhancing crop quality and productivity. Additionally, machine learning techniques have been extensively applied to support livestock production and improve animal welfare.</p>
<p>The presence of plants in our environment is an essential component of human well-being. Proper care of plants ensures the provision of healthy nutrition and air quality. The quantities of products added to and found in the soil must be carefully controlled. If the quantity of elements in the soil is insufficient, the plants will be of low quality. Conversely, if the quantity is excessive, which is the focus of this study, it presents several challenges. To properly manage agricultural processes and maintain an optimal environment for plants, the condition of the soil must be adequately controlled. The objective of this study is to monitor and control the levels of soil parameters. By employing the proposed method and analyzing measured soil data, we aim to diagnose these observations and maintain an optimal agricultural environment.</p>
<p>The issues of very high or even low quantities generate challenges for producers, impacting yields and crop rotation options. For the majority of crops, controlling and monitoring the quantities of soil parameters optimizes plant growth and improves crop competitiveness. Thus, monitoring the quantities of soil parameters ensures that a product that complies with standards and preserves the environment and safety of trees is obtained. In this case, soil that receives or contains a large quantity of chemical products could represent a danger to human health. Therefore, the objective of this study was to control soil quality and monitor the quantities of critical parameters in the soil [<xref ref-type="bibr" rid="ref-5">5</xref>]. The study area was located in the regional unit of Grevena in northern Greece. This dataset can be applied to assess soil conditions for various tasks.</p>
<p>To effectively monitor soil quality and ensure an outstanding agricultural season, it is imperative to properly control and identify all quantities that exceed the established standards. Several methods for detection and control can be found in the literature [<xref ref-type="bibr" rid="ref-6">6</xref>&#x2013;<xref ref-type="bibr" rid="ref-8">8</xref>]. The kernel method plays an interesting role in fault detection and system monitoring. In fact, multivariate statistical process methods have had great success owing to their efficiency and simplification of monitoring systems. The general purpose of these techniques is based on the analysis of historical system data from a database to model and study relationships between variables. Kernel Partial Least Squares (KPLS) is an extension approach that has been suggested for nonlinear processes [<xref ref-type="bibr" rid="ref-9">9</xref>,<xref ref-type="bibr" rid="ref-10">10</xref>].</p>
<p>The KPLS approach addresses the challenge of eigenvalues by leveraging its kernel matrix. Consequently, this method finds widespread application in the domain of fault detection for nonlinear, large-scale, and complex industrial systems. However, owing to the large amount of data studied, the KPLS method presents some limitations in the fault detection and monitoring procedure of this type of system. Precisely, the number of selected latent variables was large in the KPLS method, which resulted in a progressive increase in computation time throughout the identification step of the KPLS monitoring model.</p>
<p>The KPLS method demonstrates elegance and efficiency in developing nonlinear systems compared to other nonlinear techniques. However, these properties render the KPLS method a highly appealing approach for monitoring nonlinear systems. Nevertheless, two significant challenges have been identified concerning the application of conventional KPLS for monitoring nonlinear processes:
<list list-type="bullet">
<list-item>
<p>Determine the optimal parameter for the detection index.</p></list-item>
<list-item>
<p>Size of memory and computation time, which gradually increases with the amount of training data for large-scale systems.</p></list-item>
</list></p>
<p>The first step is to use the reduced RKPLS method, which involves reducing the number of training data. This approach processes only the observations containing essential information, resulting in a smaller kernel matrix. In this way, we address one of the major challenges presented by the KPLS method. The KPLS method allows us to select a reduced model that presents only the important data regarding system behavior. As a second step, to obtain the optimal version, we propose an optimal method that combines the RKPLS approach with the Tabu search algorithm. Consequently, an Optimized Reduced Kernel Partial Least Squares (ORKPLS) approach is proposed, which involves identifying the set of measurement observations that capture the most informative components of the system. To achieve the objectives of monitoring and control, the ORKPLS approach is proposed to predict soil parameter concentrations and help understand changes in soil quality networks. In this study, a comparative analysis of the detection performance of static methods was conducted.</p>
<p>The proposed ORKPLS method presents a very important principle. Thus, the ORKPLS method is valid and updates the reduced model if and only if:
<list list-type="bullet">
<list-item>
<p>A measurement without faults.</p></list-item>
<list-item>
<p>A measurement that is important and rich in information on the system operation using mainly optimal detection indices.</p></list-item>
</list></p>
<p>To increase the detection performance of the KPLS and ORKPLS approaches, we use the index Squared Prediction Error (SPE) to detect any anomalies and faults in the systems [<xref ref-type="bibr" rid="ref-11">11</xref>]. To effectively select the kernel parameter, we propose an optimized RKPLS model using a tabu search algorithm. This study presents a comparative analysis of the detection performance of the proposed techniques. We evaluated the detection methods using performance metrics including the False Alarm Rate, Good Detection Rate, and Computation Time [<xref ref-type="bibr" rid="ref-12">12</xref>,<xref ref-type="bibr" rid="ref-13">13</xref>].</p>
<p>The remainder of this paper is structured as follows. <xref ref-type="sec" rid="s2">Section 2</xref> outlines the principles of KPLS and the proposed ORKPLS approach. <xref ref-type="sec" rid="s3">Sections 3</xref> and <xref ref-type="sec" rid="s4">4</xref> evaluate the performance of the proposed ORKPLS approach and other kernel-based techniques. Finally, <xref ref-type="sec" rid="s5">Section 5</xref> concludes the study.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Detection Methods</title>
<p>Monitoring algorithms are crucial for ensuring the safety of both systems and nature. Several detection methods have been suggested in the literature [<xref ref-type="bibr" rid="ref-14">14</xref>,<xref ref-type="bibr" rid="ref-15">15</xref>]. Currently, these methods are primarily used to protect nature and maintain human health. This section describes the fault detection functions using the KPLS method [<xref ref-type="bibr" rid="ref-16">16</xref>] and the proposed ORKPLS method.</p>
<sec id="s2_1">
<label>2.1</label>
<title>KPLS Method for Fault Detection</title>
<p>The PLS (Partial Least Squares) approach presents a vector set extension called the latent components of the input and output measurement space to finally construct a linear multivariate regression model. In this case, the input and output measurements are as follows:
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mrow><mml:mtext>in</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>.</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>.</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>m</mml:mi></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>Y</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>.</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>.</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>J</mml:mi></mml:mrow></mml:msup></mml:math></disp-formula></p>
<p>Indeed, given an input matrix <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mrow><mml:mtext>in</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>m</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> containing <italic>N</italic> measurements with <italic>m</italic> process variables and an output matrix <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>Y</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>J</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> including <italic>N</italic> measurements with <italic>J</italic> quality variables. Thus, the main PLS approach projects and processes the input and output matrices into a low-dimensional space with <italic>L</italic> of latent variables. The PLS approach presents the <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mrow><mml:mtext>in</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>Y</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> (input/output) matrices by:
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mrow><mml:mtext>in</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>T</mml:mi><mml:mspace width="0pt" /><mml:msup><mml:mi>S</mml:mi><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:mi>E</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>Y</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>U</mml:mi><mml:mspace width="0pt" /><mml:msup><mml:mi>H</mml:mi><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:mi>F</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /></mml:math></disp-formula>where <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:mi>S</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mtable columnalign="center center center center" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mtd><mml:mtd><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mtd><mml:mtd><mml:mo>&#x2026;</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:mi>H</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mtable columnalign="center center center center" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mtd><mml:mtd><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mtd><mml:mtd><mml:mo>&#x2026;</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> are the loadings for <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mrow><mml:mtext>in</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>Y</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, respectively. Then, matrices <italic>E</italic> and <italic>F</italic> are the PLS residuals corresponding to the input matrix <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mrow><mml:mtext>in</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> and output matrix <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>Y</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>.</p>
<p>However, the PLS method has a linear structure, whereas real processes have a nonlinear structure. Therefore, the PLS method is limited to nonlinear systems. Several techniques have been proposed for this purpose. In fact, among the trends and popular approaches, the KPLS method has been found.</p>
<p>The KPLS approach is known as a kernel matrix named mainly by the Gram matrix which consists of constructing and presenting nonlinear latent components or variables with an approximately linear calculation cost. Thus, the basic concept is to determine and transform the observations, characterized by inputs/outputs, into feature space F, as shown in the following equation:
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:mi mathvariant="normal">&#x0393;</mml:mi><mml:mo>&#x003A;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mi mathvariant="normal">&#x0393;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:mi>F</mml:mi></mml:math></disp-formula></p>
<p>Therefore, the KPLS technique is determined in the traditional PLS feature space in its nonlinear kernel form. In this case, we could not compute the nonlinear transformation of each measurement from the batch system. To surpass this issue, the Mercer kernel <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:mi>k</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mo>.</mml:mo><mml:mo>,</mml:mo><mml:mo>.</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is used:
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mi>k</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>&#x27E8;</mml:mo><mml:mi mathvariant="normal">&#x0393;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi mathvariant="normal">&#x0393;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x27E9;</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi mathvariant="normal">&#x0393;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mi mathvariant="normal">&#x0393;</mml:mi><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup></mml:math></disp-formula></p>
<p>In this case, <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:mi mathvariant="normal">&#x0393;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mi>Z</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>, <italic>i</italic> &#x003D; 1, &#x2026;, <italic>N</italic> and <italic>Z</italic> is the dimension of feature space. The exigency of the kernel function verifies Mercer&#x2019; s theorem. Based to <xref ref-type="disp-formula" rid="eqn-4">Eq. (4)</xref>, the Gram matrix <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:mi>K</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>N</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> can be computed by:
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mi>K</mml:mi><mml:mo>=</mml:mo><mml:mi mathvariant="normal">&#x0393;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mi mathvariant="normal">&#x0393;</mml:mi><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup></mml:math></disp-formula>where <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:mi mathvariant="normal">&#x0393;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mtable columnalign="center center center" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mi mathvariant="normal">&#x0393;</mml:mi><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mi mathvariant="normal">&#x0393;</mml:mi><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></p>
<p>Most kernel functions that regularly used have been are presented in the literature [<xref ref-type="bibr" rid="ref-17">17</xref>]. Thus, different kernel functions are presented and determined in the following forms:
<list list-type="bullet">
<list-item>
<p>Polynomial kernel: <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mi>k</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mo>&#x27E8;</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>&#x27E9;</mml:mo></mml:mrow><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula></p></list-item>
<list-item>
<p>Sigmoid kernel: <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:mi>k</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>tanh</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>&#x27E8;</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>&#x27E9;</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></p></list-item>
<list-item>
<p>Radial Basis Function (RBF): <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:mi>k</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msup><mml:mfrac><mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo><mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>t</mml:mi><mml:mo symmetric="true">&#x2016;</mml:mo></mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:msup><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:mfrac><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> where <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:mi>p</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:mi>&#x03BC;</mml:mi></mml:math></inline-formula> are determined using metaheuristic method.</p></list-item>
</list></p>
<p>The Gram matrix <italic>K</italic> is centered using equation <xref ref-type="disp-formula" rid="eqn-6">Eq. (6)</xref>:
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:mi>K</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>n</mml:mi></mml:mfrac><mml:msub><mml:mn>1</mml:mn><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:msubsup><mml:mn>1</mml:mn><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow><mml:mi>K</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>n</mml:mi></mml:mfrac><mml:msub><mml:mn>1</mml:mn><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:msubsup><mml:mn>1</mml:mn><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>denoted by <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:msub><mml:mn>1</mml:mn><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mtable columnalign="center center center center" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mn>1</mml:mn></mml:mtd><mml:mtd><mml:mo>&#x2026;</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mn>1</mml:mn><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mtd><mml:mtd><mml:msub><mml:mn>1</mml:mn><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> and <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mtable columnalign="center center center center center" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mn>1</mml:mn></mml:mtd><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mn>0</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mn>1</mml:mn></mml:mtd><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mn>0</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mn>0</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mn>1</mml:mn></mml:mtd></mml:mtr></mml:mtable><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>N</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula></p>
<p>The deflation step was computed using the rank-one reduction of <italic>K</italic> and <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>Y</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. Using a new <italic>T</italic> score vector, the <italic>K</italic> and <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>Y</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> matrices were deflated as follows:
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mi>K</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>t</mml:mi><mml:mspace width="thinmathspace" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:msup><mml:mi>t</mml:mi><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mi>K</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>t</mml:mi><mml:mspace width="thinmathspace" /><mml:msup><mml:mi>t</mml:mi><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>K</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>t</mml:mi><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="thinmathspace" /><mml:msup><mml:mi>t</mml:mi><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mo>&#x2212;</mml:mo><mml:mi>K</mml:mi><mml:mspace width="thinmathspace" /><mml:mspace width="0pt" /><mml:mi>t</mml:mi><mml:mspace width="thinmathspace" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:msup><mml:mi>t</mml:mi><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:mi>t</mml:mi><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="thinmathspace" /><mml:msup><mml:mi>t</mml:mi><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mspace width="thinmathspace" /><mml:mi>K</mml:mi><mml:mspace width="thinmathspace" /><mml:mspace width="0pt" /><mml:mi>t</mml:mi><mml:mspace width="thinmathspace" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:msup><mml:mi>t</mml:mi><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mspace width="-12pt" /><mml:mspace width="-12pt" /><mml:mspace width="-12pt" /><mml:mspace width="-12pt" /><mml:mspace width="-12pt" /><mml:mspace width="-12pt" /><mml:mspace width="-12pt" /><mml:mspace width="-12pt" /><mml:mspace width="-12pt" /><mml:mspace width="-12pt" /><mml:mspace width="-12pt" /><mml:mspace width="-12pt" /><mml:mspace width="-12pt" /><mml:mspace width="-12pt" /><mml:msub><mml:mi>Y</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>Y</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>t</mml:mi><mml:mspace width="thinmathspace" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:mspace width="0pt" /><mml:msup><mml:mi>t</mml:mi><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>Y</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>Finally, the KPLS model was determined, after computation the loadings and scores, as:
<disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:mrow><mml:mover><mml:mi>Y</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mo>=</mml:mo><mml:mi>K</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>U</mml:mi><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>T</mml:mi><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mi>K</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>U</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:msup><mml:mi>T</mml:mi><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:msub><mml:mi>Y</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula></p>
<p>The concerning prediction outputs of validation samples can be computed by:
<disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:mrow><mml:mover><mml:mi>Y</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mspace width="thinmathspace" /><mml:mi>U</mml:mi><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>T</mml:mi><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mi>K</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>U</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:msup><mml:mi>T</mml:mi><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:msub><mml:mi>Y</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula>where <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mspace width="thinmathspace" /></mml:math></inline-formula> is the kernel matrix of the validation observations.</p>
<p><italic>Algorithm of Fault Detection</italic></p>
<p>A KPLS algorithm, for nonlinear systems, is presented by Algorithm 1:</p>
<fig id="fig-14">
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_63146-fig-14.tif"/>
</fig>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>Proposed Optimized RKPLS Using Tabu Search Approach</title>
<p>Indeed, significant drawbacks of the KPLS approach emerge as the number of measurements increases. In such cases, computer memory usage and training time become substantial. Although the KPLS method addresses the issue of nonlinearity, the training and computation times present significant challenges when the number of measurements grows.</p>
<p>Therefore, the Optimized Reduced KPLS (ORKPLS) technique is proposed to reduce the maximum number of measurements and select the most informative observations. The primary objective of the ORKPLS method is to retain only the essential data that provide rich information about the system&#x2019;s functioning. This methodology avoids the need to study missing data. Using the data projection principle, out of 781 survey points, approximately 10.49% of the data are retained specifically, the most important and effective data.</p>
<sec id="s2_2_1">
<label>2.2.1</label>
<title>Mathematical Formulation</title>
<p>A kernel approach is a class of algorithms used for pattern analysis, where the core concept involves implicitly mapping input measurements into a high-dimensional feature Hilbert space (see <xref ref-type="fig" rid="fig-1">Fig. 1</xref>). This enables the linear separation of measurements that are not linearly separable in the original space. In the proposed technique, we determine a reduced number of measurements from the <italic>N</italic> available variables in the observation matrix. The best-retained observations represent the <italic>L</italic> latent components.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Principle of kernel methods</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_63146-fig-1.tif"/>
</fig>
<p>The ORKPLS technique approaches each latent component <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:mspace width="thinmathspace" /><mml:msub><mml:mrow><mml:mo>{</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>}</mml:mo></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2026;</mml:mo><mml:mi>P</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> using a transformed input measurement <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:mi mathvariant="normal">&#x0393;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>L</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:msub><mml:mrow><mml:mo>{</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msup><mml:mo>}</mml:mo></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2026;</mml:mo><mml:mi>M</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> which has the maximum projection value in the direction of <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>.</p>
<p>The projection of the vector <inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:mi mathvariant="normal">&#x0393;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>L</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow><mml:mspace width="thinmathspace" /></mml:math></inline-formula> can be computed using <xref ref-type="disp-formula" rid="eqn-10">Eq. (10)</xref>:
<disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:mi mathvariant="normal">&#x0393;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>L</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>k</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>L</mml:mi></mml:math></disp-formula></p>
<p>Then, we project, in this case, all vectors of the transformed measurement <inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:mi mathvariant="normal">&#x0393;</mml:mi><mml:msub><mml:mrow><mml:mo>{</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msup><mml:mo>}</mml:mo></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2026;</mml:mo><mml:mi>M</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> on the latent component <inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and we retain <inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>L</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mrow><mml:mo>{</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msup><mml:mo>}</mml:mo></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2026;</mml:mo><mml:mi>M</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> that satisfies <xref ref-type="disp-formula" rid="eqn-11">Eq. (11)</xref>:
<disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mi mathvariant="normal">&#x0393;</mml:mi><mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>L</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:munder><mml:mo form="prefix">max</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>M</mml:mi></mml:mrow></mml:munder><mml:mi mathvariant="normal">&#x0393;</mml:mi><mml:msub><mml:mrow><mml:mo>{</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msup><mml:mo>}</mml:mo></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi mathvariant="normal">&#x0393;</mml:mi><mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>L</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2260;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo fence="false" stretchy="false">&#x27E8;</mml:mo><mml:mi>&#x03C2;</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:mi>&#x03C2;</mml:mi></mml:math></inline-formula> is the threshold determined.</p>
<p>When the reduced data set <inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:mspace width="thinmathspace" /><mml:msub><mml:mrow><mml:mo>{</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>L</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>}</mml:mo></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2026;</mml:mo><mml:mi>L</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is presented, a downsized measurement matrix is expressed by:
<disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:mtable columnalign="center center center" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>L</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup></mml:mtd><mml:mtd><mml:mtable columnalign="center center" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>L</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup></mml:mtd><mml:mtd><mml:mo>&#x2026;</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:mtd><mml:mtd><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>L</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>L</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup></mml:math></disp-formula></p>
<p>Meanwhile, we obtain a reduced matrix <inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> related to the function <inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:mspace width="thinmathspace" /><mml:mi>K</mml:mi></mml:math></inline-formula> (kernel function), as expressed by the <xref ref-type="disp-formula" rid="eqn-13">Eq. (13)</xref>:
<disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mtable columnalign="center center center" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mi>k</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mo>&#x2026;</mml:mo></mml:mtd><mml:mtd><mml:mi>k</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>L</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd /><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd /></mml:mtr><mml:mtr><mml:mtd /><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd /></mml:mtr><mml:mtr><mml:mtd /><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd /></mml:mtr><mml:mtr><mml:mtd><mml:mi>k</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mo>&#x2026;</mml:mo></mml:mtd><mml:mtd><mml:mi>k</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>L</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mi>L</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>L</mml:mi></mml:mrow></mml:msup></mml:math></disp-formula></p>
<p>In our case, the proposed ORKPLS detection method uses a basic radial kernel and is expressed by:
<disp-formula id="eqn-14"><label>(14)</label><mml:math id="mml-eqn-14" display="block"><mml:mspace width="thinmathspace" /><mml:mi>k</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mfrac><mml:msup><mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mo symmetric="true">&#x2016;</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mrow><mml:mn>2</mml:mn><mml:msup><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:mspace width="thinmathspace" /><mml:mi>&#x03C3;</mml:mi></mml:math></inline-formula> is the width of the Gaussian function.</p>
<p>To choose the kernel parameter accurately, it is necessary to choose the optimization method. Thus, the Tabu Search approach is an optimization algorithm for controlling an integrated heuristic technique. This method has been widely used in several fields [<xref ref-type="bibr" rid="ref-18">18</xref>]. The optimal kernel parameter is almost computed as one that can improve FD (Fault Detection) performance. Therefore, the selection of the <inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:mspace width="thinmathspace" /><mml:mi>&#x03BC;</mml:mi></mml:math></inline-formula> parameter must be treated according to the given application. To minimize the search space by referring to previous literature using the ORKPLS model, it is advised to introduce the constraints of the parameter <inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:mspace width="thinmathspace" /><mml:mi>&#x03BC;</mml:mi></mml:math></inline-formula> which are respectively attributes to the range <inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:mspace width="thinmathspace" /><mml:mi>&#x03BC;</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:msup><mml:mn>2</mml:mn><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>8</mml:mn></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mn>2</mml:mn><mml:mrow><mml:mn>8</mml:mn></mml:mrow></mml:msup><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>.</p>
</sec>
<sec id="s2_2_2">
<label>2.2.2</label>
<title>Algorithm of Fault Detection</title>
<p>Indeed, the main algorithm of the ORKPLS approach is given by Algorithm 2:</p>
<fig id="fig-15">
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_63146-fig-15.tif"/>
</fig>
</sec>
</sec>
<sec id="s2_3">
<label>2.3</label>
<title>Fault Detection Indices</title>
<p>Several indices have been developed for the fault detection stage [<xref ref-type="bibr" rid="ref-13">13</xref>]. In general, statistical methods use Hotelling&#x2019;s <italic>T</italic><sup>2</sup> and the SPE or Q statistic, which are developed and presented in terms of Mahalanobis and Euclidean distances, respectively [<xref ref-type="bibr" rid="ref-19">19</xref>]. <italic>T</italic><sup>2</sup> is given by <xref ref-type="disp-formula" rid="eqn-15">Eq. (15)</xref>, whose principle is based on the projections of the measurements in the feature space to different temporal samples.
<disp-formula id="eqn-15"><label>(15)</label><mml:math id="mml-eqn-15" display="block"><mml:msup><mml:mi>T</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:msup><mml:mi>X</mml:mi><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mover><mml:mi>W</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:msup><mml:mrow><mml:mover><mml:mi mathvariant="normal">&#x039B;</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mover><mml:mi>W</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mi>X</mml:mi></mml:math></disp-formula>where <inline-formula id="ieqn-60"><mml:math id="mml-ieqn-60"><mml:mrow><mml:mover><mml:mi mathvariant="normal">&#x039B;</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mo>=</mml:mo><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>a</mml:mi><mml:mi>g</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mi>L</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>: diagonal matrix of the eigenvalues and <inline-formula id="ieqn-61"><mml:math id="mml-ieqn-61"><mml:mrow><mml:mover><mml:mi>W</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula>: the weights matrix.</p>
<p>The SPE is a fault detection index based on the residual subspace. This index identifies new events for new measurements. For both the KPLS and ORKPLS methods, the SPE index is calculated as the sum of the squares of the residuals. The SPE index is characterized by its sensitivity to model errors and, on the other hand, its dependence on the number of retained components. Therefore, in this paper, we focus on the SPE index, which can be expressed as follows:
<disp-formula id="eqn-16"><label>(16)</label><mml:math id="mml-eqn-16" display="block"><mml:mi>S</mml:mi><mml:mi>P</mml:mi><mml:mi>E</mml:mi><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo><mml:mi>X</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>I</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mover><mml:mi>W</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:msup><mml:mrow><mml:mover><mml:mi>W</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mspace width="thinmathspace" /><mml:mi>X</mml:mi><mml:mo symmetric="true">&#x2016;</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>However, the confidence threshold is presented using <inline-formula id="ieqn-62"><mml:math id="mml-ieqn-62"><mml:msup><mml:mi>&#x03C7;</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula> the distribution.
<disp-formula id="eqn-17"><label>(17)</label><mml:math id="mml-eqn-17" display="block"><mml:mi>S</mml:mi><mml:mi>P</mml:mi><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo fence="false" stretchy="false">&#x27E9;</mml:mo><mml:mi>g</mml:mi><mml:msubsup><mml:mi>&#x03C7;</mml:mi><mml:mrow><mml:mi>h</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>&#x03B1;</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup></mml:math></disp-formula>where <inline-formula id="ieqn-63"><mml:math id="mml-ieqn-63"><mml:mi>g</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>2</mml:mn><mml:mi>b</mml:mi></mml:mrow><mml:mi>a</mml:mi></mml:mfrac></mml:math></inline-formula> and <inline-formula id="ieqn-64"><mml:math id="mml-ieqn-64"><mml:mi>h</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>2</mml:mn><mml:msup><mml:mi>a</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mi>b</mml:mi></mml:mfrac></mml:math></inline-formula></p>
<p><italic>a</italic> is the estimated mean of the <italic>SPE</italic> and <italic>b</italic> is the variance of the <italic>SPE</italic>.</p>
<p>To explain the principle of the above kernel methods. The flowcharts of the KPLS and the proposed OKPLS approaches are presented in <xref ref-type="fig" rid="fig-2">Figs. 2</xref> and <xref ref-type="fig" rid="fig-3">3</xref>.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>The flowchart of the KPLS approach based SPE chart</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_63146-fig-2.tif"/>
</fig><fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>The flowchart of the proposed OKPLS approaches based SPE chart</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_63146-fig-3.tif"/>
</fig>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Soil Analysis</title>
<p>In this paper, we aimed to secure and control soil quality in northern Greece [<xref ref-type="bibr" rid="ref-5">5</xref>]. This study was conducted to verify the impact of soil quality characteristics such as pH (Pondus Hydrogenii), Organic Matter (OM), Electric Conductivity (EC), major elements (N, P, K, Mg), and microelements (Fe, Zn, Mn, Cu, B) on plant nutrition. To ensure high-quality agriculture and promote plant health, 781 survey points were analyzed across the study area, as illustrated in the following figure.</p>
<sec id="s3_1">
<label>3.1</label>
<title>Data Description</title>
<p>The soil data consisted of a set of soil information collected between 2015 and 2019. From each survey point, as shown in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>, 16 soil parameters were measured, resulting in a total of 12,480 data points. The altitude of the study area ranges from 500 m above sea level to 900 m further north, covering approximately 270 km<sup>2</sup>. Finally, the raw data was compiled and stored in an XLSX file. All these results were carried out by the Soil and Water Research Institute (SWRI) by the administrative authorities of the region of West Macedonia, Greece.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>The main study area and survey points in Greece</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_63146-fig-4.tif"/>
</fig>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Value of the Data</title>
<p>The soil quality monitoring network was operational in Thessaloniki, Greece. It is composed of 16 parameters to be monitored and distributed over several sites: pH, OM, EC, CaCO<sub>3</sub>, N-NO<sub>3</sub>, P, K, Mg, Fe, Mn, Zn, Cu, B. The observation vector <italic>x</italic>(<italic>k</italic>) contains 16 monitored variables named <inline-formula id="ieqn-65"><mml:math id="mml-ieqn-65"><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> to <inline-formula id="ieqn-66"><mml:math id="mml-ieqn-66"><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>16</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula>, which corresponds to pH, OM, EC, CaCO<sub>3</sub>, N-NO<sub>3</sub>, P, K, Mg, Fe, Mn, Zn, Cu, B, ad are represented as follows:
<disp-formula id="eqn-18"><label>(18)</label><mml:math id="mml-eqn-18" display="block"><mml:mi>x</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2026;</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>10</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>11</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>12</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2026;</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>14</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>15</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>16</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mspace width="thinmathspace" /><mml:mi>T</mml:mi></mml:mrow></mml:msup></mml:math></disp-formula></p>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Simulation Results</title>
<p>In this section, the proposed fault detection and monitoring strategy is applied to the diagnosis of a soil analysis monitoring network.</p>
<p>The detection performances used in this paper are:
<list list-type="bullet">
<list-item>
<p>False Alarm Rate (FAR)</p></list-item>
</list>
<disp-formula id="eqn-19"><label>(19)</label><mml:math id="mml-eqn-19" display="block"><mml:mi>F</mml:mi><mml:mi>A</mml:mi><mml:mi>R</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>V</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>s</mml:mi><mml:mi>a</mml:mi><mml:mi>m</mml:mi><mml:mi>p</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>F</mml:mi><mml:mi>a</mml:mi><mml:mi>u</mml:mi><mml:mi>l</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>d</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi></mml:mrow></mml:mfrac><mml:mi mathvariant="normal">&#x0025;</mml:mi></mml:math></disp-formula>
<list list-type="bullet">
<list-item>
<p>Good Detection Rate (GDR):</p></list-item>
</list>
<disp-formula id="eqn-20"><label>(20)</label><mml:math id="mml-eqn-20" display="block"><mml:mi>G</mml:mi><mml:mi>D</mml:mi><mml:mi>R</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>f</mml:mi><mml:mi>a</mml:mi><mml:mi>u</mml:mi><mml:mi>l</mml:mi><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>F</mml:mi><mml:mi>a</mml:mi><mml:mi>u</mml:mi><mml:mi>l</mml:mi><mml:mi>t</mml:mi><mml:mi>y</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:mfrac><mml:mi mathvariant="normal">&#x0025;</mml:mi></mml:math></disp-formula>
<list list-type="bullet">
<list-item>
<p>Computation Time (CT)</p></list-item>
</list></p>
<p>In this study, fault detection utilizes the RBF (radial basis function) kernel. Consequently, kernel parameters must be determined based on the reduced dataset size and false alarm rate (FAR) values under normal operating conditions. The optimal values for these parameters are identified using the Tabu search algorithm. In our case, optimality corresponds to a lower FAR and a smaller reduced data matrix size. A total of 781 observations were analyzed: 181 observations served as training data to develop the reduced ORKPLS model, while 600 observations were processed as test data to evaluate the fault detection algorithms. The number of reduced observations is 19, representing 10.49% of the training dataset.</p>
<sec id="s3_3_1">
<label>3.3.1</label>
<title>Fault Detection Based on the KPLS Method</title>
<p>In this section, fault detection performance using the KPLS method is presented. To demonstrate its application, simulated faults are introduced across multiple variables, as depicted in the figures below. The FD results for the KPLS-based SPE method are illustrated in <xref ref-type="fig" rid="fig-5">Fig. 5</xref>. This figure illustrates the temporal progression of SPE indices during a simulated bias fault in the parameter &#x2018; Zn&#x2019; , injected between time steps 250 and 350.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Monitoring faults in the parameter Zn using KPLS method in sample intervals of [250, 350]</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_63146-fig-5.tif"/>
</fig>
<p><xref ref-type="fig" rid="fig-6">Fig. 6</xref> presents the temporal evolution of different SPE indices using the KPLS method. In this case, the bias fault was between times 300 and 500 for the &#x2018;pH&#x2019; parameter.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Monitoring faults in the parameter pH using KPLS method in sample intervals of [300, 500]</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_63146-fig-6.tif"/>
</fig>
</sec>
<sec id="s3_3_2">
<label>3.3.2</label>
<title>Fault Detection Based on the Proposed ORKPLS Method</title>
<p>This section presents the fault detection phase using the developed ORKPLS method. The following figures present show the detection performance using the SPE index for the ORKPLS method. The FD results of the ORKPLS-based SPE method are illustrated in <xref ref-type="fig" rid="fig-7">Fig. 7</xref>. This figure presents the temporal evolution of different SPE indices when injecting a bias fault between times 250 and 350 for the parameter &#x2018;Zn&#x2019;.</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Monitoring faults in the parameter Zn using ORKPLS method in sample interval of [250, 350]</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_63146-fig-7.tif"/>
</fig>
<p><xref ref-type="fig" rid="fig-8">Fig. 8</xref> presents the temporal evolution of the different SPE indices using the RKPLS method. In this case, the bias fault was between times 300 and 500 for the &#x2018;pH&#x2019; parameter.</p>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>Monitoring faults in the parameter pH using ORKPLS method in sample interval of [300, 500]</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_63146-fig-8.tif"/>
</fig>
<p>From the results obtained using the KPLS and proposed ORKPLS methods, we observe that the defects were well detected with a high good detection rate (GDR), nearly 100%. Regarding the rate of false alarms, the KPLS method produced a FAR of 6.4 for the defect related to the Zn parameter and a FAR of 7.5 for the pH parameter. In contrast, the ORKPLS method demonstrated minimal FAR compared to the other methods, with FARs of 2.8 and 3.25 for the Zn and pH parameters, respectively.</p>
<p><xref ref-type="fig" rid="fig-9">Figs. 9</xref>&#x2013;<xref ref-type="fig" rid="fig-11">11</xref> show the experimental results of the proposed ORKPLS, KPLS, Reduced Kernel Principal Component Analysis (RKPCA) and KPCA techniques. We note that the proposed OKPLS presents a higher performance compared to other techniques.</p>
<fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>FAR performance for proposed ORKPLS, KPLS, RKPCA and KPCA methods</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_63146-fig-9.tif"/>
</fig><fig id="fig-10">
<label>Figure 10</label>
<caption>
<title>GDR performance for proposed ORKPLS, KPLS, RKPCA and KPCA methods</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_63146-fig-10.tif"/>
</fig><fig id="fig-11">
<label>Figure 11</label>
<caption>
<title>CT performance for proposed ORKPLS, KPLS, RKPCA and KPCA methods</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_63146-fig-11.tif"/>
</fig>
<p><xref ref-type="table" rid="table-1">Table 1</xref> summarizes the detection performance of several soil parameters, using the proposed ORKPLS, KPLS, RKPCA, and KPCA detection methods.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Summary of good detection rates, false alarm rates, and computation time for soil data</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th rowspan="2">Parameters</th>
<th colspan="3">KPLS</th>
<th colspan="3">Proposed ORKPLS</th>
<th colspan="3">KPCA</th>
<th colspan="3">RKPCA</th>
</tr>
<tr>
<th>FAR%</th>
<th>GDR%</th>
<th>CT%</th>
<th>FAR%</th>
<th>GDR%</th>
<th>CT%</th>
<th>FAR%</th>
<th>GDR%</th>
<th>CT%</th>
<th>FAR%</th>
<th>GDR%</th>
<th>CT%</th>
</tr>
</thead>
<tbody>
<tr>
<td>OM</td>
<td>8</td>
<td>99</td>
<td>3.4</td>
<td>2.9</td>
<td>99</td>
<td>1.7</td>
<td>4</td>
<td>98</td>
<td>3.2</td>
<td>3.6</td>
<td>99</td>
<td>2.8</td>
</tr>
<tr>
<td>EC</td>
<td>6.2</td>
<td>100</td>
<td>3.43</td>
<td></td>
<td>100</td>
<td>1.7</td>
<td>3.2</td>
<td>100</td>
<td>3.5</td>
<td>2.84</td>
<td>100</td>
<td>2.8</td>
</tr>
<tr>
<td>CaCO<sub>3</sub></td>
<td>5.44</td>
<td>100</td>
<td>3.43</td>
<td></td>
<td>100</td>
<td>1.7</td>
<td>4</td>
<td>99</td>
<td>3.2</td>
<td>2.44</td>
<td>100</td>
<td>2.8</td>
</tr>
<tr>
<td>N-NO<sub>3</sub></td>
<td>6.49</td>
<td>100</td>
<td>3.4</td>
<td></td>
<td>100</td>
<td>1.71</td>
<td>3</td>
<td>100</td>
<td>4.3</td>
<td>2.78</td>
<td>100</td>
<td>2.8</td>
</tr>
<tr>
<td>Mg</td>
<td>6.25</td>
<td>99</td>
<td>3.4</td>
<td></td>
<td>100</td>
<td>1.65</td>
<td>3.8</td>
<td>99</td>
<td>6</td>
<td>3.2</td>
<td>100</td>
<td>2.8</td>
</tr>
<tr>
<td>Fe</td>
<td>8.96</td>
<td>98</td>
<td>3.46</td>
<td></td>
<td>100</td>
<td>1.7</td>
<td>4.22</td>
<td>99</td>
<td>2.6</td>
<td>4.32</td>
<td>100</td>
<td>2.8</td>
</tr>
<tr>
<td>Mn</td>
<td>7.96</td>
<td>100</td>
<td>3.4</td>
<td></td>
<td>100</td>
<td>1.69</td>
<td>3.8</td>
<td>99</td>
<td>3.3</td>
<td>2.96</td>
<td>100</td>
<td>2.8</td>
</tr>
<tr>
<td>Cu</td>
<td>9</td>
<td>100</td>
<td>3.4</td>
<td></td>
<td>100</td>
<td>1.7</td>
<td>7</td>
<td>100</td>
<td>3</td>
<td>5.3</td>
<td>100</td>
<td>2.8</td>
</tr>
<tr>
<td>B</td>
<td>5.99</td>
<td>99</td>
<td>3.4</td>
<td></td>
<td>99</td>
<td>1.7</td>
<td>4</td>
<td>97</td>
<td>3</td>
<td>2.26</td>
<td>98</td>
<td>2.8</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>As can be seen in <xref ref-type="table" rid="table-1">Table 1</xref>, all four methods can detect defects well with high detection rates. On the other hand, we notice that the proposed ORKPLS method has a minimal false alarm rate compared to the other techniques.</p>

<p>According to <xref ref-type="table" rid="table-1">Table 1</xref>, the ORKPLS method presents good results compared to other methods thanks firstly to the Tabu search method which allows to determine the parameters and the optimal indices of the kernel matrix which presents the most important axis for the detection of defects. On the other hand, the ORKPLS method allows treating just the important data and is rich in information. Thanks to this step, we obtain good performances in terms of FAR and calculation time. Thus, according to several researchers, the KPLS method presents by nature good performances in the detection of defects. Thus, by using the principles of reduction and optimization, the proposed method ORKPLS shows its effectiveness compared to other methods. This proposed method is essentially to monitor the state and environmental impact on the soil. As soon as the soil parameter rate increases through the proposed ORKPLS method, any environmental change that influences the soil parameters is easily detected.</p>

</sec>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>The Air Quality Monitoring Network (AIRLOR)</title>
<p>To further demonstrate the effectiveness of the proposed ORKPLS method, we will use another database that consists of determining air quality. The air quality monitoring network (AIRLOR) installed in Lorraine, (France) consists of 20 stations located essentially and mainly in rural, peri-urban, and urban sites [<xref ref-type="bibr" rid="ref-20">20</xref>]. The input data matrix contains 18 variables, which contain the ozone concentration O<sub>3</sub>, NO, and NO<sub>2</sub>, respectively, named <inline-formula id="ieqn-67"><mml:math id="mml-ieqn-67"><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> to <inline-formula id="ieqn-68"><mml:math id="mml-ieqn-68"><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>18</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> of each station.
<disp-formula id="eqn-21"><label>(21)</label><mml:math id="mml-eqn-21" display="block"><mml:mi>x</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:munder><mml:mrow><mml:munder><mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x23DF;</mml:mo></mml:munder></mml:mrow><mml:mrow><mml:mi>S</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:munder><mml:mo>&#x2026;</mml:mo><mml:munder><mml:mrow><mml:munder><mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>10</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>11</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>12</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x23DF;</mml:mo></mml:munder></mml:mrow><mml:mrow><mml:mi>S</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:munder><mml:mo>&#x2026;</mml:mo><mml:munder><mml:mrow><mml:munder><mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>16</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>17</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>18</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x23DF;</mml:mo></mml:munder></mml:mrow><mml:mrow><mml:mi>S</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mn>6</mml:mn></mml:mrow></mml:munder><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup></mml:math></disp-formula></p>
<p>The RBF kernel values are used, and the optimal parameter of the kernel function is computed using the TS (Tabu Search) algorithm. Then, 500 samples were collected from the AIRLOR system to prove the performance of the ORKPLS method. One bias fault is introduced. The Fault is an additive fault by adding 30% of the standard <inline-formula id="ieqn-69"><mml:math id="mml-ieqn-69"><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> variation from station <inline-formula id="ieqn-70"><mml:math id="mml-ieqn-70"><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula>, between observations 250 and 350. To evaluate the obtained results, <xref ref-type="fig" rid="fig-12">Figs. 12</xref> and <xref ref-type="fig" rid="fig-13">13</xref> depict the fault detection results of the KPLS method and the ORKPLS-based SPE technique.</p>
<fig id="fig-12">
<label>Figure 12</label>
<caption>
<title>Monitoring faults in the parameter ozone <inline-formula id="ieqn-71"><mml:math id="mml-ieqn-71"><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> using KPLS method</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_63146-fig-12.tif"/>
</fig><fig id="fig-13">
<label>Figure 13</label>
<caption>
<title>Monitoring faults in the parameter ozone <inline-formula id="ieqn-72"><mml:math id="mml-ieqn-72"><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> using ORKPLS method</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_63146-fig-13.tif"/>
</fig>
<p>The following <xref ref-type="table" rid="table-2">Table 2</xref> summarizes the detection performance for several soil parameters, using proposed ORKPLS, KPLS, RKPCA, and KPCA detection methods for the AIRLOR process to verify the effectiveness of the proposed method.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Summary of good detection rates, false alarm rates, and computation time for AIRLOR process</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th rowspan="2">Parameters</th>
<th colspan="3">KPLS</th>
<th colspan="3">Proposed ORKPLS</th>
<th colspan="3">KPCA</th>
<th colspan="3">RKPCA</th>
</tr>
<tr>
<th>FAR%</th>
<th>GDR%</th>
<th>CT%</th>
<th>FAR%</th>
<th>GDR%</th>
<th>CT%</th>
<th>FAR%</th>
<th>GDR%</th>
<th>CT%</th>
<th>FAR%</th>
<th>GDR%</th>
<th>CT%</th>
</tr>
</thead>
<tbody>
<tr>
<td>NO<sub>2</sub></td>
<td>17.77</td>
<td>94</td>
<td>0.33</td>
<td>5.33</td>
<td>98</td>
<td>0.311</td>
<td>16</td>
<td>98</td>
<td>2.2</td>
<td>7.6</td>
<td>98</td>
<td>1.8</td>
</tr>
<tr>
<td>O<sub>3</sub></td>
<td>10.44</td>
<td>84</td>
<td>0.33</td>
<td>3.77</td>
<td>100</td>
<td>0.14</td>
<td>12</td>
<td>95</td>
<td>2.5</td>
<td>5.01</td>
<td>100</td>
<td>1.8</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>From these results, we notice that the proposed ORKPLS method presents good capabilities for fault detection. The proposed method proves its effectiveness with another database. In this case, using real data, the ORKPLS method presents good results in terms of false alarm rate, as well as the computation time thanks to the observation reduction principle and the choice of optimal parameter. The proposed method can be applied firstly for several types of databases and, secondly a large number of observations. Their profitability is dedicated firstly to the principle of observation reduction and keeping only useful and relevant information. Thus, the choice of optimal kernel parameters with taboo search improves the detection quality. From the results obtained, it is noted that the proposed ORKPLS method essentially presents a minimal false alarm rate compared to the RKPCA, KPCA method, and even compared to the classical KPLS method, which are methods developed in the literature. It is also noted that the proposed method has a minimal calculation time, thanks to the principle of parameter reduction and optimization, compared to the methods developed in the literature (KPLS, KPCA, RKPCA). Thus, the proposed method has an acceptable detection rate compared to the method developed in the literature.</p>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusion</title>
<p>Soil safety and agriculture are critical for ensuring good health. This study presents four kernel methods for fault detection aimed at controlling soil parameters, with faults being detected as soon as values exceed their normal range. We note that the proposed ORKPLS method demonstrates strong fault detection performance. Specifically, the developed ORKPLS approach shows a minimal false alarm rate compared to the other methods. To properly manage the environment and ensure the quality of agricultural soil, we used the ORKPLS method to monitor soil parameters and intervene as necessary. Based on real data collected from the soil, it can be concluded that the ORKPLS approach is effective in detecting faults when parameter quantities exceed their normal range. This method is capable of detecting potential excesses of necessary products for any soil type at any time. Currently, the proposed ORKPLS method is designed for offline scenarios. However, to monitor soil parameters in real-time, the algorithm must be adapted to detect anomalies affecting the soil&#x2019;s chemical characteristics. For future work, a dynamic version of the ORKPLS method could be explored to enable online detection of soil parameters and facilitate timely decision-making.</p>
</sec>
</body>
<back>
<ack>
<p>The authors extend their appreciation to the Deputyship for Research and Innovation, Ministry of Education in Saudi Arabia for funding this research work through the project number (0226-1443-S).</p>
</ack>
<sec>
<title>Funding Statement</title>
<p>This work was supported by the Deputyship for Research and Innovation, Ministry of Education in Saudi Arabia for funding this research work through the project number (0226-1443-S).</p>
</sec>
<sec>
<title>Author Contributions</title>
<p>The authors confirm contribution to the paper as follows: study conception and design: Khaoula Ben Abdellafou, Kamel Zidi; draft manuscript preparation: Khaoula Ben Abdellafou, Kamel Zidi; funding acquisition and supervision: Ahamed Aljuhani, Okba Taouali, Mohamed Faouzi Harkat. All authors reviewed the results and approved the final version of the manuscript.</p>
</sec>
<sec sec-type="data-availability">
<title>Availability of Data and Materials</title>
<p>Data available on request from the authors. The data that support the findings of this study are available from the Corresponding Author, Okba Taouali, upon reasonable request.</p>
</sec>
<sec>
<title>Ethics Approval</title>
<p>Not applicable.</p>
</sec>
<sec sec-type="COI-statement">
<title>Conflicts of Interest</title>
<p>The authors declare no conflicts of interest to report regarding the present study.</p>
</sec>
<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>Pozza</surname> <given-names>L</given-names></string-name>, <string-name><surname>Field</surname> <given-names>D</given-names></string-name></person-group>. <article-title>The science of soil security and food security</article-title>. <source>Soil Secur</source>. <year>2020</year>;<volume>1</volume>(<issue>3</issue>):<fpage>100002</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.soisec.2020.100002</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>Amundson</surname> <given-names>R</given-names></string-name>, <string-name><surname>Berhe</surname> <given-names>A</given-names></string-name>, <string-name><surname>Asefaw</surname> <given-names>H</given-names></string-name>, <string-name><surname>Jan</surname> <given-names>W</given-names></string-name>, <string-name><surname>Olson</surname> <given-names>C</given-names></string-name>, <string-name><surname>Sztein</surname> <given-names>A</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Soil and human security in the 21st century</article-title>. <source>Science</source>. <year>2015</year>;<volume>348</volume>(<issue>6235</issue>):<fpage>1</fpage>&#x2013;<lpage>8</lpage>. doi:<pub-id pub-id-type="doi">10.1126/science.1261071</pub-id>; <pub-id pub-id-type="pmid">25954014</pub-id></mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Suchithra</surname> <given-names>MS</given-names></string-name>, <string-name><surname>Pai</surname> <given-names>ML</given-names></string-name></person-group>. <article-title>Improving the prediction accuracy of soil nutrient classification by optimizing extreme learning machine parameters</article-title>. <source>Inf Process Agric</source>. <year>2020</year>;<volume>7</volume>(<issue>1</issue>):<fpage>72</fpage>&#x2013;<lpage>82</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.inpa.2019.05.003</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>Zhu</surname> <given-names>M</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>J</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>X</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>L</given-names></string-name>, <string-name><surname>Ren</surname> <given-names>H</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>A review of the application of machine learning in water quality evaluation</article-title>. <source>Eco-Environ Health</source>. <year>2022</year>;<volume>1</volume>(<issue>2</issue>):<fpage>107</fpage>&#x2013;<lpage>16</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.eehl.2022.06.001</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>Tziachris</surname> <given-names>P</given-names></string-name>, <string-name><surname>Aschonitis</surname> <given-names>V</given-names></string-name>, <string-name><surname>Metaxa</surname> <given-names>E</given-names></string-name>, <string-name><surname>Bountla</surname> <given-names>A</given-names></string-name></person-group>. <article-title>A soil parameter dataset collected by agricultural farms in northern Greece</article-title>. <source>Data Brief</source>. <year>2022</year>;<volume>43</volume>(<issue>1</issue>):<fpage>108408</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.dib.2022.108408</pub-id>; <pub-id pub-id-type="pmid">35799851</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>Hamrouni</surname> <given-names>I</given-names></string-name>, <string-name><surname>Lahdhiri</surname> <given-names>H</given-names></string-name>, <string-name><surname>Abdellafou</surname> <given-names>K</given-names></string-name>, <string-name><surname>Taouali</surname> <given-names>O</given-names></string-name></person-group>. <article-title>Fault detection of uncertain nonlinear process using reduced interval kernel principal component analysis (RIKPCA)</article-title>. <source>Int J Adv Manuf Technol</source>. <year>2022</year>;<volume>106</volume>(<issue>9&#x2013;10</issue>):<fpage>4567</fpage>&#x2013;<lpage>76</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s00170-019-04889-3</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>Guo</surname> <given-names>F</given-names></string-name>, <string-name><surname>Xu</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Ma</surname> <given-names>H</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>X</given-names></string-name>, <string-name><surname>Gao</surname> <given-names>L</given-names></string-name></person-group>. <article-title>On optimizing hyperspectral inversion of soil copper content by kernel principal component analysis</article-title>. <source>Remote Sens</source>. <year>2024</year>;<volume>16</volume>(<issue>16</issue>):<fpage>2914</fpage>. doi:<pub-id pub-id-type="doi">10.3390/rs16162914</pub-id>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Ma</surname> <given-names>C</given-names></string-name></person-group>. <article-title>Fault diagnosis of nonlinear processes using multiscale KPCA and multiscale KPLS</article-title>. <source>Chem Eng Sci</source>. <year>2011</year>;<volume>66</volume>(<issue>1</issue>):<fpage>64</fpage>&#x2013;<lpage>72</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.ces.2010.10.008</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>Jia</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>Q</given-names></string-name></person-group>. <article-title>Quality-related fault detection approach based on dynamic kernel partial least squares</article-title>. <source>Chem Eng Res Des</source>. <year>2016</year>;<volume>106</volume>(<issue>1</issue>):<fpage>242</fpage>&#x2013;<lpage>52</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.cherd.2015.12.015</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>Liu</surname> <given-names>X</given-names></string-name>, <string-name><surname>Zhou</surname> <given-names>S</given-names></string-name></person-group>. <article-title>Quality-related fault detection based on approximate kernel partial least squares method</article-title>. <source>J Grid Comput</source>. <year>2023</year>;<volume>21</volume>(<issue>2</issue>):<fpage>29</fpage>. doi:<pub-id pub-id-type="doi">10.1007/s10723-023-09670-1</pub-id>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Choi</surname> <given-names>SW</given-names></string-name>, <string-name><surname>Lee</surname> <given-names>C</given-names></string-name>, <string-name><surname>Lee</surname> <given-names>J</given-names></string-name>, <string-name><surname>Park</surname> <given-names>J</given-names></string-name>, <string-name><surname>Lee</surname> <given-names>I</given-names></string-name></person-group>. <article-title>Fault detection and identification of nonlinear processes based on kernel PCA</article-title>. <source>Chemom Intell Lab Syst</source>. <year>2005</year>;<volume>75</volume>(<issue>1</issue>):<fpage>55</fpage>&#x2013;<lpage>67</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.chemolab.2004.05.001</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>Lahdhiri</surname> <given-names>H</given-names></string-name>, <string-name><surname>Said</surname> <given-names>M</given-names></string-name>, <string-name><surname>Abdellafou</surname> <given-names>K</given-names></string-name>, <string-name><surname>Taouali</surname> <given-names>O</given-names></string-name>, <string-name><surname>Harkat</surname> <given-names>MF</given-names></string-name></person-group>. <article-title>Supervised process monitoring and fault diagnosis based on machine learning methods</article-title>. <source>Int J Adv Manuf Technol</source>. <year>2019</year>;<volume>102</volume>(<issue>5&#x2013;8</issue>):<fpage>2321</fpage>&#x2013;<lpage>37</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s00170-019-03306-z</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>Li</surname> <given-names>G</given-names></string-name>, <string-name><surname>Alcala</surname> <given-names>CF</given-names></string-name>, <string-name><surname>Qin</surname> <given-names>SJ</given-names></string-name>, <string-name><surname>Zhou</surname> <given-names>D</given-names></string-name></person-group>. <article-title>Generalized reconstruction-based contributions for output-relevant fault diagnosis with application to the Tennessee Eastman process</article-title>. <source>IEEE Trans Control Syst Technol</source>. <year>2011</year>;<volume>19</volume>(<issue>5</issue>):<fpage>1114</fpage>&#x2013;<lpage>27</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TCST.2010.2071415</pub-id>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Chine</surname> <given-names>W</given-names></string-name>, <string-name><surname>Mellit</surname> <given-names>A</given-names></string-name>, <string-name><surname>Pavan</surname> <given-names>AM</given-names></string-name>, <string-name><surname>Kalogirou</surname> <given-names>SA</given-names></string-name></person-group>. <article-title>Fault detection method for grid-connected photovoltaic plants</article-title>. <source>Renew Energy</source>. <year>2014</year>;<volume>66</volume>:<fpage>99</fpage>&#x2013;<lpage>110</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.renene.2013.11.073</pub-id>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Schein</surname> <given-names>J</given-names></string-name>, <string-name><surname>Bushby</surname> <given-names>S</given-names></string-name>, <string-name><surname>Castro</surname> <given-names>N</given-names></string-name>, <string-name><surname>House</surname> <given-names>JM</given-names></string-name></person-group>. <article-title>A rule-based fault detection method for air handling units</article-title>. <source>Energy Build</source>. <year>2006</year>;<volume>38</volume>(<issue>12</issue>):<fpage>1485</fpage>&#x2013;<lpage>92</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.enbuild.2006.04.014</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>Zina</surname> <given-names>D</given-names></string-name>, <string-name><surname>Jouni</surname> <given-names>S</given-names></string-name>, <string-name><surname>Otto</surname> <given-names>L</given-names></string-name>, <string-name><surname>Tuomas</surname> <given-names>S</given-names></string-name>, <string-name><surname>Satu</surname> <given-names>R</given-names></string-name>, <string-name><surname>Heikki</surname> <given-names>H</given-names></string-name></person-group>. <article-title>KF-PLS: optimizing kernel partial least-squares (K-PLS) with kernel flows</article-title>. <source>Chemom Intell Lab Syst</source>. <year>2024</year>;<volume>254</volume>(<issue>1</issue>):<fpage>105238</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.chemolab.2024.105238</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>Nguyen</surname> <given-names>V</given-names></string-name>, <string-name><surname>Golinval</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Fault detection based on kernel principal component analysis</article-title>. <source>Eng Struct</source>. <year>2010</year>;<volume>32</volume>(<issue>11</issue>):<fpage>3683</fpage>&#x2013;<lpage>91</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.engstruct.2010.08.012</pub-id>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ben</surname> <given-names>AK</given-names></string-name>, <string-name><surname>Hadda</surname> <given-names>H</given-names></string-name>, <string-name><surname>Korbaa</surname> <given-names>O</given-names></string-name></person-group>. <article-title>An improved tabu search meta-heuristic approach for solving scheduling problem with non-availability constraints</article-title>. <source>Arab J Sci Eng</source>. <year>2019</year>;<volume>44</volume>(<issue>4</issue>):<fpage>3369</fpage>&#x2013;<lpage>79</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s13369-018-3525-3</pub-id>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yue</surname> <given-names>H</given-names></string-name>, <string-name><surname>Qin</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Reconstruction-based fault identification using a combined index</article-title>. <source>Ind Eng Chem Res</source>. <year>2001</year>;<volume>40</volume>(<issue>20</issue>):<fpage>4403</fpage>&#x2013;<lpage>14</lpage>. doi:<pub-id pub-id-type="doi">10.1021/ie000141</pub-id>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Harkat</surname> <given-names>MF</given-names></string-name>, <string-name><surname>Mourot</surname> <given-names>G</given-names></string-name>, <string-name><surname>Ragot</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Sensor failure detection of air quality monitoring network</article-title>. <source>IFAC Proc</source>. <year>2000</year>;<volume>33</volume>(<issue>11</issue>):<fpage>529</fpage>&#x2013;<lpage>34</lpage>. doi:<pub-id pub-id-type="doi">10.1016/S1474-6670(17)37413-X</pub-id>.</mixed-citation></ref>
</ref-list>
</back></article>