Search

By the end of 2020, over 16,300 Massive Open Online Courses (MOOCs) from 950 universities worldwide had enrolled over 180 million students. Interest in MOOCs has been matched by significant research on the topic, including a considerable number of reviews. This study uses Machine Learning techniques and human expert supervision to generate a comprehensive systematic literature mapping review that overcomes some limitations of the traditional ones and provides a broader overview of the content and main topics studied in the specialized literature devoted to MOOCs. The sample consisted of 6320 publications automatically classified within six research topics, denominated by human experts: institutional approach, pedagogical approach, evaluation, analytics, participation, and educational resources. The content analysis of the topics identified was conducted using visual network analysis, which supported the identification of different thematic sub-clusters and endorsed the classification. Results from the review show that the lowest production of MOOC papers is within the topics of the pedagogical approach and educational resources. In contrast, participation and evaluation are the most frequent ones. In addition, the most cited papers are on the topics of analytics and resources, being the pedagogical approach and the institutional approach the less cited. This highlights the need for more MOOC research from a pedagogical perspective and calls upon the presence of educators. [ABSTRACT FROM AUTHOR]

Context: Artificial Intelligence (AI) has rapidly developed over the past several decades. Several related AI approaches, such as Machine Learning (ML), have been applied to research on landscape patterns and ecological processes. Objectives: Our goal was to review the methods of AI, particularly ML, used in studies related to landscape ecology and the main topics addressed. We aimed to assess the trend in the number of ML papers and the methods used therein, and provide a synopsis and prospectus of current use and future applications of ML in landscape ecology. Methods: We conducted a systematic literature search and selected 125 papers for review. These were examined and scored according to multiple criteria regarding methods and topic. We applied quantitative statistical methods, including cluster analysis based on titles, abstracts, and keywords and a non-metric multidimensional scaling based on attributes assigned during the review. We used Random Forests machine learning to describe the differences between identified clusters in terms of the topics and methods they included. Results: The most frequent method found was Random Forests, but it is noteworthy to mention the increasing popularity of tools related to Deep Learning. The topics cover both ecologically oriented issues and the landscape-human interface. There has been a rapid increase in ML and AI methods in landscape ecology research, with Deep Learning and complex multi-step pipeline AI methods emerging in the last several years. Conclusions: The rapid increase in the number of ML papers in landscape ecology research, and the range of methods employed in them, suggest explosive growth in application of these methods in landscape ecology. The increase of Deep Learning approaches in the most recent years suggest a major change in analytical paradigms and methodologies that we feel may transform the field and enable analyses of more complex pattern process relationships across vaster data sets than has been possible previously. [ABSTRACT FROM AUTHOR]

In this paper, preliminary studies on the failure analysis of hybrid composite materials utilizing acoustic emission and machine learning are presented. The main purpose of this study was to analyze the possibilities of using machine learning techniques as a way to better cluster the data obtained from acoustic emission. In this paper, we focus on data preparation, feature extraction (Laplacian score), determination of cluster number (Caliński–Harabasz, Silhouette, and Davies–Bouldin), and testing three clustering techniques, namely K-means, fuzzy C-means, and spectral clustering. The dataset was obtained by testing fiber metal laminates—composites consisting of metal and composite layers. Two experimental tests were realized on pre-cracked rectangular specimens—one with loading in mode I and one with loading in mode II (DCB—double cantilever beam and ENF—end-notch flexural test). Elastic waves were recorded during these tests via an acoustic emission system. Preliminary studies show that the proposed method can be used successfully to cluster data obtained in this way. The obtained dataset was split into 3 clusters (for the ENF test) and 5 clusters (DCB test). In the next stages of the research campaign, based on the presented results, we intend to change the approach to semi-supervised by running additional single-cause damage tests to enhance the achieved results and enable easier damage recognition. [ABSTRACT FROM AUTHOR]

Given the rise in demand for cloud computing in the modern era, the effectiveness of resource utilization is eminent to decrease energy footprint and achieve economic services. With the emerging machine learning and artificial intelligence techniques to model and predict, it is essential to explore a principal method that provides the best solution for the accurate provisioning of forthcoming requests in a cloud data center. Recent studies used machine learning and other advanced analytics to predict resource usage; however, these do not consider long-range dependencies in the time series, which is essential to capture for better prediction. Further, they show limitations in handling noise, missing values, and outliers in datasets. In this paper, we explored the problem by studying three techniques that enabled us to answer improvements in short-term forecasting of physical machines' resource usage if the above factors are considered. We evaluated the predictions using Transformer and Informer deep learning models that cover the above aspects and compared them with the Long short-term memory (LSTM) model. We used a real-world Google cluster trace usage dataset and employed Balanced Iterative Reducing and Clustering using Hierarchies (BIRCH) algorithm to select heterogeneous machines. The evaluation of the three models depicts that the Transformer architecture that considers long-range dependencies in time series and shortcomings with datasets shows improvement in forecasting with 14.2% reduction in RMSE than LSTM. However, LSTM shows better results for some machines than the Transformer, which depicts the importance of input sequence order. The Informer model, which considers both dependencies and is a hybrid of LSTM and Transformer, outperformed both models with 21.7% from LSTM and 20.8% from Transformer reduction in RMSE. The results also depict Informer model consistently performs better than the other models across all subsets of the dataset. Our study proves that considering long-range dependencies and sequence ordering for resource usage time series improves the prediction. [ABSTRACT FROM AUTHOR]

With the advancement of technology such as video monitoring, Internet-of-things, cloud, and machine learning, Industry 4.0 is working continuously to ensure the security of workers. The workers are equipped with sensors to analyze their activities. In general, the recognition of human activities in cloud-based industrial scenario is leveraged to monitor the safety of the workers. This paper introduced a new optimal clustering method for the activity recognition of workers in industry using cloud based IoT environment. The proposed method uses the temporal and spatial features of human workers in industry. The proposed method is tested on publicly available dataset of different activities maintained into three groups, namely movement, gestures, and object handling, in the context of the medium and small industrial environment. The experimental findings validate that the proposed method achieves 80.2 % , 81.05 % and 80.19 % of average accuracy for movement, gesture, and object handling activities, which clearly outperformed the fuzzy c-means, particle-swarm optimization, and HMM-based activity recognition methods. [ABSTRACT FROM AUTHOR]

