Search

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]

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]

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]

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 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]

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]

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]

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]

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]

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]

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]

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]

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]

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]

One of the most important composite indicators (CIs) to assess the development of countries or regions is the human development index (HDI) which is used by the United Nations (UN) to rank countries. HDI has three dimensions including healthy life, population education, and standard of living. A total of four different sub-indicators are defined for these three dimensions. The UN evaluates and ranks all countries using a simple arithmetic or geometric average of the sub-indicators and then categorizes the countries into four different groups based on their HDI scores. To measure the HDI, the benefit-of-the-doubt (BOD) model is used by researchers instead of the geometric mean. The conventional BOD model has some main drawbacks. The first is not accounting for data uncertainty, and the second is evaluating countries using different weights for the same sub-indicators. Furthermore, BOD model is not capable of predicting countries' future HDI scores. To overcome these deficiencies, this paper proposes a common weight fuzzy BOD (CWFBOD) model to measure the HDI scores. First, to take into account the uncertainty, data are considered fuzzy numbers, and a fuzzy BOD model (FBOD) is introduced. Then, to find a set of common weights for the three dimensions of HDI, the proposed FBOD model is transformed into a multiple-objective CWFBOD model. To convert and solve the multiple objective CWFBOD model to a single objective model, a fuzzy theory approach is used. In addition, of predicting the future HDI scores of countries, an artificial neural network (ANN) is designed and trained, where the original data on sub-indicators health, education, and income are considered as the features, and the HDI scores generated by CWBOD are assumed as the target of ANN. Finally, this study applies the fuzzy C-Means clustering technique to cluster all countries into four different clusters based on the HDI scores generated by FBOD and CWFBOD models. To illustrate the ability of the proposed methodology, the HDI scores of 190 countries during the period of 2015–2021 have been estimated and predicted. The results show that the proposed integrated methodology can be effectively used to estimate and predict the HDI scores as well as to cluster countries. [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]

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]

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]

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]

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]

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]

Wireless sensor network is effective for data aggregation and transmission in IoT environment. Here, the sensor data often contain a significant amount of noises or redundancy exists, and thus, the data are aggregated to extract meaningful information and reduce the transmission cost. In this paper, a novel data aggregation scheme is proposed based on clustering of the nodes and extreme learning machine (ELM) which efficiently reduces redundant and erroneous data. Mahalanobis distance-based radial basis function is applied to the projection stage of the ELM to reduce the instability of the training process. Kalman filter is also used to filter the data at each sensor node before transmitted to the cluster head. Computer simulation with real datasets shows that the proposed scheme consistently outperforms the existing schemes in terms of clustering accuracy of the data and energy efficiency of WSN. [ABSTRACT FROM AUTHOR]

Inferring the quality of service experienced by wireless users is challenging, as network monitoring does not capture the service perception for each user individually. In this paper, we propose an unsupervised machine learning approach to infer the quality of service experienced by wireless users, based on the different usage profiles of a large-scale wireless network. To this end, our approach correlates the usage data of access points, and the summaries of connection flows passing through the access points in the network. Then, we apply the k-means clustering algorithm to infer different network usage profiles. We evaluate our proposed approach to infer QoS on a real large-scale wireless network, and the results show that discriminating the flows into five clusters allows identifying prevalent usage profiles of the degraded state of the network and overload conditions in access points, considering only the flow summaries. [ABSTRACT FROM AUTHOR]

In a large-scale data center, it is vital to precisely recognize the termination statuses of applications at an early stage. In recent years, many machine learning techniques have been applied to this issue, which is beneficial for optimizing the scheduling policy and improving the efficiency of resource utilization. However, if the application's dynamic information is insufficient at the early stage, the generalization performance of the machine learning model will be lessened, and the prediction accuracy could be low. To overcome this problem, a novel failure prediction method that is based on the association relationships between similar jobs is proposed in this paper to jointly predict task's termination statuses at an earlier stage. The similar jobs whose tasks have similar changing modes of consumed resources, an inherent structural correlation may exist, and the correlation information is significant for improving the prediction model's generalization performance. First, a job clustering algorithm is proposed for identifying the jobs with higher similarity from jobs that have various numbers of tasks. Second, based on the job clustering results, the robust multi-task learning algorithm is introduced to effectively utilize the domain information among jobs (i.e. interactional relationship among jobs on the termination statuses of task). Experiments are conducted on a Google cluster workload traces dataset. The results show that the proposed method can realize higher prediction accuracy, lower misjudgment rate, and higher predictive stability than several state-of-the-art methods at 1/3 the running time of the tasks. [ABSTRACT FROM AUTHOR]

