Incremental Algorithm Research Articles

Capturing More Associations by Referencing External Graphs

This paper studies association rule discovery in a graph G 1 by referencing an external graph G 2 with overlapping information. The objective is to enrich G 1 with relevant properties and links from G 2 . As a testbed, we consider Graph Association Rules (GARs). We propose a notion of graph joins to enrich G 1 by aligning entities across G 1 and G 2 . We also introduce a graph filtering method to support graph joins, by fetching only the data of G 2 that pertains to the entities of G 1 , to reduce noise and the size of the fused data. Based on these we develop a parallel algorithm to discover GARs across G 1 and G 2 . Moreover, we provide an incremental GAR discovery algorithm in response to updates to G 1 and G 2 . We show that both algorithms guarantee to reduce parallel runtime when given more processors. Better yet, the incremental algorithm is bounded relative to the batch one. Using real-life and synthetic data, we empirically verify that the methods improve the accuracy of association analyses by 30.4% on average, and scale well with large graphs.

A novel maximum power point tracking with hybrid control algorithm for automotive thermoelectric generator system.

To dynamically track the maximum power of an automotive thermoelectric generator (ATEG) system in real-time, this study introduces a novel maximum power point tracking (MPPT) algorithm that integrates Kalman filtering and fuzzy control. Employing a two-phase interleaved parallel DC-DC boost converter in the MPPT controller effectively reduces current ripple and switch loss. Results demonstrated a significant improvement in tracking time compared to the traditional incremental conductance algorithm, attributed to the elimination of high-frequency components in output power by the Kalman filter. The novel algorithm exhibits enhanced tracking stability through the application of fuzzy control. Ultimately, the tracking accuracy of the novel algorithm surpasses that of the incremental conductance algorithm by 5.2%, achieving an impressive 94.9%. This study, therefore, presents a valuable contribution to a novel MPPT algorithm for precisely and rapidly tracking the global maximum power points of the ATEG system throughout the entire vehicle driving cycle.

OEBench: Investigating Open Environment Challenges in Real-World Relational Data Streams

How to get insights from relational data streams in a timely manner is a hot research topic. Data streams can present unique challenges, such as distribution drifts, outliers, emerging classes, and changing features, which have recently been described as open environment challenges for machine learning. While existing studies have been done on incremental learning for data streams, their evaluations are mostly conducted with synthetic datasets. Thus, a natural question is how those open environment challenges look like and how existing incremental learning algorithms perform on real-world relational data streams. To fill this gap, we develop an Open Environment Benchmark named OEBench to evaluate open environment challenges in real-world relational data streams. Specifically, we investigate 55 real-world relational data streams and establish that open environment scenarios are indeed widespread, which presents significant challenges for stream learning algorithms. Through benchmarks with existing incremental learning algorithms, we find that increased data quantity may not consistently enhance the model accuracy when applied in open environment scenarios, where machine learning models can be significantly compromised by missing values, distribution drifts, or anomalies in real-world data streams. The current techniques are insufficient in effectively mitigating these challenges brought by open environments. More researches are needed to address real-world open environment challenges. All datasets and code are open-sourced in https://github.com/Xtra-Computing/OEBench.

Incremental reinforcement learning and optimal output regulation under unmeasurable disturbances

In this paper, we propose novel data-driven optimal dynamic controller design frameworks, via both state-feedback and output-feedback, for solving optimal output regulation problems of linear discrete-time systems subject to unknown dynamics and unmeasurable disturbances using reinforcement learning (RL). Fundamentally different from existing research on optimal output regulation problems and RL, the proposed procedures can determine both the optimal control gain and the optimal dynamic compensator simultaneously instead of presetting a non-optimal dynamic compensator. Moreover, we present incremental dataset-based RL algorithms to learn the optimal dynamic controllers that do not require the measurements of the external disturbance and the exostate during learning, which is of great practical importance. Besides, we show that the proposed incremental dataset-based learning methods are more robust to a class of measurement noises with arbitrary magnitudes than routine RL algorithms. Comprehensive simulation results validate the efficacy of our methodologies.

BASS: Broad Network Based on Localized Stochastic Sensitivity.

