Search

Under the influence of the coronavirus disease and other factors, agricultural product prices show non-stationary and non-linear characteristics, making it increasingly difficult to forecast accurately. This paper proposes an innovative combinatorial model for Chinese hog price forecasting. First, the price is decomposed using the Seasonal and Trend decomposition using the Loess (STL) model. Next, the decomposed data are trained with the Long Short-term Memory (LSTM) and Seasonal Autoregressive Integrated Moving Average (SARIMA) models. Finally, the prepared data and the multivariate influence factors after Factor analysis are predicted using the gated recurrent neural network and attention mechanisms (AttGRU) to obtain the final prediction values. Compared with other models, the STL-FA-AttGRU model produced the lowest errors and achieved more accurate forecasts of hog prices. Therefore, the model proposed in this paper has the potential for other price forecasting, contributing to the development of precision and sustainable agriculture. [ABSTRACT FROM AUTHOR]

In today's big data era, there are a large number of unstructured information resources on the web. Natural language processing researchers have been working hard to figure out how to extract useful information from them. Entity Relation Extraction is a crucial step in Information Extraction and provides technical support for Knowledge Graphs, Intelligent Q&A systems and Intelligent Retrieval. In this paper, we present a comprehensive history of entity relation extraction and introduce the relation extraction methods based on Machine Mearning, the relation extraction methods based on Deep Learning and the relation extraction methods for open domains. Then we summarize the characteristics and representative results of each type of method and introduce the common datasets and evaluation systems for entity relation extraction. Finally, we summarize current entity relation extraction methods and look forward to future technologies. [ABSTRACT FROM AUTHOR]

Clustering is widely used in data mining and machine learning. The possibilistic c-means clustering (PCM) method loosens the constraint of the fuzzy c-means clustering (FCM) method to solve the problem of noise sensitivity of FCM. But there is also a new problem: overlapping cluster centers are not suitable for clustering non-cluster distribution data. We propose a novel possibilistic c-means clustering method based on the nearest-neighbour isolation similarity in this paper. All samples are taken as the initial cluster centers in the proposed approach to obtain k sub-clusters iteratively. Then the first b samples farthest from the center of each sub-cluster are chosen to represent the sub-cluster. Afterward, sub-clusters are mapped to the distinguishable space by using these selected samples to calculate the nearest-neighbour isolation similarity of the sub-clusters. Then, adjacent sub-clusters can be merged according to the presented connecting strategy, and finally, C clusters are obtained. Our method proposed in this paper has been tested on 15 UCI benchmark datasets and a synthetic dataset. Experimental results show that our proposed method is suitable for clustering non-cluster distribution data, and the clustering results are better than those of the comparison methods with solid robustness. [ABSTRACT FROM AUTHOR]

Precision marketing is faced with multiple levels of problems, such as pollution of the data environment and unscientific algorithms, which need to be sorted out urgently. Based on neural network technology, this paper constructs a neural network-based precision marketing model and focuses on data mining to study user churn prediction and user value enhancement, which are the two most important factors affecting marketing revenue. Moreover, this paper conducts an empirical test of the product strategy and market strategy adopted by big data precision marketing. According to the characteristics of the user population and the application scenarios of the product, this paper puts the corresponding precision marketing methods in a targeted manner and analyzes the performance of the model through experimental research. The research results show that precision marketing methods based on big data information platforms need to be more detailed and more comprehensive. At the same time, precision marketing methods need to correspond to the sensitive information characteristics of target users and consider the background and current situation of actual market execution to effectively play it role. [ABSTRACT FROM AUTHOR]

To promote the development of English-Chinese bilingual context, a CBR-based bilingual contextual intelligent model is constructed. This paper first expounds the development history of the bilingual context in English and Chinese. Concerning contextual knowledge, a CBR-based bilingual context system is designed. Using machine learning theory, the bilingual context of English and Chinese is analyzed, which provides a good environment for language learning. In this paper, a data mining algorithm is applied to optimize and update the algorithm flow and evaluation model. By evaluating the development pattern of bilingual context effectively, an effective recognition model is established. In the bilingual context intelligent model test, the practicability and efficiency test of the model shows that CBR has good practicability and is worth further promotion. [ABSTRACT FROM AUTHOR]

The paper reviews classification algorithms based on Gene Expression Programming (GEP) used for mining the real-life datasets. Our aim is to show, chronologically, most important developments as well as the current state-of-the-art in the area of GEP-based classifiers, with a view to attract further real life applications. We begin with reviewing approaches to building basic, stand alone, GEP classifiers and eventually, combining them into the classifier ensemble. In the following part of the paper we describe and illustrate with example several hybrid solutions where GEP is integrated with other methods. Next, we review specialized and dedicated methods including multiple criteria and incremental GEP-based classification tools. Final part of the paper reviews specialized GEP-based classifiers used to mine the real-life datasets. [ABSTRACT FROM AUTHOR]

