Search

Semi-Supervised Graph Clustering (SSGC) has emerged as a pivotal field at the intersection of graph clustering and semi-supervised learning (SSL), offering innovative solutions to intricate data analysis problems. However, despite its significance and wide-ranging applications, there exists a notable void in the literature—a comprehensive survey specifically dedicated to SSGC techniques and their diverse applications remains conspicuously absent. Addressing this gap, this paper presents a systematic and comprehensive review of SSGC methodologies, spanning from well-established approaches to cutting-edge developments. Through a meticulous categorization, critical examination, and insightful discussion of these techniques, this survey not only illuminates the current landscape of SSGC but also identifies unexplored avenues for exploration and innovation. In this paper we present a comprehensive survey of conventional graph construction, graph clustering, SSL methods, evaluation metrics and their primary development process. We then provide a taxonomy of SSGC techniques based on their structures and principles and thoroughly analyze and discuss the related models. Furthermore, we review the applications of SSGC in various fields. Lastly, we summarize the limitations of current SSGC algorithms and discuss the future directions of the field. [ABSTRACT FROM AUTHOR]

Semi-Supervised Graph Clustering (SSGC) has emerged as a pivotal field at the intersection of graph clustering and semi-supervised learning (SSL), offering innovative solutions to intricate data analysis problems. However, despite its significance and wide-ranging applications, there exists a notable void in the literature—a comprehensive survey specifically dedicated to SSGC techniques and their diverse applications remains conspicuously absent. Addressing this gap, this paper presents a systematic and comprehensive review of SSGC methodologies, spanning from well-established approaches to cutting-edge developments. Through a meticulous categorization, critical examination, and insightful discussion of these techniques, this survey not only illuminates the current landscape of SSGC but also identifies unexplored avenues for exploration and innovation. In this paper we present a comprehensive survey of conventional graph construction, graph clustering, SSL methods, evaluation metrics and their primary development process. We then provide a taxonomy of SSGC techniques based on their structures and principles and thoroughly analyze and discuss the related models. Furthermore, we review the applications of SSGC in various fields. Lastly, we summarize the limitations of current SSGC algorithms and discuss the future directions of the field. [ABSTRACT FROM AUTHOR]

The lighting requirements are subjective and one light setting cannot work for all. However, there is little work on developing smart lighting algorithms that can adapt to user preferences. To address this gap, this paper uses fuzzy logic and reinforcement learning to develop an adaptive lighting algorithm. In particular, we develop a baseline fuzzy inference system (FIS) using the domain knowledge, generating light recommendation based on a set of intuitive rules. These rules, derived from existing literature, are based on environmental conditions i.e. daily glare index, and user information including age, activity, and chronotype. Through a feedback mechanism, the user interacts with the algorithm, correcting the algorithm output to their preferences. We interpret these corrections as rewards to a Q-learning algorithm, which tunes the FIS parameters online to match the user preferences. The Q-learning is a model-free learning algorithm that learns to act optimally by interacting with the user and the rewards it receives. This allows the proposed algorithm to work in a model-free manner, effectively handling the uncertainties that might arise from the individualistic preferences of users. To the authors' best knowledge, this algorithm is pioneering work in designing intelligent algorithms for personalized lighting control, featuring several elements of novelty, including the number of environmental and user-related inputs, the continuous control of light intensity as opposed to common on/off control, and the ability to learn user preferences. The algorithm is implemented in a real aircraft cabin and is evaluated in an extensive user study. The implementation results demonstrate that the developed algorithm possesses the capability to learn user preferences while successfully adapting to a wide range of environmental conditions and user characteristics. This underscores its viability as a potent solution for intelligent light management, featuring advanced learning capabilities. • Intelligent lighting algorithm with the ability to learn from and adapt to user preferences. • A fuzzy inference system tunes lighting based on environment and user traits. • The developed algorithm is tested and verified via an in-depth user study. [ABSTRACT FROM AUTHOR]

Grid-interactive building control poses a critical challenge in the context of grid modernization and decarbonization. Recently, various artificial intelligence-based optimal control approaches have been proposed, providing innovative solutions to optimal building control problems. However, researchers and practitioners are now confronted with a dilemma when selecting appropriate control strategies, ranging from model-based (knowledge-incorporating) to learning-based (data-driven) approaches, and hybrid methods combining them. Although each algorithm in existing literature claims superiority over specific baselines, their performance has never been systematically compared and analyzed, owing to the absence of a unified platform for comprehensive evaluation. To fill this knowledge gap, we identify and implement all state-of-the-art approaches within a modular training and evaluation framework, assessing their efficacy in a grid-interactive building control problem. In this paper, we also introduce a streamlined hybrid method that complements existing hybrid approaches. Our comparative study reveals and quantifies the advantages of hybrid methods: on average, they achieve near-optimal control while requiring less than 14% of the online computation of traditional model-based methods. To achieve this performance, they need as few as 2% of the training samples of purely learning-based methods. Finally, we provide insights into the merits, limitations, and implementation of each method to help researchers better understand the state of the art and future directions. The software framework implemented in this study is open-sourced to facilitate future research. [ABSTRACT FROM AUTHOR]