Real-world data sets often contain mislabelled entities. This can be particularly problematic if the data set is being used by a supervised classification algorithm at its learning phase. In this case, the accuracy of this classification algorithm, when applied to unlabelled data, is likely to suffer considerably. In this paper, we introduce a clustering-based method capable of reducing the number of mislabelled entities in data sets. Our method can be summarised as follows: (i) cluster the data set; (ii) select the entities that have the most potential to be assigned to correct clusters; (iii) use the entities of the previous step to define the core clusters and map them to the labels using a confusion matrix; (iv) use the core clusters and our cluster membership criterion to correct the labels of the remaining entities. We perform numerous experiments to validate our method empirically using k-nearest neighbour classifiers as a benchmark. We experiment with both synthetic and real-world data sets with different proportions of mislabelled entities. Our experiments demonstrate that the proposed method produces promising results. Thus, it could be used as a preprocessing data correction step of a supervised machine learning algorithm. [ABSTRACT FROM AUTHOR]

In the context of computer experiments, metamodels are largely used to represent the output of computer codes. Among these models, Gaussian process regression (kriging) is very efficient see e.g Snelson (Flexible and efficient Gaussian process models for machine learning. ProQuest LLC, Ann Arbor, MI. Thesis (Ph.D.)–University of London, University College London, London, 2008). In high dimension that is with a large number of input variables, but with few observations, the estimation of the parameters with a classical anisotropic kriging can be completely inaccurate. Because there are equal numbers of ranges and input variables the optimization space becomes too large compared to available information. One way to overcome this drawback is to use an isotropic kernel that only depends on one parameter. However this model is too restrictive. The aim of this paper is twofold. Our first objective is to propose a smooth kernel with as few parameters as warranted. We introduce a kernel which is a tensor product of few isotropic kernels built on well-chosen subgroup of variables. The main difficulty is to find the number and the composition of the groups. Our second objective is to propose algorithmic strategies to overcome this difficulty. Four forward strategies are proposed. They all start with the simplest isotropic kernel and stop when the best model according to BIC criterion is found. They all show very good accuracy results on simulation test cases. But one of them is more efficient. Tested on a real data set, our kernel shows very good prediction results. [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]

The global k-means algorithm is an incremental approach to clustering that dynamically adds one cluster center at a time through a deterministic global search procedure from suitable initial positions, and employs k-means to minimize the sum of the intra-cluster variances. However the global k-means algorithm sometimes results singleton clusters and the initial positions sometimes are bad, after a bad initialization, poor local optimal can be easily obtained by k-means algorithm. In this paper, we modified the global k-means algorithm to eliminate the singleton clusters at first, and then we apply MinMax k-means clustering error method to global k-means algorithm to overcome the effect of bad initialization, proposed the global Minmax k-means algorithm. The proposed clustering method is tested on some popular data sets and compared to the k-means algorithm, the global k-means algorithm and the MinMax k-means algorithm. The experiment results show our proposed algorithm outperforms other algorithms mentioned in the paper. [ABSTRACT FROM AUTHOR]

Fuzzy neural network (FNN) and support vector machine (SVM) are popular techniques for pattern classification. FNN has a good local representation power and human-like reasoning benefit. But the learning algorithms used in most FNN classifiers only focus on minimizing empirical risk. SVM has excellent generalization performance due to focusing on simultaneously minimizing both empirical and expected risks. But this performance is dependent on choosing an appropriate kernel function. To overcome these challenges some efforts have been made to combine SVM and FNN; however, the methods proposed so far are faced with some major problems such as significantly increasing number of fuzzy rules. In this paper a support vector-based fuzzy classifier with adaptive kernel (SVFC-AK) is proposed. SVFC-AK implements the mentioned combining idea and yet not have disadvantages of the previous methods. This is realized by leveraging an underlying relation between FNN and kernel SVM. More precisely, SVFC-AK is a TS-type FNN for which the parameters are tuned through a new adaptive fuzzy kernel SVM. Also, the proposed fuzzy kernel, which is calculated automatically, is inspired by the fuzzy rule-based representation of FNN. Moreover, the fuzzy rules of SVFC-AK are generated using a modified clustering method based on Gaussian mixture model, which determines the number of required rules automatically. The experimental results illustrate that the classification performance of SVFC-AK is competitive or even better than some related methods, while the number of its fuzzy rules or hyper-parameters is substantially smaller. [ABSTRACT FROM AUTHOR]