Parkinson disease (PD) is a neurodegenerative disease that occurs due to insufficient level of dopamine in the human brain. This disease may occur predominantly in elder people. There exists no definite procedure to diagnose PD. It is diagnosed based on the symptoms, clinical trials, and number of laboratory tests. In this research paper, machine learning techniques are used to predict PD and help the medical practitioner to recommend personalized drugs for the patients. In this research paper, appropriate features are selected through rough set theory, and principal component analysis is used for dimensionality reduction. The performance is experimented using deep neural network, random forest, and SVM classifiers. The efficiency of the proposed approach is measured through confusion matrix, accuracy, precision, and recall. [ABSTRACT FROM AUTHOR]

Shale gas reservoirs are contributing a major role in overall hydrocarbon production, especially in the United States, and due to the intense development of such reservoirs, it is a must thing to learn the productive methods for modeling production and performance evaluation. Consequently, one of the most adopted techniques these days for the sake of production performance analysis is the utilization of artificial intelligence (AI) and machine learning (ML). Hydrocarbon exploration and production is a continuous process that brings a lot of data from sub-surface as well as from the surface facilities. Availability of such a huge data set that keeps on increasing over time enhances the computational capabilities and performance accuracy through AI and ML applications using a data-driven approach. The ML approach can be utilized through supervised and unsupervised methods in addition to artificial neural networks (ANN). Other ML approaches include random forest (RF), support vector machine (SVM), boosting technique, clustering methods, and artificial network-based architecture, etc. In this paper, a systematic literature review is presented focused on the AI and ML applications for the shale gas production performance evaluation and their modeling. [ABSTRACT FROM AUTHOR]

Network attacks are becoming more complex, making it more difficult to detect intrusions. Various research have been done over the years, employing different categorization techniques of Data Mining (DM) and Machine Learning (ML) inspired hybrid approaches to develop robust IDS. Almost all researchers suggested to improve accuracy in intrusion detection with low computational cost. Authors observed that dissimilar sets of features were picked for different classifiers to get the highest accuracy. This paper is dedicated to a review of relevant research, where an in-depth investigation was carried out with two emphasis points of IDS, which contain distinct pre-processing techniques in the form of feature selection and a diversity of classification algorithms. In addition, this paper presents a comparative algorithmic assessment of the DM and ML techniques applied to create an intelligent IDS. A novel feature selection method based on the CART algorithm has also introduced which provides optimal feature subset of the dataset so perfectly that it has made various existing DM and ML classifying algorithms more performant than earlier, this makes classifiers independent of feature selection. To validate the performance of proposed work, experiments have performed using the 'Python' programming language and 'corrected' & '10_percent' of 'Kddcup99' datasets used as benchmark. As an outcome proposed work, we found that feature reduction and selecting a classifier had a significant influence on the rate of intrusion detection accuracy. The results of simulation and comparison analysis of proposed work with existing DM and ML based classification approaches show that the suggested work is more competent in true prediction and attaining maximum intrusion detection accuracy with minimal computing cost of prediction. [ABSTRACT FROM AUTHOR]

One of the significant challenges in the sports industry is identifying the factors influencing match results and their respective weightage. For appropriate recommendations to the team management and the team players, there is a need to predict the match and quantify the important factors for which prediction models need to be developed. The second thing required is identifying talented and emerging players and performing an associative analysis of the important factors to the match-winning outcome. This paper formulates a hybrid machine learning-clustering-associative rules model. This paper also implements the framework for cricket matches, one of the most popular sports globally watched by billions around the world. We predict the match outcome for One day Internationals (ODIs) and Twenty 20 s (T20s) (two formats of Cricket representing fifty over and twenty over versions respectively) adopting state-of-the-art machine learning algorithms, Random Forest, Gradient Boosting, and Deep neural networks. The variable importance is computed using machine-learning techniques and further statistically validated through the regression model. The emerging talented players are identified by clustering. Association rules are generated for determining the best possible winning outcome. The results show that environmental conditions are equally crucial for determining a match result, as are internal quantitative factors. The model is thus helpful for both team management and for players to improve their winning strategy and also for discovering emerging players to form an unbeatable team. [ABSTRACT FROM AUTHOR]

The circular economy and its various recirculation loops have become a major study subject over recent years, particularly in the field of agriculture, which is a significant source of waste production. There have been several studies focused on transforming agricultural lignocellulosic waste with "sustainable" processes: economically viable, socially accepted, and environmentally friendly. Thanks to "life cycle thinking", it is possible to assess these potential environmental impacts. However, these environmental analyses generally require a massive volume of specific data, the collection of which can be time-consuming and tedious, or impossible to practice. On the other hand, scientific articles describing the processes for the valorization of agricultural by-products are intriguing but rarely exploited sources of data. In this paper, a hybridization of data science techniques and environmental analysis was proposed to improve life cycle analysis (LCA) thanks to Machine Learning (ML). ML part of the proposed approach is based on unsupervised learning, which is composed of two methods: dimension reduction using the Multidimensional Scaling and clustering technique using k-means. Composed of five steps and dedicated to researchers or R&D engineers, the approach is oriented towards offering a decision on technologies and processes for waste to energy in the early eco-design step. The case study in the domain of pre-treatment processes for corn stover and rice straw is detailed. The results show that all impacts that concern the chemical pollution of soil and water are found in the same cluster. Other impacts are detected in the same cluster which is related to the land use and the land transformation. In the same vein, two purely mechanical pre-treatments have been identified and grouped by Multidimensional Scaling and k-means. [ABSTRACT FROM AUTHOR]

The amount of digital data in the universe is growing at an exponential rate with the rapid development of digital information, and this reveals new machine learning methods. Learning algorithms using hyperboxes are a subsection of machine learning methods. Fuzzy min–max neural network (FMNN) are one of the most common and advanced methods using hyperboxes. FMNN is a special type of NeuroFuzzy system that combines the artificial neural network and fuzzy set into a common framework. This paper conducts an extensive bibliometric and network analysis of FMNN literature. Two hundred and sixty-two publications are analysed from the period of 1992–2022. Several analyses are realized in order to identify trends, challenges and key points in a more scientific and objective way that affect the development of knowledge in the FMNN domain. It can be seen from bibliometric analysis that there is rapid development in the last 10 years. Social network analysis results show that Chee Peng Lim is the most active author in the network. Besides, the modifications of FMNN are generally developed for classification. However, there are still potential future research opportunities for clustering. [ABSTRACT FROM AUTHOR]