Bayesian network (BN) structure learning is the basis of BN applications and plays a pivotal role in many machine learning tasks. Whereas remarkable progress in structure learning has been achieved in the past, making further improvements in the efficiency and accuracy of structure learning is a significant challenge. In this paper, we propose an efficient skeleton learning approach-based hybrid algorithm (ESLH), which consists of two phases. In the constraint-based phase, a dynamic threshold (DTH) strategy and a skeleton learning method based on triangle breaking (SLTB) are proposed to learn the skeleton of a BN structure efficiently. DTH designs a dynamic threshold to remove redundant edges in the initial skeleton with little time overhead. By the result of DTH, SLTB first finds, tests and breaks triangles in the initial skeleton to efficiently remove redundant edges and then removes the remaining redundant edges to discover the final skeleton. In the score-and-search phase, ESLH employs the hill-climbing algorithm to find the highest-scored structure. We propose a novel strategy to divide this phase into three steps, both utilizing the learned skeleton to constrain the search space and preventing the errors of the learned skeleton from reducing the quality of the final learned structure. Extensive experiments on benchmark BNs validate the effectiveness of DTH and SLTB and demonstrate that ESLH is more than five times faster than the state-of-the-art structure learning algorithms while maintaining the highest average accuracy. [ABSTRACT FROM AUTHOR]

Bayesian network (BN) structure learning is the basis of BN applications and plays a pivotal role in many machine learning tasks. Whereas remarkable progress in structure learning has been achieved in the past, making further improvements in the efficiency and accuracy of structure learning is a significant challenge. In this paper, we propose an efficient skeleton learning approach-based hybrid algorithm (ESLH), which consists of two phases. In the constraint-based phase, a dynamic threshold (DTH) strategy and a skeleton learning method based on triangle breaking (SLTB) are proposed to learn the skeleton of a BN structure efficiently. DTH designs a dynamic threshold to remove redundant edges in the initial skeleton with little time overhead. By the result of DTH, SLTB first finds, tests and breaks triangles in the initial skeleton to efficiently remove redundant edges and then removes the remaining redundant edges to discover the final skeleton. In the score-and-search phase, ESLH employs the hill-climbing algorithm to find the highest-scored structure. We propose a novel strategy to divide this phase into three steps, both utilizing the learned skeleton to constrain the search space and preventing the errors of the learned skeleton from reducing the quality of the final learned structure. Extensive experiments on benchmark BNs validate the effectiveness of DTH and SLTB and demonstrate that ESLH is more than five times faster than the state-of-the-art structure learning algorithms while maintaining the highest average accuracy. [ABSTRACT FROM AUTHOR]

Grassland restoration is a crucial method for preventing ecological degradation in grasslands. Unmanned Aerial Vehicles (UAVs) offer a promising solution to reduce extensive human labor and enhance restoration efficiency, given their fully automatic capabilities, yet their full potential remains exploited. This paper progresses this emerging technology for planning the grassland restoration. We undertake the first attempt to mathematically model the UAV-enabled restoration process as the maximization of restoration areas problem (MRAP). This model considers factors including limited UAV battery energy, grass seed weight, the number of restored areas, and their sizes. The MRAP is a composite problem involving trajectory design and area allocation, which are highly coupled and conflicting. Consequently, it requires solving two NP-hard subproblems: the variant Traveling Salesman Problem (TSP) and the Multidimensional Knapsack Problem (MKP) simultaneously. To address this complex problem, we introduce a novel cooperative memetic algorithm. The algorithm integrates an efficient heuristic algorithm, variant population-based incremental learning (PBIL), and a maximum-residual-energy-based local search (MRELS) strategy, referred to as CHAPBILM. The algorithm solves the two subproblems interlacedly by leveraging the interdependencies and inherent knowledge between them. The simulation results demonstrate that CHAPBILM successfully solves the MRAP on multiple instances in a near-optimal way. It also confirms the conflicts between trajectory design and area allocation. The effectiveness of CHAPBILM is further supported by comparisons with traditional optimization methods that do not exploit the interdependencies between the two subproblems. The proposed model and solution have the potential to be extended to other complex optimization problems in ecological protection and precision agriculture. • The maximization of restoration areas problem is first presented for the UAV-enabled grassland restoration method. • An energy-sensitive mathematical programming model is formulated for the maximization of restoration areas problem under the realistic constraints. • A novel cooperative memetic algorithm CHAPBILM is explored to effectively solve the maximization restoration areas problem, without ignoring the dependence between the two stages. • The simulation results demonstrate that CHAPBILM performs significantly better than the noncooperative optimization method for the problem, which also confirms the dependency relationship. [ABSTRACT FROM AUTHOR]