The training of the standard broad learning system (BLS) concerns the optimization of its output weights via the minimization of both training mean square error (MSE) and a penalty term. However, it degrades the generalization capability and robustness of BLS when facing complex and noisy environments, especially when small perturbations or noise appear in input data. Therefore, this work proposes a broad network based on localized stochastic sensitivity (BASS) algorithm to tackle the issue of noise or input perturbations from a local perturbation perspective. The localized stochastic sensitivity (LSS) prompts an increase in the network's noise robustness by considering unseen samples located within a Q -neighborhood of training samples, which enhances the generalization capability of BASS with respect to noisy and perturbed data. Then, three incremental learning algorithms are derived to update BASS quickly when new samples arrive or the network is deemed to be expanded, without retraining the entire model. Due to the inherent superiorities of the LSS, extensive experimental results on 13 benchmark datasets show that BASS yields better accuracies on various regression and classification problems. For instance, BASS uses fewer parameters (12.6 million) to yield 1% higher Top-1 accuracy in comparison to AlexNet (60 million) on the large-scale ImageNet (ILSVRC2012) dataset.

Optimizing The Maximum Power of Photovoltaic System Using Modified Incremental Conductance Algorithm Operating Under Varying Dynamic Climatic Conditions

Optimizing The Maximum Power of Photovoltaic System Using Modified Incremental Conductance Algorithm Operating Under Varying Dynamic Climatic Conditions

Kernel Path for Semisupervised Support Vector Machine.

Semisupervised support vector machine (S3VM) is a powerful semisupervised learning model that can use large amounts of unlabeled data to train high-quality classification models. The choice of kernel parameters in the kernel function determines the mapping between the input space and the feature space and is crucial to the performance of the S3VM. Kernel path algorithms have been widely recognized as one of the most efficient tools to trace the solutions with respect to a kernel parameter. However, existing kernel path algorithms are limited to convex problems, while S3VM is nonconvex problem. To address this challenging problem, in this article, we first propose a kernel path algorithm of S3VM (KPS3VM), which can track the solutions of the nonconvex S3VM with respect to a kernel parameter. Specifically, we estimate the position of the breakpoint by monitoring the change of the sample sets. In addition, we also use an incremental and decremental learning algorithm to deal with the Karush-Khun-Tucker violating samples in the process of tracking the solutions. More importantly, we prove the finite convergence of our KPS3VM algorithm. Experimental results on various benchmark datasets not only validate the effectiveness of our KPS3VM algorithm but also show the advantage of choosing the optimal kernel parameters.

A data-knowledge-driven interval type-2 fuzzy neural network with interpretability and self-adaptive structure

Interval type-2 fuzzy neural networks (IT2FNNs) have gained sustainable attention and wide applications because of their power of adaptive fuzzy modeling. Although the existing models accurately simulate the relationships between inputs and outputs by various adaptive learning algorithms, the parameters and fuzzy rules characterizing the model behaviors no longer have explicit interpretations. To achieve good interpretability and generalization performance, this paper proposes a novel data-knowledge-driven IT2FNN (DKIT2FNN). Unlike accuracy-oriented model fitting, DKIT2FNN pioneers the use of famous association rule mining techniques to automatically explore the interpretable rule knowledge, which intuitively presents conditional relation patterns among features. Using the obtained knowledge, the DKIT2FNN model is accomplished in a single-hidden layer network framework, in which the antecedent structure of each fuzzy rule is determined by the relation patterns provided by rule knowledge. In addition, an adversarial incremental learning algorithm is proposed for the self-organizing modeling of DKIT2FNN. Besides automatically assembling a compact rule base, it integrates the label adversarial training to reinforce the model's capability against label noise. We validate the DKIT2FNN on classification benchmark datasets with label noise and compare it with state-of-the-art non-fuzzy and neuro-fuzzy methods. The results demonstrate that the proposed DKIT2FNN achieves robust classification performance and good interpretability.

An adaptive routing strategy in P2P-based Edge Cloud