Fuzzy clustering is an important research field in pattern recognition, machine learning and image processing. The fuzzy C-means (FCM) clustering algorithm is one of the most common fuzzy clustering algorithms. However, it requires a given number of clusters in advance for accurate clustering of data sets, so it is necessary to put forward a better clustering validity index to verify the clustering results. This paper presents a ratio component-wise design method of clustering validity function based on FCM clustering method. By permutation and combination of six clustering validity components representing different meanings in the form of ratio, 49 different clustering validity functions are formed. Then, these functions are verified experimentally under six kinds of UCI data sets, and a clustering validity function with the simplest structure and the best classification effect is selected by comparison. Finally, this function is compared with seven traditional clustering validity functions on eight UCI data sets. The simulation results show that the proposed validity function can better verify the classification results and determine the optimal clustering number of different data sets. [ABSTRACT FROM AUTHOR]

Big data has the characteristics of rapid data flow, massive data scale, dynamic data system, and various data types, and it has become increasingly apparent in improving innovation and entrepreneurship data analysis, trend prediction, and decision support. In this paper, the authors analyze the economic function data and entrepreneurship analysis based on machine learning. The support vector pair is very sensitive to the choice of parameters, and the parameters obtained using the genetic algorithm will greatly improve the accuracy of the model prediction. When using the genetic algorithm to find parameters, the cv method is used for verification. By applying big data technologies and platforms, it can provide strong data support to establish entrepreneurship education; integrate and integrate various types of innovation and entrepreneurship data, improve the quality of data collection.At the same time, through big data mining and analysis, accurately determine market demand hotspots and innovation and entrepreneurship trends, and promote scientific planning of innovation and entrepreneurship strategies. The research results show that this research model can be applied to actual projects in the future, and help investors better understand the changes of market economy. [ABSTRACT FROM AUTHOR]

Link prediction tremendously gained interest in the field of machine learning and data mining due to its real world applicability on various fields such as in social network analysis, biomedicine, e-commerce, scientific community, etc. Several link prediction methods have been developed which mainly focuses on the topological features of the network structure, to figure out the link prediction problem. Here, the main aim of this paper is to perform feature extraction from the given real time complex network using subgraph extraction technique and labeling of the vertices in the subgraph according to the distance from the vertex associated with each target link. This proposed model helps to learn the topological pattern from the extracted subgraph without using the topological properties of each vertex. The Geodesic distance measure is used in labeling of the vertices in the subgraph. The feature extraction is carried out with different size of the subgraph as K = 10and K = 15. Then the features are fit to different machine learning classification model. For the evaluation purpose, area under the ROC curve (AUC) metric is used. Further, comparative analysis of the existing link prediction methods is performed to have a clear picture of their variability in the performance of each network. Later, the experimental results obtained from different machine learning classifiers based on AUC metric have been presented. From the analysis, we can conclude that AdaBoost, Adaptive Logistic Regression, Bagging and Random forest maintain great performance comparatively on all the network. Finally, comparative analysis has been carried out between some best existing methods, and four best classification models, to make visible that link prediction based on classification models works well across several varieties of complex networks and solve the link prediction problem with superior performance and with robustness. [ABSTRACT FROM AUTHOR]

Quality prediction plays an essential role in the business outcome of the product. Due to the business interest of the concept, it has extensively been studied in the last few years. Advancement in machine learning (ML) techniques and with the advent of robust and sophisticated ML algorithms, it is required to analyze the factors influencing the success of the movies. This paper presents a hybrid features prediction model based on pre-released and social media data features using multiple ML techniques to predict the quality of the pre-released movies for effective business resource planning. This study aims to integrate pre-released and social media data features to form a hybrid features-based movie quality prediction (MQP) model. The proposed model comprises of two different experimental models; (i) predict movies quality using the original set of features and (ii) develop a subset of features based on principle component analysis technique to predict movies success class. This work employ and implement different ML-based classification models, such as Decision Tree (DT), Support Vector Machines with the linear and quadratic kernel (L-SVM and Q-SVM), Logistic Regression (LR), Bagged Tree (BT) and Boosted Tree (BOT), to predict the quality of the movies. Different performance measures are utilized to evaluate the performance of the proposed ML-based classification models, such as Accuracy (AC), Precision (PR), Recall (RE), and F-Measure (FM). The experimental results reveal that BT and BOT classifiers performed accurately and produced high accuracy compared to other classifiers, such as DT, LR, LSVM, and Q-SVM. The BT and BOT classifiers achieved an accuracy of 90.1% and 89.7%, which shows an efficiency of the proposed MQP model compared to other state-of-art- techniques. The proposed work is also compared with existing prediction models, and experimental results indicate that the proposed MQP model performed slightly better compared to other models. The experimental results will help the movies industry to formulate business resources effectively, such as investment, number of screens, and release date planning, etc. [ABSTRACT FROM AUTHOR]

Feature selection is one of the key problems in machine learning and data mining. It involves identifying a subset of the most useful features that produces compatible results as the original entire set of features. It can reduce the dimensionality of original data, speed up the learning process and build comprehensible learning models with good generalization performance. Nowadays, ensemble idea has been used to improve the performance of feature selection by integrating multiple base feature selection models into an ensemble one. In this paper, in order to improve the efficiency of feature selection in dealing with large scale, high dimension and imbalanced problems, a Min-Max Ensemble Feature Selection (M2-EFS) is proposed, which is based on balanced data partition and min-max ensemble strategy. The experimental results demonstrate that the M2-EFS can obtain higher performance than other classical ensemble methods in most cases, especially for large scale, high dimension and imbalanced data. [ABSTRACT FROM AUTHOR]