Extreme learning machine (ELM) is a training algorithm for single hidden layer feedforward neural network (SLFN), which converges much faster than traditional methods and yields promising performance. In this paper, we hope to present a comprehensive review on ELM. Firstly, we will focus on the theoretical analysis including universal approximation theory and generalization. Then, the various improvements are listed, which help ELM works better in terms of stability, efficiency, and accuracy. Because of its outstanding performance, ELM has been successfully applied in many real-time learning tasks for classification, clustering, and regression. Besides, we report the applications of ELM in medical imaging: MRI, CT, and mammogram. The controversies of ELM were also discussed in this paper. We aim to report these advances and find some future perspectives. [ABSTRACT FROM AUTHOR]

Deploying virtual machines poses a significant challenge for cloud data centers, requiring careful consideration of various objectives such as minimizing energy consumption, resource wastage, ensuring load balancing, and meeting service level agreements. While researchers have explored multi-objective methods to tackle virtual machine placement, evaluating potential solutions remains complex in such scenarios. In this paper, we introduce two novel multi-objective algorithms tailored to address this challenge. The VMPMFuzzyORL method employs reinforcement learning for virtual machine placement, with candidate solutions assessed using a fuzzy system. While practical, incorporating fuzzy systems introduces notable runtime overhead. To mitigate this, we propose MRRL, an alternative approach involving initial virtual machine clustering using the k-means algorithm, followed by optimized placement utilizing a customized reinforcement learning strategy with multiple reward signals. Extensive simulations highlight the significant advantages of these approaches over existing techniques, particularly energy efficiency, resource utilization, load balancing, and overall execution time. [ABSTRACT FROM AUTHOR]

Tensor factorization has been widely applied in computer vision and machine learning area. Nonnegative Tucker decomposition (NTD) is a popular tensor factorization technique. However, it neglects the geometrical structure of the data space and the available label information of sample data, lowering the data representation performance. To overcome this defect, in this paper, we propose a novel semi-supervised NTD method, named graph regularized discriminative nonnegative Tucker decomposition (GDNTD), which incorporates the graph construction of the data space and the available label information of the sample data into NTD. Specifically, a graph construction is utilized to preserve the geometric structure between data by a graph regularization term. Then, a label matrix is presented for guiding the data representation by a label constraint regularization term. Finally, based on the NTD property of maintaining the internal structure of data, the graph regularizer and the label regularizer are integrated into NTD to generate the proposed method. Thus, GDNTD can extract the part-based representation, preserve the local geometrical structure of the data space, and improve the discriminative ability of the learned model simultaneously, greatly boosting the model's data representation performance. We test the proposed method through a set of evaluations on four image datasets. Experimental results show that the GDNTD method outperforms state-of-the-art approaches, demonstrating its strong potential for data representation. [ABSTRACT FROM AUTHOR]

The recent trend in network intrusion detection leverages key features of machine learning (ML) algorithms to detect network traffic anomalies. Network traffic flows contain high dimensional features which significantly affect data-driven approaches. Therefore, the performance of ML-based approaches mainly depends on the appropriate set of features of network data. Different feature selection and extraction methods are extensively employed to attain the informative and compact set of features. Existing methods often suffer from achieving the expected performance due to the lacking of effectively removing redundant features as well as incorporating features with complementary information. In this paper, we present a cluster-based feature extraction method using Mahalanobis distance (cFEM) that clusters the correlated features and extracts new feature representations based on a distance metric. The extracted features on the transformed dimensions are employed to train different machine learning classifiers. We conducted extensive experiments using three renowned datasets. The results show that cFEM outperforms the state-of-the-art intrusion detection methods in several performance metrics such as detection rate (99.61%) and false alarm rate (0.26%). Further experiments on extracted features show that our extracted features are discriminative, free of redundancy, and able to capture complementary information. [ABSTRACT FROM AUTHOR]

We revisit the problem of fair clustering, first introduced by Chierichetti et al. (Fair clustering through fairlets, 2017), which requires each protected attribute to have approximately equal representation in every cluster, i.e., a Balance property. Existing solutions to fair clustering are either not scalable or do not achieve an optimal trade-off between clustering objectives and fairness. In this paper, we propose a new notion of fairness which we call τ -ratio fairness, that strictly generalizes the Balance property and enables a fine-grained efficiency vs. fairness trade-off. Furthermore, we show that a simple greedy round-robin-based algorithm achieves this trade-off efficiently. Under a more general setting of multi-valued protected attributes, we rigorously analyze the theoretical properties of the proposed algorithm, the Fair Round-Robin Algorithm for Clustering Over-End ( FRAC OE ). We also propose a heuristic algorithm, Fair Round-Robin Algorithm for Clustering (FRAC), that applies round-robin allocation at each iteration of a vanilla clustering algorithm. Our experimental results suggest that both FRAC and FRAC OE outperform all the state-of-the-art algorithms and work exceptionally well even for a large number of clusters. [ABSTRACT FROM AUTHOR]

Recent development in smart devices has lead us to an explosion in data generation and heterogeneity, which requires new network solutions for better analyzing and understanding traffic. These solutions should be intelligent and scalable in order to handle the huge amount of data automatically. With the progress of high-performance computing (HPC), it becomes feasible easily to deploy machine learning (ML) to solve complex problems and its efficiency has been validated in several domains (e.g., healthcare or computer vision). At the same time, network slicing (NS) has drawn significant attention from both industry and academia as it is essential to address the diversity of service requirements. Therefore, the adoption of ML within NS management is an interesting issue. In this paper, we have focused on analyzing network data with the objective of defining network slices according to traffic flow behaviors. For dimensionality reduction, the feature selection has been applied to select the most relevant features (15 out of 87 features) from a real dataset of more than 3 million instances. Then, a K-means clustering is applied to better understand and distinguish behaviors of traffic. The results demonstrated a good correlation among instances in the same cluster generated by the unsupervised learning. This solution can be further integrated in a real environment using network function virtualization. [ABSTRACT FROM AUTHOR]