Attribute reduction can remove data noise and redundancy, thus reducing computational complexity, which is very important for machine learning. Because the difference between nominal attribute values is difficult to measure, attribute reduction for hybrid data faces challenges. In addition, most of the existing methods are sensitive to noise due to the lack of an anti-noise mechanism. Decision attribute contains the most important information of data. This paper proposes some techniques that consider the above problems from the perspective of fuzzy evidence theory. First of all, a new distance incorporating decision attributes is defined, and then a new fuzzy relation with an anti-noise mechanism is defined. Furthermore, fuzzy belief and fuzzy plausibility are defined based on the defined new distance and new fuzzy relation. In this framework, two anti-noise attribute reduction algorithms for hybrid data are proposed. Experiments on 12 data sets of various types show that compared with the other 8 state-of-the-art algorithms, the proposed algorithms improve the classification accuracy by at least 2% and the anti-noise ability by at least 11%. Therefore, it can be concluded that the proposed algorithms have excellent anti-noise ability while maintaining good feature selection ability. [ABSTRACT FROM AUTHOR]

MapReduce is a popular paradigm in distributed computing, but it is not efficient when executing iterative algorithms over a distributed big dataset due to its heavy data communication overhead. Non-MapReduce computing is an alternative for improving computing efficiency and data scalability when using iterative algorithms to process big distributed datasets on clusters. In this paper, we investigate Non-MapReduce approach in distributed computing and use Spark implementations of machine learning algorithms to discuss the problems of MapReduce in executing iterative algorithms over a big distributed dataset and the advantages of Non-MapReduce for the same tasks. We present a method to build a new machine learning library made of sequential algorithms for distributed computing. We use experiment results to show comparisons of computing efficiency and data scalability of MapReduce and Non-MapReduce in executing six machine learning algorithms over big datasets. [ABSTRACT FROM AUTHOR]

Because of the COVID-19 pandemic, Chinese hospitals are increasing their efforts to control the number of patients to decrease cross-infection risks. In this paper, we investigate the flexible physician scheduling problem for emergency departments (EDs), considering the constraint of the maximum number of emergency patients in one time period. We model the ED service system as a time-varying queue with returns and formulate the physician scheduling problem as a mixed-integer programming model. To solve the scheduling problem effectively, we design a learning-based two-stage optimization algorithm. In the first stage, we solve the physician staffing problem, in which two effective acceleration strategies based on machine learning models are developed. In the second stage, we propose a branch-and-price algorithm to determine the physician scheduling plan. Numerical experiments based on real-life data show that the proposed two-stage algorithm can effectively solve our flexible physician scheduling problem, and the scheduling plan obtained by the proposed two-stage algorithm can significantly improve the physician schedule without involving more physicians. [ABSTRACT FROM AUTHOR]

Aeroengine fault detection is an important means to ensure flight safety. The application premise of data driven fault detection method is that all data come from the same distribution. However, this assumption is invalid in the actual engine fault detection, because the engine state will change with the increase of operating time, and the collected data will also have distribution differences. Due to the high cost of collecting engine data, it is difficult to collect enough data from the current state. Fortunately, transfer learning can transfer data information from other fields to the target field, thus alleviating the problem of data scarcity in the target domain. Therefore, from the idea of transfer learning, this paper proposes a cross domain aeroengine fault detection method, viz. transfer learning based on kernel perception algorithm with uneven margins (TL-KPAUM). The proposed method is divided into two stages. In the first stage, KPAUM is trained using the data in the source domain to extract the information in the source domain. In the second stage, the data in the target domain is used to realize the adaptation to the target domain. Compared with several baseline methods, TL-KPAUM has better performance when the amount of data in the target domain is small. Finally, using the simulation data of turbofan engine, the fault detection experiments of degraded state are designed, and the results show that this method is effective. [Display omitted] • A transfer learning algorithm is proposed for aeroengine fault detection. • The proposed method is applied to engine fault detection in different domains. • Simulation results show the effectiveness of this method compared with other methods. • The proposed method has good performance in the case of sparse data in the target domain. [ABSTRACT FROM AUTHOR]

A large amount of data, provided in the form of video data, is acquired during manned inspections flights of electric power lines. This data is analyzed by expert human inspectors to detect faults in the power lines infrastructure and prepare the inspection reports. This process is extremely time consuming, very expensive and prone to human error. In this paper, we present PoLIS: the Power Line Inspection Software, which has been developed with the objective of assisting the analysis of the data acquired during inspection flights. PoLIS is based on the cooperation between computer vision and machine learning techniques to automatically process video sequences acquired during inspection flights, resulting in a set of representative images per electric tower which we call Key Frames. These representative images can then be used for inspection purposes, leading to a drastic reduction of the human operators’ workload. At the core of the strategy lies an electric tower detector, which is in charge of estimating the location of the towers within the images based on the combination of a sliding window search technique and a supervised classifier. The location of the tower is then tracked using a tracking-by-registration algorithm based on direct methods, estimating the position of the tower in different images. Finally, different criteria are applied for defining whether the image corresponds to a Key Frame image or not. Extensive evaluation of the proposed strategy is conducted using videos acquired during manned helicopter inspections. The videos constituting this database contain several thousand frames representing both medium and high voltage power transmission lines in the infra-red (IR) and visible spectra. The obtained results show that the proposed strategy can reduce the large amount of data present in the inspection videos to a few Key Frames for each tower. It is also demonstrated that the learning-based approach proposed in PoLIS is appropriate for detecting electric towers, a process which is made faster and more robust by coupling it with a tower tracking algorithm. A Graphical User Interface allowing the application of PoLIS to user-provided videos is also presented in this paper, illustrating the whole process and the automated generation of an inspection report. [ABSTRACT FROM AUTHOR]