Under the background of the development of the new era, with the arrival of the big data era and the development of computer technology, people are more and more inclined to use data to analyze all kinds of problems encountered in teaching. Different educational data models are constructed through data analysis. By statistics of different educational data and analysis using correlation models, the relationship between different variables and the intensity of interaction in these activities can be determined. Using computer to complete some teaching tasks and construct a certain teaching mode can improve the efficiency of teachers' teaching and students' learning to a certain extent. In the process of discussing the use of computer in classroom teaching, we should analyze how to use computer to carry out new forms of teaching activities and how to evaluate the teaching quality of computer teaching. On the one hand, this paper summarizes the current situation of the development of digital teaching mode in colleges and universities in China; on the other hand, it analyzes the research results of computer teaching by professionals in the new era; Finally, the knowledge of data mining is expounded. [ABSTRACT FROM AUTHOR]

Data preprocessing is a necessary core in data mining. Preprocessing involves handling missing values, outlier and noise removal, data normalization, etc. The problem with existing methods which handle missing values is that they deal with the whole data ignoring the characteristics of the data (e.g., similarities and differences between cases). This paper focuses on handling the missing values using machine learning methods taking into account the characteristics of the data. The proposed preprocessing method clusters the data, then imputes the missing values in each cluster depending on the data belong to this cluster rather than the whole data. The author performed a comparative study of the proposed method and ten popular imputation methods namely mean, median, mode, KNN, IterativeImputer, IterativeSVD, Softimpute, Mice, Forimp, and Missforest. The experiments were done on four datasets with different number of clusters, sizes, and shapes. The empirical study showed better effectiveness from the point of view of imputation time, Root Mean Square Error (RMSE), Mean Absolute Error (MAE), and coefficient of determination (R2 score) (i.e., the similarity of the original removed value to the imputed one). [ABSTRACT FROM AUTHOR]

Learning from high-dimensional imbalanced data is prevalent in many vital real-world applications, which poses a severe challenge to traditional data mining and machine learning algorithms. The existing works generally use dimension reduction methods to deal with the curse of dimensionality, then apply traditional imbalance learning techniques to combat the problem of class imbalance. However, dimensionality reduction may cause the loss of useful information, especially for the minority classes. This paper introduces an ensemble-based method, HIBoost, to directly handle the imbalanced learning problem in high dimensional space. HIBoost takes into account the inherent high-dimensional hubness phenomenon, i.e., high-dimensional data tends to contain the singular points (hubs and anti-hubs) which frequently or rarely occur in k-nearest neighbors of other points. For the singular hubs and anti-hubs induced by high dimension, HIBoost introduces a discount factor to restrict the weight growth of them in the process of updating weight, so that the risk of over fitting can be reduced when training component classifiers. For class imbalance problem, HIBoost uses SMOTE to balance the training data in each iteration so as to alleviate the prediction bias of component classifiers. Experimental results based on sixteen high-dimensional imbalanced data sets demonstrate the effectiveness of HIBoost. [ABSTRACT FROM AUTHOR]

Due to the vast and rapid increase in data, data mining has become an increasingly important tool for the purpose of knowledge discovery in order to prevent the presence of rich data but poor knowledge. Data mining tasks can be undertaken in two ways, namely, manual walkthrough of data and use of machine learning approaches. Due to the presence of big data, machine learning has thus become a powerful tool to do data mining in intelligent ways. A popular approach of machine learning is inductive learning, which can be used to generate a rule set (a set of rules) using a particular algorithm. Inductive learning can involve a single base algorithm learning from a single data set following a standard learning approach. In this approach, the learning algorithm can generate a single rule set such as decision trees. On the other hand, the inductive learning can also involve a single base algorithm learning from multiple data sets following an ensemble learning approach. In this approach, the learning algorithm can generate multiple rule sets such as random forests. The latter approach is usually designed to reduce overfitting of models that usually arises when the former approach is adopted. In this context, the ensemble learning approach usually enables the improvement of the overall accuracy in prediction. The aim of this paper is to introduce a new approach of ensemble learning called Collaborative Rule Generation. In the new approach, the inductive learning involves multiple base algorithms learning from a single data set to generate a single rule set, which aims to enable each rule to have a higher quality. This paper also includes an experimental study validating the Collaborative Rule Generation approach and discusses the results in both quantitative and qualitative ways. [ABSTRACT FROM AUTHOR]

The rapid growth in the extraction of clinical events from unstructured clinical records has raised considerable challenges. In this paper, we propose the use of different features with a statical modeling method called conditional random fields, which is consider an algorithm for effectively solving problems of sequence tagging. Our goal is to determine which feature selection can affect the performance of four subtasks presented in SemEval Task-12: Clinical TempEval 2016. We applied a careful preprocessing, where the proposed method was tested on real clinical records from Task-12: Clinical TempEval 2016. The comparative analyses obtained indicate that our proposal achieves good results compared to the work presented in Task-12: Clinical TempEval 2016 challenges. [ABSTRACT FROM AUTHOR]