In robotic systems, both software and hardware components are equally important. However, scant attention has been devoted until now in order to detect anomalies/failures affecting the software component of robots while many proposals exist aimed at detecting physical anomalies. To bridge this gap, the present paper focuses on the study of anomalies affecting the software performance of a robot by using a novel visualization tool. Unsupervised visualization methods from the machine learning field are applied in order to upgrade the recently proposed Hybrid Unsupervised Exploratory Plots (HUEPs). Furthermore, Curvilinear Component Analysis and t-distributed stochastic neighbor embedding are added to the original HUEPs formulation and comprehensively compared. Furthermore, all the different combinations of HUEPs are validated in a real-life scenario. Thanks to this intelligent visualization of robot status, interesting conclusions can be obtained to improve anomaly detection in robot performance. [ABSTRACT FROM AUTHOR]

Notably, real problems are increasingly complex and require sophisticated models and algorithms capable of quickly dealing with large data sets and finding optimal solutions. However, there is no perfect method or algorithm; all of them have some limitations that can be mitigated or eliminated by combining the skills of different methodologies. In this way, it is expected to develop hybrid algorithms that can take advantage of the potential and particularities of each method (optimization and machine learning) to integrate methodologies and make them more efficient. This paper presents an extensive systematic and bibliometric literature review on hybrid methods involving optimization and machine learning techniques for clustering and classification. It aims to identify the potential of methods and algorithms to overcome the difficulties of one or both methodologies when combined. After the description of optimization and machine learning methods, a numerical overview of the works published since 1970 is presented. Moreover, an in-depth state-of-art review over the last three years is presented. Furthermore, a SWOT analysis of the ten most cited algorithms of the collected database is performed, investigating the strengths and weaknesses of the pure algorithms and detaching the opportunities and threats that have been explored with hybrid methods. Thus, with this investigation, it was possible to highlight the most notable works and discoveries involving hybrid methods in terms of clustering and classification and also point out the difficulties of the pure methods and algorithms that can be strengthened through the inspirations of other methodologies; they are hybrid methods. [ABSTRACT FROM AUTHOR]

The proliferation of high-performance personal devices and the widespread deployment of machine learning (ML) applications have led to two consequences: the volume of private data from individuals or groups has exploded over the past few years; and the traditional central servers for training ML models have experienced communication and performance bottlenecks in the face of massive amounts of data. However, this reality also provides the possibility of keeping data local for ML training and fusing models on a broader scale. As a new branch of ML application, Federated Learning (FL) aims to solve the problem of multi-party joint learning on the premise of protecting personal data privacy. However, due to the heterogeneity of devices, including network connection, network bandwidth, computing resources, etc., it is unrealistic to train, update and aggregate models in all devices in parallel, while personal data is often not independent and identically distributed (Non-IID) due to multiple reasons. This reality poses a challenge to the speed and convergence of FL. In this paper, we propose the pFedCAM algorithm, which aims to improve the robustness of the FL system to device heterogeneity and Non-IID data, while achieving some degree of federation model personalization. pFedCAM is based on the idea of clustering and model interpolation by classifying heterogeneous clients and performing FedAvg algorithm in parallel, and then combining them into personalized federated global models by inter-cluster model interpolation. Experiments show that the accuracy of pFedCAM improves 10.3% on Fashion-MNIST and 11.3% on CIFAR-10 compared to the benchmark in the case of Non-IID data. In the end, we applied pFedCAM in HomeProtect, a smart home privacy protection framework we designed, and achieved good practical results in the case of flame recognition. [ABSTRACT FROM AUTHOR]

Single-cell ribonucleic acid (RNA) sequencing technology is used to analyze transcriptomes of each cell individually and helps to identify rare cell populations. By using traditional applications, it is difficult to understand and analyze the transcriptomic profiles of cells at the single-cell level. So, to overcome these kinds of issues, machine learning technologies are playing a great role. In this paper, we analyzed single-cell RNA seq data by implementing linear dimensional reduction, identifying highly variable features, clustering the cells, nonlinear dimensional reduction, and identifying gene markers. This type of single-cell RNA sequencing analysis is much needed in identifying transcriptomic profile challenges in cells and heterogeneous characteristics. Our study helps researchers who are doing fundamental research in the field of bioinformatics and computational biology concerning single-cell RNA sequencing data. [ABSTRACT FROM AUTHOR]

In different scientific fields, some parts of the collected dataset may include incomplete data with at least one missing value. To tackle this issue, statisticians and machine learning experts have introduced different missing value imputation (MVI) approaches. Hydrological data are mostly time series with stationary (or cyclic) trends that its observations have high autocorrelation (or cyclic auto-correlation). In addition, these time series frequently exhibit random and non-constant oscillations from their trends. Therefore, the selected MVI approach for hydrological time series should consider these serious aspects. One aspect of hydrological time series data that has not been closely examined in the MVI studies up to now is the existence of cyclic trend, named cyclostationarity. In this paper, a novel MVI approach for cyclostationary hydrological time series, called cyclic clustering, will be discussed. The performance of the proposed method is studied by employing numerous simulated datasets. The results indicate that the cyclic clustering approach is robust to impute missing values for both stationary and cyclostationary hydrological time series. The applicability of the introduced approach is also investigated in a real-world problem. [ABSTRACT FROM AUTHOR]

Clustering is effective method to increase network lifetime, energy efficiency, and connectivity of sensor nodes in wireless sensor network. An energy efficient clustering algorithm has been proposed in this paper. Sensor nodes are clustered using K-means algorithm which dynamically forms number of clusters in accordance with number of alive nodes. Selection of suitable CH is done by fuzzy inference system by choosing three fuzzy input variable such as residual energy of Sensor node, its distance from cluster center and base station. Amount of data transmitted by member nodes to CH is reduced by machine learning that classify similar data at regular interval. The simulation results show that proposed algorithm (DKFM) outperforms other cluster-based algorithms in terms of data received by base station, number of alive node per round, time of first node, middle node and last node to die for various density of sensor nodes and scalable conditions. [ABSTRACT FROM AUTHOR]