This paper proposes an ensemble multi-objective biogeography-based optimization (EMBBO) algorithm, which is inspired by ensemble learning, to solve the automated warehouse scheduling problem. First, a real-world automated warehouse scheduling problem is formulated as a constrained multi-objective optimization problem. Then EMBBO is formulated as a combination of several multi-objective biogeography-based optimization (MBBO) algorithms, including vector evaluated biogeography-based optimization (VEBBO), non-dominated sorting biogeography-based optimization (NSBBO), and niched Pareto biogeography-based optimization (NPBBO). Performance is tested on a set of 10 unconstrained multi-objective benchmark functions and 10 constrained multi-objective benchmark functions from the 2009 Congress on Evolutionary Computation (CEC), and compared with single constituent MBBO and CEC competition algorithms. Results show that EMBBO is better than its constituent algorithms, and among the best CEC competition algorithms, for the benchmark functions studied in this paper. Finally, EMBBO is successfully applied to the automated warehouse scheduling problem, and the results show that EMBBO is a competitive algorithm for automated warehouse scheduling. [ABSTRACT FROM AUTHOR]

Deep Reinforcement Learning systems are now a hot topic in Machine Learning for their effectiveness in many complex tasks, but their application in safety-critical domains (e.g., robot control or self-autonomous driving) remains dangerous without mechanism to detect and prevent risk situations. In Deep RL, such risk is mostly in the form of adversarial attacks, which introduce small perturbations to sensor inputs with the aim of changing the network-based decisions and thus cause catastrophic situations. In the light of these dangers, a promising line of research is that of providing these Deep RL algorithms with suitable defenses, especially when deploying in real environments. This paper suggests that this line of research could be greatly improved by the concepts from the existing research field of Safe Reinforcement Learning, which has been postulated as a family of RL algorithms capable of providing defenses against many forms of risks. However, the connections between Safe RL and the design of defenses against adversarial attacks in Deep RL remain largely unexplored. This paper seeks to explore precisely some of these connections. In particular, this paper proposes to reuse some of the concepts from existing Safe RL algorithms to create a novel and effective instance-based defense for the deployment stage of Deep RL policies. The proposed algorithm uses a risk function based on how far a state is from the state space known by the agent, that allows identifying and preventing adversarial situations. The success of the proposed defense has been evaluated in 4 Atari games. [ABSTRACT FROM AUTHOR]

Computational tools for the analysis of data gathered by monitoring systems are necessary because the amount of data steadily increases. Machine learning algorithms can be used in both regression and classification problems, providing useful insights while avoiding the bias and proneness to errors of humans. In this paper, a specific kind of decision tree algorithm, called conditional inference tree, is used to extract relevant knowledge from data that pertains to electrical motors. The model is chosen due to its flexibility, strong statistical foundation, as well as great capabilities to generalize and cope with problems in the data. The obtained knowledge is organized in a structured way and then analyzed in the context of health condition monitoring. The final results illustrate how the approach can be used to gain insight into the system and present the results in an understandable, user-friendly manner. [ABSTRACT FROM AUTHOR]

Imbalanced problem occurs when the size of one class, i.e. the minority class, is much lower than that of the other classes, i.e. the majority classes. Conventional data level methods are employed as the preprocessing approaches to balance the datasets before the classifier learning. Since the balanced data remains unchanged during the learning process, one pre-deleted sample would never be used to train the classifier, which may result in information loss. To solve this problem, this work presents an One-sided Dynamic Undersampling (ODU) technique which adopts all samples in the training process, and dynamically determines whether a majority sample should be used for the classifier learning. Thus, ODU can dynamically undersample the majority class to balance the dataset. To validate the effectiveness of ODU, we integrate it into No-Propagation neural networks to propose an ODU No-Propagation Neural Networks (ODUNPNN). ODUNPNN takes all training samples into consideration, and dynamically undersamples majority class after each iteration, i.e. ODUNPNN integrates undersampling approach into the classifier learning process. Experimental results on both synthetic and real-world imbalance datasets demonstrate that ODUNPNN outperforms the NPNN-based algorithms, and results in comparative performance compared with LASVM-AL, EasyEnsemble, and DyS on real-world imbalance datasets. The contributions of this paper are: (1) ODUNPNN integrates undersampling approach into the classifier learning process. (2) ODUNPNN dynamically balances training data in each iteration. (3) ODU technique can be integrated into other classification learning machines. [ABSTRACT FROM AUTHOR]