Breakthrough classification performances have been achieved by utilizing ensemble techniques in machine learning and data mining. Bagging is one such ensemble technique that has outperformed single models in obtaining higher predictive performances. This paper proposes an ensemble technique by utilizing the basic bootstrap aggregating technique on hybridization of two base learners namely Naïve Bayes (NB) and Decision Tree (DT). Before induction of the DT, NB algorithm is employed for eliminating mislabeled or contradictory instances from the training set. Consequently, bagging approach is applied on hybrid NBDT as the base learner. The resultant Bagged Naïve Bayes-Decision Tree (BNBDT) algorithm is then used for improving the classification accuracy of various multi-class problems. This algorithm iteratively trains the base learner from random samples of the training set, and then performs majority voting of their predictions. The proposed algorithm is compared with both ensemble and single classification techniques such as Random Forest, Bagged NB, Bagged DT, NB, and DT. Experimental results over 52 UCI data sets with bag size 100 demonstrate that the proposed algorithm significantly outperforms the existing algorithms. [ABSTRACT FROM AUTHOR]

Bayesian belief networks (BBN) and fuzzy cognitive maps (FCM) are two major causal knowledge frameworks that are frequently used in various domains for cause and effect analysis. However, most researchers use these as separate approaches to analyse the cause(s) and effect(s) of an event. In practice, both methods have their own strengths and weaknesses in both causal modelling and causal analysis. In this paper, a combination of BBN and FCM is used in order to model and analyse network intrusions. First, the BBN is learnt from network intrusion data; following this, an FCM is generated from the BBN, using a migration method. A data-mining approach is suitable for use in the construction of a BBN for network intrusion since this is a data-rich domain, while an FCM is appropriate for the intuitive representation of complex domains. The proposed method of network intrusion analysis using both BBN and FCM consists of several stages, in order to leverage the capabilities of each approach in building the causal model and performing causal analysis. Both the intuitive representation of the causal model in FCM and the wide variety of reasoning methods supported by BBN are exploited in this research to facilitate network intrusion analysis. [ABSTRACT FROM AUTHOR]

Fault diagnosis plays a crucial role to maintain healthy conditions in rotating machinery. In real industrial applications, a Machine Learning based Classifier (ML-C) analyses data from a current machinery condition to detect abnormal behaviours. Usually, this is achieved through a previous training of the ML-C model, under supervised learning; however, for new machinery conditions, the classifier is not able to correctly identify these new condition. This paper proposes a framework to detect new patterns of abnormal conditions in gearboxes, that could be associated to new faults. The framework relies on an algorithm to build evolving models in simultaneous scenarios of classification and clustering. The design is inspired by the main principles of the K-means and the One Nearest Neighbour (1-NN) algorithms. A heuristic metric is defined to analyse the new discovered clusters; as a result, these new clusters can be labelled as new classes corresponding to new faulty patterns. Once a new pattern is identified, the associated data feeds a dedicated supervised classifier which is updated through a new training phase. The proposed framework is tested on data collected from a gearbox test bed under realistic conditions of faults. Experimental results show that the algorithm is able to discover new valuable knowledge than can be identified as new faulty classes. [ABSTRACT FROM AUTHOR]

In the medical field, Named Entity Recognition (NER) plays a crucial role in the process of information extraction through electronic medical records and medical texts. To address the problems of long distance entity, entity confusion, and difficulty in boundary division in the Chinese electronic medical record NER task, we propose a Chinese electronic medical record NER method based on the multi-head attention mechanism and character-word fusion. This method uses a new character-word joint feature representation based on the pre-training model BERT and self-constructed domain dictionary, which can accurately divide the entity boundary and solve the impact of unregistered words. Subsequently, on the basis of the BiLSTM-CRF model, a multi-head attention mechanism is introduced to learn the dependency relationship between remote entities and entity information in different semantic spaces, which effectively improves the performance of the model. Experiments show that our models have better performance and achieves significant improvement compared to baselines. The specific performance is that the F1 value on the Chinese electronic medical record data set reaches 95.22%, which is 2.67%higher than the F1 value of the baseline model. [ABSTRACT FROM AUTHOR]

Research focus increases rapidly on recent years in mining imbalanced data set, because of its challenge and its extensive application on the real world. A dataset is said to be imbalance, if categories of the classification attribute is not evenly represented. A fine balanced dataset is an important source for the classifiers to define the best prediction model. All the existing classifiers are inclined to perform poor on the imbalanced datasets. The reason for this is, all the classifiers seek to optimize their overall accuracy not by considering the relative distribution of each class. Hence, it is very essential to go for well balanced dataset for classification. In this paper, the comprehensive Enhanced Minority Oversampling TEchnique (EMOTE) is proposed to improve the performance of the classifier by balancing the dataset. The key idea of the proposed method is to balance the dataset by tuning the misclassified instances of the minority classes into correctly classified instances through oversampling their nearest neighbor. To investigate the performance of the proposed model, different oversampling and under sampling methods inclusive of the well known method SMOTE (Synthetic Minority Oversampling TEchnique) are considered. Various imbalanced datasets from the UCI machine learning repository are considered for experiments The experimental results shows that, the proposed method EMOTE outperformed the other methods in balancing the dataset. In addition to this it is also proved that, the classifier is able to effectively improve its performance on the dataset which is generated by EMOTE. [ABSTRACT FROM AUTHOR]