Healthcare is evolving from standard to personalized, driven by the patients' needs. Personalized healthcare is a medical model based on genetics, genomics, and other biological information that helps to predict risk for disease. To date, machine learning and data mining are the fastest-growing healthcare field used to classify patient cohorts from a large dataset and its application for diabetes subtyping will be a breakthrough. In this review paper, we have identified, analyzed, and summarized how previous studies distinguished diabetes into subtypes besides implementing the methods for diabetes subtyping using data mining and various clustering algorithms. We have discovered that many studies have suggested diabetes can be differentiated into subtypes clinically based on the risk complications, genetically defined, using clinical features, and for treatment selection. As for clustering algorithms, k-means clustering and hierarchical clustering were shown to be widely used in determining sub-clusters of diabetes. To further investigate diabetes subtyping, understanding the specific objective and method of diabetes subtyping using clustering algorithms from a large dataset will be crucial which could contribute to novel knowledge and improvement for diabetes management. [ABSTRACT FROM AUTHOR]

The real world involves many graphs and networks that are essentially heterogeneous, in which various types of relations connect multiple types of vertices. With the development of information networks, node features can be described by data of different modalities, resulting in multimodal heterogeneous graphs. However, most existed methods can only handle unimodal heterogeneous graphs. Moreover, most existing heterogeneous graph mining methods are based on meta-paths that depend on domain experts for modeling. In this paper, we propose a novel multimodal heterogeneous graph attention network (MHGAT) to address these problems. Specifically, we exploit edge-level aggregation to capture graph heterogeneity information to achieve more informative representations adaptively. Further, we use the modality-level attention mechanism to obtain multimodal fusion information. Because plain graph convolutional networks can not capture higher-order neighborhood information, we utilize the residual connection and the dense connection access to obtain it. Extensive experimental results show that the MHGAT outperforms state-of-the-art baselines on three datasets for node classification, clustering, and visualization tasks. [ABSTRACT FROM AUTHOR]

Nowadays, social data analysis is widely used in different businesses. Machine learning has proved its effectiveness in big data analysis for customers' segmentation and decision making. In the context of tourism and hospitality, there have been several studies for customers' decision making through social data analysis. However, the use of machine learning techniques for data-driven analysis by data obtained from social networking services is still in the early stage of development. This paper aims to develop a new hybrid method using machine learning techniques for social data analysis in hotel selection. The author develops the method by the combination of feature selection, supervised learning and unsupervised learning techniques. The author uses fuzzy k-means for data clustering, correlation-based feature selection for feature selection, and the ANFIS (adaptive neuro-fuzzy inference system) method for predicting customers' overall satisfaction in each cluster. The method is applied to a dataset for hotels in Saudi Arabia obtained from TripAdvisor. The prediction models of different clusters are evaluated using a set of evaluation metrics and compared with the other prediction techniques. The method was evaluated by mean-square error (MSE) and correlation coefficient (R2). The author compared the results of this study with other methods, which are ANFIS, support vector regression (SVR), artificial neural network (ANN) and decision trees. In this comparison, ANN was trained for 200 epochs and SVR was implemented by radial basis function kernel. The results revealed that the method that uses fuzzy k-means and neuro-fuzzy system (MSE = 0.0734; R2 = 0.9834) has better predicted overall ratings with a lower mean-squared error. [ABSTRACT FROM AUTHOR]

Software is playing a growing role in many safety-critical applications, and software systems dependability is a major concern. Predicting faulty modules of software before the testing phase is one method for enhancing software reliability. The ability to predict and identify the faulty modules of software can lower software testing costs. Machine learning algorithms can be used to solve software fault prediction problem. Identifying the faulty modules of software with the maximum accuracy, precision, and performance are the main objectives of this study. A hybrid method combining the autoencoder and the K-means algorithm is utilized in this paper to develop a software fault predictor. The autoencoder algorithm, as a preprocessor, is used to select the effective attributes of the training dataset and consequently to reduce its size. Using an autoencoder with the K-means clustering method results in lower clustering error and time. Tests conducted on the standard NASA PROMIS data sets demonstrate that by removing the inefficient elements from the training data set, the proposed fault predictor has increased accuracy (96%) and precision (93%). The recall criteria provided by the proposed method is about 87%. Also, reducing the time necessary to create the software fault predictor is the other merit of this study. [ABSTRACT FROM AUTHOR]

Anomalies in water quality, which frequently arise due to pollution, constitute a substantial menace to human health. The preservation of public welfare critically entails the timely recognition of abnormal water quality. Conventional techniques for detecting water quality anomalies face obstacles such as the necessity of expert knowledge, limited accuracy in detection, and delays in identification. In this paper, we proposed an original unsupervised technique for identifying water quality anomalies combined with time-frequency analysis and clustering (TCAD). We chose time-frequency analysis because it effectively evaluates water quality changes, generating distinct multi-band signals that reflect different aspects of water quality dynamics. We also proposed a clustering technique which can identify water quality markers and amalgamate data from multi-band signals for accurate anomaly detection. We seek to clarify the reasoning behind our methodology by portraying how time-frequency analysis and clustering address the deficiencies of conventional methods. Our experiments evaluated various indicators of water quality, and the effectiveness of our proposed approach was supported by comparative analyses with commonly used models for detecting anomalies in water quality. [ABSTRACT FROM AUTHOR]

Businesses are the driving force behind economic systems and are the lifeblood of the community. A business shares striking similarity to a living organism, including birth, infancy, rising, prosperity, and falling. The success of a business is not only important to the owners, but is also critical to the regional/domestic economic system, or even the global economy. Recent years have witnessed many new emerging businesses with tremendous success, such as Google, Apple, Facebook etc., yet millions of businesses also fail or fade out within a rather short period of time. Finding patterns/factors connected to the business rise and fall remains a long lasting question puzzling many economists, entrepreneurs, and government officials. Recent advancement in artificial intelligence, especially machine learning, has lend researchers powers to use data to model and predict business success. However, due to data driven nature of all machine learning methods, existing approaches are rather domain-driven and ad-hoc in their design and validations. In this paper, we propose a systematic review of modeling and prediction of business success. We first outline a triangle framework to showcase three parities connected to the business: Investment-Business-Market (IBM). After that, we align features into three main categories, each of which is focused on modeling a business from a particular perspective, such as sales, management, innovation etc., and further summarize different types of machine learning and deep learning methods for business modeling and prediction. The survey provides a comprehensive review of computational approaches for business performance modeling and prediction. [ABSTRACT FROM AUTHOR]