Abstract: This paper presents a core vector machine (CVM)-based algorithm for on-line voltage security assessment of power systems. To classify the system security status, a CVM has been trained for each contingency. The proposed CVM-based security assessment has very small training time and space in comparison with support vector machines (SVM) and artificial neural networks (ANNs)-based algorithms. The proposed algorithm produces less support vectors (SV) and therefore is faster than existing algorithms. In this paper, a new decision tree (DT)-based feature selection technique has been presented, too. The proposed CVM algorithm has been applied to New England 39-bus power system. The simulation results show the effectiveness and the stability of the proposed method for on-line voltage security assessment procedure of large-scale power system. [Copyright &y& Elsevier]

Abstract: Reinforcement learning (RL) has received some attention in recent years from agent-based researchers because it deals with the problem of how an autonomous agent can learn to select proper actions for achieving its goals through interacting with its environment. Although there have been several successful examples demonstrating the usefulness of RL, its application to manufacturing systems has not been fully explored yet. In this paper, Q-learning, a popular RL algorithm, is applied to a single machine dispatching rule selection problem. This paper investigates the application potential of Q-learning, a widely used RL algorithm to a dispatching rule selection problem on a single machine to determine if it can be used to enable a single machine agent to learn commonly accepted dispatching rules for three example cases in which the best dispatching rules have been previously defined. This study provided encouraging results that show the potential of RL for application to agent-based production scheduling. [Copyright &y& Elsevier]

In this paper, a self-adaptive classification learning hybrid JAYA and Rao-1 algorithm, which is called EHRJAYA, is proposed for solving large-scale numerical problems and real-world complex engineering optimization problems. JAYA algorithm and Rao-1 algorithm are two kinds of algorithms with simple structure and superior performance, which have the characteristics of no particular controlling parameters. In EHRJAYA the evolution strategies of the two algorithms are selected through a random selection mechanism. Then, a novel self-adaptive classification learning strategy is proposed, which fully utilizes information from different individuals. On this basis, two different adaptive coefficients are introduced to guide the population towards the optimal individual and away from the worst individual. Finally, combining the linear population reduction strategy and the dynamic lens opposition-based learning strategy, the convergence speed and ability to jump out of local optimum of the algorithm are greatly improved. To verify the performance of the proposed EHRJAYA, 59 complex functions from the CEC2014 and CEC2017 competitions are solved by EHRJAYA. Then, EHRJAYA and more than 20 algorithms with superior performance jointly solve ten challenging real-world engineering optimization problems. Experimental results show that the proposed EHRJAYA can obtain optimal results with the least computational resources in most cases. Therefore, in the face of these problems, effective solutions can be provided by EHRJAYA. [ABSTRACT FROM AUTHOR]

In this paper, a new sequential learning algorithm is constructed by combining the Online Sequential Extreme Learning Machine (OS-ELM) and Kalman filter regression. The Kalman Online Sequential Extreme Learning Machine (KOSELM) handles the problem of multicollinearity of the OS-ELM, which can generate poor predictions and unstable models. The KOSELM learns the training data one-by-one or chunk-by-chunk by adjusting the variance of the output weights through the Kalman filter. The performance of the proposed algorithm has been validated on benchmark regression datasets, and the results show that KOSELM can achieve a higher learning accuracy than OS-ELM and its related extensions. A statistical validation for the differences of the accuracy for all algorithms is performed, and the results confirm that KOSELM has better stability than ReOS-ELM, TOSELM and LS-IELM. [ABSTRACT FROM AUTHOR]

Clustering is an essential tool in data mining research and applications. It is the subject of active research in many fields of study, such as computer science, data science, statistics, pattern recognition, artificial intelligence, and machine learning. Several clustering techniques have been proposed and implemented, and most of them successfully find excellent quality or optimal clustering results in the domains mentioned earlier. However, there has been a gradual shift in the choice of clustering methods among domain experts and practitioners alike, which is precipitated by the fact that most traditional clustering algorithms still depend on the number of clusters provided a priori. These conventional clustering algorithms cannot effectively handle real-world data clustering analysis problems where the number of clusters in data objects cannot be easily identified. Also, they cannot effectively manage problems where the optimal number of clusters for a high-dimensional dataset cannot be easily determined. Therefore, there is a need for improved, flexible, and efficient clustering techniques. Recently, a variety of efficient clustering algorithms have been proposed in the literature, and these algorithms produced good results when evaluated on real-world clustering problems. This study presents an up-to-date systematic and comprehensive review of traditional and state-of-the-art clustering techniques for different domains. This survey considers clustering from a more practical perspective. It shows the outstanding role of clustering in various disciplines, such as education, marketing, medicine, biology, and bioinformatics. It also discusses the application of clustering to different fields attracting intensive efforts among the scientific community, such as big data, artificial intelligence, and robotics. This survey paper will be beneficial for both practitioners and researchers. It will serve as a good reference point for researchers and practitioners to design improved and efficient state-of-the-art clustering algorithms. • Provide an up-to-date comprehensive review of the different clustering techniques. • Highlight novel and most recent practical applications areas of clustering. • Provide a convenient research path for new researchers. • Help experts develop new algorithms for emerging challenges in the research area. [ABSTRACT FROM AUTHOR]