Magnetic Resonance Imaging (MRI) is a diagnostic tool of remarkable potential in the area of neuroscience and clinical neuroimaging. The diagnostic accuracy can be limited by incompetence of the operating personnel, which can be supplemented by machine learning algorithms for classification of physiology and pathology. This paper uses effective information feature extraction, principal component analysis (PCA) for feature reduction and support vector machine (SVM) for classification of multi-sequence MR images of 7 patients. All axial slices of the brain are classified into normal and abnormal images. Various methods for feature extraction were tested among which effective information yielded the highest accuracy of 80.8% in a set of 677 images used for training and testing. The sensitivity and specificity were 80% and 81.06%, respectively. Different grid sizes were tested, and the highest accuracy was reported for 2 x 2 which indicates that the feature extraction must be taken over a small grid to ensure detection of minor variation from normal. The image sequences tested considered in the study are T1 weighted, T2 weighted, Fluid-attenuated inversion recovery (FLAIR), and post contrast T1 weighted. T2 weighted images were best classified with the maximum accuracy of 95.97%. This method proved to be effective to classify the images of all four sequences with accuracy ranging from 92-96%. The method was also tested with out of sample data and the accuracy obtained was 72.4%. The novelty of this work lies in the classification of multi-sequential images using all the different slices of the patient which includes the top of the skull as well as the mandible. The slices differ significantly as the spread of the tumor varies with each slice. The slices are taken at 5mm gap and the tumor can have a thickness less or more than the slice gap considered for the scan. [ABSTRACT FROM AUTHOR]

Machine-learning and data-mining techniques have been developed to turn data into useful task-oriented knowledge. The algorithms for mining association rules identify relationships among transactions using binary values and find rules at a single-concept level or multiple levels. Mining associations among itemsets only by using support and confidence thresholds at different levels of hierarchical data would not give interesting rules both for binary or quantitative data. This paper proposes a two phase algorithm that mines rare generalized fuzzy coherent rules at inter-cross level hierarchies. During phase-I both positive and negative fuzzy coherent rules are mined and in Phase-II, rare generalized fuzzy coherent rules are extracted from the resultant rules obtained from Phase-I. The algorithm framework works on top down methodology in generating positive and negative fuzzy coherent rules and mining rare generalized rules from it. Experiments conducted using synthetic dataset show the performance of the proposed algorithm in terms of the number of rare generalized rules generated, compared to fuzzy multiple-level association rule mining algorithm. [ABSTRACT FROM AUTHOR]

Data mining and machine learning methods have been utilized successfully in the past for identifying and forecasting meaningful patterns from data repositories of diverse application domains. However, the high number of dimensions and instances present in large datasets pose great technical challenges to these existing methods of classification and prediction. The presence of noisy data and missing values makes it even tougher to achieve accurate prediction outcomes. A number of hybrid methodologies constituting dimensionality reduction, feature selection and noise removal methods have been proposed in the literature. However, majority of these techniques force the analysts to compromise on accuracy of classification and prediction results. Therefore, there is a strong need of a methodology that not only scales well with the sheer size and volume of data but also provides near to accurate classification and prediction results by effectively handling the noise in data variables. This paper proposes a fuzzy-based methodology which ranks the dimensions in order of importance and exploits Fuzzy Nearest Neighbor (FNN) approaches for accurate classification and prediction. An experimental evaluation on real world datasets, taken from UCI machine learning repository, shows that the proposed approach outperforms the existing classification and prediction methods by employing only a subset of important features to achieve high prediction accuracy rates at multiple levels of data abstraction. [ABSTRACT FROM AUTHOR]

The results of data mining can be used to predict the physical health status of sports athletes and college sports students and provide physical fitness warnings, so that students can pay attention to physical health status and adjust their physical exercise status. Discrete Morse theory, as a powerful optimization theory, plays a big role in algorithm optimization. This paper combines data mining and discrete Morse theory to propose a grid clustering algorithm based on discrete Morse theory. Moreover, according to the theorem that the cell complex reaches the optimum when it has the smallest possible critical point, this study applies the concept of critical points in the discrete Morse theory to optimize the grid clustering process to obtain clustering results. In addition, this study uses the improved C4.5 algorithm to analyze the physical fitness assessment results and obtains a valuable analysis of the physical fitness assessment results. [ABSTRACT FROM AUTHOR]

