<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article article-type="research-article" dtd-version="2.3" xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Energy Res.</journal-id>
<journal-title>Frontiers in Energy Research</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Energy Res.</abbrev-journal-title>
<issn pub-type="epub">2296-598X</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">1464389</article-id>
<article-id pub-id-type="doi">10.3389/fenrg.2024.1464389</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Energy Research</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>An approach to model and method for current pattern mining for electricity consumption</article-title>
<alt-title alt-title-type="left-running-head">Zhang et al.</alt-title>
<alt-title alt-title-type="right-running-head">
<ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3389/fenrg.2024.1464389">10.3389/fenrg.2024.1464389</ext-link>
</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname>Zhang</surname>
<given-names>Zhenya</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/2714473/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
<role content-type="https://credit.niso.org/contributor-roles/resources/"/>
<role content-type="https://credit.niso.org/contributor-roles/project-administration/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/funding-acquisition/"/>
<role content-type="https://credit.niso.org/contributor-roles/data-curation/"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Cheng</surname>
<given-names>Hongmei</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<xref ref-type="aff" rid="aff3">
<sup>3</sup>
</xref>
<xref ref-type="corresp" rid="c001">&#x2a;</xref>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
<role content-type="https://credit.niso.org/contributor-roles/resources/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/funding-acquisition/"/>
<role content-type="https://credit.niso.org/contributor-roles/data-curation/"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Wang</surname>
<given-names>Ping</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/formal-analysis/"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Zhang</surname>
<given-names>Shuguang</given-names>
</name>
<xref ref-type="aff" rid="aff4">
<sup>4</sup>
</xref>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
</contrib>
</contrib-group>
<aff id="aff1">
<sup>1</sup>
<institution>Anhui Province Key Laboratory of Intelligent Building and Building Energy Saving</institution>, <institution>Anhui Jianzhu University</institution>, <addr-line>Hefei</addr-line>, <country>China</country>
</aff>
<aff id="aff2">
<sup>2</sup>
<institution>School of Electronic and Information Engineering</institution>, <institution>Anhui Jianzhu University</institution>, <addr-line>Hefei</addr-line>, <country>China</country>
</aff>
<aff id="aff3">
<sup>3</sup>
<institution>School of Economics and Management</institution>, <institution>Anhui Jianzhu University</institution>, <addr-line>Hefei</addr-line>, <country>China</country>
</aff>
<aff id="aff4">
<sup>4</sup>
<institution>Department of Statistics and Finance</institution>, <institution>University of Science and Technology of China</institution>, <addr-line>Hefei</addr-line>, <country>China</country>
</aff>
<author-notes>
<fn fn-type="edited-by">
<p>
<bold>Edited by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/808496/overview">Haris M. Khalid</ext-link>, University of Dubai, United Arab Emirates</p>
</fn>
<fn fn-type="edited-by">
<p>
<bold>Reviewed by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1779041/overview">Fengtao Guang</ext-link>, China University of Geosciences Wuhan, China</p>
<p>
<ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/2029473/overview">Krishna Kumar Mohbey</ext-link>, Central University of Rajasthan, India</p>
</fn>
<corresp id="c001">&#x2a;Correspondence: Hongmei Cheng, <email>hmcheng@mail.ustc.edu.cn</email>
</corresp>
</author-notes>
<pub-date pub-type="epub">
<day>23</day>
<month>01</month>
<year>2026</year>
</pub-date>
<pub-date pub-type="collection">
<year>2024</year>
</pub-date>
<volume>12</volume>
<elocation-id>1464389</elocation-id>
<history>
<date date-type="received">
<day>17</day>
<month>07</month>
<year>2024</year>
</date>
<date date-type="accepted">
<day>21</day>
<month>11</month>
<year>2024</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2026 Zhang, Cheng, Wang and Zhang.</copyright-statement>
<copyright-year>2026</copyright-year>
<copyright-holder>Zhang, Cheng, Wang and Zhang</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p>
</license>
</permissions>
<abstract>
<p>Many studies of intelligent electricity must ascertain the running state of appliances/devices based on the electricity situation of users. In this article, we present the current pattern-based appliance running state identification model (CPARSIM) to identify the running states of appliances based on current online data. Based on frequent online power situation data, current online data sequences can be segmented into some sequence pieces with different lengths. Within the framework of CPARSIM, variable-length pieces of current-state sequences are represented by their univariate regression features, with each sequence piece being treated as one point within the two-dimensional feature space. Considering the relationship between the appliance running state and current-state patterns, the problem of current-state pattern set mining is modeled as a cluster analysis problem within CPARSIM, and the presented approach employs a DBSCAN algorithm-based technique to mine the current-state pattern set. Experimental results show that the DBSCAN algorithm-based approach for the current-state pattern set mining is more effective than the k-means algorithm and the self-organizing map (SOM) neural network.</p>
</abstract>
<kwd-group>
<kwd>current sequence piece</kwd>
<kwd>current state pattern</kwd>
<kwd>univariate regression model</kwd>
<kwd>PSO algorithm</kwd>
<kwd>clustering</kwd>
<kwd>identification</kwd>
</kwd-group>
<counts>
<page-count count="15"/>
</counts>
<custom-meta-wrap>
<custom-meta>
<meta-name>section-at-acceptance</meta-name>
<meta-value>Smart Grids</meta-value>
</custom-meta>
</custom-meta-wrap>
</article-meta>
</front>
<body>
<sec id="s1">
<title>1 Introduction</title>
<p>Electricity is one irreplaceable form of energy in modern production and daily life. Research related to its generation, transmission, storage, and utilization is increasingly the focus of researchers and applications on electric grids, power supply, distribution, renewable energy, and energy efficiency management (<xref ref-type="bibr" rid="B21">Hou et al., 2024</xref>; <xref ref-type="bibr" rid="B14">El-Sayed et al., 2024</xref>; <xref ref-type="bibr" rid="B3">Ahmed et al., 2024</xref>; <xref ref-type="bibr" rid="B28">Naidu et al., 2024</xref>; <xref ref-type="bibr" rid="B16">Gennitsaris et al., 2023</xref>; <xref ref-type="bibr" rid="B18">Hasanvand et al., 2024</xref>; <xref ref-type="bibr" rid="B42">Yang et al., 2024</xref>; <xref ref-type="bibr" rid="B10">Chen et al., 2023</xref>; <xref ref-type="bibr" rid="B24">Kumar et al., 2023a</xref>; <xref ref-type="bibr" rid="B23">Kumar, 2024</xref>; <xref ref-type="bibr" rid="B25">Kumar et al., 2023b</xref>). With the popularization of Internet of Things (IoT) technology, an increasing number of applications and research have focused on precisely monitoring and managing electricity usage processes at the user end (<xref ref-type="bibr" rid="B2">Ahammed et al., 2021</xref>; <xref ref-type="bibr" rid="B1">Abhishek et al., 2021</xref>; <xref ref-type="bibr" rid="B15">Fabricio et al., 2020</xref>; <xref ref-type="bibr" rid="B32">Ramson et al., 2022</xref>; <xref ref-type="bibr" rid="B6">Balakumar et al., 2023</xref>; <xref ref-type="bibr" rid="B36">Solatidehkordi et al., 2023</xref>; <xref ref-type="bibr" rid="B7">Caldera et al., 2023</xref>; <xref ref-type="bibr" rid="B12">&#xc7;imen et al., 2021</xref>; <xref ref-type="bibr" rid="B9">Chen et al., 2020</xref>; <xref ref-type="bibr" rid="B5">Avancini et al., 2021</xref>; <xref ref-type="bibr" rid="B11">Chou and Truong, 2019</xref>; <xref ref-type="bibr" rid="B13">Diawuo et al., 2020</xref>; <xref ref-type="bibr" rid="B34">Saleem et al., 2021</xref>; <xref ref-type="bibr" rid="B35">Sayed et al., 2022</xref>; <xref ref-type="bibr" rid="B31">Rago et al., 2021</xref>; <xref ref-type="bibr" rid="B20">Himeur et al., 2023</xref>; <xref ref-type="bibr" rid="B27">Mohi-Ud-Din et al., 2021</xref>; <xref ref-type="bibr" rid="B30">Priyadharshini et al., 2021</xref>; <xref ref-type="bibr" rid="B38">Ullah et al., 2022</xref>; <xref ref-type="bibr" rid="B43">Zhou et al., 2022</xref>; <xref ref-type="bibr" rid="B44">Zhu et al., 2020</xref>). Currently, most research on electricity consumption on the user demand side is based on features such as voltage, current, power, and other characteristics of appliances. The steady-state analysis, transient analysis, and a combination of both have received attention. Data used in those research works are electricity consumption situation data acquired through smart meters (<xref ref-type="bibr" rid="B5">Avancini et al., 2021</xref>; <xref ref-type="bibr" rid="B30">Priyadharshini et al., 2021</xref>; <xref ref-type="bibr" rid="B40">Wang et al., 2013</xref>; <xref ref-type="bibr" rid="B37">Swindiarto et al., 2018</xref>). Because the time granularity of the observed electricity consumption situation data is relatively large when electricity consumption situations are collected through smart meters, it is insufficient to support the timely identification of the types of appliances in use and their running state. The precise perception and online monitoring of electricity consumption situations on the user side not only can help understand details of the user-side power consumption but can also contribute to enhancing the safety and efficient management of user-side energy (<xref ref-type="bibr" rid="B11">Chou and Truong, 2019</xref>; <xref ref-type="bibr" rid="B29">Phangbertha et al., 2019</xref>; <xref ref-type="bibr" rid="B39">Wang and Zhang, 2022</xref>): On the one hand, the online monitoring and precise perception of electricity consumption situations enable users to promptly monitor the operation state of their appliances and detect any abnormal issues, ensuring the safety of their electricity usage; on the other hand, the online monitoring and precise perception of electricity consumption situations on the user side also contribute to a more accurate understanding of the electricity consumption process, providing detailed evidence for optimizing electricity usage behavior and adjusting electricity consumption habits.</p>
<p>There are two methods for running-state monitoring of electrical appliances. One is intrusive appliance load monitoring (ILM), and the other is nonintrusive appliance load monitoring (NALM). The ILM method generally utilizes devices such as smart plugs to collect data on the electric consumption situation of individual appliances (<xref ref-type="bibr" rid="B11">Chou and Truong, 2019</xref>; <xref ref-type="bibr" rid="B29">Phangbertha et al., 2019</xref>; <xref ref-type="bibr" rid="B39">Wang and Zhang, 2022</xref>; <xref ref-type="bibr" rid="B33">Ridi et al., 2013</xref>; <xref ref-type="bibr" rid="B41">Yan et al., 2019</xref>). The ILM method typically conducts further research based on the current and power data from the electric consumption situation. By analyzing and modeling those data, the ILM method can reveal the electricity consumption patterns of users, electrical load characteristics, and other potential measures for improving energy efficiency (<xref ref-type="bibr" rid="B11">Chou and Truong, 2019</xref>; <xref ref-type="bibr" rid="B39">Wang and Zhang, 2022</xref>). Based on the typical ILM system architecture and commonly used feature extraction and machine learning algorithms in ILM systems, methods based on the K-nearest neighbor algorithm and the Gaussian mixture model (GMM) are used to classify appliances based on smart plugs (<xref ref-type="bibr" rid="B33">Ridi et al., 2013</xref>). This method extracts dynamic features of current data sequences by utilizing the first and second derivatives of the electric data sequence. A household appliance identification algorithm based on the Bayesian classification model is proposed based on the electric consumption situation data collected through smart plugs (<xref ref-type="bibr" rid="B41">Yan et al., 2019</xref>), which can summarize and extract the electricity consumption behavior and energy consumption characteristics of typical household appliances from the load power sequence samples.</p>
<p>The NALM method samples electricity consumption data such as voltage, current, load, or power of the total load at the power entrance. By decomposing the electricity consumption data, the NALM method can infer the operational state of various electrical appliances. In general, NALM utilizes devices such as electric meters for electricity consumption data collection and can be used to monitor and identify individual electrical appliances within households or buildings in time (<xref ref-type="bibr" rid="B17">Hart, 1992</xref>; <xref ref-type="bibr" rid="B22">Kong et al., 2018</xref>; <xref ref-type="bibr" rid="B19">Himeur et al., 2020</xref>; <xref ref-type="bibr" rid="B8">Chen et al., 2022</xref>; <xref ref-type="bibr" rid="B4">Aslan and Nur, 2022</xref>; <xref ref-type="bibr" rid="B26">Liu et al., 2019</xref>). The NALM method can determine the energy consumption of an appliance when the appliance is working within an electrical load by conducting a detailed analysis of the total load current and voltage measured at the power interface (<xref ref-type="bibr" rid="B17">Hart, 1992</xref>).</p>
<p>To offer an improved solution for accurately identifying appliances such as washing machines and dishwashers with diverse modes and varying energy consumption patterns, a novel framework based on hierarchical hidden Markov models (HHMM) is given for modeling the problem of appliance identification (<xref ref-type="bibr" rid="B22">Kong et al., 2018</xref>). An appliance identification system based on the NALM method utilizes multi-scale wavelet transform to extract features from data sequences and employs an integrated bagging tree classifier for data sequence classification (<xref ref-type="bibr" rid="B19">Himeur et al., 2020</xref>), which presents a novel and reliable event detection scheme. Based on the NALM method, a two-stream convolutional neural network (TSCNN) is used to extract temporal and spectral load characteristics from current sequences and perform classification tasks (<xref ref-type="bibr" rid="B8">Chen et al., 2022</xref>). This approach effectively captures and uses the time-domain and frequency-domain features of the load signals for accurate classification. The K-nearest neighbors rule (k-NNR) and support vector machines (SVMs) for load identification are employed to extract ten features on the time domain and the steady state from electrical current sequences (<xref ref-type="bibr" rid="B4">Aslan and Nur, 2022</xref>). Additionally, principal component analysis (PCA) is combined with k-NNR and SVM separately to evaluate the effectiveness of the ten features and select the most useful ones. Meanwhile, S-transform extracts device features and employs an SVM classifier to identify each electrical device (<xref ref-type="bibr" rid="B26">Liu et al., 2019</xref>).</p>
<p>With high-frequency online monitoring of the electricity consumption situation on the user side, this article proposes the current pattern-based appliance running state identification model (CPARSIM) to promptly identify the running state of electrical appliances on the user side. By analyzing the electrical current state, the model can accurately determine the running state of appliances in real time. This approach can enable efficient monitoring and management of user-side electrical appliances. To extract the current patterns corresponding to different running states of electrical appliances from a massive amount of high-frequency monitoring data of user electricity consumption, with definitions of the current transfer state and current steady state, CPARSIM represents each piece of the current sequence using a univariate regression feature. In CPARSIM, each cluster of the entire set of univariate regression features of all current pieces is treated as one current pattern, and the DBSCAN algorithm is used to cluster the univariate regression feature set. In CPARSIM, each current pattern corresponds to a specific running state of an electrical appliance. According to the current state of the univariate regression features of the current piece, CPARSIM asserts the running state of the appliance when the electricity consumption situation is monitored online.</p>
<p>The rest of this article is organized as follows. The univariate regression features of the current sequence piece and its construction methods are presented in <xref ref-type="sec" rid="s2">Section 2</xref>; <xref ref-type="sec" rid="s3">Section 3</xref> proposes a current-state pattern mining method based on the DBSCAN algorithm, and experimental results and analysis are provided in <xref ref-type="sec" rid="s4">Section 4</xref>. Finally, <xref ref-type="sec" rid="s5">Section 5</xref> summarizes the research of the entire article. The main contributions of this article are as follows:<list list-type="simple">
<list-item>
<p>(1) Introducing CPARSIM. We propose the current pattern-based appliance running state identification model (CPARSIM), which enables the identification of running states of electrical appliances using univariate regression features of current pieces and current patterns.</p>
</list-item>
<list-item>
<p>(2) Representing the current sequence piece using a univariate regression model. We utilize a univariate regression feature representation to capture the feature of each piece of the current sequence, allowing for practical analysis and clustering of the current patterns. Due to the occasional data missing in current sequence pieces, the particle swarm optimization (PSO) algorithm is applied to construct the univariate regression features of the current sequence pieces.</p>
</list-item>
<list-item>
<p>(3) Current-state pattern mining based on cluster analysis. To identify the running state of an electrical appliance, a method for acquiring current patterns was designed utilizing the DBSCAN algorithm, which achieved current pattern acquisition through cluster analysis.</p>
</list-item>
</list>
</p>
</sec>
<sec id="s2">
<title>2 Univariate regression feature of current sequence piece</title>
<p>The running state of one electrical appliance often changes from one state to another when the appliance is working. Usually, when the running state of an appliance is in a specific stable condition, the electric consumption data on the power line remain relatively stable. However, when the running state of the appliance changes, the electric consumption data on the power line also change.</p>
<p>If an appliance is running stably, the running state of the appliance is called the steady state. Correspondingly, the online monitoring data sequence of the steady state of the appliance is referred to as the steady-state sequence. As to two adjacent steady states in time of one appliance, the running states of an appliance generally cannot instantaneously transfer from one steady state to the next. In general, the transition requires some time from the first to the next. The data sequence collected at the time interval from the ending of the first steady state to the beginning of the following steady state is referred to as the transfer-state sequence, and the running state of the appliance at that time interval is the transfer state. From the perspective of electricity consumption, the running of an electrical appliance is a continuous transfer process between a steady state and a transfer state. During a steady state, the electrical current of the appliance remains relatively stable. However, the electrical current undergoes variations during the transfer, including momentary peaks or sustained fluctuations. This transfer process reflects the appliance energy consumption and dynamic characteristics under different running states.</p>
<p>The timely identification of the running state of an electrical appliance based on high-frequency current data is a common challenge in appliance running state identification. The CPARSIM framework is depicted in <xref ref-type="fig" rid="F1">Figure 1</xref>.</p>
<fig id="F1" position="float">
<label>FIGURE 1</label>
<caption>
<p>The framework of the current pattern-based appliance state identification model (CPARSIM). <bold>(A)</bold> &#xa3;&#x201d; A&#xa3;&#xa9;; <bold>(B)</bold> &#xa3;&#x201d; B&#xa3;&#xa9;.</p>
</caption>
<graphic xlink:href="fenrg-12-1464389-g001.tif"/>
</fig>
<p>The CPARSIM framework depicted in <xref ref-type="fig" rid="F1">Figure 1</xref> consists of Parts A and B. Part A utilizes high-frequency collected data from historical records to construct a set of current-state patterns. On the other hand, Part B uses the current pattern set built in Part A to perform an online analysis of the current sequence piece, thereby identifying the running state of the appliance. In <xref ref-type="fig" rid="F1">Figure 1</xref>, Module 1 performs a deep analysis of the current sequence, decomposing it into some individual steady-state sequence pieces. Module 2 extracts all current transfer state sequences from the current sequence with the steady-state sequences outputted by Module 1 and the original current sequence as inputs. All current steady-state sequences outputted by Module 1 and current transfer-state sequences outputted by Module 2 are converted into current-state features by Module 3. Module 4 takes the current-state feature set as input and generates the current-state pattern set.</p>
<p>As shown in <xref ref-type="fig" rid="F1">Figure 1</xref>, Module 5 is responsible for storing, querying, and visualizing all current-state patterns. Module 6 generates feature representations for the current sequence pieces. With the construction of the running state identification model based on the current-state pattern set in Model 5, Module 7 identifies the running state of the electrical appliance on the circuit with the output of Model 6 as input.</p>
<p>Changes in the operational state of electrical loads in a circuit can cause rapid alterations in the current sequence state. These rapid changes in the current sequence state can be effectively captured when monitoring user electricity usage patterns at a fine-grained level. Based on this concept, the CPARSIM model first derives feature representations of all current transitional and steady states from the sample dataset. It can then determine the state of the load corresponding to the observed current sequence state based on these feature datasets, thus achieving recognition of the appliance&#x2019;s operational state. This model has a framework structure, and the design and implementation of each module within this structure are topics of interest in related research. Overall, the construction and identification processes of the CPARSIM model are as follows.<list list-type="simple">
<list-item>
<p>a) As shown in Part A of <xref ref-type="fig" rid="F1">Figure 1</xref>, when constructing the feature set of all current steady states, the CPARSIM model first uses Module 1 to extract all steady-state sequence segments from the entire sequence data. Then, Module 2 extracts all steady-state sequence segments from the complete sequence data based on the segments obtained by Module 1. Next, Module 3 performs a feature representation of the current sequence segments constructed by Modules 1 and 2, while Module 4 conducts an in-depth analysis of the feature representation of all current sequence segments to obtain current patterns based on the feature representation. Finally, Module 5 stores and manages all current patterns and provides access support.</p>
</list-item>
<list-item>
<p>b) As shown in Part B of <xref ref-type="fig" rid="F1">Figure 1</xref>, Module 6 first performs a feature representation of the observed current sequence segments when identifying the current state online. Then, Module 7 constructs an identification model for current patterns based on the current pattern set stored in Module 5 and uses the constructed identification model to identify the state of the load corresponding to the online current sequence segment features.</p>
</list-item>
</list>
</p>
<sec id="s2-1">
<title>2.1 Current steady-state sequence and current transition state sequence</title>
<p>Suppose that the current value in the power line at time interval <inline-formula id="inf1">
<mml:math id="m1">
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mtext>&#xa0;</mml:mtext>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula> must be sampled once, where <inline-formula id="inf2">
<mml:math id="m2">
<mml:mrow>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>R</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf3">
<mml:math id="m3">
<mml:mrow>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
<mml:mo>&#x3e;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf4">
<mml:math id="m4">
<mml:mrow>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
<mml:mo>&#x3e;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf5">
<mml:math id="m5">
<mml:mrow>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
<mml:mo>&#x3c;</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>&#x3c;</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>&#x3c;</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3c;</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>&#x3c;</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, and <inline-formula id="inf6">
<mml:math id="m6">
<mml:mrow>
<mml:mi>T</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
<mml:mtext>&#xa0;</mml:mtext>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula> is the time interval for observation. If <italic>s</italic>
<sub>
<italic>i</italic>
</sub> is the current value in the power line at time interval <inline-formula id="inf7">
<mml:math id="m7">
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mtext>&#xa0;</mml:mtext>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf8">
<mml:math id="m8">
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#x3c;</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
<mml:mo>&#x3e;</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> is the current sequence of electricity consumption. Let <inline-formula id="inf9">
<mml:math id="m9">
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:msubsup>
<mml:mi>s</mml:mi>
<mml:mi>k</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>&#x3b5;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#x3c;</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3e;</mml:mo>
<mml:mo>&#x2286;</mml:mo>
<mml:mi>S</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> be the current sequence of electricity consumption at time interval <inline-formula id="inf10">
<mml:math id="m10">
<mml:mrow>
<mml:msubsup>
<mml:mo>&#x394;</mml:mo>
<mml:mi>k</mml:mi>
<mml:mi>m</mml:mi>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mtext>&#xa0;</mml:mtext>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf11">
<mml:math id="m11">
<mml:mrow>
<mml:mover accent="true">
<mml:mi>s</mml:mi>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfrac>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
<mml:mi>m</mml:mi>
</mml:munderover>
</mml:mstyle>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi mathvariant="normal">i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> where <italic>&#x3b5; &#x3e;</italic> 0. If inequality system (<xref ref-type="disp-formula" rid="e1">Equation 1</xref>) is satisfied, <inline-formula id="inf12">
<mml:math id="m12">
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:msubsup>
<mml:mi>s</mml:mi>
<mml:mi>k</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>&#x3b5;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>, the current sequence of electricity consumption at time interval <inline-formula id="inf13">
<mml:math id="m13">
<mml:mrow>
<mml:msubsup>
<mml:mo>&#x394;</mml:mo>
<mml:mi>k</mml:mi>
<mml:mi>m</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>, is one <italic>&#x3b5;-piece</italic> of the current sequence of electricity consumption.</p>
<p>The <italic>&#x3b5;-piece</italic> of the current sequence of electricity consumption defined by <xref ref-type="disp-formula" rid="e1">Equation 1</xref> below is based on the mean value of the current sequence. In this system, the <italic>&#x3b5;-piece</italic> of the current sequence is determined based on the mean value of the electricity consumption. It means that the sequence is divided into segments where the variation within each segment is small, and specifically, the maximum deviation from the mean value within a segment does not exceed <italic>&#x3b5;</italic>. Similarly, <xref ref-type="disp-formula" rid="e2">Equation 2</xref> illustrates another kind of <italic>&#x3b5;-piece</italic> of the current sequence of electricity consumption based on jump detection. In this system, jump detection means that if the difference between any two consecutive observed data points is greater than <italic>&#x3b5;</italic>, those two consecutive observed data points are in different <italic>&#x3b5;-piece</italic>s of the current sequence. That is, the difference between two successive observed data points is not greater than <italic>&#x3b5;</italic> in the <italic>&#x3b5;-piece</italic> of the current sequence of electricity consumption. Furthermore, in the system according to <xref ref-type="disp-formula" rid="e2">Equation 2</xref>, the <italic>&#x3b5;</italic>-piece is determined based on detecting jumps or significant changes in the consumption data. A jump is defined as a point where the difference between any two consecutive observed data points is greater than <italic>&#x3b5;</italic>. A jump indicates the end of one &#x3b5;-piece and the beginning of another. It means that an <italic>&#x3b5;</italic>-piece is a sequence segment where the difference between any two successive observed data points does not exceed <italic>&#x3b5;</italic>.<disp-formula id="e1">
<mml:math id="m14">
<mml:mrow>
<mml:mrow>
<mml:mfenced open="{" close="" separators="|">
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mrow>
<mml:mfenced open="|" close="|" separators="|">
<mml:mrow>
<mml:mover accent="true">
<mml:mi>s</mml:mi>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>&#x3b5;</mml:mi>
<mml:mtext>&#xa0;</mml:mtext>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>k</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>m</mml:mi>
<mml:mtext>&#xa0;</mml:mtext>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mrow>
<mml:mfenced open="|" close="|" separators="|">
<mml:mrow>
<mml:mover accent="true">
<mml:mi>s</mml:mi>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>m</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3e;</mml:mo>
<mml:mi>&#x3b5;</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mrow>
<mml:mfenced open="|" close="|" separators="|">
<mml:mrow>
<mml:mover accent="true">
<mml:mi>s</mml:mi>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3e;</mml:mo>
<mml:mi>&#x3b5;</mml:mi>
<mml:mtext>&#xa0;</mml:mtext>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:math>
<label>(1)</label>
</disp-formula>
<disp-formula id="e2">
<mml:math id="m15">
<mml:mrow>
<mml:mfenced open="{" close="" separators="|">
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mrow>
<mml:mfenced open="|" close="|" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>&#x3b5;</mml:mi>
<mml:mtext>&#xa0;</mml:mtext>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>k</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>m</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
<label>(2)</label>
</disp-formula>
</p>
<p>Let <inline-formula id="inf14">
<mml:math id="m16">
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:msup>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mi>i</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>&#x3b5;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:mi>e</mml:mi>
<mml:msup>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mi>i</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>&#x3b5;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:mi>e</mml:mi>
<mml:msup>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mi>i</mml:mi>
<mml:mi>u</mml:mi>
</mml:msub>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>&#x3b5;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> be all <italic>&#x3b5;-pieces</italic> of the current sequence of electricity consumption in electricity consumption sequence <italic>S</italic>, where <inline-formula id="inf15">
<mml:math id="m17">
<mml:mrow>
<mml:msub>
<mml:mi>i</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>&#x3c;</mml:mo>
<mml:msub>
<mml:mi>i</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>&#x3c;</mml:mo>
<mml:mo>&#x22ef;</mml:mo>
<mml:mo>&#x3c;</mml:mo>
<mml:msub>
<mml:mi>i</mml:mi>
<mml:mi>u</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, and <inline-formula id="inf16">
<mml:math id="m18">
<mml:mrow>
<mml:mi>&#x3c4;</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the time interval of <inline-formula id="inf17">
<mml:math id="m19">
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:msup>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>&#x3b5;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf18">
<mml:math id="m20">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>u</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>. If <inline-formula id="inf19">
<mml:math id="m21">
<mml:mrow>
<mml:mi>&#x3c4;</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:msub>
<mml:mo>&#x2229;</mml:mo>
<mml:mi>&#x3c4;</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#x2205;</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> for <inline-formula id="inf20">
<mml:math id="m22">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>u</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf21">
<mml:math id="m23">
<mml:mrow>
<mml:mi>E</mml:mi>
<mml:msup>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>&#x3b5;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msup>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="{" close="}" separators="|">
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:msup>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mi>i</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>&#x3b5;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:mi>e</mml:mi>
<mml:msup>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mi>i</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>&#x3b5;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:mi>e</mml:mi>
<mml:msup>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mi>i</mml:mi>
<mml:mi>u</mml:mi>
</mml:msub>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>&#x3b5;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> is the <italic>&#x3b5;-piece</italic> set of the current sequence of <italic>S</italic>.</p>
<p>Suppose <inline-formula id="inf22">
<mml:math id="m24">
<mml:mrow>
<mml:mi>E</mml:mi>
<mml:msup>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>&#x3b5;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msup>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="{" close="}" separators="|">
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:msup>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mi>i</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>&#x3b5;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:mi>e</mml:mi>
<mml:msup>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mi>i</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>&#x3b5;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:mi>e</mml:mi>
<mml:msup>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mi>i</mml:mi>
<mml:mi>u</mml:mi>
</mml:msub>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>&#x3b5;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> is the set of <italic>&#x3b5;-pieces</italic> of the current sequence, and <inline-formula id="inf23">
<mml:math id="m25">
<mml:mrow>
<mml:mi>&#x3c4;</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfenced open="(" close="]" separators="|">
<mml:mrow>
<mml:mi>&#x3c4;</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>b</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>g</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mtext>&#xa0;</mml:mtext>
<mml:mi>&#x3c4;</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula> is the observation time interval where <inline-formula id="inf24">
<mml:math id="m26">
<mml:mrow>
<mml:msub>
<mml:mi>i</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>&#x3c;</mml:mo>
<mml:msub>
<mml:mi>i</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>&#x3c;</mml:mo>
<mml:mo>&#x22ef;</mml:mo>
<mml:mo>&#x3c;</mml:mo>
<mml:msub>
<mml:mi>i</mml:mi>
<mml:mi>u</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>. As to <inline-formula id="inf25">
<mml:math id="m27">
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:msup>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>&#x3b5;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf26">
<mml:math id="m28">
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:msubsup>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>&#x3b5;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>, if <inline-formula id="inf27">
<mml:math id="m29">
<mml:mrow>
<mml:mi>&#x3c4;</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>&#x3c4;</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>b</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>g</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf28">
<mml:math id="m30">
<mml:mrow>
<mml:mrow>
<mml:mfenced open="|" close="|" separators="|">
<mml:mrow>
<mml:msub>
<mml:mover accent="true">
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mover accent="true">
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3e;</mml:mo>
<mml:mo>&#x394;</mml:mo>
<mml:mo>&#x3e;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, or <inline-formula id="inf29">
<mml:math id="m31">
<mml:mrow>
<mml:mi>&#x3c4;</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3c;</mml:mo>
<mml:mi>&#x3c4;</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>b</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>g</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf30">
<mml:math id="m32">
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:msup>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>&#x3b5;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf31">
<mml:math id="m33">
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:msubsup>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>&#x3b5;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> are current steady-state sequences. If <inline-formula id="inf32">
<mml:math id="m34">
<mml:mrow>
<mml:mi>&#x3c4;</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>&#x3c4;</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>b</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>g</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf33">
<mml:math id="m35">
<mml:mrow>
<mml:mrow>
<mml:mfenced open="|" close="|" separators="|">
<mml:mrow>
<mml:msub>
<mml:mover accent="true">
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mover accent="true">
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2264;</mml:mo>
<mml:mo>&#x394;</mml:mo>
<mml:mo>&#x3e;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf34">
<mml:math id="m36">
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:msup>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>&#x3b5;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf35">
<mml:math id="m37">
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:msubsup>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>&#x3b5;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> should be merged as one new current sequence, and the new current sequence is a current steady-state sequence.</p>
<p>Suppose the number of current steady-state sequences in the observation current sequence <inline-formula id="inf36">
<mml:math id="m38">
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#x3c;</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
<mml:mo>&#x3e;</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> under <italic>&#x3b5;</italic> &#x3e; 0, <inline-formula id="inf37">
<mml:math id="m39">
<mml:mrow>
<mml:mo>&#x394;</mml:mo>
<mml:mo>&#x3e;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula> is <italic>k</italic>. Let <inline-formula id="inf38">
<mml:math id="m40">
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> be the <italic>i</italic>th current steady-state sequence, <italic>i</italic> &#x3d; 1&#x2026;<italic>k</italic>. <inline-formula id="inf39">
<mml:math id="m41">
<mml:mrow>
<mml:mi>E</mml:mi>
<mml:mi>S</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="{" close="}" separators="|">
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> is the full current steady-state sequence set of <italic>S</italic>.</p>
<p>It is easy to prove that the intersection of corresponding time intervals of any two steady-state current sequences is empty.</p>
<p>Suppose <inline-formula id="inf40">
<mml:math id="m42">
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#x3c;</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
<mml:mo>&#x3e;</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> is the current sequence observed at period <inline-formula id="inf41">
<mml:math id="m43">
<mml:mrow>
<mml:mi>T</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mfenced open="(" close="]" separators="|">
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mtext>&#xa0;</mml:mtext>
<mml:mi mathvariant="normal">t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf42">
<mml:math id="m44">
<mml:mrow>
<mml:mi>E</mml:mi>
<mml:mi>S</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="{" close="}" separators="|">
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> is the full current steady-state sequence set of <italic>S</italic>, <inline-formula id="inf43">
<mml:math id="m45">
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the i<italic>th</italic> current steady-state sequence, <inline-formula id="inf44">
<mml:math id="m46">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf45">
<mml:math id="m47">
<mml:mrow>
<mml:mi>&#x3c4;</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>&#x3c4;</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>b</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>g</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mtext>&#xa0;</mml:mtext>
<mml:mi>&#x3c4;</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula> is the time interval of <inline-formula id="inf46">
<mml:math id="m48">
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf47">
<mml:math id="m49">
<mml:mrow>
<mml:mi>&#x3c4;</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>b</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>g</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2265;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf48">
<mml:math id="m50">
<mml:mrow>
<mml:mi>&#x3c4;</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2265;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, and <inline-formula id="inf49">
<mml:math id="m51">
<mml:mrow>
<mml:mi>&#x3c4;</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>b</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>g</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3c;</mml:mo>
<mml:mi>&#x3c4;</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>. If <inline-formula id="inf50">
<mml:math id="m52">
<mml:mrow>
<mml:mi>&#x3c4;</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf51">
<mml:math id="m53">
<mml:mrow>
<mml:mi>&#x3c4;</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">k</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>b</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>g</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf52">
<mml:math id="m54">
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>v</mml:mi>
<mml:msub>
<mml:mi>e</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the current sequence observed at time interval <inline-formula id="inf53">
<mml:math id="m55">
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>&#x3c4;</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mtext>&#xa0;</mml:mtext>
<mml:mi>&#x3c4;</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>b</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>g</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula>, then <inline-formula id="inf54">
<mml:math id="m56">
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>v</mml:mi>
<mml:msub>
<mml:mi>e</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is one current transfer-state sequence.</p>
<p>For <inline-formula id="inf55">
<mml:math id="m57">
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>E</mml:mi>
<mml:mi>S</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf56">
<mml:math id="m58">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>, if <inline-formula id="inf57">
<mml:math id="m59">
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is a current steady-state sequence at time interval <inline-formula id="inf58">
<mml:math id="m60">
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>&#x3c4;</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>b</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>g</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mtext>&#xa0;</mml:mtext>
<mml:mi>&#x3c4;</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula>, the running state of load at time interval <inline-formula id="inf59">
<mml:math id="m61">
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>&#x3c4;</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>b</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>g</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mtext>&#xa0;</mml:mtext>
<mml:mi>&#x3c4;</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula> is also called a steady state. Meanwhile, if <inline-formula id="inf60">
<mml:math id="m62">
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is a current transfer-state sequence at time interval <inline-formula id="inf61">
<mml:math id="m63">
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>&#x3c4;</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>b</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>g</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mtext>&#xa0;</mml:mtext>
<mml:mi>&#x3c4;</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula>, the running state of load at time interval <inline-formula id="inf62">
<mml:math id="m64">
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>&#x3c4;</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>b</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>g</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mtext>&#xa0;</mml:mtext>
<mml:mi>&#x3c4;</mml:mi>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula> is also called a transfer state.</p>
</sec>
<sec id="s2-2">
<title>2.2 Mining features of the current sequence piece</title>
<p>Both steady-state current sequences and transfer current sequences are considered current-state sequences. The lengths of each current-state sequence may vary in the current-state sequence. To describe each current-state sequence using fixed features, we use the two constant coefficients of the univariate regression model for the current-state sequence as its characteristics.</p>
<p>If <inline-formula id="inf63">
<mml:math id="m65">
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#x3c;</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>&#x22ef;</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
<mml:mo>&#x3e;</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> is one current-state sequence, and <inline-formula id="inf64">
<mml:math id="m66">
<mml:mrow>
<mml:msup>
<mml:mi>S</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#x3c;</mml:mo>
<mml:msubsup>
<mml:mi>s</mml:mi>
<mml:mn>1</mml:mn>
<mml:mo>&#x2032;</mml:mo>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mi>s</mml:mi>
<mml:mn>2</mml:mn>
<mml:mo>&#x2032;</mml:mo>
</mml:msubsup>
<mml:mo>&#x22ef;</mml:mo>
<mml:msubsup>
<mml:mi>s</mml:mi>
<mml:mi>n</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msubsup>
<mml:mo>&#x3e;</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> is the estimate of <italic>S</italic> by the univariate regression model of <italic>S</italic>, each element of <italic>S</italic>
<sup>
<italic>&#x2019;</italic>
</sup> can be calculated according to <xref ref-type="disp-formula" rid="e3">Equation 3</xref>. In <xref ref-type="disp-formula" rid="e3">Equation 3</xref>, <italic>a</italic> and <italic>b</italic> are the two constant coefficients of the univariate regression model of <italic>S</italic>. As to one current-state sequence, the optimal values of the coefficients (<italic>a</italic>, <italic>b</italic>) of <xref ref-type="disp-formula" rid="e3">Equation 3</xref> represent the features of the current-state sequence.<disp-formula id="e3">
<mml:math id="m67">
<mml:mrow>
<mml:mrow>
<mml:mfenced open="{" close="" separators="|">
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msubsup>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">k</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>&#x2032;</mml:mo>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:msubsup>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">k</mml:mi>
</mml:mrow>
<mml:mo>&#x2032;</mml:mo>
</mml:msubsup>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>a</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
<mml:mo>&#x3e;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>a</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>R</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msubsup>
<mml:mi>s</mml:mi>
<mml:mn>1</mml:mn>
<mml:mo>&#x2032;</mml:mo>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>R</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:math>
<label>(3)</label>
</disp-formula>
</p>
<p>As to the current-state sequence <inline-formula id="inf65">
<mml:math id="m68">
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#x3c;</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>&#x22ef;</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
<mml:mo>&#x3e;</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula>, if <inline-formula id="inf66">
<mml:math id="m69">
<mml:mrow>
<mml:mi>&#x3b4;</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> is defined as <xref ref-type="disp-formula" rid="e4">Equation 4</xref> and <inline-formula id="inf67">
<mml:math id="m70">
<mml:mrow>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mi>S</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> is defined as <xref ref-type="disp-formula" rid="e5">Equation 5</xref>, the optimal solution to the optimization problem defined by <xref ref-type="disp-formula" rid="e6">Equation 6</xref> is the univariate regression feature of <italic>S</italic>.<disp-formula id="e4">
<mml:math id="m71">
<mml:mrow>
<mml:mi>&#x3b4;</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mrow>
<mml:mfenced open="{" close="" separators="|">
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>S</mml:mi>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mtext>&#xa0;is&#xa0;not&#xa0;missing</mml:mtext>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>S</mml:mi>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mtext>&#xa0;is&#xa0;missing</mml:mtext>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(4)</label>
</disp-formula>
<disp-formula id="e5">
<mml:math id="m72">
<mml:mrow>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mi>S</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mover accent="true">
<mml:mo>&#x3d;</mml:mo>
<mml:mi>d</mml:mi>
</mml:mover>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:mi>&#x3b4;</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mfrac>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
</mml:mstyle>
<mml:mi>&#x3b4;</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:math>
<label>(5)</label>
</disp-formula>
<disp-formula id="e6">
<mml:math id="m73">
<mml:mrow>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mi>S</mml:mi>
<mml:mo>&#x2a;</mml:mo>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>min</mml:mi>
<mml:mo>&#x2061;</mml:mo>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mi>S</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:math>
<label>(6)</label>
</disp-formula>
</p>
<p>As to the current-state sequence <inline-formula id="inf68">
<mml:math id="m74">
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#x3c;</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>&#x22ef;</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
<mml:mo>&#x3e;</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula>, if <italic>S</italic> has no missing data, that is, if the value of <inline-formula id="inf69">
<mml:math id="m75">
<mml:mrow>
<mml:mi>&#x3b4;</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> for each element in <italic>S</italic> is 1, slope <italic>a,</italic> and intercept <italic>b</italic>, the univariate regression feature of <italic>S</italic> can be calculated using the least squares method. When <italic>S</italic> is missing data, the PSO algorithm is utilized to solve the optimization problem defined by <xref ref-type="disp-formula" rid="e6">Equation 6</xref> to get the univariate regression feature of <italic>S</italic>. The optimal solution of the optimization problem defined by <xref ref-type="disp-formula" rid="e6">Equation 6</xref> is treated as the univariate regression feature of <italic>S</italic>.<disp-formula id="e7">
<mml:math id="m76">
<mml:mrow>
<mml:mi>v</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>&#x3c9;</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>v</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>c</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>r</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow/>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#xd7;</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>B</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>c</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>r</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow/>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#xd7;</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>g</mml:mi>
<mml:mi>B</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:math>
<label>(7)</label>
</disp-formula>
<disp-formula id="e8">
<mml:math id="m77">
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>v</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:math>
<label>(8)</label>
</disp-formula>
</p>
<p>As to the PSO algorithm, let the velocity of a particle at time <italic>t</italic> be <italic>v</italic>(<italic>t</italic>) and the position of the particle at time <italic>t</italic> be <italic>x</italic>(<italic>t</italic>), <italic>v</italic>(<italic>t</italic>&#x2b;1). The velocity of each particle is updated according to <xref ref-type="disp-formula" rid="e7">Equation 7</xref>. Meanwhile, <italic>x</italic>(<italic>t</italic>&#x2b;1), the position of any particle, is generally updated according to <xref ref-type="disp-formula" rid="e8">Equation 8</xref>. In <xref ref-type="disp-formula" rid="e7">Equation 7</xref>, parameter <italic>&#x3c9;</italic> is the inertia factor, <italic>c</italic>
<sub>1</sub> and <italic>c</italic>
<sub>2</sub> are the learning factors, <italic>rand</italic>() is a random number, <italic>pBest</italic> denotes the historical best position of the particle, and <italic>gBest</italic> is the historical best position of all particles. Because the PSO algorithm is a stochastic optimization algorithm, the solution of PSO for an optimization problem is the approximation of the optimal solution. If an optimization problem is solved using the PSO algorithm, some approximated optimal solutions as candidate solutions may usually be obtained by the PSO algorithm. The solution for the optimization problem is the best solution among those candidate solutions. This approach will significantly increase the computation time required to solve the optimization problem.</p>
</sec>
</sec>
<sec id="s3">
<title>3 Methods for current-state pattern mining</title>
<sec id="s3-1">
<title>3.1 Current-state pattern mining based on DBSCAN algorithm</title>
<p>
<statement content-type="algorithm" id="Algorithm_1">
<label>Algorithm 1</label>
<p>current-state pattern mining based on the DBSCAN algorithm.<list list-type="simple">
<list-item>
<p>
<bold>Input:</bold> <italic>FS</italic> &#x3d; {<italic>fs</italic>
<sub>1</sub>,<italic>fs</italic>
<sub>2</sub>,&#x2026;,<italic>fs</italic>
<sub>n</sub>}, univariate regression feature set of current sequence piece; <italic>epsilon</italic>, neighborhood radius; <italic>min</italic>_<italic>pts</italic>, minimum number of samples</p>
</list-item>
<list-item>
<p>
<bold>Output:</bold> <italic>P</italic>S, current-state pattern set</p>
</list-item>
<list-item>
<p>1)&#x2003;<italic>n</italic> &#x3d; length(<italic>FS</italic>);</p>
</list-item>
<list-item>
<p>2)&#x2003;cluster_labels(1:n) &#x3d; 0;</p>
</list-item>
<list-item>
<p>3)&#x2003;cluster_id &#x3d; 1;</p>
</list-item>
<list-item>
<p>4)&#x2003;for i &#x3d; 1:n</p>
</list-item>
<list-item>
<p>5)&#x2003;&#x2003;if cluster_labels(i) &#x3d;&#x3d; 0</p>
</list-item>
<list-item>
<p>6)&#x2003;&#x2003;&#x2003;neighbors &#x3d; <italic>findNeighbors</italic> (i, <italic>FS</italic>, epsilon); //Get neighboring data for the <italic>i</italic>th data point.</p>
</list-item>
<list-item>
<p>7)&#x2003;&#x2003;&#x2003;if <italic>numel</italic>(neighbors) &#x2265; min_pts; //The <italic>numel</italic>() function counts the total number of neighboring data for the <italic>i</italic>th data point.</p>
</list-item>
<list-item>
<p>8)&#x2003;&#x2003;&#x2003;&#x2003;cluster_labels(i) &#x3d; cluster_id</p>
</list-item>
<list-item>
<p>9)&#x2003;&#x2003;&#x2003;&#x2003;cluster_labels &#x3d; <italic>expandCluster</italic>(i, neighbors, <italic>FS</italic>, <italic>epsilon</italic>, <italic>min</italic>_<italic>pts</italic>, cluster_id, cluster_labels);</p>
</list-item>
<list-item>
<p>10)&#x2003;&#x2003;&#x2003;cluster_id &#x3d; cluster_id &#x2b; 1;</p>
</list-item>
<list-item>
<p>11)PS&#x3d; cluster_labels;</p>
</list-item>
</list>
</p>
</statement>
</p>
<p>Although the lengths of each current sequence piece vary in the set of current sequence pieces, each current sequence piece can be represented by a two-dimensional vector if each current sequence piece is represented with the two constant coefficients of its univariate linear regression model. If each current sequence piece is represented with the two constant coefficients of its univariate linear regression model, two analogous current sequence pieces are closely related, and the dissimilarity of two disanalogous current sequence pieces is significant in the two-dimensional feature space for the set of current sequence pieces. The evidence above suggests that the set of current sequence pieces can be clustered into different clusters by a specific clustering analysis algorithm if each current sequence piece is represented with the two constant coefficients of its univariate linear regression model as its feature. The current-state sequence pieces within each cluster have similar morphologies, while there are significant disparities in the morphology of current-state sequence pieces between different clusters. Given that the morphology of current sequence pieces within each cluster in their respective feature space is similar, the feature representation of a cluster is a current-state pattern. The flow for current-state pattern mining based on the DBSCAN algorithm is given at <xref ref-type="statement" rid="Algorithm_1">Algorithm 1</xref>. Function <italic>expandCluster</italic>() is used to expand the clustering cluster at step (9) in <xref ref-type="statement" rid="Algorithm_1">Algorithm 1</xref>. With the use of <italic>expandCluster</italic>(), the neighboring data of the <italic>i</italic>th data point is within the same cluster as the <italic>i</italic>th data point.</p>
<p>
<statement content-type="algorithm" id="Algorithm_2">
<label>Algorithm 2</label>
<p>
<italic>findNeighbors</italic>(), Seeking the neighbors of the core data.<list list-type="simple">
<list-item>
<p>
<bold>Input:</bold> <italic>FS</italic>, the feature set of the current sequence piece; <italic>index</italic>, the position of the core entity within <italic>FS</italic>; <italic>epsilon</italic>, neighborhood radius;</p>
</list-item>
<list-item>
<p>
<bold>Output:</bold> neighbors, the indices set of neighboring data for the <italic>i</italic>th core data in FS</p>
</list-item>
<list-item>
<p>1)&#x2003;neighbors &#x3d; [];</p>
</list-item>
<list-item>
<p>2)&#x2003;distances &#x3d; sqrt(sum(<italic>FS</italic> &#x2212; <italic>FS</italic>(index, :).&#x5e;2, 2);//Compute the distance between the specific data point and the other data points.</p>
</list-item>
<list-item>
<p>3)&#x2003;for i &#x3d; 1:<italic>numel</italic>(distances)</p>
</list-item>
<list-item>
<p>4)&#x2003;&#x2003;if distances(i) &#x2264; epsilon</p>
</list-item>
<list-item>
<p>5)&#x2003;&#x2003;neighbors &#x3d; [neighbors i];</p>
</list-item>
</list>
</p>
</statement>
</p>
<p>The flow for current-state pattern mining, as presented in <xref ref-type="statement" rid="Algorithm_1">Algorithm 1</xref>, is based on the fundamental principle of the DBSCAN algorithm. However, it does not label any current-state sequence piece as noise. The key idea for current-state pattern mining based on the DBSCAN algorithm in <xref ref-type="statement" rid="Algorithm_1">Algorithm 1</xref> is that any current-state sequence piece with several neighboring sequence pieces not less than <italic>min</italic>_<italic>pts</italic> is assigned to a cluster, and all neighboring sequences are also within the same cluster. At step(2) of <xref ref-type="statement" rid="Algorithm_1">Algorithm 1</xref>, each current-state sequence piece is marked with a cluster label of 0, indicating that its cluster membership is undecided. Based on the concept that any current-state sequence piece is the neighbor of the ith current-state sequence piece if the distance from the ith current-state sequence piece to the current-state sequence piece is not greater than epsilon, step(6) of <xref ref-type="statement" rid="Algorithm_1">Algorithm 1</xref> uses the function <italic>findNeighbors</italic>() to obtain all neighboring current-state sequence pieces of the <italic>i</italic>th current sequence piece: any current-state sequence piece within a distance epsilon from <italic>i</italic>th current sequence piece is considered a neighbor. In step(9) of <xref ref-type="statement" rid="Algorithm_1">Algorithm 1</xref>, the <italic>expandCluster</italic>() function is used to expand the cluster of the <italic>i</italic>th current sequence piece by performing a depth-first search on its neighboring sequence pieces. <xref ref-type="statement" rid="Algorithm_2">Algorithm 2</xref> provides one implementation flow for the <italic>findNeighbors</italic>() function. Meanwhile, <xref ref-type="statement" rid="Algorithm_3">Algorithm 3</xref> provides one implementation flow for the <italic>expandCluster</italic>() function. In <xref ref-type="statement" rid="Algorithm_2">Algorithm 2</xref> and <xref ref-type="statement" rid="Algorithm_3">Algorithm 3</xref>, the function <italic>numel</italic>() is used to obtain the number of elements in the current sequence piece set. In <xref ref-type="statement" rid="Algorithm_2">Algorithm 2</xref>, steps(3)&#x223c;(5) seek data that are in the neighboring field of data point <italic>FS</italic>(<italic>index</italic>) where the distance from data point <italic>FS</italic>(<italic>index</italic>) to the data point is not greater than <italic>epsilon</italic>.</p>
<p>
<statement content-type="algorithm" id="Algorithm_3">
<label>Algorithm 3</label>
<p>
<italic>expand Cluster</italic>(), Extend the cluster ID of the specified data point to its neighboring data points.<list list-type="simple">
<list-item>
<p>
<bold>Input:</bold> <italic>S</italic>, data sequence; <italic>index</italic>, the indices of core data in S; <italic>neighbors</italic>, data buffer for the neighbor of data point <italic>S</italic>(<italic>index</italic>); <italic>epsilon</italic>, neighborhood radius; <italic>min</italic>_<italic>pts</italic>, minimum number of samples; <italic>cluster_id</italic>, the identifier of the cluster where <italic>S</italic>(<italic>index</italic>) is located; <italic>cluster_labels</italic>, the identifier buffer of each element in <italic>S</italic>, which is the cluster partition of <italic>S</italic>;</p>
</list-item>
<list-item>
<p>
<bold>Output:</bold> <italic>cluster_labels</italic>, Cluster labels after expansion</p>
</list-item>
<list-item>
<p>1)&#x2003;for i &#x3d; 1:<italic>numel</italic>(<italic>neighbors</italic>) // traversal each neighboring data point</p>
</list-item>
<list-item>
<p>2)&#x2003;&#x2003;<italic>neighbor</italic> &#x3d; <italic>neighbors</italic>(i);</p>
</list-item>
<list-item>
<p>3)&#x2003;&#x2003;if <italic>cluster_labels</italic>(<italic>neighbor</italic>) &#x3d;&#x3d; 0//no cluster id is assigned for the neighboring data point</p>
</list-item>
<list-item>
<p>4)&#x2003;&#x2003;&#x2003;<italic>cluster_labels</italic>(<italic>neighbor</italic>) &#x3d; cluster_id; // Assign cluster id to neighbor</p>
</list-item>
<list-item>
<p>5)&#x2003;&#x2003;&#x2003;<italic>neighbor_neighbors</italic> &#x3d; <italic>findNeighbors</italic>(<italic>neighbor</italic>, <italic>S</italic>, <italic>epsilon</italic>);//Seeking all neighbors of neighbor.</p>
</list-item>
<list-item>
<p>6)&#x2003;&#x2003;&#x2003;if <italic>numel</italic>(<italic>neighbor_neighbors</italic>) &#x2265; <italic>min_pts cluster_labels</italic> &#x3d; <italic>expandCluster</italic>(<italic>neighbor</italic>, <italic>neighbor_neighbors</italic>, <italic>FS, epsilon</italic>, <italic>min_pts</italic>, <italic>cluster_id</italic>, <italic>cluster_labels</italic>);</p>
</list-item>
</list>
</p>
</statement>
</p>
<p>The <italic>find Neighbors</italic>() function, as described in <xref ref-type="statement" rid="Algorithm_2">Algorithm 2</xref>, computes the distance between the current data point and all other data points in the feature set <italic>FS</italic>. This operation takes <italic>O</italic>(<italic>n</italic>) time, where <italic>n</italic> is the number of data points in <italic>FS</italic>. The <italic>expandCluster</italic>() function, as described in <xref ref-type="statement" rid="Algorithm_2">Algorithm 3</xref>, performs a depth-first search (DFS) to expand the cluster for the neighboring points. In the worst case, it may visit each data point once, leading to a time complexity of <italic>O</italic>(<italic>n</italic>) for each call. In <xref ref-type="statement" rid="Algorithm_1">Algorithm 1</xref>, the main loop iterates over each data point in <italic>FS</italic>, and for each point, it may call <italic>findNeighbors</italic>() and <italic>expandCluster</italic>(), both of which have time complexities of <italic>O</italic>(<italic>n</italic>). Therefore, the overall time complexity of <xref ref-type="statement" rid="Algorithm_1">Algorithm 1</xref> is <italic>O</italic>(<italic>n</italic>)&#xd7;<italic>O</italic>(<italic>n</italic>)&#x3d; <italic>O</italic>(<italic>n</italic>
<sup>2</sup>).</p>
</sec>
<sec id="s3-2">
<title>3.2 Evaluation of the current-state pattern mining method</title>
<p>When the clustering analysis method extracts current sequence patterns from a collection of current sequence pieces, each current sequence pattern responds to a cluster. For each current-state pattern, every current sequence piece within its corresponding cluster exhibits approximate similarity to the others in the feature space. Furthermore, the sequence pieces corresponding to different current-state modes exhibit dissimilarities with distant distances in the feature space. Those facts, as above, imply that it is possible to partition a set of current sequence pieces into distinct clusters using clustering techniques. Current sequence pieces in the same cluster exhibit similar morphology in the feature space. Meanwhile, the morphology for different current sequence pieces in different clusters is notably disparate. Various metrics, such as SSE (sum of squares for error), silhouette coefficient, and the Calinski&#x2013;Harabasz index, are commonly used to evaluate the performance of the current-state pattern mining method.<disp-formula id="e9">
<mml:math id="m78">
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>n</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mfenced open="&#x2016;" close="&#x2016;" separators="|">
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mi>b</mml:mi>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>M</mml:mi>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>M</mml:mi>
<mml:mi>F</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:mfrac>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(9)</label>
</disp-formula>
</p>
<p>In the process of clustering the set of current sequence pieces <bold>
<italic>V</italic>
</bold>, where each element in <bold>
<italic>V</italic>
</bold> is the univariate regression features of a current sequence piece, the current sequence pieces within each cluster are similar. At the same time, there are significant variations in the morphology among current sequence pieces across different clusters. Suppose the similarity of feature morphology between any two data points in <bold>
<italic>V</italic>
</bold> is established. In that case, the performance of clustering-based methods for current-state pattern mining can be evaluated by the accuracy of cluster partitioning.</p>
<p>Given a dataset <bold>
<italic>V</italic>
</bold>, let <inline-formula id="inf70">
<mml:math id="m79">
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="&#x2016;" close="&#x2016;" separators="|">
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, and suppose <bold>
<italic>F</italic>
</bold> is a clustering partition of <bold>
<italic>V</italic>
</bold>. <bold>
<italic>F</italic>
</bold> can be represented by an <inline-formula id="inf71">
<mml:math id="m80">
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> binary matrix <inline-formula id="inf72">
<mml:math id="m81">
<mml:mrow>
<mml:msub>
<mml:mi>M</mml:mi>
<mml:mi>F</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>. For any arbitrary <italic>u</italic> and v belonging to <bold>
<italic>V</italic>
</bold>, if <bold>
<italic>F</italic>
</bold> asserts that <italic>u</italic> and <italic>v</italic> are in the same cluster, <inline-formula id="inf73">
<mml:math id="m82">
<mml:mrow>
<mml:msub>
<mml:mi>M</mml:mi>
<mml:mi>F</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>u</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>v</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>; otherwise, <inline-formula id="inf74">
<mml:math id="m83">
<mml:mrow>
<mml:msub>
<mml:mi>M</mml:mi>
<mml:mi>F</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>u</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>v</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>. Specially, if u &#x3d; v, <inline-formula id="inf75">
<mml:math id="m84">
<mml:mrow>
<mml:msub>
<mml:mi>M</mml:mi>
<mml:mi>F</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>u</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>v</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>. With the supposition above, <inline-formula id="inf76">
<mml:math id="m85">
<mml:mrow>
<mml:msub>
<mml:mi>M</mml:mi>
<mml:mi>F</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is a representation matrix of the clustering partition. Furthermore, let <italic>C</italic> be an annotated clustering partition of <italic>V</italic>, and let <italic>F</italic> be any clustering partition of <bold>
<italic>V</italic>
</bold>. Then, <inline-formula id="inf77">
<mml:math id="m86">
<mml:mrow>
<mml:msub>
<mml:mi>M</mml:mi>
<mml:mi>C</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the representation matrix of <italic>C</italic>, and <inline-formula id="inf78">
<mml:math id="m87">
<mml:mrow>
<mml:msub>
<mml:mi>M</mml:mi>
<mml:mi>F</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the representation matrix of <italic>F</italic>. For <inline-formula id="inf79">
<mml:math id="m88">
<mml:mrow>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>u</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>v</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>V</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>, if <inline-formula id="inf80">
<mml:math id="m89">
<mml:mrow>
<mml:msub>
<mml:mi>M</mml:mi>
<mml:mi>F</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>u</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>v</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>M</mml:mi>
<mml:mi>C</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>u</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>v</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, the clustering assertion of <italic>F</italic> for <inline-formula id="inf81">
<mml:math id="m90">
<mml:mrow>
<mml:mi>u</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>v</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>V</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> holds. Accordingly, the precision indicator defined in <xref ref-type="disp-formula" rid="e9">Equation 9</xref> represents the accuracy of cluster partition <italic>F</italic>.</p>
<p>In <xref ref-type="disp-formula" rid="e9">Equation 9</xref>, the function <italic>abs</italic>() is used to calculate the absolute value of each component, and the operator <inline-formula id="inf82">
<mml:math id="m91">
<mml:mrow>
<mml:mfenced open="&#x2016;" close="&#x2016;" separators="|">
<mml:mrow>
<mml:mo>&#x2022;</mml:mo>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula> is used to sum up the matrix components. The value of precision ranges between 0 and 1. As to the clustering partition <italic>F</italic>, the assertion of whether any two data points in <italic>V</italic> belong to the same cluster in <italic>F</italic> is closer to the view of clustering partition <italic>C</italic> if the value of precision is near 1. The precision indicator defined in <xref ref-type="disp-formula" rid="e9">Equation 9</xref> can evaluate the performance of clustering-based approaches for current-state pattern mining.</p>
<p>It is worth noting that the choice of evaluation methods for clustering partition needs to be determined based on specific problem scenarios and data characteristics in practical applications. Moreover, evaluation metrics are often referenced and should be comprehensively considered with domain knowledge and applicable application requirements.</p>
</sec>
</sec>
<sec sec-type="results|discussion" id="s4">
<title>4 Results and discussion</title>
<p>The electrical data sequence used in our experiment is from the observation data of the lighting line in Anhui Province Key Laboratory of Intelligent Building &#x26; Building Energy Saving. The period for the current observation data collected spans from 2023-02-01 00:00:00 to 2023-05-31 23:59:59. During those 10,368,000&#xa0;s, data were collected 8,098,039 times, and duplicate data collections (where two or more collections occurred in one second) occurred 1,024 times. Moreover, data were missed 2,062,229 times, and power outages occurred 138 times, while the data collection program was terminated once at 206,570&#xa0;s.</p>
<p>With <italic>&#x3b5;</italic> &#x3d; 0.08, <italic>&#x2206;</italic> &#x3d; 0.3, for the current sequence as above, there are 339 current sequence pieces corresponding to the transfer state and 348 current sequence pieces corresponding to the steady state. That is, there are 687 current sequence pieces in our experiment. <xref ref-type="fig" rid="F2">Figure 2A</xref> illustrates the time-domain morphology of the current sequence and the 687 current sequence pieces. <xref ref-type="fig" rid="F2">Figure 2B</xref> presents the time-domain morphology of the current sequence from 2023-02-10 14:33:19 to 2023-02-11 01:39:59 within five current sequence pieces (three steady-state sequence pieces and two transfer sequence pieces). In <xref ref-type="fig" rid="F2">Figures 2A, B</xref>, the curve for the current sequence piece of the steady state is marked in red, while blue marks the curve for the current sequence piece of the transfer state. According to curves in <xref ref-type="fig" rid="F2">Figures 2A, B</xref>, each piece of the current transfer state corresponds to the current sequence piece with relatively rapid ascent or descent. In contrast, the current steady-state pieces fit into the current sequence piece with minimal fluctuations. In <xref ref-type="fig" rid="F2">Figures 2A, B</xref>, the missing current data within each non-power outage time interval are estimated using the observed value or estimated value (when data are missing) of the previous second&#x2019;s current.</p>
<fig id="F2" position="float">
<label>FIGURE 2</label>
<caption>
<p>Current steady-state and transfer-state sequence pieces. <bold>(A)</bold> All and <bold>(B)</bold> Part.</p>
</caption>
<graphic xlink:href="fenrg-12-1464389-g002.tif"/>
</fig>
<p>
<xref ref-type="fig" rid="F3">Figure 3</xref> illustrates the time-domain morphology of the current sequence in 1&#xa0;min intervals from 2023-02-10 17:45:34 to 2023-02-10 17:46:33. In <xref ref-type="fig" rid="F3">Figure 3</xref>, the horizontal axis represents the sampling time, and the vertical axis represents the collected current values. A point in <xref ref-type="fig" rid="F3">Figure 3</xref> represents a current value collected at a specific time. Theoretically, the points in <xref ref-type="fig" rid="F3">Figure 3</xref> should have equal horizontal intervals due to the electricity state being sampled per second. However, it can be observed from <xref ref-type="fig" rid="F3">Figure 3</xref> that the points are not evenly spaced horizontally. This phenomenon indicates that not every moment of current data is collected and implies that the model and method used to construct the feature of the current sequence must be able to handle or tolerate missing data.</p>
<fig id="F3" position="float">
<label>FIGURE 3</label>
<caption>
<p>The missing data phenomenon in the current sequence.</p>
</caption>
<graphic xlink:href="fenrg-12-1464389-g003.tif"/>
</fig>
<p>The PSO algorithm is used to construct the univariate regression feature of the current sequence piece defined by <xref ref-type="disp-formula" rid="e3">Equation 3</xref>. In our experiment, the particle number of the PSO algorithm is 400, the&#xa0;values of learning factors c1 and c2 are 2, and the value of inertia factor &#x3c9; is 0.8. Because each particle represents a candidate solution to the corresponding optimization problem in the PSO algorithm for solving optimization problems, <xref ref-type="table" rid="T1">Table 1</xref> presents the minimum, maximum, mean, median, Q1, Q3, and variance of the feasible solution fitness values corresponding to all 400 particles when the PSO algorithm is used to construct all univariate regression features for 687 current sequence pieces. As the experiment was repeated 20 times, <xref ref-type="table" rid="T1">Table 1</xref> contains 20 rows. Across all 20 experiments, the fitness value of the optimal solution had a minimum of 8.11E&#x2212;20, a maximum of 1.71E&#x2212;15, and a variance of 3.9474&#x2212;16. These values are all very close to 0. Because the PSO algorithm uses the feasible solution with the smallest fitness value as the estimated optimal solution, and each data point in the minimum column of <xref ref-type="table" rid="T1">Table 1</xref> is approximately 0, it can be asserted that the PSO algorithm is suitable for accurately solving the univariate regression features of the current sequence piece. The time used by the PSO algorithm is also given in <xref ref-type="table" rid="T1">Table 1.</xref> When the PSO algorithm is used to solve the univariate regression features of all 687 current sequence pieces, the minimum time used is 3,748.056&#xa0;s, the maximum is 4,566.583&#xa0;s, the mean is 4,118.558&#xa0;s, the variance is 240.122&#xa0;s, and the total time is 82,371.151&#xa0;s over 20 repetitions. Given that the average time required to solve the univariate regression feature of each current sequence piece is 5.995&#xa0;s, attention should be paid to the associated time constraints when the PSO algorithm is used to construct the univariate regression features of the current sequence piece in practice.</p>
<table-wrap id="T1" position="float">
<label>TABLE 1</label>
<caption>
<p>Performance of the PSO algorithm (iterations: 200).</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="center"/>
<th align="center">Minimum</th>
<th align="center">Q1</th>
<th align="center">Median</th>
<th align="center">Q3</th>
<th align="center">Maximum</th>
<th align="center">Mean</th>
<th align="center">Variance</th>
<th align="center">Time (s)</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">1</td>
<td align="center">2.18E&#x2212;17</td>
<td align="center">6.14E&#x2212;06</td>
<td align="center">0.005915</td>
<td align="center">0.046876</td>
<td align="center">0.284161</td>
<td align="center">0.026936</td>
<td align="center">0.035172</td>
<td align="center">3,916.186</td>
</tr>
<tr>
<td align="center">2</td>
<td align="center">8.11E&#x2212;20</td>
<td align="center">6.97E&#x2212;06</td>
<td align="center">0.004900</td>
<td align="center">0.046876</td>
<td align="center">0.812825</td>
<td align="center">0.028135</td>
<td align="center">0.047289</td>
<td align="center">4,051.608</td>
</tr>
<tr>
<td align="center">3</td>
<td align="center">1.72E&#x2212;17</td>
<td align="center">7.55E&#x2212;06</td>
<td align="center">0.008788</td>
<td align="center">0.04967</td>
<td align="center">0.556733</td>
<td align="center">0.028838</td>
<td align="center">0.043793</td>
<td align="center">4,037.236</td>
</tr>
<tr>
<td align="center">4</td>
<td align="center">1.80E&#x2212;16</td>
<td align="center">7.20E&#x2212;06</td>
<td align="center">0.004900</td>
<td align="center">0.04655</td>
<td align="center">0.390373</td>
<td align="center">0.026696</td>
<td align="center">0.035665</td>
<td align="center">3,860.215</td>
</tr>
<tr>
<td align="center">5</td>
<td align="center">7.05E&#x2212;17</td>
<td align="center">5.89E&#x2212;06</td>
<td align="center">0.008783</td>
<td align="center">0.049599</td>
<td align="center">0.350894</td>
<td align="center">0.028190</td>
<td align="center">0.039172</td>
<td align="center">3,952.556</td>
</tr>
<tr>
<td align="center">6</td>
<td align="center">6.24E&#x2212;16</td>
<td align="center">7.47E&#x2212;06</td>
<td align="center">0.006978</td>
<td align="center">0.049599</td>
<td align="center">0.367692</td>
<td align="center">0.028093</td>
<td align="center">0.038814</td>
<td align="center">4,055.331</td>
</tr>
<tr>
<td align="center">7</td>
<td align="center">4.02E&#x2212;18</td>
<td align="center">7.69E&#x2212;06</td>
<td align="center">0.006400</td>
<td align="center">0.049599</td>
<td align="center">0.962228</td>
<td align="center">0.02947</td>
<td align="center">0.053411</td>
<td align="center">4,002.863</td>
</tr>
<tr>
<td align="center">8</td>
<td align="center">3.80E&#x2212;16</td>
<td align="center">7.45E&#x2212;06</td>
<td align="center">0.007446</td>
<td align="center">0.050069</td>
<td align="center">0.442084</td>
<td align="center">0.028848</td>
<td align="center">0.040611</td>
<td align="center">3,844.893</td>
</tr>
<tr>
<td align="center">9</td>
<td align="center">5.13E&#x2212;17</td>
<td align="center">6.95E&#x2212;06</td>
<td align="center">0.004225</td>
<td align="center">0.046102</td>
<td align="center">0.394482</td>
<td align="center">0.02644</td>
<td align="center">0.036134</td>
<td align="center">4,071.216</td>
</tr>
<tr>
<td align="center">10</td>
<td align="center">1.29E&#x2212;17</td>
<td align="center">7.25E&#x2212;06</td>
<td align="center">0.005915</td>
<td align="center">0.047078</td>
<td align="center">0.713795</td>
<td align="center">0.028431</td>
<td align="center">0.047236</td>
<td align="center">3,748.056</td>
</tr>
<tr>
<td align="center">11</td>
<td align="center">5.40E&#x2212;16</td>
<td align="center">5.57E&#x2212;06</td>
<td align="center">0.002363</td>
<td align="center">0.046008</td>
<td align="center">0.231456</td>
<td align="center">0.026177</td>
<td align="center">0.03434</td>
<td align="center">4,210.883</td>
</tr>
<tr>
<td align="center">12</td>
<td align="center">1.83E&#x2212;16</td>
<td align="center">7.85E&#x2212;06</td>
<td align="center">0.006400</td>
<td align="center">0.049358</td>
<td align="center">0.322102</td>
<td align="center">0.027581</td>
<td align="center">0.036152</td>
<td align="center">4,028.632</td>
</tr>
<tr>
<td align="center">13</td>
<td align="center">1.71E&#x2212;15</td>
<td align="center">6.37E&#x2212;06</td>
<td align="center">0.006247</td>
<td align="center">0.047078</td>
<td align="center">0.607395</td>
<td align="center">0.028316</td>
<td align="center">0.044176</td>
<td align="center">3,959.003</td>
</tr>
<tr>
<td align="center">14</td>
<td align="center">1.43E&#x2212;16</td>
<td align="center">7.29E&#x2212;06</td>
<td align="center">0.006061</td>
<td align="center">0.046755</td>
<td align="center">0.304938</td>
<td align="center">0.027006</td>
<td align="center">0.035239</td>
<td align="center">4,040.110</td>
</tr>
<tr>
<td align="center">15</td>
<td align="center">5.28E&#x2212;17</td>
<td align="center">7.51E&#x2212;06</td>
<td align="center">0.004900</td>
<td align="center">0.046550</td>
<td align="center">0.231841</td>
<td align="center">0.026547</td>
<td align="center">0.034294</td>
<td align="center">4,308.729</td>
</tr>
<tr>
<td align="center">16</td>
<td align="center">1.27E&#x2212;17</td>
<td align="center">7.29E&#x2212;06</td>
<td align="center">0.004900</td>
<td align="center">0.046876</td>
<td align="center">0.545821</td>
<td align="center">0.027147</td>
<td align="center">0.038771</td>
<td align="center">4,524.026</td>
</tr>
<tr>
<td align="center">17</td>
<td align="center">1.12E&#x2212;16</td>
<td align="center">7.80E&#x2212;06</td>
<td align="center">0.004900</td>
<td align="center">0.046102</td>
<td align="center">0.261583</td>
<td align="center">0.026215</td>
<td align="center">0.033314</td>
<td align="center">4,332.294</td>
</tr>
<tr>
<td align="center">18</td>
<td align="center">4.52E&#x2212;17</td>
<td align="center">5.10E&#x2212;06</td>
<td align="center">0.003803</td>
<td align="center">0.046755</td>
<td align="center">3.118498</td>
<td align="center">0.031507</td>
<td align="center">0.123786</td>
<td align="center">4,312.621</td>
</tr>
<tr>
<td align="center">19</td>
<td align="center">4.35E&#x2212;17</td>
<td align="center">5.21E&#x2212;06</td>
<td align="center">0.004900</td>
<td align="center">0.046102</td>
<td align="center">0.232323</td>
<td align="center">0.026108</td>
<td align="center">0.033349</td>
<td align="center">4,566.583</td>
</tr>
<tr>
<td align="center">20</td>
<td align="center">5.26E&#x2212;17</td>
<td align="center">4.99E&#x2212;06</td>
<td align="center">0.004900</td>
<td align="center">0.046755</td>
<td align="center">0.908978</td>
<td align="center">0.028676</td>
<td align="center">0.051158</td>
<td align="center">4,548.110</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Two sets of lighting appliance fixtures are used in the experiment. Manual annotation determined that the 687 current sequence pieces in the experimental current sequence data corresponded to 13 different electricity states for the two lighting appliances. <xref ref-type="table" rid="T2">Table 2</xref> describes those 13 electricity states. Because the missing data phenomena happened randomly during power data acquisition, the PSO algorithm was employed to construct the univariate regression features of the current sequence pieces specified in <xref ref-type="disp-formula" rid="e3">Equation 3</xref>.</p>
<table-wrap id="T2" position="float">
<label>TABLE 2</label>
<caption>
<p>Electricity usage state of appliances.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="center">State</th>
<th align="center">Code</th>
<th align="center">Count</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">Fully closed</td>
<td align="center">1</td>
<td align="center">148</td>
</tr>
<tr>
<td align="left">First group open and second group closed</td>
<td align="center">2</td>
<td align="center">30</td>
</tr>
<tr>
<td align="left">First group closed and second group open</td>
<td align="center">3</td>
<td align="center">1</td>
</tr>
<tr>
<td align="left">Fully open</td>
<td align="center">4</td>
<td align="center">169</td>
</tr>
<tr>
<td align="left">From first group open and second group closed to fully closed</td>
<td align="center">5</td>
<td align="center">12</td>
</tr>
<tr>
<td align="left">From first group open and second group closed to fully open</td>
<td align="center">6</td>
<td align="center">18</td>
</tr>
<tr>
<td align="left">From fully closed to first group open and second group closed</td>
<td align="center">7</td>
<td align="center">1</td>
</tr>
<tr>
<td align="left">From fully closed to fully open</td>
<td align="center">8</td>
<td align="center">142</td>
</tr>
<tr>
<td align="left">From first group closed and second group open to fully closed</td>
<td align="center">9</td>
<td align="center">1</td>
</tr>
<tr>
<td align="left">From fully open to fully closed</td>
<td align="center">10</td>
<td align="center">132</td>
</tr>
<tr>
<td align="left">From fully open to first group open and second group closed</td>
<td align="center">11</td>
<td align="center">29</td>
</tr>
<tr>
<td align="left">From fully open to first group closed and second group open</td>
<td align="center">12</td>
<td align="center">1</td>
</tr>
<tr>
<td align="left">From fully open to fully open via instantaneously fully closed</td>
<td align="center">13</td>
<td align="center">3</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>First, all 687 current sequence pieces, where each current sequence piece is represented with its univariate regression feature, are partitioned into some clusters by <xref ref-type="statement" rid="Algorithm_1">Algorithm 1</xref>. Each cluster is treated as one current-state pattern corresponding to one electricity state in <xref ref-type="table" rid="T2">Table 2</xref>. <xref ref-type="fig" rid="F4">Figure 4</xref> illustrates the precision of <xref ref-type="statement" rid="Algorithm_3">Algorithm 3</xref> for current-state pattern mining, while <xref ref-type="fig" rid="F5">Figure 5</xref> illustrates the silhouette coefficients. Because the implementation of <xref ref-type="statement" rid="Algorithm_1">Algorithm 1</xref> takes reference from the DBScan algorithm, <italic>epsilon</italic>, the neighborhood radius parameter in <xref ref-type="fig" rid="F4">Figure 4</xref> varies from 0.001 to 1, incrementing by 0.001. Meanwhile, <italic>minPts</italic>, the minimum number of sample parameter for the density threshold, ranges from 1 to 20, incrementing by 1. <xref ref-type="fig" rid="F4">Figure 4</xref> illustrates the fluctuations in precision, as defined by <xref ref-type="disp-formula" rid="e9">Equation 9</xref>, with variations in the parameters <italic>epsilon</italic> and <italic>minPts</italic>. According to <xref ref-type="fig" rid="F4">Figure 4</xref>, the precision of current-state pattern mining by <xref ref-type="statement" rid="Algorithm_3">Algorithm 3</xref> exhibits significant variability when <italic>epsilon</italic> and <italic>minPts</italic> vary: the minimum precision is 0.1913, the maximum precision is 0.7824, the median precision is 0.6697, and the average precision is 0.5010 with 0.2561 as the standard deviation. When <italic>epsilon</italic> ranges from 0.001 to 0.006 and <italic>minPts</italic> is set to 1, the precision reaches its maximum. In <xref ref-type="fig" rid="F4">Figure 4</xref>, the purple point indicates the corresponding data point representing the maximum precision value.</p>
<fig id="F4" position="float">
<label>FIGURE 4</label>
<caption>
<p>The precision of current-state pattern mining by <xref ref-type="statement" rid="Algorithm_1">Algorithm 1</xref>.</p>
</caption>
<graphic xlink:href="fenrg-12-1464389-g004.tif"/>
</fig>
<fig id="F5" position="float">
<label>FIGURE 5</label>
<caption>
<p>The silhouette coefficients of current-state pattern mining by <xref ref-type="statement" rid="Algorithm_1">Algorithm 1</xref>.</p>
</caption>
<graphic xlink:href="fenrg-12-1464389-g005.tif"/>
</fig>
<p>Because <xref ref-type="statement" rid="Algorithm_1">Algorithm 1</xref> is implemented based on the DBScan algorithm, the silhouette coefficient can also be used to evaluate the performance of current-state pattern mining by <xref ref-type="statement" rid="Algorithm_1">Algorithm 1</xref>. <xref ref-type="fig" rid="F5">Figure 5</xref> illustrates the variation of the average silhouette coefficient concerning changes in the values of <italic>epsilon</italic> and <italic>minPts</italic>. In <xref ref-type="fig" rid="F5">Figure 5</xref>, because <xref ref-type="statement" rid="Algorithm_1">Algorithm 1</xref> clusters all the current sequence pieces into one cluster when <italic>epsilon</italic> exceeds 0.875, the neighborhood radius parameter, <italic>epsilon</italic>, varies from 0.001 to 0.875, incrementing by 0.001; meanwhile, <italic>minPts</italic>, varies uniformly from 1 to 20, incrementing by 1. It is evident that the silhouette coefficient of current-state pattern mining by <xref ref-type="statement" rid="Algorithm_1">Algorithm 1</xref> exhibits significant variability when <italic>epsilon</italic> and <italic>minPts</italic> vary. For the average silhouette coefficient, the minimum is &#x2212;0.3425, the maximum is 0.9379, the mean is 0.6142, the median is 0.6582, and the standard deviation is 0.1573. When <italic>epsilon</italic> is set to 0.005, and <italic>minPts</italic> is set to 1, the average silhouette coefficient reaches its maximum of 0.9379. In <xref ref-type="fig" rid="F5">Figure 5</xref>, the maximum of the average silhouette coefficient is highlighted in purple. According to <xref ref-type="fig" rid="F4">Figures 4</xref>, <xref ref-type="fig" rid="F5">5</xref>, it is easy to assert that the performance of current state pattern mining by <xref ref-type="statement" rid="Algorithm_1">Algorithm 1</xref> is optimal when the value of <italic>epsilon</italic> is set to 0.005 and <italic>minPts</italic> is set to 1.</p>
<p>The k-means algorithm is a widely used clustering algorithm. For comparison, <xref ref-type="fig" rid="F6">Figures 6</xref>, <xref ref-type="fig" rid="F7">7</xref> illustrate the variations in precision and average silhouette coefficient of current-state pattern mining by the k-means algorithm based on the univariate regression feature set of current sequence pieces. When current-state patterns are mined by the k-means algorithm, for each possible value of parameter <italic>k</italic>, the process is repeatedly executed 400 times, and the precision and silhouette coefficient are recorded each time in our experiment. <xref ref-type="fig" rid="F6">Figure 6</xref> illustrates the variation of precision with increasing <italic>k</italic>. In <xref ref-type="fig" rid="F6">Figure 6</xref>, <italic>k</italic> uniformly increases from 1 to 30, incrementing by 1. As <italic>k</italic> increases, some indicators for the precision of the current-state pattern constructed by the k-means algorithm, such as minimum, maximum, average, or median, tend to stabilize. Moreover, when k &#x2265; 13, the minimum, maximum, average, and median values are all approximately 0.77, and the values of these indicators are gradually approaching consistency. Because the k-means algorithm considers all data as one cluster when <italic>k</italic> &#x3d; 1, the silhouette coefficient for the clustering cannot be calculated; therefore, in <xref ref-type="fig" rid="F7">Figure 7</xref>, the value of <italic>k</italic> varies from 2 to 30, incrementing by 1. In <xref ref-type="fig" rid="F7">Figure 7</xref>, when k &#x2265; 13, the mean and median of the silhouette coefficients for the current-state patterns constructed by the <italic>k</italic>-means algorithm converge and approach stability. Furthermore, when k &#x3d; 14, 15, and 16, both the mean and the median reach their highest levels, and the average silhouette coefficient values are 0.8431, 0.8430, and 0.8422; meanwhile, the median values are 0.8505, 0.8499, and 0.8490, respectively. According to information in <xref ref-type="fig" rid="F6">Figures 6</xref>, <xref ref-type="fig" rid="F7">7</xref>, the best value of parameter <italic>k</italic> is 14, 15, or 16 when the k-means algorithm is used to mine the current-state patterns.</p>
<fig id="F6" position="float">
<label>FIGURE 6</label>
<caption>
<p>The precision of current-state pattern mining by the k-means algorithm.</p>
</caption>
<graphic xlink:href="fenrg-12-1464389-g006.tif"/>
</fig>
<fig id="F7" position="float">
<label>FIGURE 7</label>
<caption>
<p>The silhouette coefficients of current-state pattern mining by the k-means algorithm.</p>
</caption>
<graphic xlink:href="fenrg-12-1464389-g007.tif"/>
</fig>
<p>The SOM neural network is one kind of unsupervised learning artificial neural network that is extensively used in domains such as data clustering, feature extraction, and data visualization. The experiment utilized an SOM neural network to perform cluster analysis on the univariate regression feature set of all current sequence pieces to obtain current sequence patterns. In the experiment, the SOM neural network consisted of 30 neurons arranged in five rows and six columns. Parameter <italic>epochs</italic>, representing the number of training iterations, varied uniformly from 50 to 1,000, incrementing by 50. For each value of <italic>epochs</italic>, the current-state patterns are constructed 400 times, and the precision and silhouette coefficient of the partition of the feature set of current sequence pieces are recorded each time. <xref ref-type="fig" rid="F8">Figures 8</xref>, <xref ref-type="fig" rid="F9">9</xref> illustrate the variations of precision and the average silhouette coefficient across different epochs.</p>
<fig id="F8" position="float">
<label>FIGURE 8</label>
<caption>
<p>The precision of current-state pattern mining by SOM.</p>
</caption>
<graphic xlink:href="fenrg-12-1464389-g008.tif"/>
</fig>
<fig id="F9" position="float">
<label>FIGURE 9</label>
<caption>
<p>The silhouette coefficients of current-state pattern mining by SOM.</p>
</caption>
<graphic xlink:href="fenrg-12-1464389-g009.tif"/>
</fig>
<p>
<xref ref-type="fig" rid="F8">Figure 8</xref> illustrates the variation curve of precision of cluster partition of current state pattern mining by SOM with epoch increases. Obviously, the average precision remains relatively stable at approximately 0.78, and the median of precision aligns with the maximum precision and stabilizes at 0.7824 when <italic>epochs</italic> &#x2265; 100. <xref ref-type="fig" rid="F9">Figure 9</xref> illustrates the variation curve of the silhouette coefficient of cluster partition of current state pattern mining by SOM with <italic>epochs</italic> increases. The average silhouette coefficients remain relatively stable at around 0.82, and the median silhouette coefficients remain relatively stable at around 0.83 when <italic>epochs</italic> &#x2265; 150. According to <xref ref-type="fig" rid="F8">Figures 8</xref>, <xref ref-type="fig" rid="F9">9</xref>, it can be concluded that the performance of cluster partition of current-state pattern mining by SOM is better when <italic>epochs</italic> &#x3d; 150 or 200.</p>
<p>The optimal precision and silhouette coefficient of the current-state pattern constructed by the DBSCAN algorithm, k-means algorithm, and SOM neural network are given in <xref ref-type="table" rid="T3">Table 3</xref>. In the row for the DBSCAN algorithm of <xref ref-type="table" rid="T3">Table 3</xref>, the precision value at the precision column is the maximum precision when the current-state pattern is constructed by <xref ref-type="statement" rid="Algorithm_1">Algorithm 1</xref> as above, and the silhouette coefficient value at the silhouette coefficient column represents the maximum average silhouette coefficient of the current-state pattern is built by <xref ref-type="statement" rid="Algorithm_1">Algorithm 1</xref> as above. In the row for the k-means algorithm of <xref ref-type="table" rid="T3">Table 3</xref>, the precision value at the precision column is the maximum of average precision when the current-state pattern is constructed by the k-means algorithm 400 times as above, and the silhouette coefficient value at the silhouette coefficient column represents the maximum of average silhouette coefficient of the current-state pattern is constructed by the k-means algorithm 400 times. In the row for the SOM neural network of <xref ref-type="table" rid="T3">Table 3</xref>, the precision value at the precision column is the maximum of average precision when the current-state pattern is constructed by the SOM algorithm 400 times as above, and the silhouette coefficient value at the silhouette coefficient column represents the maximum of average silhouette coefficient of the current-state pattern is constructed by the SOM 400 times. Based on the information provided in <xref ref-type="table" rid="T3">Table 3</xref>, it can be concluded that <xref ref-type="statement" rid="Algorithm_1">Algorithm 1</xref> demonstrates superior performance in partitioning current-state patterns than the k-means algorithm and SOM neural network. Thus, <xref ref-type="statement" rid="Algorithm_1">Algorithm 1</xref> is deemed more suitable for current-state pattern mining.</p>
<table-wrap id="T3" position="float">
<label>TABLE 3</label>
<caption>
<p>Performance of current-state patterns by different clustering algorithms.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="center">Clustering algorithm</th>
<th align="center">Precision</th>
<th align="center">Silhouette coefficient</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">DBSCAN</td>
<td align="center">0.7824</td>
<td align="center">0.9379</td>
</tr>
<tr>
<td align="center">K-means</td>
<td align="center">0.7789</td>
<td align="center">0.8431</td>
</tr>
<tr>
<td align="center">SOM</td>
<td align="center">0.7824</td>
<td align="center">0.8240</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The computer used for current-state pattern mining in this experiment is a Dawn W760-g20 server with dual Intel<sup>&#xae;</sup> Xeon<sup>&#xae;</sup> CPU E5-2637 v3 processors and 192&#xa0;GB ECC memory. The operating system is Windows 10, and the program environment is MatLab R2017a.</p>
</sec>
<sec sec-type="conclusion" id="s5">
<title>5 Conclusion</title>
<p>This study introduces the CPARSIM framework, designed to efficiently identify electrical current-state patterns and the running states of appliances by analyzing current sequence pieces. In the CPARSIM framework, the two coefficients of the univariate regression equation for each current sequence piece are treated as its features, and the PSO algorithm is applied to solve the univariate regression equation for a current sequence piece where some data may be missing. The challenge of mining current-state patterns is approached as a cluster analysis problem, with each cluster representing a distinct current-state pattern. A novel current-state pattern mining method is proposed based on the DBSCAN algorithm. In our experiments, clustering analysis algorithms, such as the k-means algorithm, DBSCAN algorithm, and SOM neural network, are individually used to cluster the feature set of current sequence pieces. Experimental results show that the current-state pattern mining by the DBSCAN algorithm is more suitable for identifying running states of appliances based on online current sequence pieces in real scenarios.</p>
<p>In this article, the tactics of adjacent data differencing are used to identify pieces of the online current sequence. The online data may exhibit more significant fluctuations if there is significant interference on the circuit, and those fluctuations may result in a single current sequence piece being identified as multiple pieces, as well as significant drifting of the features of these pieces. To ensure the completeness and stability of the current sequence pieces for the same event, techniques such as applying sliding windows, fixed time interval sampling, event triggering, and methods based on load switching points are exciting topics. Additionally, the standardization and normalization of data and the analysis and interpretation of appliances running states corresponding to various current-state patterns based on cluster analysis results are valuable topics for future research.</p>
<p>Furthermore, this article uses univariate regression features to represent variable-length current sequence pieces, and each sequence piece is treated as one point within the two-dimensional feature space. In the future, Fourier transformation can extract the spectral features of the current sequence pieces, or statistical features such as mean, variance, and peak value could be used to represent variable-length current sequence pieces in a unified dimension. Representing variable-length current sequence pieces in a suitable dimension is worth attention in different application scenarios.</p>
</sec>
</body>
<back>
<sec sec-type="data-availability" id="s6">
<title>Data availability statement</title>
<p>The raw data supporting the conclusions of this article will be made available by the authors, without undue reservation.</p>
</sec>
<sec sec-type="author-contributions" id="s7">
<title>Author contributions</title>
<p>ZZ: Writing&#x2013;review and editing, Writing&#x2013;original draft, Software, Resources, Project administration, Methodology, Funding acquisition, Data curation, and Conceptualization. HC: Writing&#x2013;review and editing, Writing&#x2013;original draft, Visualization, Validation, Software, Resources, Investigation, Funding acquisition, Data curation, and Conceptualization. PW: Writing&#x2013;review and editing, Visualization, Validation, Software, Investigation, Formal analysis, and Conceptualization. SZ: Writing&#x2013;review and editing, Visualization, Supervision, and Methodology.</p>
</sec>
<sec sec-type="funding-information" id="s8">
<title>Funding</title>
<p>The author(s) declare that financial support was received for the research, authorship, and/or publication of this article. This work is partially supported by the Discipline (Major) Top-notch Talent Academic Funding Project of Anhui Provincial University and College (gxbjZD2021067 and gxyq2022030), the Innovative Leading Talents Project of Anhui Provincial Special Support Program [(2022)21], the Key Project of Natural Science Research of Universities of Anhui Province (2024AH050246), and the director foundation of the Anhui Province Key Laboratory of Intelligent Building &#x26; Building Energy Saving (No. IBES2022ZR01).</p>
</sec>
<sec sec-type="COI-statement" id="s9">
<title>Conflict of interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="disclaimer" id="s10">
<title>Publisher&#x2019;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors, and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Abhishek</surname>
<given-names>A. S.</given-names>
</name>
<name>
<surname>Bhasker</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Ponraj</surname>
<given-names>A. S.</given-names>
</name>
</person-group> (<year>2021</year>). &#x201c;<article-title>IoT based control system for home automation</article-title>,&#x201d; in <conf-name>2021 IEEE 2nd International Conference on Technology, Engineering, Management for Societal Impact Using Marketing, Entrepreneurship and Talent(TEMSMET)</conf-name> (<publisher-loc>Pune, India</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>1</fpage>&#x2013;<lpage>5</lpage>. <pub-id pub-id-type="doi">10.1109/TEMSMET53515.2021.9768686</pub-id>
</citation>
</ref>
<ref id="B2">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ahammed</surname>
<given-names>M. T.</given-names>
</name>
<name>
<surname>Hasan</surname>
<given-names>M. M.</given-names>
</name>
<name>
<surname>Arefin</surname>
<given-names>M. S.</given-names>
</name>
<name>
<surname>Islam</surname>
<given-names>M. R.</given-names>
</name>
<name>
<surname>Rahman</surname>
<given-names>M. A.</given-names>
</name>
<name>
<surname>Hossain</surname>
<given-names>E.</given-names>
</name>
<etal/>
</person-group> (<year>2021</year>). <article-title>Real-time non-intrusive electrical load classification over IoT using machine learning</article-title>. <source>IEEE Access</source> <volume>9</volume>, <fpage>115053</fpage>&#x2013;<lpage>115067</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2021.3104263</pub-id>
</citation>
</ref>
<ref id="B3">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ahmed</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Ali</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Ciocia</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>D&#x2019;Angola</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>Technological elements behind the renewable energy community: current status, existing gap, necessity, and future perspective&#x2014;overview</article-title>. <source>Energies</source> <volume>17</volume> (<issue>13</issue>), <fpage>3100</fpage>. <pub-id pub-id-type="doi">10.3390/en17133100</pub-id>
</citation>
</ref>
<ref id="B4">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Aslan</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Nur</surname>
<given-names>Z. E.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>An efficient hybrid model for appliances classification based on time series features</article-title>. <source>Energy Build.</source> <volume>266</volume>, <fpage>112087</fpage>. <pub-id pub-id-type="doi">10.1016/j.enbuild.2022.112087</pub-id>
</citation>
</ref>
<ref id="B5">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Avancini</surname>
<given-names>D. B.</given-names>
</name>
<name>
<surname>Rodrigues</surname>
<given-names>J. J. P. C.</given-names>
</name>
<name>
<surname>Rab&#xea;lo</surname>
<given-names>R. A. L.</given-names>
</name>
<name>
<surname>Das</surname>
<given-names>A. K.</given-names>
</name>
<name>
<surname>Kozlov</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Solic</surname>
<given-names>P.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>A new IoT-based smart energy meter for smart grids</article-title>. <source>Int. J. Energy Res.</source> <volume>45</volume> (<issue>1</issue>), <fpage>189</fpage>&#x2013;<lpage>202</lpage>. <pub-id pub-id-type="doi">10.1002/er.5177</pub-id>
</citation>
</ref>
<ref id="B6">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Balakumar</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Vinopraba</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Chandrasekaran</surname>
<given-names>K.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Machine learning based demand response scheme for IoT enabled PV integrated smart building</article-title>. <source>Sustain. Cities Soc.</source> <volume>89</volume>, <fpage>104260</fpage>. <pub-id pub-id-type="doi">10.1016/j.scs.2022.104260</pub-id>
</citation>
</ref>
<ref id="B7">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Caldera</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Hussain</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Romano</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Re</surname>
<given-names>V.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Energy-consumption pattern-detecting technique for household appliances for smart home platform</article-title>. <source>Energies</source> <volume>16</volume> (<issue>2</issue>), <fpage>824</fpage>. <pub-id pub-id-type="doi">10.3390/en16020824</pub-id>
</citation>
</ref>
<ref id="B8">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chen</surname>
<given-names>J. F.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>X. T.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>W. H.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Temporal and spectral feature learning with two-stream convolutional neural networks for appliance recognition in NILM</article-title>. <source>IEEE Trans. Smart Grid</source> <volume>13</volume> (<issue>1</issue>), <fpage>762</fpage>&#x2013;<lpage>772</lpage>. <pub-id pub-id-type="doi">10.1109/TSG.2021.3112341</pub-id>
</citation>
</ref>
<ref id="B9">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chen</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Hu</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Fan</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>He</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Scale- and context-aware convolutional non-intrusive load monitoring</article-title>. <source>IEEE Trans. Power Syst.</source> <volume>35</volume> (<issue>3</issue>), <fpage>2362</fpage>&#x2013;<lpage>2373</lpage>. <pub-id pub-id-type="doi">10.1109/TPWRS.2019.2953225</pub-id>
</citation>
</ref>
<ref id="B10">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chen</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Dong</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Che</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Huang</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Coordinated emergency control strategy of high-voltage direct current transmission and energy storage system based on Pontryagin minimum principle for enhancing power system frequency stability</article-title>. <source>IET Renew. Power Gener.</source> <volume>17</volume> (<issue>7</issue>), <fpage>1680</fpage>&#x2013;<lpage>1698</lpage>. <pub-id pub-id-type="doi">10.1049/rpg2.12703</pub-id>
</citation>
</ref>
<ref id="B11">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chou</surname>
<given-names>J. S.</given-names>
</name>
<name>
<surname>Truong</surname>
<given-names>N. S.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Cloud forecasting system for monitoring and alerting of energy use by home appliances</article-title>. <source>Appl. Energy</source> <volume>249</volume>, <fpage>166</fpage>&#x2013;<lpage>177</lpage>. <pub-id pub-id-type="doi">10.1016/j.apenergy.2019.04.063</pub-id>
</citation>
</ref>
<ref id="B12">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>&#xc7;imen</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>&#xc7;etinkaya</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Vasquez</surname>
<given-names>J. C.</given-names>
</name>
<name>
<surname>Guerrero</surname>
<given-names>J. M.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>A microgrid energy management system based on non-intrusive load monitoring via multitask learning</article-title>. <source>IEEE Trans. Smart Grid</source> <volume>12</volume> (<issue>2</issue>), <fpage>977</fpage>&#x2013;<lpage>987</lpage>. <pub-id pub-id-type="doi">10.1109/TSG.2020.3027491</pub-id>
</citation>
</ref>
<ref id="B13">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Diawuo</surname>
<given-names>F. A.</given-names>
</name>
<name>
<surname>Sakah</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>de la Rue du Can</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Baptista</surname>
<given-names>P. C.</given-names>
</name>
<name>
<surname>Silva</surname>
<given-names>C. A.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Assessment of multiple-based demand response actions for peak residential electricity reduction in Ghana</article-title>. <source>Sustain. Cities Soc.</source> <volume>59</volume>, <fpage>102235</fpage>. <pub-id pub-id-type="doi">10.1016/j.scs.2020.102235</pub-id>
</citation>
</ref>
<ref id="B14">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>El-Sayed</surname>
<given-names>W. T.</given-names>
</name>
<name>
<surname>Awad</surname>
<given-names>A. S. A.</given-names>
</name>
<name>
<surname>Al-Abri</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Alawasa</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Onen</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Ahshan</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>Integrated planning of hydrogen supply chain and reinforcement of power distribution network for accommodating fuel cell electric vehicles</article-title>. <source>Int. J. Hydrogen Energy</source> <volume>81</volume>, <fpage>865</fpage>&#x2013;<lpage>877</lpage>. <pub-id pub-id-type="doi">10.1016/j.ijhydene.2024.07.316</pub-id>
</citation>
</ref>
<ref id="B15">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Fabricio</surname>
<given-names>M. A.</given-names>
</name>
<name>
<surname>Behrens</surname>
<given-names>F. H.</given-names>
</name>
<name>
<surname>Bianchini</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Monitoring of industrial electrical equipment using IoT</article-title>. <source>IEEE Lat. Am. Trans.</source> <volume>18</volume> (<issue>8</issue>), <fpage>1425</fpage>&#x2013;<lpage>1432</lpage>. <pub-id pub-id-type="doi">10.1109/TLA.2020.9111678</pub-id>
</citation>
</ref>
<ref id="B16">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gennitsaris</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Oliveira</surname>
<given-names>M. C.</given-names>
</name>
<name>
<surname>Vris</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Bofilios</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Ntinou</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Frutuoso</surname>
<given-names>A. R.</given-names>
</name>
<etal/>
</person-group> (<year>2023</year>). <article-title>Energy efficiency management in small and medium-sized enterprises: current situation, case studies and best practices</article-title>. <source>Sustainability</source> <volume>15</volume> (<issue>4</issue>), <fpage>3727</fpage>. <pub-id pub-id-type="doi">10.3390/su15043727</pub-id>
</citation>
</ref>
<ref id="B17">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hart</surname>
<given-names>G. W.</given-names>
</name>
</person-group> (<year>1992</year>). <article-title>Nonintrusive appliance load monitoring</article-title>. <source>Proc. IEEE</source> <volume>80</volume> (<issue>12</issue>), <fpage>1870</fpage>&#x2013;<lpage>1891</lpage>. <pub-id pub-id-type="doi">10.1109/5.192069</pub-id>
</citation>
</ref>
<ref id="B18">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hasanvand</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Savaedi</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Hajivand</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Hamrani Salemi</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>Harnessing tidal energy efficiency: a comprehensive analysis of tandem flapping hydrofoils for maximizing power generation from low-level currents</article-title>. <source>Ocean. Eng.</source> <volume>310</volume>, <fpage>118673</fpage>. <pub-id pub-id-type="doi">10.1016/j.oceaneng.2024.118673</pub-id>
</citation>
</ref>
<ref id="B19">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Himeur</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Alsalemi</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Bensaali</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Amira</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Robust event-based non-intrusive appliance recognition using multi-scale wavelet packet tree and ensemble bagging tree</article-title>. <source>Appl. Energy</source> <volume>267</volume>, <fpage>114877</fpage>. <pub-id pub-id-type="doi">10.1016/j.apenergy.2020.114877</pub-id>
</citation>
</ref>
<ref id="B20">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Himeur</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Elnour</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Fadli</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Meskin</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Petri</surname>
<given-names>I.</given-names>
</name>
<name>
<surname>Rezgui</surname>
<given-names>Y.</given-names>
</name>
<etal/>
</person-group> (<year>2023</year>). <article-title>AI-big data analytics for building automation and management systems: a survey, actual challenges and future perspectives</article-title>. <source>Artif. Intell. Rev.</source> <volume>56</volume> (<issue>6</issue>), <fpage>4929</fpage>&#x2013;<lpage>5021</lpage>. <pub-id pub-id-type="doi">10.1007/s10462-022-10286-2</pub-id>
<pub-id pub-id-type="pmid">36268476</pub-id>
</citation>
</ref>
<ref id="B21">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hou</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Qin</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Fan</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Song</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>P.</given-names>
</name>
<etal/>
</person-group> (<year>2024</year>). <article-title>A selective and staged active current limiting control strategy for fault identification in MMC HVDC power grids</article-title>. <source>Int. J. Electr. Power Energy Syst.</source> <volume>160</volume>, <fpage>110143</fpage>. <pub-id pub-id-type="doi">10.1016/j.ijepes.2024.110143</pub-id>
</citation>
</ref>
<ref id="B22">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kong</surname>
<given-names>W. C.</given-names>
</name>
<name>
<surname>Dong</surname>
<given-names>Z. Y.</given-names>
</name>
<name>
<surname>Hill</surname>
<given-names>D. J.</given-names>
</name>
<name>
<surname>Ma</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Zhao</surname>
<given-names>J. H.</given-names>
</name>
<name>
<surname>Luo</surname>
<given-names>F. J.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>A hierarchical hidden Markov model framework for home appliance modeling</article-title>. <source>IEEE Trans. Smart Grid</source> <volume>9</volume> (<issue>4</issue>), <fpage>3079</fpage>&#x2013;<lpage>3090</lpage>. <pub-id pub-id-type="doi">10.1109/TSG.2016.2626389</pub-id>
</citation>
</ref>
<ref id="B23">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kumar</surname>
<given-names>N.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>EV charging adapter to operate with isolated pillar Top solar panels in remote locations</article-title>. <source>IEEE Trans. Energy Convers.</source> <volume>39</volume> (<issue>1</issue>), <fpage>29</fpage>&#x2013;<lpage>36</lpage>. <pub-id pub-id-type="doi">10.1109/TEC.2023.3298817</pub-id>
</citation>
</ref>
<ref id="B24">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kumar</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Saxena</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Singh</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Panigrahi</surname>
<given-names>B. K.</given-names>
</name>
</person-group> (<year>2023a</year>). <article-title>Power quality improved grid-interfaced PV-assisted onboard EV charging infrastructure for smart households consumers</article-title>. <source>IEEE Trans. Consumer Electron.</source> <volume>69</volume> (<issue>4</issue>), <fpage>1091</fpage>&#x2013;<lpage>1100</lpage>. <pub-id pub-id-type="doi">10.1109/TCE.2023.3296480</pub-id>
</citation>
</ref>
<ref id="B25">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kumar</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Singh</surname>
<given-names>H. K.</given-names>
</name>
<name>
<surname>Niwareeba</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>2023b</year>). <article-title>Adaptive control technique for portable solar powered EV charging adapter to operate in remote location</article-title>. <source>IEEE Open J. Circuits Syst.</source> <volume>4</volume>, <fpage>115</fpage>&#x2013;<lpage>125</lpage>. <pub-id pub-id-type="doi">10.1109/OJCAS.2023.3247573</pub-id>
</citation>
</ref>
<ref id="B26">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>H. P.</given-names>
</name>
<name>
<surname>Yu</surname>
<given-names>C. M.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>A hybrid model for appliance classification based on time series features</article-title>. <source>Energy Build.</source> <volume>196</volume>, <fpage>112</fpage>&#x2013;<lpage>123</lpage>. <pub-id pub-id-type="doi">10.1016/j.enbuild.2019.05.028</pub-id>
</citation>
</ref>
<ref id="B27">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Mohi-Ud-Din</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Marnerides</surname>
<given-names>A. K.</given-names>
</name>
<name>
<surname>Shi</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Dobbins</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Macdermott</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Deep cola: a deep COmpetitive learning algorithm for future home energy management systems</article-title>. <source>IEEE Trans. Emerg. Top. Comput. Intell.</source> <volume>5</volume> (<issue>6</issue>), <fpage>1</fpage>&#x2013;<lpage>11</lpage>. <pub-id pub-id-type="doi">10.1109/TETCI.2020.3027300</pub-id>
</citation>
</ref>
<ref id="B28">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Naidu</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Chand</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Pandaram</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Vosikata</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>Electricity consumption, renewable energy production, and current account of organisation for economic Co-operation and development countries: implications for sustainability</article-title>. <source>Sustainability</source> <volume>16</volume> (<issue>9</issue>), <fpage>3722</fpage>. <pub-id pub-id-type="doi">10.3390/su16093722</pub-id>
</citation>
</ref>
<ref id="B29">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Phangbertha</surname>
<given-names>L. N.</given-names>
</name>
<name>
<surname>Fitri</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Purnamasari</surname>
<given-names>I.</given-names>
</name>
<name>
<surname>Muliono</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Smart socket for electricity control in home environment</article-title>. <source>Procedia Comput. Sci.</source> <volume>157</volume>, <fpage>465</fpage>&#x2013;<lpage>472</lpage>. <pub-id pub-id-type="doi">10.1016/j.procs.2019.09.002</pub-id>
</citation>
</ref>
<ref id="B30">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Priyadharshini</surname>
<given-names>S. G.</given-names>
</name>
<name>
<surname>Subramani</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Preetha Roselyn</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Development of intelligent smart metering system through remote monitoring and control under robust conditions</article-title>. <source>J. Test. Eval.</source> <volume>49</volume> (<issue>4</issue>), <fpage>2370</fpage>&#x2013;<lpage>2387</lpage>. <pub-id pub-id-type="doi">10.1520/JTE20200218</pub-id>
</citation>
</ref>
<ref id="B31">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Rago</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Piro</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Boggia</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Dini</surname>
<given-names>P.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Anticipatory allocation of communication and computational Resources at the edge using spatio-temporal dynamics of mobile users</article-title>. <source>IEEE Trans. Netw. Serv. Manag.</source> <volume>18</volume> (<issue>4</issue>), <fpage>4548</fpage>&#x2013;<lpage>4562</lpage>. <pub-id pub-id-type="doi">10.1109/TNSM.2021.3099472</pub-id>
</citation>
</ref>
<ref id="B32">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ramson</surname>
<given-names>S. R. J.</given-names>
</name>
<name>
<surname>Vishnu</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Kirubaraj</surname>
<given-names>A. A.</given-names>
</name>
<name>
<surname>Anagnostopoulos</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Abu-Mahfouz</surname>
<given-names>A. M.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>A LoRaWAN IoT-enabled trash bin level monitoring system</article-title>. <source>IEEE Trans. Industrial Inf.</source> <volume>18</volume> (<issue>2</issue>), <fpage>786</fpage>&#x2013;<lpage>795</lpage>. <pub-id pub-id-type="doi">10.1109/TII.2021.3078556</pub-id>
</citation>
</ref>
<ref id="B33">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Ridi</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Gisler</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Hennebert</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2013</year>). &#x201c;<article-title>Automatic identification of electrical appliances using smart plugs</article-title>,&#x201d; in <conf-name>2013 8th International Workshop on Systems, Signal Processing and Their Applications(WoSSPA)</conf-name> (<publisher-loc>Algiers, Algeria</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>301</fpage>&#x2013;<lpage>305</lpage>. <pub-id pub-id-type="doi">10.1109/WoSSPA.2013.6602380</pub-id>
</citation>
</ref>
<ref id="B34">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Saleem</surname>
<given-names>M. U.</given-names>
</name>
<name>
<surname>Usman</surname>
<given-names>M. R.</given-names>
</name>
<name>
<surname>Shakir</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Design, implementation, and deployment of an IoT based smart energy management system</article-title>. <source>IEEE Access</source> <volume>9</volume>, <fpage>59649</fpage>&#x2013;<lpage>59664</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2021.3070960</pub-id>
</citation>
</ref>
<ref id="B35">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Sayed</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Himeur</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Alsalemi</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Bensaali</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Amira</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Intelligent edge-based recommender system for Internet of energy applications</article-title>. <source>IEEE Syst. J.</source> <volume>16</volume> (<issue>3</issue>), <fpage>5001</fpage>&#x2013;<lpage>5010</lpage>. <pub-id pub-id-type="doi">10.1109/JSYST.2021.3124793</pub-id>
</citation>
</ref>
<ref id="B36">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Solatidehkordi</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Ramesh</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Al-Ali</surname>
<given-names>A. R.</given-names>
</name>
<name>
<surname>Osman</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Shaaban</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>An IoT deep learning-based home appliances management and classification system</article-title>. <source>Energy Rep.</source> <volume>9</volume> (<issue>3</issue>), <fpage>503</fpage>&#x2013;<lpage>509</lpage>. <pub-id pub-id-type="doi">10.1016/j.egyr.2023.01.071</pub-id>
</citation>
</ref>
<ref id="B37">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Swindiarto</surname>
<given-names>V. T. P.</given-names>
</name>
<name>
<surname>Sarno</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Novitasari</surname>
<given-names>D. C. R.</given-names>
</name>
</person-group> (<year>2018</year>). &#x201c;<article-title>Integration of fuzzy C-means clustering and TOPSIS (FCM-TOPSIS) with silhouette analysis for multi criteria parameter data</article-title>,&#x201d; in <conf-name>2018 International Seminar on Application for Technology of Information and Communication: Creative Technology for Human Life, iSemantic</conf-name> (<publisher-loc>Semarang, Indonesia</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>463</fpage>&#x2013;<lpage>468</lpage>. <pub-id pub-id-type="doi">10.1109/ISEMANTIC.2018.8549844</pub-id>
</citation>
</ref>
<ref id="B38">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ullah</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Narayanan</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Wolff</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Nardelli</surname>
<given-names>P. H. J.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Industrial energy management system: design of a conceptual framework using IoT and big data</article-title>. <source>IEEE Access</source> <volume>10</volume>, <fpage>110557</fpage>&#x2013;<lpage>110567</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2022.3215167</pub-id>
</citation>
</ref>
<ref id="B39">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Anomaly detection for power consumption patterns based on linear discriminant analysis and density peak clustering</article-title>. <source>Dianli Xit. Zidonghua/Automation Electr. Power Syst.</source> <volume>46</volume> (<issue>5</issue>), <fpage>87</fpage>&#x2013;<lpage>95</lpage>. <pub-id pub-id-type="doi">10.7500/AEPS20210717003</pub-id>
</citation>
</ref>
<ref id="B40">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>L. C.</given-names>
</name>
<name>
<surname>Cho</surname>
<given-names>W. T.</given-names>
</name>
<name>
<surname>Chiu</surname>
<given-names>Y. S.</given-names>
</name>
<name>
<surname>Lai</surname>
<given-names>C. F.</given-names>
</name>
</person-group> (<year>2013</year>). &#x201c;<article-title>A parallel multi-appliance recognition for smart meter</article-title>,&#x201d; in <conf-name>Proceedings - 2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing(DASC)</conf-name> (<publisher-loc>Chengdu, Sichuan, China</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>475</fpage>&#x2013;<lpage>480</lpage>. <pub-id pub-id-type="doi">10.1109/DASC.2013.110</pub-id>
</citation>
</ref>
<ref id="B41">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yan</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Jin</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Sun</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Dong</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Ye</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Z.</given-names>
</name>
<etal/>
</person-group> (<year>2019</year>). <article-title>Household appliance recognition through a Bayes classification model</article-title>. <source>Sustain. Cities Soc.</source> <volume>46</volume>, <fpage>101393</fpage>. <pub-id pub-id-type="doi">10.1016/j.scs.2018.12.021</pub-id>
</citation>
</ref>
<ref id="B42">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Wei</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Fan</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Qiu</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>Profile of inner magnetically insulated transmission lines to minimize energy loss under MA/Cm lineal current density for high-current pulsed-power accelerators</article-title>. <source>IEEE Trans. Plasma Sci.</source> <volume>52</volume> (<issue>4</issue>), <fpage>1372</fpage>&#x2013;<lpage>1379</lpage>. <pub-id pub-id-type="doi">10.1109/TPS.2024.3388712</pub-id>
</citation>
</ref>
<ref id="B43">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhou</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Dong</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Hu</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Xiao</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Non-intrusive load monitoring based on motif mining and harmonic function based semi-supervised learning</article-title>. <source>Dianli Zidonghua Shebei/Electric Power Autom. Equip.</source> <volume>42</volume> (<issue>7</issue>), <fpage>3</fpage>&#x2013;<lpage>10</lpage>. <pub-id pub-id-type="doi">10.16081/j.epae.202202013</pub-id>
</citation>
</ref>
<ref id="B44">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhu</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Ai</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>He</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Sun</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>X.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>An overview of data-driven electricity consumption behavior analysis method and application</article-title>. <source>Dianwang Jishu/Power Syst. Technol.</source> <volume>44</volume> (<issue>9</issue>), <fpage>3497</fpage>&#x2013;<lpage>3507</lpage>. <pub-id pub-id-type="doi">10.13335/j.1000-3673.pst.2020.0226a</pub-id>
</citation>
</ref>
</ref-list>
</back>
</article>