Applying multi-agent reinforcement learning (MARL) in continuous distributed control system is an attractive issue, because it entitles agents adaptively to construct a cooperative behavior, even if the dynamics of such distributed system is unknown a priori. However the implementation of MARL always suffers from dimension explosion, nonstationary learning, and generalization in continuous systems. This paper presents a continuous coordinated learning algorithm with time-sharing tracking framework (CCL-TT) to deal with these problems, in which the value function is dimension reduced to lighten dimension explosion, the time-sharing tracking framework (TTF) is developed to solve nonstationary learning, and Gaussian regression modeling is applied to realize generalization. With TTF, a macroscopic concurrent learning is set up to meet the requirements of temporal stationary condition in value learning and generalization. Finally the simulation illustrates how CCL-TT realizes cooperative learning without knowledge about the dynamics of the system, even with disturbance. [ABSTRACT FROM AUTHOR]

Extreme learning machine (ELM), a simple single-hidden-layer feed-forward neural network with fast implementation, has been successfully applied in many fields. This paper proposes an ELM with a constructional structure (CS-ELM) for improving the performance of ELM in dealing with regression problems. In the CS-ELM, there are some partial input subnets (PISs). The first step in designing the PISs is to divide the data-attribute-space into several sub-spaces through using an improved extension clustering algorithm (IECA). The input data attributes in the same sub-space can build a PIS and the similar information of the data attributes is stored in the corresponding PIS. Additionally, a double parallel structure is applied in the CS-ELM, in which there is a special channel that directly connects the input layer neurons to the output layer neurons. In this regard, the proposed procedure can be called ELM with a data-attribute-space-oriented double parallel (DASODP) structure (DASODP–ELM). To test the validity of the proposed method, it is applied to 4 regression applications. The experimental results indicate that, compared with ELM, DASODP–ELM with less number of parameters can achieve higher regression precision in the generalization phase. [ABSTRACT FROM AUTHOR]

Due to the rapidly growing volume and velocity of big data, real-time streaming data analysis has become increasingly important in many applications. To discover knowledge from such data, a wide range of machine learning techniques have been proposed and used in practice. Among them, clustering, which aims at grouping objects into different classes on the basis of their similarity, is the most common form of unsupervised learning. However, most existing clustering algorithms are designed for static data, and hence are not best suited for streaming data. In this paper, we propose PC-DPC, a two-stage progressive clustering algorithm with graph-augmented density peak clustering. PC-DPC first identifies clusters of streaming data using an improved density peak clustering algorithm, and then merges newly arriving data into the existing data pool by measuring inter-cluster structural similarity, which considers the distance between a center and representative points. We illustrate the superiority of PC-DPC over several state-of-the-art clustering algorithms in terms of clustering accuracy and running time on publicly available benchmark datasets. [ABSTRACT FROM AUTHOR]

Sine Cosine Algorithm (SCA) that is one of the population-based metaheuristic optimization algorithms basically consists of the updating mechanism based on sine and cosine functions. In this algorithm, a few random and adaptive variables are also utilized for more effective motions of the candidate solutions. SCA has some drawbacks like other some metaheuristic algorithms. SCA tends to be stuck into the local regions in the search space and this affects negatively on the computational effort required to find the best solution point in the search space. This paper presents four different improved versions of SCA. The proposed improvements on original SCA are the innovations on the updating mechanism of SCA. To evaluate the performances of Improved Sine Cosine Algorithms (ImpSCAs), well-known numerical optimization problems including CEC 2014 test suite are used. Firstly, different analyses of the proposed ImpSCAs are dealt with such as the convergence analysis, search history analysis, trajectory analysis, average distance analysis, and computational complexity analysis. Secondly, the proposed four versions of ImpSCAs are compared with the original SCA for CEC 2014 benchmark problems with dimension sizes of 10D, 30D and 50D. Finally, original SCA and ImpSCAs are adapted to select optimal feature combination and they are tested for 10 feature selection datasets taken from the UCI machine learning repository. The benchmark results show that the performances of the ImpSCA 1 , ImpSCA 2 , and ImpSCA 4 are better than that of the original SCA. From the feature selection results, it is observed that three versions of ImpSCAs (except ImpSCA 3) outperform the original SCA in 80% of the datasets. Source codes of ImpSCAs are publicly available at https://github.com/uguryuzgec/ImpSCAs. • We focused to improve the exploration and exploitation ability of the original SCA. • The basic idea is based on the innovations on the update mechanism. • The ISCAs were evaluated using CEC2014 benchmark test suite. • The proposed ISCAs were tested for 10 popular UCI datasets. • Three versions of ISCAs (except ISCA 3) outperform the SCA in 80% of the datasets. [ABSTRACT FROM AUTHOR]