Density-based clustering has received increasing attention for its ability to handle clusters of arbitrary shapes. However, it still has difficulties in mining clusters of arbitrary densities, especially the clusters of sparse regions in the presence of dense regions. To address this problem, this paper presents a new concept called density decreased chain on the mutual k-NN graph. It starts with the local density center whose density is the highest in the data points connected to this center. Based on the density decreased chain, the concept of the core point is redefined. The density of the core point is close to that of the local density center on the same density decreased chain as the core point. According to its definition, the core point in the data with arbitrary densities can be well identified because the local density centers exist in both sparse and dense regions. Further, intra-cluster density decreased chain is defined to mine subclusters in the core points. After forming the subclusters, the remaining data point is hierarchically assigned to one of these subclusters by the density decreased chains containing this remaining data point. The experiments illustrate the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

Copyright of e & i Elektrotechnik und Informationstechnik is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Recently, Internet of Things (IoT) and multimedia are gaining popularity because of their usages in various applications. Numerous sensors and automated devices are generating huge volumes of data. Therefore, it is required to efficiently and effectively analyze this voluminous data. It can be achieved by using appropriate machine leaning techniques such as clustering. Among the clustering techniques, the k-means method/algorithm is one of the simplest, effective and commonly used methods. For making the cluster, it uses a measure of similarity/distance among the data observations. Nearby/similar data observations are placed within the same cluster whereas distant/dis-similar data observations are placed in other clusters. Hence, the similarity/distance metric plays a major role on the performance and accuracy of the k-means. Therefore, using an appropriate similarity/distance metric, the performance and accuracy of the k-means can be improved. K-means algorithm is majorly implemented using Euclidean distance metric. With the objective to explore the better and/or alternate similarity/distance metric(s) for k-means, a case study, based on empirical evaluation, of thirteen different similarity/distance metrics on six well-known datasets is performed and presented in this paper. By using the efficient and effective similarity / distance metrics, the performance and accuracy of the k-means algorithm can be improved which leads to formation of good clusters of various data observations or things or images etc. The results of the empirical study are analyzed and compared on the basis of widely used statistical clustering evaluation/validation measures. Based on the comparative results, these metrics are assigned with the ranks. Overall, the results demonstrate that Manhattan and Minkowski distance metrics gives better results for k-means algorithm. [ABSTRACT FROM AUTHOR]

Supervised learning requires a sufficient training dataset which includes all labels. However, there are cases that some class is not in the training data. Zero-shot learning (ZSL) is the task of predicting class that is not in the training data (unseen class). The existing ZSL method is done for image data. However, the zero-shot problem should happen to every data type. Hence, considering ZSL for other data types is required. In this paper, we propose the cluster-based ZSL method, which is a baseline method for multivariate binary classification problems. The proposed method is based on the assumption that if data is far from training data, the data is considered as unseen class. In training, clustering is done for training data. In prediction, the data is determined belonging to a cluster or not. If data does not belong to a cluster, the data is predicted as unseen class. The proposed method is evaluated and demonstrated using the KEEL datasets. [ABSTRACT FROM AUTHOR]

With the rapid development of digital information, the data volume generated by humans and machines is growing exponentially. Along with this trend, machine learning algorithms have been formed and evolved continuously to discover new information and knowledge from different data sources. Learning algorithms using hyperboxes as fundamental representational and building blocks are a branch of machine learning methods. These algorithms have enormous potential for high scalability and online adaptation of predictors built using hyperbox data representations to the dynamically changing environments and streaming data. This paper aims to give a comprehensive survey of the literature on hyperbox-based machine learning models. In general, according to the architecture and characteristic features of the resulting models, the existing hyperbox-based learning algorithms may be grouped into three major categories: fuzzy min–max neural networks, hyperbox-based hybrid models and other algorithms based on hyperbox representations. Within each of these groups, this paper shows a brief description of the structure of models, associated learning algorithms and an analysis of their advantages and drawbacks. Main applications of these hyperbox-based models to the real-world problems are also described in this paper. Finally, we discuss some open problems and identify potential future research directions in this field. [ABSTRACT FROM AUTHOR]

Machine Learning (ML) techniques have been used in an extensive range of applications in the field of structural and multidisciplinary optimization over the last few years. This paper presents a survey of this wide but disjointed literature on ML techniques in the structural and multidisciplinary optimization field. First, we discuss the challenges associated with conventional optimization and how Machine learning can address them. Then, we review the literature in the context of how ML can accelerate design synthesis and optimization. Some real-life engineering applications in structural design, material design, fluid mechanics, aerodynamics, heat transfer, and multidisciplinary design are summarized, and a brief list of widely used open-source codes as well as commercial packages are provided. Finally, the survey culminates with some concluding remarks and future research suggestions. For the sake of completeness, categories of ML problems, algorithms, and paradigms are presented in the Appendix. [ABSTRACT FROM AUTHOR]

The demand for more radio spectrum bandwidths has risen as a result of recent developments in wireless technology from every field of the wireless industry. It's getting faster by the day, and we're on our way to greater mobility as the market for higher data rates grows. The growth of the internet has increase demand for wireless networks, causing the available radio spectrum to become increasingly congested. Various studies have found that the rising demand for spectrum is due to regulatory schemes put in place by authorities to protect the rapidly growing number of spectrum users. Researchers are putting in a lot of effort to establish a methodology for coping with the looming spectrum crisis. Several regulators have recently expressed interest in funding free radio channels to give unlicensed devices entry. Clouds, hail, dust, gases, and other troposphere phenomena are more vulnerable to frequencies above 10 GHz. The effect of these phenomena on radio wave propagation in the troposphere is discussed in this paper. The results of various studies in this area are examined in this review.We have indicated "Vivek Kumar" as corresponding author. Please check and confirm.ok confirmed [ABSTRACT FROM AUTHOR]