P2P-based Edge Cloud (PEC) is widely used in Internet of Things (IoT). Inevitably, the sensor data routing technology has a significant impact on the performance of PEC. Due to its prevalence and complexity, the existing routing technologies in PEC need to be optimized. Specifically, key factors such as overall network traffic, user access latency, and resource utilization of edge nodes should be considered to adapt to the dynamic requirements of user request services and network topology. In order to address the challenges produced by these factors, an adaptive routing in P2P-based Edge Cloud is proposed, which is named ARPEC. In our approach, a target edge node selection scheme based on message activity and network topology is proposed, aiming to minimize the load on edge node and user access latency. Furthermore, to minimize system overhead, sensor data routing is mapped to minimum cost maximum flow (MCMF) graph. On this basis, a target edge node selection algorithm based on a grey linear regression combination prediction model is designed, and an incremental MCMF algorithm based on belief propagation (BP) is proposed. The evaluation results show that our approach can effectively improve PEC transmission performance and user experience.

Key grids based batch-incremental CLIQUE clustering algorithm considering cluster structure changes

In the network environment, data from various industries is dynamic and large-scale. Traditional clustering algorithms struggle to effectively utilize existing clustering results when faced with continuously evolving data, which makes the incremental grid-based clustering highly regarded. However, the existing incremental grid-based clustering algorithms fail to adequately consider the impact of newly added data on the original cluster structure. To address this issue, the key grids based batch-incremental CLIQUE clustering algorithm is proposed. The algorithm designates the incremental data mapping grids, which are or their neighbour girds are mixed with original data, as key grids to fully consider the cluster structure changes caused by the incremental data. Moreover, the cluster similarity coefficient based on grid features is introduced to measure density differences between the incremental data and the original clusters, and the cluster membership degree is defined to further consider the cluster membership of boundary sparse grid data and the identification of noise points. All of which ensures that the algorithm can adaptively create, merge or split clusters with the arrival of new data. Experimental results show that the proposed algorithm can adaptively adjust the cluster structure during incremental clustering, outperforming in accuracy and efficiency when clustering large-scale, dynamically changing data.

Speeding up iterative applications of the BUILD supertree algorithm.

The Open Tree of Life (OToL) project produces a supertree that summarizes phylogenetic knowledge from tree estimates published in the primary literature. The supertree construction algorithm iteratively calls Aho's Build algorithm thousands of times in order to assess the compatability of different phylogenetic groupings. We describe an incrementalized version of the Build algorithm that is able to share work between successive calls to Build. We provide details that allow a programmer to implement the incremental algorithm BuildInc, including pseudo-code and a description of data structures. We assess the effect of BuildInc on our supertree algorithm by analyzing simulated data and by analyzing a supertree problem taken from the OpenTree 13.4 synthesis tree. We find that BuildInc provides up to 550-fold speedup for our supertree algorithm.

An Improved Jaccard Coefficient‐Based Clustering Approach with Application to Diagnosis and RUL Estimation

Sample clustering techniques play a crucial role in the data‐driven state evaluation of electromechanical equipment, and selecting an appropriate similarity measurement method for sample sets helps improve the clustering performance. The Jaccard coefficient is a commonly employed indicator of similarity for scalar set‐type samples. In this paper, we propose an incremental clustering algorithm for matrix‐type samples by defining an improved Jaccard coefficient. First, a new binary relation is formulated to derive a relationship matrix between samples. Second, an undirected graph is given by using the relationship matrix, and an improved pruning operation is provided to simplify the graph by eliminating redundant edges. Then, a new relationship matrix is generated according to the modified graph, which enables the calculation of the improved Jaccard coefficient. By using the improved Jaccard coefficient, the improved incremental clustering algorithm updates cluster centers by selecting a particular sample to maximize the sum of similarities between the selected sample and other samples within the same cluster. Finally, the effectiveness of the proposed incremental clustering algorithm is demonstrated in fault diagnosis and remaining useful life estimation application scenarios, respectively. The experimental results indicate that the improved algorithm outperforms traditional clustering methods.

Research on the Innovative Development of Digital Media Enabled by Computer Visual Arts