In this study, we propose a new classification method by adopting some ideas originating from the fuzzy comprehensive evaluation (FCE). To make the FCE be a classifier, the class labels in classification problems are regarded as the evaluation remarks in the FCE, and the attributes in these two domains are regarded to be consistent. Then, to implement the FCE model B = W ∘ R and obtain an accurate classification result, on the one hand, a learning algorithm, which is based on the joint distribution of attribute values and is dynamic, is proposed to construct the fuzzy relational matrix R; on the other hand, equal weight is considered to constitute the weight vector W. Meanwhile, for a continuous dataset, the discretization method and the determination of the discretization class number corresponding to the proposed classifier are discussed. The proposed classifier not only innovatively extends the FCE to data mining but also has its own classification advantages, that is, it is easy to operate and has good interpretability. Finally, we perform some numerical experiments using publicly available datasets, and the experimental results demonstrate that the proposed classifier outperforms some existing classifiers. [ABSTRACT FROM AUTHOR]

The requisite of detecting Autism in the initial stage proposed dataset is exceptionally high in the recent era since it affects children with severe impacts on social and communication developments by damaging the neural system in a broader range. Thus, it is highly essential to identify this Autism in the primary stage. So many methods are employed in autism detection but fail to produce accurate results. Therefore, the present study uses the data mining technique in the process of autism detection, which provides multiple beneficial impacts with high accuracy as it identifies the essential genes and gene sequences in a gene expression microarray dataset. For optimally selecting the genes, the Artificial Bee Colony (ABC) Algorithm is utilized in this study. In contrast, the feature selection process is carried out by five different algorithms: tabu search, correlation, information gain ratio, simulated annealing, and chi-square. The proposed work utilizes a hybrid Extreme Learning Machine (ELM) algorithm based Adaptive Neuro-Fuzzy Inference System (ANFIS) in the classification process, significantly assisting in attaining high-accuracy results. The entire work is validated through Java. The obtained outcomes have specified that the introduced approach provides efficient results with an optimal precision value of 89%, an accuracy of 93%, and a recall value of 87%. [ABSTRACT FROM AUTHOR]

Recently, the representation learning is the fucus of intense research of machine learning community. The underlying idea is that the key for successful discrimination of difficult datasets is a good feature extraction. A transformation of the data space into another space where classification is easy. This work proposes a novel transformation into feature space that follows a photographic intuition: that we can build from pairs of features in original space some kind of photographic plate where the sample data are projected to create a picture of the data distribution in the feature subspace defined by the feature pair. These photographic plates may be used as individuals of a classifier ensemble. The approach allows a natural definition of a confidence weight affecting each individual classifier out for the construction of a combination rule used by the ensemble. Hence the name Paired Feature Multilayer Ensemble (pfme). The approach is naturally naive parallel, insensitive to sample size, robust to dimension increase, and allows a regularization in feature space which is independent from original input space. The proposed approach was evaluated on the basis of the computer experiments carried out on the benchmark datasets. [ABSTRACT FROM AUTHOR]

It is difficult for underwater archaeologists to recover the fine details of a captured image on the seabed when the image quality worsens due to the presence of more noisy artefacts, a mismatched device colour map, and a blurry image. To resolve this problem, we present a machine learning-based image restoration model (ML-IRM) for improving the visual quality of underwater images that have been deteriorated. Using this model, a home-made bowl set-up is created in which a different liquid concentration is used to replicate seabed water variation, and an object is dipped, or a video is played behind the bowl to recognise the object texture captured image in high-resolution for training the image restoration model is proposed. Gaussian and bidirectional pre-processing filters are used to both the high and low frequency components of the training image, respectively. To improve the clarity of the high-frequency channel background, soft-thresholding decreases the presence of distracting artefacts. On the other hand, the ML-IRM model can effectively keep the object textures on a low frequency channel. Experiment findings show that the proposed ML-IRM model improves the quality of seabed images, eliminates colour mismatches, and allows for more detailed information extraction. Blue shadow, green shadow, hazy, and low light test samples are randomly selected from all five datasets including U45 [1], EUVP [2], DUIE [3], UIEB [4], UM-ImageNet [5], and the proposed model. Peak Signal to Noise Ratio (PSNR) and Structural Similarity Index (SSIM) are computed for each condition separately. We list the values of PSNR (at 16.99 dB, 15.96 dB, 18.09 dB, 15.67 dB, 9.39 dB, 17.98 dB, 19.32 dB, 14.27 dB, 12.07 dB, and 25.47 dB) and SSIM (at 0.52, 0.57, 0.33, 0.47, 0.44, and 0.23, respectively. Similarly, it demonstrates that the proposed ML-IRM achieves a satisfactory result in terms of colour correction and contrast adjustment when applied to the problem of improving underwater images captured in low light. To do so, high-resolution images were captured in two low-light conditions (after 6 p.m. and again at 6 a.m.) for the training image datasets, and the results of their observations were compared to those of other existing state-of-the-art-methods. [ABSTRACT FROM AUTHOR]

The remarkable developments in biotechnology as well as the health sciences have resulted in the production of an enormous amount of data, including high-throughput screening genomics information and clinical information obtained through extensive electronic health records (EHRs). The application of data mining and machine learning techniques in the biosciences is today more vital than ever to achieving this objective as attempts are made to intelligently translate all readily available data into knowledge. Diabetes mellitus (DM), a group of metabolic disorders, is well known to have a serious detrimental effect on population lives all over the world. Large-scale research into all aspects of diabetic has resulted in the production of enormous amounts of data (detection, etiopathophysiology, therapy, etc.). The goal of the current study is to conduct a thorough examination of the use of machine learning, data mining methods and tools in the field of diabetes research, with the first classification making an appearance to be the most popular. These applications relate to a Statistical model and Diagnosis, b) Diabetic Complications, c) Multiple genes Background and Environment, and e) Free Healthcare and Management. Numerous machine learning algorithms were applied. 85% of the methods used were supervised learning approaches, whereas 15% were uncontrolled ones, including association rules. Developed on improved support vector machines, the most successful and widely used algorithm (SVM). Medical datasets were predominantly used in terms of data kind. [ABSTRACT FROM AUTHOR]