Innovation capability is a great driving force leading city development. It is also important to evaluate the innovation capability of a city for city development. In this paper, we propose an ECNN model to evaluate city innovation capability. This model studies innovation capability from the perspective of machine learning. Compared with the existing statistical methods, it is a novel model, to the best of our knowledge, to evaluate the city's innovation capability in terms of machine learning. It overcomes the shortcomings of the original statistical methods for studying the relationship between indicators without considering the relationship between indicators and innovation capabilities. This model first clusters all samples, and the sample categories are marked as clusters. Second, the weight of each indicator is calculated by the entropy gain rate, and the total score is calculated by adding the weighted values of each indicator. To obtain more precise results, the neural network calculates the sample scores, which have the same score but belong to the cluster, with good clustering data as the training set. In this way, different clusters represent different innovation capabilities. Each sample has an innovation capability score. Therefore, the ECNN model has high practicability in evaluating the innovation capability of cities. [ABSTRACT FROM AUTHOR]

For scholarly organizations, students' academic performance (AP) computes student achievements in different academic subjects. Therefore, a systematic literature review based on machine learning approaches to improve student performance is proposed. This field creates a way to discover hidden examples from instructive information. Machine learning (ML) techniques are used for performance prediction. It is become a challenge due to its imbalanced dataset. This review aims to identify the best proposals that focus on various ML methods used for the performance analysis of students. This review will become helpful to the teachers in identifying the weak students, and it helps to improve their performance through proper guidance. Thus, it reflects in the student's background and boosts their growth. It also brings benefits to students, teachers, and institutions. This study focused on applying machine learning techniques to predict students' performance in recent times. With a systematic approach, the research identified the existing prediction methods and tools used to predict students' performance and observed the researchers' type of variables in this research area. In this study, almost more than 100 papers were analyzed to reveal various modern techniques that are commonly used to predict student performance and the goals they need to achieve in this field. The results from the various research will help improve students' academics and monitor the student's performance, which would also improve their literacy rate. [ABSTRACT FROM AUTHOR]

The systematic processing of unstructured communication data as well as the milestone of pattern recognition in order to determine communication groups in negotiations bears many challenges in Machine Learning. In particular, the so-called curse of dimensionality makes the pattern recognition process demanding and requires further research in the negotiation environment. In this paper, various selected renowned clustering approaches are evaluated with regard to their pattern recognition potential based on high-dimensional negotiation communication data. A research approach is presented to evaluate the application potential of selected methods via a holistic framework including three main evaluation milestones: the determination of optimal number of clusters, the main clustering application, and the performance evaluation. Hence, quantified Term Document Matrices are initially pre-processed and afterwards used as underlying databases to investigate the pattern recognition potential of clustering techniques by considering the information regarding the optimal number of clusters and by measuring the respective internal as well as external performances. The overall research results show that certain cluster separations are recommended by internal and external performance measures by means of a holistic evaluation approach, whereas three of the clustering separations are eliminated based on the evaluation results. [ABSTRACT FROM AUTHOR]

Machine learning-based predictive modeling is to develop machine learning-based or data-driven models to predict failures before they occur and estimate the remaining useful life or time to failure (TTF) accurately. Accurate TTF estimation plays a vital role in predictive maintenance or PHM (Prognostic and Health Management). Despite the availability of large amounts of data and a variety of powerful data analysis methods, predictive models developed for PHM still fail to provide accurate and precise TTF estimations. This paper addresses this problem by integrating machine learning algorithms such as classification, regression and clustering. A classification system is used to determine the likelihood of component failures such that rough indications of TTF are provided. Clustering and SVM-based local regression are then introduced to refine the time to failure estimations provided by the classification system. The paper illustrates the applicability of the proposed approach through a real world aerospace application with details on data pre-processing requirements. The results demonstrate that the proposed method can reduce uncertainty in estimating time to failure, which in turn helps augment the usefulness of predictive maintenance. [ABSTRACT FROM AUTHOR]

Class decomposition describes the process of segmenting each class into a number of homogeneous subclasses. This can be naturally achieved through clustering. Utilising class decomposition can provide a number of benefits to supervised learning, especially ensembles. It can be a computationally efficient way to provide a linearly separable data set without the need for feature engineering required by techniques like support vector machines and deep learning. For ensembles, the decomposition is a natural way to increase diversity, a key factor for the success of ensemble classifiers. In this paper, we propose to adopt class decomposition to the state-of-the-art ensemble learning Random Forests. Medical data for patient diagnosis may greatly benefit from this technique, as the same disease can have a diverse of symptoms. We have experimentally validated our proposed method on a number of data sets that are mainly related to the medical domain. Results reported in this paper show clearly that our method has significantly improved the accuracy of Random Forests. [ABSTRACT FROM AUTHOR]

In machine learning, a data set is often viewed as a point set distributed on a manifold. Using Euclidean norms to measure the proximity of this data set reduces the efficiency of learning methods. Also, many algorithms like Laplacian Eigenmaps or spectral clustering that require to measure similarity assume the k-Nearest Neighbors of any point are quite equal to the local neighborhood of the point on the manifold using Euclidean norms. In this paper, we propose a new method that intelligently transforms data on an unknown manifold to an n-sphere by the conformal stereographic projection, which preserves the angles and similarities of data in the original manifold. Therefore similarities represent actual similarities of the data in the original space. Experimental results on various problems, including clustering and manifold learning, show the effectiveness of our method. [ABSTRACT FROM AUTHOR]

While Vehicular Ad-hoc Network (VANET) is developed to enable effective vehicle communication and traffic information exchange, VANET is also vulnerable to different security attacks, such as DOS attacks. The usage of an intrusion detection system (IDS) is one possible solution for preventing attacks in VANET. However, dealing with a large amount of vehicular data that keep growing in the urban environment is still an critical challenge for IDSs. This paper, therefore, proposes a new machine learning model to improve the performance of IDSs by using Random Forest and a posterior detection based on coresets to improve the detection accuracy and increase detection efficiency. The experimental results show that the proposed machine learning model can significantly enhance the detection accuracy compared to classical application of machine learning models. [ABSTRACT FROM AUTHOR]

Heart disease is the most life-threatening disease globally, affecting human life very critically. On-time and precise diagnosis of heart disease is vital for the prevention and treatment of heart failure. In the earlier stage, several detection techniques were developed to detect heart disease using machine learning techniques. But the heart problems have not been detected accurately with the minimum required time. This paper presented an effective heart disease prediction system that accurately diagnoses abnormality within a short duration. The feature selection process is carried with stochastic gradient boosting with a recursive feature elimination approach. For classification, the features are clustered by using the adaptive Harris hawk optimization clustering approach. Based on clustered features, the classification is processed with an enhanced deep genetic algorithm. This method improves the performance of the deep neural network by augmenting its initial weights with an enhanced genetic algorithm, which recommends better weights for the neural network. The demonstration of the proposed work is simulated in the MATLAB platform and the dataset used in UCI machine learning repository. The experimental outcome shows that the developed feature selection and classification approach attain 98.36% and 97.3% accuracy compared with the state-of-the-art techniques. [ABSTRACT FROM AUTHOR]