Abstract This paper explores the integration of computer visual art with digital media, highlighting the innovative potential of computer technology in creating dynamic digital media art. Initially, we review relevant theories of computer-based visual art and examine their applications in digital media art. We then detail an immersive scene design using Web3D technology, where images are processed via a computer vision camera imaging model, transformed, and analyzed with the SIFT algorithm to extract feature points. These are integrated with the incremental SFM algorithm for three-dimensional image reconstruction in immersive environments. We validate these methods with real datasets and controlled experiments to assess user experience improvements in digital media applications. Results indicate that the SIFT algorithm’s image-matching accuracy ranges from 50% to 78%, and the incremental SFM algorithm shows an average rotation error of only 0.183°. User sentiment scores improved significantly, from 11.583 to 23.452, post-experience, demonstrating enhanced realism and a new direction for digital media art.

Model Validation for an Integrated Solar PV System Laboratory

This study focuses on the model validation of an Integrated Solar System Laboratory, employing a comprehensive approach encompassing solar energy sources, batteries, DC/DC boost converters, inverters, and controllers. Mathematical models were meticulously formulated for each key component and implemented using MATLAB/Simulink to create a virtual environment mirroring the laboratory setup. Validation was conducted by accurately representing the designed system parameters in the simulation environment, and then assessing the dynamic responses of the various simulated outputs. The system, designed for diverse photovoltaic solar applications, integrates energy management software. Simulation results showcase the system’s dynamic responses to varying solar irradiance, load patterns, and disturbances, highlighting the efficacy of control algorithms. Key findings indicate that the incremental conductance algorithm effectively optimizes the PV module’s operating point at 7.5 Amps and 90 volts. System stability endures load variations, with the inverter stable at 65%. Additionally, the efficiency of the MPPT technique and converter duty cycle stability are emphasized, along with the battery discharge rate reduction from 67% to approximately 20%. The study validates solar system models, ensuring accurate representation. Robust control algorithms maintain stability amidst load variations, showcasing system efficiency.

An Incremental Naive Bayes Learner for Real-time Health Prediction

Healthcare monitoring systems have improved with the Internet of Things and machine learning prediction models. Traditional batch machine-learning approaches cannot generate an effective model since most data will be continuous and real-time. Real-time medical data processing is challenging since the entire data is unavailable during prediction. Here, a continuous model adaptation based on incremental learning is demanded. The development of such a system can significantly improve patient outcomes and reduce healthcare costs. This paper proposes an Incremental Naive Bayes Learner that can handle concept drifts in data. The algorithm keeps a sliding window of data constantly updated as new data is added. The adaptive window size determines how much data is used to train the model at any given time. After processing each chunk of data, the algorithm calculates the model’s accuracy. The system detects a concept drift and dynamically updates the training set if the accuracy drops below a predefined threshold. We conducted a comparative evaluation of state-of-the-art batch and incremental learning algorithms on different medical datasets, demonstrating the impact of incremental learning. The results demonstrate the effectiveness of our approach: the Agrawal dataset achieved the highest accuracy at 66.6%, followed by Dialysis at 61.6%, while Liver and HCC achieved 50% and 58.3% accuracy, respectively. This approach ensures a sustained high level of accuracy in healthcare monitoring systems over time, even amidst concept drift.

Global Model Selection via Solution Paths for Robust Support Vector Machine.

Robust support vector machine (RSVM) using ramp loss provides a better generalization performance than traditional support vector machine (SVM) using hinge loss. However, the good performance of RSVM heavily depends on the proper values of regularization parameter and ramp parameter. Traditional model selection technique with gird search has extremely high computational cost especially for fine-grained search. To address this challenging problem, in this paper, we first propose solution paths of RSVM (SPRSVM) based on the concave-convex procedure (CCCP) which can track the solutions of the non-convex RSVM with respect to regularization parameter and ramp parameter respectively. Specifically, we use incremental and decremental learning algorithms to deal with the Karush-Khun-Tucker violating samples in the process of tracking the solutions. Based on the solution paths of RSVM and the piecewise linearity of model function, we can compute the error paths of RSVM and find the values of regularization parameter and ramp parameter, respectively, which corresponds to the minimum cross validation error. We prove the finite convergence of SPRSVM and analyze the computational complexity of SPRSVM. Experimental results on a variety of benchmark datasets not only verify that our SPRSVM can globally search the regularization and ramp parameters respectively, but also show a huge reduction of computational time compared with the grid search approach.