A smart healthcare network can use sensors and the Internet of Things (IoT) to enhance patient care while decreasing healthcare expenditures. It has become more difficult for healthcare providers to keep track and analyze the massive amounts of data it generates. Health care data created by IoT devices and e-health systems must be handled more efficiently. A wide range of healthcare industries can benefit from machine learning (ML) algorithms in the digital world. However, each of these algorithms has to be taught to anticipate or solve a certain problem. IoT-enabled healthcare data and health monitoring-based machine learning algorithms (IoT-HDHM-MLA) have been proposed to solve the difficulties faced by healthcare providers. Sensors and IoT devices are vital for monitoring an individual's health. The proposed IoT-HDHM-MLA aims to deliver healthcare services via remote monitoring with experts and machine learning algorithms. In this system, patients are monitored in real-time for various key characteristics using a collection of small wireless wearable nodes. The health care business benefits from systematic data collection and efficient data mining. Thus, the experimental findings demonstrate that IoT-HDHM-MLA enhances efficiency in patient health surveillance. [ABSTRACT FROM AUTHOR]

With the rapid development of information technology, data streams in various fields are showing the characteristics of rapid arrival, complex structure and timely processing. Complex types of data streams make the classification performance worse. However, ensemble classification has become one of the main methods of processing data streams. Ensemble classification performance is better than traditional single classifiers. This article introduces the ensemble classification algorithms of complex data streams for the first time. Then overview analyzes the advantages and disadvantages of these algorithms for steady-state, concept drift, imbalanced, multi-label and multi-instance data streams. At the same time, the application fields of data streams are also introduced which summarizes the ensemble algorithms processing text, graph and big data streams. Moreover, it comprehensively summarizes the verification technology, evaluation indicators and open source platforms of complex data streams mining algorithms. Finally, the challenges and future research directions of ensemble learning algorithms dealing with uncertain, multi-type, delayed, multi-type concept drift data streams are given. [ABSTRACT FROM AUTHOR]

Understanding the real-world short texts become an essential task in the recent research area. The document deduction analysis and latent coherent topic named as the important aspect of this process. Latent Dirichlet Allocation (LDA) and Probabilistic Latent Semantic Analysis (PLSA) are suggested to model huge information and documents. This type of contexts' main problem is the information limitation, words relationship, sparsity, and knowledge extraction. The knowledge discovery and machine learning techniques integrated with topic modeling were proposed to overcome this issue. The knowledge discovery was applied based on the hidden information extraction to increase the suitable dataset for further analysis. The integration of machine learning techniques, Artificial Neural Network (ANN) and Long Short-Term (LSTM) are applied to anticipate topic movements. LSTM layers are fed with latent topic distribution learned from the pre-trained Latent Dirichlet Allocation (LDA) model. We demonstrate general information from different techniques applied in short text topic modeling. We proposed three categories based on Dirichlet multinomial mixture, global word co-occurrences, and self-aggregation using representative design and analysis of all categories' performance in different tasks. Finally, the proposed system evaluates with state-of-art methods on real-world datasets, comprises them with long document topic modeling algorithms, and creates a classification framework that considers further knowledge and represents it in the machine learning pipeline. [ABSTRACT FROM AUTHOR]

Although Machine Learning (ML) is widely used to examine hidden patterns in complex databases and learn from them to predict future events in many fields, utilization of it for predicting the outcome of occupational accidents is relatively sparse. This study utilized diversified ML algorithms; Multinomial Logistic Regression (MLR), Support Vector Machines (SVM), Single C5.0 Tree (C5), Stochastic Gradient Boosting (SGB), and Neural Network (NN) in classifying the severity of occupational accidents in binary (Fatal/NonFatal) and multi-class (Fatal/Major/Minor) outcomes. Comparison of the performance of models showed Balanced Accuracy to be the best for SVM and SGB methods in 2-Class and SGB in 3-Class. Algorithms performed better at predicting fatal accidents compared to major and minor accidents. Results obtained revealed that, ML unveils factors contributing to severity to better address the corrective actions. Furthermore, taking action related to even some of the most significant factors in complex accidents database with many attributes can prevent majority of severe accidents. Interpretation of most significant factors identified for accident prediction suggest the following corrective measures: taking fall prevention actions, prioritizing workplace inspections based on the number of employees, and supplementing safety actions according to worker's age and experience. [ABSTRACT FROM AUTHOR]