Evolutionary K-Means (EKM), which combines K-Means and genetic algorithm, solves K-Means' initiation problem by selecting parameters automatically through the evolution of partitions. Currently, EKM algorithms usually choose silhouette index as cluster validity index, and they are effective in clustering well-separated clusters. However, their performance of clustering noisy data is often disappointing. On the other hand, clustering stability-based approaches are more robust to noise; yet, they should start intelligently to find some challenging clusters. It is necessary to join EKM with clustering stability-based analysis. In this paper, we present a novel EKM algorithm that uses clustering stability to evaluate partitions. We firstly introduce two weighted aggregated consensus matrices, positive aggregated consensus matrix (PA) and negative aggregated consensus matrix (NA), to store clustering tendency for each pair of instances. Specifically, PA stores the tendency of sharing the same label and NA stores that of having different labels. Based upon the matrices, clusters and partitions can be evaluated from the view of clustering stability. Then, we propose a clustering stability-based EKM algorithm CSEKM that evolves partitions and the aggregated matrices simultaneously. To evaluate the algorithm's performance, we compare it with an EKM algorithm, two consensus clustering algorithms, a clustering stability-based algorithm and a multi-index-based clustering approach. Experimental results on a series of artificial datasets, two simulated datasets and eight UCI datasets suggest CSEKM is more robust to noise. [ABSTRACT FROM AUTHOR]

The minimum number attribute reduction problem is an important issue when dealing with huge amounts of data. The problem of minimum attribute reduction is formally known to be as an NP complete nonlinearly constrained optimization problem. Social spider optimization algorithm is a new meta-heuristic algorithm of the swarm intelligence field to global solution. The social spider optimization algorithm is emulates the behavior of cooperation between spiders based on the biological laws of the cooperative colony. Inspired by the social spiders, in this paper, an improved social spider algorithm for the minimal reduction problem was proposed. In the proposed algorithm, the fitness function depends on the rough sets dependency degree and it takes into a consideration the number of selected features. For each spider, the fitness function is computed and compared with the global best fitness value. If the current value is better, then the global best fitness is replaced with it and its position became the reduct set. Then, the position of each spider is updated according to its type. This process is repeated until the stopping criterion is satisfied. To validate the proposed algorithm, several real clinical medical datasets which are available from the UCI Machine Learning Repository were used to compute the performance of the proposed algorithm. The experimental results illustrate that the proposed algorithm is superior to state-of-the-art swarm-based in terms of classification accuracy while limiting number of features. [ABSTRACT FROM AUTHOR]

Recent years have seen an increased interest in machine learning-based predictive methods for analyzing quantitative behavioral data in experimental psychology. While these methods can achieve relatively greater sensitivity compared to conventional univariate techniques, they still lack an established and accessible implementation. The aim of current work was to build an open-source R toolbox - “PredPsych” - that could make these methods readily available to all psychologists. PredPsych is a user-friendly, R toolbox based on machine-learning predictive algorithms. In this paper, we present the framework of PredPsych via the analysis of a recently published multiple-subject motion capture dataset. In addition, we discuss examples of possible research questions that can be addressed with the machine-learning algorithms implemented in PredPsych and cannot be easily addressed with univariate statistical analysis. We anticipate that PredPsych will be of use to researchers with limited programming experience not only in the field of psychology, but also in that of clinical neuroscience, enabling computational assessment of putative bio-behavioral markers for both prognosis and diagnosis. [ABSTRACT FROM AUTHOR]

Discovering the similar groups is a popular primary step in analysis of biomedical data, which cannot be identified manually. Many supervised and unsupervised machine learning and statistical approaches have been developed to solve this problem. Clustering is an unsupervised learning approach, which organizes the data into similar groups, and is used to discover the intrinsic hidden structure of data. In this paper, we used clustering by fast search and find of density peaks (CDP) approach for cancer subtyping and identification of normal tissues from tumor tissues. In additional, we also address the preprocessing and underlying distance matrix’s impact on finalized groups. We have performed extensive experiments on real-world and synthetic cancer gene expression microarray data sets and compared obtained results with state-of-the-art clustering approaches. [ABSTRACT FROM AUTHOR]

Clustering, as an unsupervised learning method and an important process in data mining, is an aspect of large and distributed data analysis. In many applications, such as peer-to-peer systems, huge volumes of data are distributed between multiple sources. Analysis of these volumes of data and identifying appropriate clusters is challenging due to transmission, processing and storage costs. In this paper, a gossip-based distributed clustering algorithm for P2P networks called Efficient GBDC-P2P is proposed, based on an improved gossip communicative approach by combining the peer sampeling and CYCLON protocol and the idea of partitioning-based data clustering. This algorithm is appropriate for data clustering in unstructured P2P networks, and it is adapted to the dynamic conditions of these networks. In the Efficient GBDC-P2P algorithm, distributed peers perform clustering operation in a distributed way only through local communications with their neighbors. Our approach does not rely on the central server to carry out data clustering task and without the need to synchronize operations. Evaluation results verify the efficiency of our proposed algorithm for data clustering in unstructured P2P networks. Furthermore, comparative analyses with other well-established distributed clustering approaches demonstrate the superior accuracy of the proposed method. [ABSTRACT FROM AUTHOR]