Speech enhancement has substantial interest in the utilization of speaker identification, video-conference, speech transmission through communication channels, speech-based biometric system, mobile phones, hearing aids, microphones, voice conversion etc. Pattern mining methods have a vital step in the growth of speech enhancement schemes. To design a successful speech enhancement system consideration to the background noise processing is needed. A substantial number of methods from traditional techniques and machine learning have been utilized to process and remove the additive noise from a speech signal. With the advancement of machine learning and deep learning, classification of speech has become more significant. Methods of speech enhancement consist of different stages, such as feature extraction of the input speech signal, feature selection, feature selection followed by classification. Deep learning techniques are also an emerging field in the classification domain, which is discussed in this review. The intention of this paper is to provide a state-of-the-art summary and present approaches for using the widely used machine learning and deep learning methods to detect the challenges along with future research directions of speech enhancement systems. [ABSTRACT FROM AUTHOR]

An asymmetric approach to clustering of the asymmetric self-organizing map is proposed. The clustering is performed using an improved asymmetric version of the well-known $$k$$ -means algorithm. The improved asymmetric $$k$$ -means algorithm is the second proposal of this paper. As a result, we obtain a two-stage fully asymmetric data analysis technique. In this way, we maintain the methodological consistency of the both utilized methods, because they are both formulated in asymmetric versions, and consequently, they both properly adjust to asymmetric relationships in analyzed data. The results of our experiments on real data confirm the effectiveness of the proposed approach. [ABSTRACT FROM AUTHOR]

Rapid pavement deterioration is a major problem in areas with harsh weather exposure and/or high truck traffic loading. While several studies in recent years have focused on pavement deterioration and management systems, there is not, to date, a robust method explaining how large amounts of pavement data can be processed to identify homogeneous groups for the calibration of pavement performance models to support prioritization of maintenance, rehabilitation, or design of new pavements. This study employs machine learning to develop an approach, capable of partitioning pavement data with a close response to causal factors including traffic and weather conditions; and considering pavement performance through factors including international roughness index and deflections. Two classes of clustering, i.e. soft and hard partitioning, through K-means and Self Organizing Maps—SOM respectively, were tested to understand the correlation between daily factors and pavements deterioration. The goodness of clustering was tested using extrinsic and intrinsic evaluation methods. It was concluded from the results that SOM clustering provided reliable results, as it employs a soft clustering method, where data points can belong to more than one cluster at the same time. The results allowed better visualization of data points, identifying hidden relationships among clusters, and exploring correlations between external effects and homogeneous families. Moreover, it became apparent that unlike the common Markovian methods, including previous years' condition in the analysis of clusters has marginal to no effects on the detection of homogeneous grouping. The methodology proposed in this paper will produce more reliable pavement homogenous groups as input for performance models and decision-making for the maintenance and rehabilitation of pavements. Moreover, future researchers can use the results of this study to prepare a standardized design for pavement groups. [ABSTRACT FROM AUTHOR]

Developing effective and efficient data stream classifiers is challenging for the machine learning community because of the dynamic nature of data streams. As a result, many data stream learning algorithms have been proposed during the past decades and achieve great success in various fields. This paper aims to explore a specific type of challenge in learning evolving data streams, called concept evolution (emergence of novel classes). Concept evolution indicates that the underlying patterns evolve over time, and new patterns (classes) may emerge at any time in streaming data. Therefore, data stream classifiers with emerging class detection have received increasing attention in recent years due to the practical values in many real-world applications. In this article, we provide a comprehensive overview of the existing works in this line of research. We discuss and analyze various aspects of the proposed algorithms for data stream classification with concept evolution detection and adaptation. Additionally, we discuss the potential application areas in which these techniques can be used. We also provide a detailed overview of evaluation measures and datasets used in these studies. Finally, we describe the current research challenges and future directions for data stream classification with novel class detection. [ABSTRACT FROM AUTHOR]

With the many folds increase in demand for capacity in mobile broadband communication technology every year, wireless carriers must be prepared for the tremendous increase in mobile traffic in coming years. It forces scientists and researchers to come up with new wireless spectrum bands which has capabilities to support higher data rates. The higher spectrum bands like millimeter waves are the candidate band for this type of problems. This band comes with the challenges of radio wave attenuations oof signals due to the presence of gases, water vapor and other weather phenomenon like rain, storms, snow, hail etc. Different models are presented in order to predict attenuation due to rain out of which ITU-R model is the widely acceptable model. The ITU-R model contains complex methodology for calculating regression coefficients which are depends on frequency and polarization. In this paper, K-Means algorithm is used to propose an improved ITU-R model. Proposed model can make up the shortcoming of ITU-R model to determine the break-up points in frequency range and obtained soft clusters have been trained by machine learning algorithms then proposes a mathematical model for prediction of radio wave attenuation due to rain. The implementation results of proposed model were also compared with the ITU-R model. [ABSTRACT FROM AUTHOR]

Although data mining problems require a flat mining table as input, in many real-world applications analysts are interested in finding patterns in a relational database. To this end, new methods and software have been recently developed that automatically add attributes (or features) to a target table of a relational database which summarize information from all other tables. When attributes are automatically constructed by these methods, selecting the important attributes is particularly difficult, because a large number of the attributes are highly correlated. In this setting, attribute selection techniques such as the Least Absolute Shrinkage and Selection Operator (lasso), elastic net, and other machine learning methods tend to under-perform. In this paper, we introduce a novel attribute selection procedure, where after an initial screening step, we cluster the attributes into different groups and apply the group lasso to select both the true attributes groups and then the true attributes. The procedure is particularly suited to high dimensional data sets where the attributes are highly correlated. We test our procedure on several simulated data sets and a real-world data set from a marketing database. The results show that our proposed procedure obtains a higher predictive performance while selecting a much smaller set of attributes when compared to other state-of-the-art methods. [ABSTRACT FROM AUTHOR]