Since the reform began in our country, with the rapid economic growth in recent years, the income level has grown extremely unequal, and it is difficult for the low-income poor to benefit from the rapid economic growth. The most important prerequisite for the fight against poverty is the accurate identification of the causes of poverty. To date, our country has not reached the level of maturity required to accurately study the causes of poverty in various households. However, with the rapid development of Internet technology and big data technology in recent years, the application of large-scale data technology and data extraction algorithms to poverty reduction can identify truly poor households faster and more accurately. Compared with traditional machine learning algorithms, there are no machine storage and technical constraints, can use a large amount of data and rely on multiple data samples. [ABSTRACT FROM AUTHOR]

On-time recovery and treatment of disease is always desirable. The use of Machine learning in health-care has grown very fast to diagnosis the different kinds of diseases in the past few years. In such a diagnosis, past and real-time data are playing very crucial role in using data mining techniques. Still, we are lacking in diagnosing the emotional mental disturbance accurately in the early stages. Thus,the initial diagnosis of depression expressively stances a great problem for both,researchers and clinical professionals. We have addressed the said problem in our proposed work using Pipeline Machine Learning technique where people based on emotional stages have been effectively classified into different groups in e-healthcare. To implement Hybrid classification, a well known machine learning multi-feature hybrid classifier is used by having the emotional stimulation in form of negative or positive people. In order to improve classification, an Ensemble Learning Algorithm is used which helps in choosing the more suitable features from the available genres-emotion data on online media. Additionally, Hold out validation method has been to split the dataset for training and testing of the predictive model. Further, performance evaluation measures have been applied to check the proposed system evaluation. This study is done on Genres-Tags MovieLens dataset. The experimental results show that applied ensemble method provides optimal classification performance by choosing the best subset of features. The said results proved the excellency of the proposed system which comes from the choosing most related features selected by the Integrated Learning algorithm. Additionally, suggested approach is used to accurately and effectively diagnose the depression in its early stage. It will help in recovery and treatment of depressed people. We conclude that use of the suggested method is highly suitable in all aspects of e-healthcare for depress stimulation. [ABSTRACT FROM AUTHOR]

Email is one of the most popular ways of communication. Nevertheless, it is also a potential tool to deceive and fill users with unwanted publicity, which reduces productivity. To alleviate such fact, a common solution has been building machine learning models based on the content of emails to automatically separate emails (spam vs ham). In this work, a study of a set of machine learning models and content-based features for the problem of cross-dataset email classification is presented. This problem consists in training and testing the models using different datasets; considering the fact that the datasets were collected under different independent setups. This has the purpose of simulating future variable or unpredictable conditions in the emails content distributions as could happen in a real setting, where models are trained using emails from a certain period of time, group of users or accounts, but tested with emails from other users or accounts. Experiments were conducted with the models and features using different datasets and two setups, same-dataset, and cross-dataset, to show the complexity of the later. The performance was evaluated using the Area Under the ROC Curve, a common metric in email classification. The results show interesting insights for the problem. [ABSTRACT FROM AUTHOR]

The k-NN algorithm is an instance-based learning algorithm which is widely used in the data mining applications. The core engine of the k-NN algorithm is the distance/similarity function. The performance of the k-NN algorithm varies with the selection of distance function. The traditional distance/similarity functions in k-NN do not perfectly handle the mix-mode words such as when one string has multiple substrings/words. For example, a two-word string of "Employee Name", a one-word string of "Name" or more than one word such as, "Name of Employee". This ambiguity is faced by different distance/similarity functions causing difficulties in finding the perfect match of words. To improve the perfect-match calculation functionality in the traditional k-NN algorithm, a new similarity distance metric is developed and named as word-distance (w-distance). The perfect match will help us to identify the exact required value. The proposed w-distance is a hybrid of distance and similarity in nature because it is to handle dissimilarity and similarity features of strings at the same time. The simulation results showed that w-distance has a better impact on the performance of the k-NN algorithm as compared to the Euclidean distance and the cosine similarity. [ABSTRACT FROM AUTHOR]

The Credit Score is the most fascinating three digit number associated with an individual or an organization as it figures out what loans you will qualify for and the interest rate you will pay. Current credit scoring system is based on the financial history of individual or organization. This work illustrates a new credit scoring system which incorporates Legacy credit score and emotional/social credit score. The legacy credit score is based on the financial history of an individual. The emotional/social credit score is based on analysis and study of social media and other web interaction. The new system called information trustworthiness is developed to improve the precision of social media data when compared with data from reliable sources. Finally, the proper fractions of legacy credit score and emotional/social credit score are added to get Advanced Credit Score. This score is more precise than Legacy credit score as it also incorporates personality traits of an individual which have a high impact on one's financial behavior. However, the accuracy of the Advanced Credit Score is dependent on the fractions of legacy credit score and emotional/social credit score selected. The advance scoring system can be effectively used to distinguish people who defaulted many times and who never used loans or services like credit cards which are otherwise not possible using legacy financial credit scoring system. [ABSTRACT FROM AUTHOR]