When Broad Learning System Meets Label Noise Learning: A Reweighting Learning Framework.

Broad learning system (BLS) is a novel neural network with efficient learning and expansion capacity, but it is sensitive to noise. Accordingly, the existing robust broad models try to suppress noise by assigning each sample an appropriate scalar weight to tune down the contribution of noisy samples in network training. However, they disregard the useful information of the noncorrupted elements hidden in the noisy samples, leading to unsatisfactory performance. To this end, a novel BLS with adaptive reweighting (BLS-AR) strategy is proposed in this article for the classification of data with label noise. Different from the previous works, the BLS-AR learns for each sample a weight vector rather than a scalar weight to indicate the noise degree of each element in the sample, which extends the reweighting strategy from sample level to element level. This enables the proposed network to precisely identify noisy elements and thus highlight the contribution of informative ones to train a more accurate representation model. Thanks to the separability of the model, the proposed network can be divided into several subnetworks, each of which can be trained efficiently. In addition, three corresponding incremental learning algorithms of the BLS-AR are developed for adding new samples or expanding the network. Substantial experiments are conducted to explicate the effectiveness and robustness of the proposed BLS-AR model.

A Memory-Efficient Federated Kernel Support Vector Machine for Edge Devices.

A federated learning (FL) scheme (denoted as Fed-KSVM) is designed to train kernel support vector machines (SVMs) over multiple edge devices with low memory consumption. To decompose the training process of kernel SVM, each edge device first constructs high-dimensional random feature vectors of its local data, and then trains a local SVM model over the random feature vectors. To reduce the memory consumption on each edge device, the optimization problem of the local model is divided into several subproblems. Each subproblem only optimizes a subset of the model parameters over a block of random feature vectors with a low dimension. To achieve the same optimal solution to the original optimization problem, an incremental learning algorithm called block boosting is designed to solve these subproblems sequentially. After training of the local models, the central server constructs a global SVM model by averaging the model parameters of these local models. Fed-KSVM only increases the iterations of training the local SVM models to save the memory consumption, while the communication rounds between the edge devices and the central server are not affected. Theoretical analysis shows that the kernel SVM model trained by Fed-KSVM converges to the optimal model with a linear convergence rate. Because of such a fast convergence rate, Fed-KSVM reduces the communication cost during training by up to 99% compared with the centralized training method. The experimental results also show that Fed-KSVM reduces the memory consumption on the edge devices by nearly 90% while achieving the highest test accuracy, compared with the state-of-the-art schemes.

An Incremental Clustering Algorithm for Arbitrary Shaped in IoT Data

An Incremental Clustering Algorithm for Arbitrary Shaped in IoT Data

Establishment of the microscope incubation system and its application in evaluating tumor treatment effects through real-time live cellular imaging.

Introduction: Long-term imaging of live cells is commonly used for the study of dynamic cell behaviors. It is crucial to keep the cell viability during the investigation of physiological and biological processes by live cell imaging. Conventional incubators that providing stable temperature, carbon dioxide (CO2) concentration, and humidity are often incompatible with most imaging tools. Available commercial or custom-made stage-top incubators are bulky or unable to provide constant environmental conditions during long time culture. Methods: In this study, we reported the development of the microscope incubation system (MIS) that can be easily adapted to any inverted microscope stage. Incremental PID control algorithm was introduced to keep stable temperature and gas concentration of the system. Moreover, efficient translucent materials were applied for the top and bottom of the incubator which make it possible for images taken during culture. Results: The MIS could support cell viability comparable to standard incubators. When used in real time imaging, the MIS was able to trace single cell migration in scratch assay, T cell mediated tumor cells killing in co-culture assay, inflation-collapse and fusion of organoids in 3D culture. And the viability and drug responses of cells cultured in the MIS were able to be calculated by a label-free methods based on long term imaging. Discussion: We offer new insights into monitoring cell behaviors during long term culture by using the stage adapted MIS. This study illustrates that the newly developed MIS is a viable solution for long-term imaging during in vitro cell culture and demonstrates its potential in cell biology, cancer biology and drug discovery research where long-term real-time recording is required.