Abstract: Traditional cross-domain learning methods transfer learning from a source domain to a target domain. In this paper, we propose the multiple-domain learning problem for several equally treated domains. The multiple-domain learning problem assumes that samples from different domains have different distributions, but share the same feature and class label spaces. Each domain could be a target domain, while also be a source domain for other domains. A novel multiple-domain representation method is proposed for the multiple-domain learning problem. This method is based on nonnegative matrix factorization (NMF), and tries to learn a basis matrix and coding vectors for samples, so that the domain distribution mismatch among different domains will be reduced under an extended variation of the maximum mean discrepancy (MMD) criterion. The novel algorithm — multiple-domain NMF (MDNMF) — was evaluated on two challenging multiple-domain learning problems — multiple user spam email detection and multiple-domain glioma diagnosis. The effectiveness of the proposed algorithm is experimentally verified. [Copyright &y& Elsevier]

Automatic taxonomy induction is a challenging task in the field of natural language understanding (NLU) and information retrieval (IR) because it requires machine learning and understanding the is-a relation (i.e. hypernym relation) between term pairs. Therefore, the deep taxa (DTaxa) based on the actor–critic algorithm framework is designed to deal with the aforementioned problems in this paper. The agent in the DTaxa regards the taxonomy induction process as the sequential decision steps so that the agent can take the operation of a term as an action via the policy network to jointly optimize hypernym detection and hypernym organization. Meanwhile, the DTaxa obtains a stable performance from the experiences buffered in the memory. In order to verify the effectiveness of the DTaxa for the automatic taxonomy induction, two experiments are performed on the all bottomed-out full subtrees extracted from WordNet 3.0 and the English environment and science taxonomies in the SemEval-2016 task 13, respectively. The proposed method outperforms these existing methods and achieves state-of-the-art among most metrics. [Display omitted] • The end-to-end DTaxa is proposed for automatic taxonomy induction. • The DTaxa based on actor–critic framework decreases large variance caused by REINFORCEMET algorithm. • The performance of the DTaxa is performed on two publicly available datasets. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, a multiscale overcomplete dictionary learning approach is proposed for image denoising by exploiting the multiscale property and sparse representation of images. The images are firstly sparsely represented by a translation invariant dictionary and then the coefficients are denoised using some learned multiscale dictionaries. Dictionaries learning can be reduced to a non-convex l 0-norm minimization problem with multiple variables, so an evolution-enhanced algorithm is proposed to alternately optimize the variables. Some experiments are taken on comparing the performance of our proposed method with its counterparts on some benchmark natural images, and the superiorities of our proposed method to its counterparts can be observed in both the visual result and some numerical guidelines. [Copyright &y& Elsevier]

Abstract: The management of atmospheric pollution using video is not yet widespread. However it is an efficient way to evaluate the polluting rejects coming from large industrial facilities when traditional captors are not usable. This paper presents a comparison of different classifiers for a monitoring system of polluting smokes. The data used in this work are stemming from a system of video analysis and signal processing. The database includes the pollution level of puffs of smoke defined by an expert. Six machine learning techniques are tested and compared to classify the puffs of smoke: k-nearest neighbour, naïve Bayes classifier, artificial neural network, decision tree, support vector machine and a fuzzy model. The parameters of each type of classifier are split into three categories: learned parameters, parameters determined by a first step of the experimentation, and parameters set by the programmer. We compare the results of the best classifier of each type depending on the size of the learning set. A part of the discussion concerns the robustness of the classifier facing the case where classes of interest are under-represented, as the high level of pollution in our data. [Copyright &y& Elsevier]

Abstract: This paper proposes an intelligent task planning and action selection mechanism for a mobile robot in a robot soccer system through a fuzzy neural network approach. The proposed fuzzy neural network system is developed through the two dimensional fuzzification of the soccer field. A five layer fuzzy neural network system is trained through error back propagation learning algorithm to impart a strategy based action selection. The action selection depends on the field configuration, and the emergence of a particular field configuration results from the game dynamics. Strategy of the robot changes when the configuration of the objects in the field changes. The proposed fuzzy neural network structure is flexible to accommodate all possible filed configurations. Simulation results indicate that the proposed approach is simple and has the capability in coordinating the multi-agent system through selection of sensible actions. [Copyright &y& Elsevier]

Abstract: A large number of problems that occur in knowledge-representation, learning, very large scale integration technology (VLSI-design), and other areas of artificial intelligence, are essentially satisfiability problems. The satisfiability problem refers to the task of finding a satisfying assignment that makes a Boolean expression evaluate to True. The growing need for more efficient and scalable algorithms has led to the development of a large number of SAT solvers. This paper reports the first approach that combines finite learning automata with the greedy satisfiability algorithm (GSAT). In brief, we introduce a new algorithm that integrates finite learning automata and traditional GSAT used with random walk. Furthermore, we present a detailed comparative analysis of the new algorithm''s performance, using a benchmark set containing randomized and structured problems from various domains. [Copyright &y& Elsevier]