Clustering is a powerful and versatile tool for knowledge discovery, able to provide a valuable information for data analysis in various domains. To perform this task based on streaming data is quite challenging: outdated knowledge needs to be disposed while the current knowledge is obtained from fresh data; since data are continuously flowing, strict efficiency constraints have to be met. This paper presents WCDS, an approach to this problem based on the WiSARD artificial neural network model. This model already had useful characteristics as inherent incremental learning capability and patent functioning speed. These were combined with novel features as an adaptive countermeasure to cluster imbalance, a mechanism to discard expired data, and offline clustering based on a pairwise similarity measure for WiSARD discriminators. In an insightful experimental evaluation, the proposed system had an excellent performance according to multiple quality standards. This supports its applicability for the analysis of data streams. [ABSTRACT FROM AUTHOR]

Background: With the rapid accumulation of biological datasets, machine learning methods designed to automate data analysis are urgently needed. In recent years, so-called topic models that originated from the field of natural language processing have been receiving much attention in bioinformatics because of their interpretability. Our aim was to review the application and development of topic models for bioinformatics. Description: This paper starts with the description of a topic model, with a focus on the understanding of topic modeling. A general outline is provided on how to build an application in a topic model and how to develop a topic model. Meanwhile, the literature on application of topic models to biological data was searched and analyzed in depth. According to the types of models and the analogy between the concept of document-topic-word and a biological object (as well as the tasks of a topic model), we categorized the related studies and provided an outlook on the use of topic models for the development of bioinformatics applications. Conclusion: Topic modeling is a useful method (in contrast to the traditional means of data reduction in bioinformatics) and enhances researchers' ability to interpret biological information. Nevertheless, due to the lack of topic models optimized for specific biological data, the studies on topic modeling in biological data still have a long and challenging road ahead. We believe that topic models are a promising method for various applications in bioinformatics research. [ABSTRACT FROM AUTHOR]

Machine Learning techniques have been useful in almost every field of concern. Data Mining, a branch of Machine Learning is one of the most extensively used techniques. The ever-increasing demands in the field of medicine are being addressed by computational approaches in which Big Data analysis, image processing and data mining are on top priority. These techniques have been exploited in the domain of ophthalmology for better retinal fundus image analysis. Blood vessels, one of the most significant retinal anatomical structures are analysed for diagnosis of many diseases like retinopathy, occlusion and many other vision threatening diseases. Vessel segmentation can also be a pre-processing step for segmentation of other retinal structures like optic disc, fovea, microneurysms, etc. In this paper, blood vessel segmentation is attempted through image processing and data mining techniques. The retinal blood vessels were segmented through color space conversion and color channel extraction, image pre-processing, Gabor filtering, image postprocessing, feature construction through application of principal component analysis, k-means clustering and first level classification using Naïve-Bayes classification algorithm and second level classification using C4.5 enhanced with bagging techniques. Association of every pixel against the feature vector necessitates Big Data analysis. The proposed methodology was evaluated on a publicly available database, STARE. The results reported 95.05% accuracy on entire dataset; however the accuracy was 95.20% on normal images and 94.89% on pathological images. A comparison of these results with the existing methodologies is also reported. This methodology can help ophthalmologists in better and faster analysis and hence early treatment to the patients. [ABSTRACT FROM AUTHOR]

Because of its deterministic nature, K-means does not yield confidence information about centroids and estimated cluster memberships, although this could be useful for inferential purposes. In this paper we propose to arrive at such information by means of a non-parametric bootstrap procedure, the performance of which is tested in an extensive simulation study. Results show that the coverage of hyper-ellipsoid bootstrap confidence regions for the centroids is in general close to the nominal coverage probability. For the cluster memberships, we found that probabilistic membership information derived from the bootstrap analysis can be used to improve the cluster assignment of individual objects, albeit only in the case of a very large number of clusters. However, in the case of smaller numbers of clusters, the probabilistic membership information still appeared to be useful as it indicates for which objects the cluster assignment resulting from the analysis of the original data is likely to be correct; hence, this information can be used to construct a partial clustering in which the latter objects only are assigned to clusters. [ABSTRACT FROM AUTHOR]

With the rapid increase of user access, load balancing in cloud data center has become an important factor affecting cluster stability. From the point of view of green scheduling, this paper proposed a virtual machine intelligent scheduling strategy based on machine learning algorithm to achieve load balancing of cloud data center. Firstly, a load forecasting algorithm based on genetic algorithm (SVR_GA), k-means clustering algorithm based on optimized min-max, and adaptive differential evolution algorithm (ESA_DE) to enhance local search ability are proposed to solve the load imbalance problem in cloud data center. The experimental results showed that compared with other classical algorithms, the proposed virtual machine scheduling strategy reduces the number of virtual machine migration by 94.5% and the energy consumption of cloud data center by 49.13%. [ABSTRACT FROM AUTHOR]