State-of-charge (SOC) is the key parameter for battery management, and the accurate estimation of SOC is pretty important for the safe and stable operation of lithium batteries. This paper investigates a regularized extreme learning machine trained with the spectral Fletcher–Reeves algorithm and tuned with the beetle antennae search algorithm (BAS-SFR-RELM) for intelligent and robust SOC estimation. In the experiment section, the urban dynamometer driving schedule (UDDS) profile and the Los Angeles 92 (LA92) profile are performed on a battery test platform for data collection. In the simulation section, the root mean squared error (RMSE) and the mean absolute error (MAE) are adopted to evaluate the performance of the model. Compared with the linear regression (LR), the back propagation (BP) network, the multi-layer perceptron (MLP), and the long short-term memory (LSTM) network, the BAS-SFR-RELM method can efficiently obtain the optimal regularization coefficient to effectively prevent overfitting with faster convergence speed. Increasing the number of hidden neurons in the BAS-SFR-RELM appropriately can improve the SOC estimation precision. Implementing the BAS-SFR-RELM with the noise-added data set gives high robustness for SOC estimation • A novel model is constructed to estimate the SOC of lithium batteries. • The BAS algorithm is applied to optimize the regularization coefficient then overfitting is prevented. • The SFR algorithm is introduced to tune the output weights of the RELM. • The UDDS data set and the LA92 data set are used for model training, validation and testing. [ABSTRACT FROM AUTHOR]

Hyperparameter optimization is critical for the performance of machine learning algorithms. Significant efforts have been dedicated to improve the final accuracy of algorithm by hyperparameter tuning. However, some indicators (such as latency, cpu utilization) are also very important in the actual environment. In this paper, we propose a novel method EMORL (E ffective M ulti- O bjective R einforcement L earning) based on multi-objective reinforcement learning for hyperparameter optimization to solve the above limitations. Specifically, we extend hyperparameter optimization problem to the reinforcement learning framework and employ an agent to select hyperparameters sequentially, and design a scalarization function that combines accuracy and latency as a multi-objective reward to guide the policy update. To improve the efficiency of hyperparameter optimization, previously successful configuration is reused for reshaping the advantage function. In the experiment, we apply the proposed method to tune the hyperparameters of the eXtreme Gradient Boosting on 101 tasks and convolutional neural networks on 2 tasks. The experimental results demonstrate that the proposed method is better than other methods in most tasks, especially in terms of latency. In addition, we verify the various components of the proposed method through ablation experiments. [ABSTRACT FROM AUTHOR]

Abstract: The explosion of on-line information has given rise to many manually constructed topic hierarchies (such as Yahoo!!). But with the current growth rate in the amount of information, manual classification in topic hierarchies results in an immense information bottleneck. Therefore, developing an automatic classifier is an urgent need. However, classifiers suffer from enormous dimensionality, since the dimensionality is determined by the number of distinct keywords in a document corpus. More seriously, most classifiers are either working slowly or they are constructed subjectively without any learning ability. In this paper, we address these problems with a fair feature-subset selection (FFSS) algorithm and an adaptive fuzzy learning network (AFLN) for classification. The FFSS algorithm is used to reduce the enormous dimensionality. It not only gives fair treatment to each category but also has ability to identify useful features, including both positive and negative features. On the other hand, the AFLN provides extremely fast learning ability to model the uncertain behavior for classification so as to correct the fuzzy matrix automatically. Experimental results show that both FFSS algorithm and the AFLN lead to a significant improvement in document classification, compared to alternative approaches. [Copyright &y& Elsevier]

Inter type-2 fuzzy model has been confirmed to be more effective in Takagi–Sugeno (T–S) fuzzy model identification compared to type-1 fuzzy model. It is indisputable that some algorithms based on inter type-2 fuzzy model have already been developed and shown remarkable modeling performance. To further improve the modeling accuracy, the optimization methods and the neural network are taken into consideration. In this paper, an evolving modified inter type-2 fuzzy c-regression model (MIT2-FCRM) algorithm based on gravitational search algorithm (GSA) and a consequent parameter identification method based on extreme learning machine algorithm with forgetting factor for processing online sequences (namely WOS-ELM) were proposed. Then a novel approach for T–S fuzzy modeling was presented, in which, the coefficients of the upper and lower hyperplanes were obtained by evolving MIT2-FCRM algorithm based on GSA, a hyper-plane-shaped membership function (MF) was utilized to identify the antecedent parameters of the T–S fuzzy model, and WOS-ELM was employed to identify the consequent parameters. The modeling results of six examples indicate that the proposed approach is superior to other studies in terms of identification accuracy, compact fuzzy rules and noise resistance ability. [ABSTRACT FROM AUTHOR]

Abstract: During the last decades, many researchers in image processing and AI community have been focused on developing image and video analysis and understanding. However, despite their extensive efforts on these, there are still several significant challenges such as robust object segmentation and tracking, motion feature extraction, context modeling, and machine learning algorithms. Therefore, more advanced related issues should be taken into account. We have selected nine research papers whose topics are strongly related to the intelligent surveillance system in smart home environment. [Copyright &y& Elsevier]