Search

With unlabeled and high-dimensional data explosion, unsupervised feature selection has become an essential step in many machine learning and data mining tasks. Many dictionary learning based models have been successfully developed for unsupervised feature selection in recent years. These models learn an over-complete dictionary to investigate more data distribution information. However, over-complete dictionary learning will generate redundancy in the latent representations for data. Moreover, if data contain noise, dictionary learning will also yield noise in the latent representations. In this paper, we propose a novel unsupervised feature selection framework, named dictionary learning for unsupervised feature selection via dual sparse regression. In this model, dictionary learning is first embedded into a sparse regression to learn an over-complete dictionary with sparse representations for data, in which the redundancy and noise are eliminated. The data are then projected to the representations to evaluate the significance of features using the other sparse regression. We also offer an efficient algorithm to solve this problem and theoretically analyze its convergence and computational complexity, which is proportional to the data dimensionality. Finally, the evaluation results with the k-means task utilizing the selected features on 9 benchmark datasets demonstrate the superiority of our approach in terms of effectiveness and efficiency. [ABSTRACT FROM AUTHOR]

The increasing amount of data from web systems data is becoming one of the most valuable resources for information retrieval and knowledge discovery. The huge content of information makes it an important area for data mining research. To analyze the dependencies of the outcoming data, expressed as query scenarios, we present a new approach for evaluating the behavior of interactive web systems by applying different data mining techniques to solve the problem. We propose tools that take outcoming logs as input, analyze them, and provide information about web client actions. Qualitative and quantitative automatic evaluation of the data can explain the connections between the most significant parameters of the system in particular scenarios. In this paper, we propose a new method, which can be used to efficiently verify the type of client behavior of a web system or design of the system. The analysis of results demonstrates the possibility of efficient pattern search. [ABSTRACT FROM AUTHOR]

The presence of machine learning, data mining and related disciplines is increasingly evident in everyday environments. The support for the applications of learning techniques in topics related to economic risk assessment, among other financial topics of interest, is relevant for us as human beings. The content of this paper consists of a proposal of a new supervised learning algorithm and its application in real world datasets related to finance, called D1-NN (Dynamic 1-Nearest Neighbor). The D1-NN performance is competitive against the main state of the art algorithms in solving finance-related problems. The effectiveness of the new D1-NN classifier was compared against five supervised classifiers of the most important approaches (Bayes, nearest neighbors, support vector machines, classifier ensembles, and neural networks), with superior results overall. [ABSTRACT FROM AUTHOR]

k nearest neighbor (k NN) is a simple and widely used classifier; it can achieve comparable performance with more complex classifiers including decision tree and artificial neural network. Therefore, k NN has been listed as one of the top 10 algorithms in machine learning and data mining. On the other hand, in many classification problems, such as medical diagnosis and intrusion detection, the collected training sets are usually class imbalanced. In class imbalanced data, although positive examples are heavily outnumbered by negative ones, positive examples usually carry more meaningful information and are more important than negative examples. Similar to other classical classifiers, k NN is also proposed under the assumption that the training set has approximately balanced class distribution, leading to its unsatisfactory performance on imbalanced data. In addition, under a class imbalanced scenario, the global resampling strategies that are suitable to decision tree and artificial neural network often do not work well for k NN, which is a local information-oriented classifier. To solve this problem, researchers have conducted many works for k NN over the past decade. This paper presents a comprehensive survey of these works according to their different perspectives and analyzes and compares their characteristics. At last, several future directions are pointed out. [ABSTRACT FROM AUTHOR]

Both cost-sensitive classification and online learning have been extensively studied in data mining and machine learning communities, respectively. However, very limited study addresses an important intersecting problem, that is, “Cost-Sensitive Online Classification”. In this paper, we formally study this problem, and propose a new framework for Cost-Sensitive Online Classification by directly optimizing cost-sensitive measures using online gradient descent techniques. Specifically, we propose two novel cost-sensitive online classification algorithms, which are designed to directly optimize two well-known cost-sensitive measures: (i) maximization of weighted sum of sensitivity and specificity, and (ii) minimization of weighted misclassification cost. We analyze the theoretical bounds of the cost-sensitive measures made by the proposed algorithms, and extensively examine their empirical performance on a variety of cost-sensitive online classification tasks. Finally, we demonstrate the application of the proposed technique for solving several online anomaly detection tasks, showing that the proposed technique could be a highly efficient and effective tool to tackle cost-sensitive online classification tasks in various application domains. [ABSTRACT FROM AUTHOR]

To beat competition and obtain valuable information, decision-makers must conduct in-depth machine learning or data mining for data analytics. Traditionally, clustering and classification are two common methods used in machine mining. For clustering, data are divided into various groups according to the similarity or common features. On the other hand, classification refers to building a model by given training data, where the target class or label is predicted for the test data. In recent years, many researchers focus on the hybrid of clustering and classification. These techniques have admirable achievements, but there is still room to ameliorate performances, such as distributed process. Therefore, we propose clustering and classification based on distributed automatic feature engineering (AFE) for customer segmentation in this paper. In the proposed algorithm, AFE uses artificial bee colony (ABC) to select valuable features of input data, and then RFM provides the basic data analytics. In AFE, it first initializes the number of cluster k. Moreover, the clustering methods of k-means, Wald method, and fuzzy c-means (FCM) are processed to cluster the examples in variant groups. Finally, the classification method of an improved fuzzy decision tree classifies the target data and generates decision rules for explaining the detail situations. AFE also determines the value of the split number in the improved fuzzy decision tree to increase classification accuracy. The proposed clustering and classification based on automatic feature engineering is distributed, performed in Apache Spark platform. The topic of this paper is about solving the problem of clustering and classification for machine learning. From the results, the corresponding classification accuracy outperforms other approaches. Moreover, we also provide useful strategies and decision rules from data analytics for decision-makers. [ABSTRACT FROM AUTHOR]

Machine learning is a subcategory of artificial intelligence, which aims to make computers capable of solving complex problems without being explicitly programmed. Availability of large datasets, development of effective algorithms, and access to the powerful computers have resulted in the unprecedented success of machine learning in recent years. This powerful tool has been employed in a plethora of science and engineering domains including mining and minerals industry. Considering the ever-increasing global demand for raw materials, complexities of the geological structure of ore deposits, and decreasing ore grade, high-quality and extensive mineralogical information is required. Comprehensive analyses of such invaluable information call for advanced and powerful techniques including machine learning. This paper presents a systematic review of the efforts that have been dedicated to the development of machine learning-based solutions for better utilizing mineralogical data in mining and mineral studies. To that end, we investigate the main reasons behind the superiority of machine learning in the relevant literature, machine learning algorithms that have been deployed, input data, concerned outputs, as well as the general trends in the subject area. [ABSTRACT FROM AUTHOR]

The KNN algorithm is one of the most famous algorithms in machine learning and data mining. It does not preprocess the data before classification, which leads to longer time and more errors. To solve the problems, this paper first proposes a PK-means++ algorithm, which can better ensure the stability of a random experiment. Then, based on it and spherical region division, an improved KNNPK+ is proposed. The algorithm can select the center of the spherical region appropriately and then construct an initial classifier for the training set to improve the accuracy and time of classification. [ABSTRACT FROM AUTHOR]

Data Mining plays a decisive role especially in medical domain. Decision trees are predominant model in machine learning. Decision trees are simple and very effective classification approach. The decision tree identifies the utmost prime features of a given problem. One of the most common disease in India is Liver Cirrhosis. It is distinctly difficult to uncover Liver Cirrhosis in its initial stage. However early diagnosis of Liver Cirrhosis is highly important. The liver disease data set has a collection of distinguishing features that affect the healthy state of a patient. Machine Learning methods enable knowledge acquisition in early stages and use of this acquired knowledge plays an important role in solving problems like suppose if we want to predict whether the patient with the Liver Cirrhosis has also been suffering from Hepatitis C or not. In order to easily arrive at this knowledge certainly there is a need for fully integrated system. In this paper the collected Liver disease data set is analyzed and prognosticated whether the patient is suffering from liver cirrhosis or not. [ABSTRACT FROM AUTHOR]

During the big data era, there is a continuous occurrence of developing the learning of imbalanced data gives a pathway for the research field along with data mining and machine learning concepts. In recent years, Big Data and Big Data Analytics having high eminence due to data exploration by many of the applications in real-time. Using machine learning will be a greater solution to solve the difficulties that occur when we learn the imbalanced data. Many real-world applications have to predict the solutions for highly imbalanced datasets with the imbalanced target variable. In most of the cases, the target variable assigns or having the least occurrences of the target values due to the sort of imbalances associated with things or events strongly applicable for the users who avail the solutions (for example, results of stock changes, fraud finding, network security, etc.). The expansion of the availability of data due to the rise of big data from the network systems such as security, internet transactions, finance manipulations, surveillance of CCTV or other devices makes the chance to the critical study of insufficient knowledge from the imbalance data when supporting the decision making processes. The data imbalance occurrence is a challenge to the research field. In recent trends, there is more data level and an algorithm level method is being upgraded constantly and leads to develop a new hybrid framework to solve this problem in classification. Classifying the imbalanced data is a challenging task in the field of big data analytics. This study mainly concentrates on the problem existing in most cases of real-world applications as an imbalance occurs in the data. This difficulty present due to the data distribution with skewed nature. We have analyses the data imbalance and find the solution. This paper concentrates mainly on finding a better solution to this nature of the problem to be solved with the proposed framework using a hybrid ensemble classifier based on the Binary Cross-Entropy method as loss function along with the Gradient Boost Algorithm. [ABSTRACT FROM AUTHOR]

Feature selection is one of the most important tasks in many machine learning and data mining problems. Due to the increasing size of the problems, removing useless, erroneous or noisy features is frequently an initial step that is performed before other data mining algorithms are applied. The aim is to reproduce, or even improve, the performance of the data mining algorithm when all the features are used. Furthermore, the selection of the most relevant features may offer the expert valuable information about the problem to be solved. Over the past few decades, many different feature selection algorithms have been proposed, each with its own strengths and weaknesses. However, as in the case of classification, it is unlikely that a single feature selection algorithm would be able to achieve good results across many different datasets and application fields. Furthermore, when we are dealing with thousands of features, the most powerful feature selection methods are frequently too time consuming to be applied. In classification, one of the most successful ways of consistently improving the performance of a single weak learner is to construct ensembles using boosting methods. In this paper, we propose a general framework for feature selection boosting in the same way boosting is applied to classification. The proposed approach opens a new field of research in which to apply the many techniques developed for boosting classifiers. Using 120 datasets, the experiments reported show a clear improvement in several state-of-the-art feature selection algorithms using the proposed methodology. [ABSTRACT FROM AUTHOR]

A trouble ticket is an important information carrier in system maintenance, which records problem symptoms, the resolving process, and resolutions. A critical challenge for the ticket management system is how to quickly assign a proper expert to deal with trouble tickets and fix problems. Thousands of tickets bouncing among multiple experts before being fixed will consume limited system maintenance resources and may also violate the service level agreement (SLA). Thus, for an incoming ticket, an expert should be recommended as quickly as possible in order to reduce the processing delay. In this paper, to address the challenge in the expert assignment, we exploit an expert collaboration network model by combining expertise profiles and social profiles learned from problem descriptions and resolution sequences of the historical resolved tickets, and develop several two-stage expert recommendation algorithms to determine a resolver to solve the problem. To evaluate the effectiveness of expert recommendation algorithms, we conduct extensive experiments on a real ticket data set. The experimental results show that the proposed algorithms can effectively shorten the mean number of steps to resolve (MSTR) with a high recommendation precision, especially for the long routing sequences generated from manual assignments. The proposed model and algorithms have the potential of being used in a ticket routing recommendation engine to greatly reduce human intervention in the routing process. [ABSTRACT FROM AUTHOR]

Semi-supervised data classification is one of significant field of study in machine learning and data mining since it deals with datasets which consists both a few labeled and many unlabeled data. The researchers have interest in this field because in real life most of the datasets have this feature. In this paper we suggest a collective method for solving semi-supervised data classification problems. Examples in R1 presented and solved to gain a clear understanding. For comparison between state of art methods, well-known machine learning tool WEKA is used. Experiments are made on real-world datasets provided in UCI dataset repository. Results are shown in tables in terms of testing accuracies by use of ten fold cross validation. [ABSTRACT FROM AUTHOR]

Solving real-world multi-objective optimization problems using Multi-Objective Optimization Algorithms becomes difficult when the number of objectives is high since the types of algorithms generally used to solve these problems are based on the concept of non-dominance, which ceases to work as the number of objectives grows. This problem is known as the curse of dimensionality. Simultaneously, the existence of many objectives, a characteristic of practical optimization problems, makes choosing a solution to the problem very difficult. Different approaches are being used in the literature to reduce the number of objectives required for optimization. This work aims to propose a machine learning methodology, designated by FS-OPA, to tackle this problem. The proposed methodology was assessed using DTLZ benchmarks problems suggested in the literature and compared with similar algorithms, showing a good performance. In the end, the methodology was applied to a difficult real problem in polymer processing, showing its effectiveness. The algorithm proposed has some advantages when compared with a similar algorithm in the literature based on machine learning (NL-MVU-PCA), namely, the possibility for establishing variable–variable and objective–variable relations (not only objective–objective), and the elimination of the need to define/chose a kernel neither to optimize algorithm parameters. The collaboration with the DM(s) allows for the obtainment of explainable solutions. [ABSTRACT FROM AUTHOR]

Imbalanced learning is important and challenging since the problem of the classification of imbalanced datasets is prevalent in machine learning and data mining fields. Sampling approaches are proposed to address this issue, and cluster-based oversampling methods have shown great potential as they aim to simultaneously tackle between-class and within-class imbalance issues. However, all existing clustering methods are based on a one-time approach. Due to the lack of a priori knowledge, improper setting of the number of clusters often exists, which leads to poor clustering performance. Besides, the existing methods are likely to generate noisy instances. To solve these problems, this paper proposes a deep instance envelope network-based imbalanced learning algorithm with the multilayer fuzzy c-means (MlFCM) and a minimum interlayer discrepancy mechanism based on the maximum mean discrepancy (MIDMD). This algorithm can guarantee high quality balanced instances using a deep instance envelope network in the absence of prior knowledge. First, the MlFCM is designed for the original minority class instances to obtain deep instances and increase the diversity of instances. Then, the MIDMD is proposed to avoid the generation of noisy instances and maintain the consistency of the interlayers of instances. Next, the multilayer FCM and minimum interlayer discrepancy mechanism are combined to construct a deep instance envelope network – the MlFC&IDMD. Finally, an imbalance learning algorithm is proposed based on the MlFC&IDMD. In the experimental section, thirty-three popular public datasets are used for verification, and over ten representative algorithms are used for comparison. The experimental results show that the proposed approach significantly outperforms other popular methods. • For the first time, a multilayer FCM (MlFCM) algorithm for classification is proposed to mine the instances for more information. • A minimum interlayer discrepancy mechanism (MIDMD) is proposed to make the distribution of instances before and after clustering consistent. • A deep instance envelope network (MlFC&IDMD) is constructed by combining the MlFCM and MIDMD. • An efficient strategy is proposed to determine the number of layers L of the deep instance envelope network. • A new imbalance learning algorithm is proposed based on the MlFC&IDMD. [ABSTRACT FROM AUTHOR]

Online social media have aroused much research interest in recent years. In contrast to previous work that focused on the detection of emerging topics, this article undertakes the prediction of active users in online social events, which is so far rarely explored. This prediction task is formulated as a binary classification problem that built on real-world tweet streams, taking Ferguson event and New York Chockhold event as examples. Then, a comprehensive user feature system is designed to characterize the events’ online participants, which includes not only basic statistical characteristics and image-pixel-level features, but also some emotional features and personality features. Next, the Weighted Random Forest (Weighted-RF) classifier is adopted to solve the classification problem. Based on the user feature system and the classifier, the experience of a previous event can be archived and applied to the prediction of later similar events. Experimental results show that the Weighted-RF trained by samples of Ferguson event can effectively predict active users in NYC event, with an AUC value around 0.8392. Besides, the image-content based personality model provides a new tool for depicting user portraits, which further contributes to the quantitative analysis of online social events. [ABSTRACT FROM AUTHOR]

Abstract: It is a very interesting topic to forecast the movement direction of financial time series by machine learning methods. Among these machine learning methods, support vector machine (SVM) is the most effective and intelligent one. A new learning model is presented in this paper, called the polynomial smooth support vector machine (PSSVM). After being solved by Broyden–Fletcher–Goldfarb–Shanno (BFGS) method, optimal forecasting parameters are obtained. The exchange rate movement direction of RMB (Chinese renminbi) vs USD (United States Dollars) is investigated. Six indexes of Dow Jones China Index Series are used as the input. 4 sections with 180 time experiments have been completed. Many results show that the proposed learning model is effective and powerful. [Copyright &y& Elsevier]

Abstract: Clustering is a method of unsupervised learning, and a common technique for intelligent data analysis used in many fields. The enlarging volumes of information produced by the progress of technology, makes clustering of very large scale data a challenging task. Therefore, parallel processing of very large scale data set is a good solution to that problem. CLARANS is approved to be an efficient and effective clustering method for spatial data mining. It is insensitive to outliers and has the advantage of processing category data directly compared to other partition method like K-means. However, it is a serial algorithm and cannot process large scale data set efficiently. In this paper, we propose a parallel CLARANS clustering algorithm based on MapReduce, which is a current and powerful parallel programming framework. Experimental results demonstrate that the parallel CLARANS algorithm can handle large scale data set efficiently and effectively. Furthermore, the evaluation criterions of scaleup, speedup and sizeup validate its efficiency. [Copyright &y& Elsevier]

Abstract: This paper introduces a multi-objective grammar based genetic programming algorithm, MOG3P-MI, to solve a Web Mining problem from the perspective of multiple instance learning. This algorithm is evaluated and compared to other algorithms that were previously used to solve this problem. Computational experiments show that the MOG3P-MI algorithm obtains the best results, adds comprehensibility and clarity to the knowledge discovery process and overcomes the main drawbacks of previous techniques obtaining solutions which maintain a balance between conflicting measurements like sensitivity and specificity. [ABSTRACT FROM AUTHOR]

We survey the progress in data mining methods for spacecraft health monitoring. The main emphasis is placed on the analysis of telemetry data enabling the identification of spacecraft states that are atypical during normal operation and the prediction of possible failures in the operation of the spacecraft or its components. The main stages required for the creation of general-purpose spacecraft state monitoring systems are considered; methods for detecting anomalies in telemetry data taking into account the specific features of the spacecraft are presented in detail; and publications on this topic known to the authors are analyzed. Examples of the implementation of such systems in flight control centers of various countries are given. The promising areas of development of methods for analyzing the technical state of complex systems relevant for solving problems in space technology are discussed, and the main factors that hinder the development of machine learning methods for analyzing telemetry data are noted. [ABSTRACT FROM AUTHOR]

Background: Implementation research has delved into barriers to implementing change and interventions for the implementation of innovation in practice. There remains a gap, however, that fails to connect implementation barriers to the most effective implementation strategies and provide a more tailored approach during implementation. This study aimed to explore barriers for the implementation of professional services in community pharmacies and to predict the effectiveness of facilitation strategies to overcome implementation barriers using machine learning techniques.Methods: Six change facilitators facilitated a 2-year change programme aimed at implementing professional services across community pharmacies in Australia. A mixed methods approach was used where barriers were identified by change facilitators during the implementation study. Change facilitators trialled and recorded tailored facilitation strategies delivered to overcome identified barriers. Barriers were coded according to implementation factors derived from the Consolidated Framework for Implementation Research and the Theoretical Domains Framework. Tailored facilitation strategies were coded into 16 facilitation categories. To predict the effectiveness of these strategies, data mining with random forest was used to provide the highest level of accuracy. A predictive resolution percentage was established for each implementation strategy in relation to the barriers that were resolved by that particular strategy.Results: During the 2-year programme, 1131 barriers and facilitation strategies were recorded by change facilitators. The most frequently identified barriers were a 'lack of ability to plan for change', 'lack of internal supporters for the change', 'lack of knowledge and experience', 'lack of monitoring and feedback', 'lack of individual alignment with the change', 'undefined change objectives', 'lack of objective feedback' and 'lack of time'. The random forest algorithm used was able to provide 96.9% prediction accuracy. The strategy category with the highest predicted resolution rate across the most number of implementation barriers was 'to empower stakeholders to develop objectives and solve problems'.Conclusions: Results from this study have provided a better understanding of implementation barriers in community pharmacy and how data-driven approaches can be used to predict the effectiveness of facilitation strategies to overcome implementation barriers. Tailored facilitation strategies such as these can increase the rate of real-time implementation of innovations in healthcare, leading to an industry that can confidently and efficiently adapt to continuous change. [ABSTRACT FROM AUTHOR]

Approximate Nearest Neighbor Search (ANNS) is a fundamental problem in many areas of machine learning and data mining. During the past decade, numerous hashing algorithms are proposed to solve this problem. Every proposed algorithm claims to outperform Locality Sensitive Hashing (LSH), which is the most popular hashing method. However, the evaluation of these hashing article was not thorough enough, and the claim should be re-examined. If implemented correctly, almost all the hashing methods will have their performance improved as the code length increases. However, many existing hashing article only report the performance with the code length shorter than 128. In this article, we carefully revisit the problem of search-with-a-hash-index and analyze the pros and cons of two popular hash index search procedures. Then we proposed a simple but effective novel hash index search approach and made a thorough comparison of eleven popular hashing algorithms. Surprisingly, the random-projection-based Locality Sensitive Hashing ranked the first, which is in contradiction to the claims in all the other 10 hashing article. Despite the extreme simplicity of random-projection-based LSH, our results show that the capability of this algorithm has been far underestimated. For the sake of reproducibility, all the codes used in the article are released on GitHub, which can be used as a testing platform for a fair comparison between various hashing algorithms. [ABSTRACT FROM AUTHOR]

Motorway's personnel tasks management and incidents monitoring, and response are critical processes that contribute to the motorway's orderly and smooth operation. Existing management practices utilize SCADA technologies that control motorway actuator systems as well as various means of personnel communications mobile technologies. Nevertheless, contemporary motorways lack a unified incident response solution that tracks resources, sends notification alerts when necessary, and automates incident resolution. This paper presents a new holistic and unified management and response system called Resources Management System (RMS). This system was originally implemented as a generic motorways resources management system for the EGNATIA ODOS motorway that uses it in Greece. The implemented RMS provides real-time resources tracking, personnel utilization algorithms, and data mining capabilities towards incident confrontation. It operates as an incidents' collection and resources central communication interface. It is also capable of incident response and completion time categorization; real-time tunnel exits sensory monitoring, staff mobilization, and tracking system. Furthermore, the RMS includes machine learning methodologies and smart agents (bots) for solving the problem of estimating and evaluating the response and completion time of incidents based on previous successful incidents' confrontations. [ABSTRACT FROM AUTHOR]

Diabetes is one of the most common diseases worldwide. Many Machine Learning (ML) techniques have been utilized in predicting diabetes in the last couple of years. The increasing complexity of this problem has inspired researchers to explore the robust set of Deep Learning (DL) algorithms. The highest accuracy achieved so far was 95.1% by a combined model CNN-LSTM. Even though numerous ML algorithms were used in solving this problem, there are a set of classifiers that are rarely used or even not used at all in this problem, so it is of interest to determine the performance of these classifiers in predicting diabetes. Moreover, there is no recent survey that has reviewed and compared the performance of all the proposed ML and DL techniques in addition to combined models. This article surveyed all the ML and DL techniques-based diabetes predictions published in the last six years. In addition, one study was developed that aimed to implement those rarely and not used ML classifiers on the Pima Indian Dataset to analyze their performance. The classifiers obtained an accuracy of 68%–74%. The recommendation is to use these classifiers in diabetes prediction and enhance them by developing combined models. [ABSTRACT FROM AUTHOR]

We have developed a new methodology for examining and extracting patterns from brain electric activity by using data mining and machine learning techniques. Data was collected from experiments focused on the study of cognitive processes that might evoke different specific strategies in the resolution of math problems. A binary classification problem was constructed using correlations and phase synchronization between different electroencephalographic channels as characteristics and, as labels or classes, the math performances of individuals participating in specially designed experiments. The proposed methodology is based on using well-established procedures of feature selection, which were used to determine a suitable brain functional network size related to math problem solving strategies and also to discover the most relevant links in this network without including noisy connections or excluding significant connections. [ABSTRACT FROM AUTHOR]

Since most classifiers are biased toward the dominant class, class imbalance is a challenging problem in machine learning. The most popular approaches to solving this problem include oversampling minority examples and undersampling majority examples. Oversampling may increase the probability of overfitting, whereas undersampling eliminates examples that may be crucial to the learning process. We present a linear time resampling method based on random data partitioning and a majority voting rule to address both concerns, where an imbalanced dataset is partitioned into a number of small subdatasets, each of which must be class balanced. After that, a specific classifier is trained for each subdataset, and the final classification result is established by applying the majority voting rule to the results of all of the trained models. We compared the performance of the proposed method to some of the most well-known oversampling and undersampling methods, employing a range of classifiers, on 33 benchmark machine learning class-imbalanced datasets. The classification results produced by the classifiers employed on the generated data by the proposed method were comparable to most of the resampling methods tested, with the exception of SMOTEFUNA, which is an oversampling method that increases the probability of overfitting. The proposed method produced results that were comparable to the Easy Ensemble (EE) undersampling method. As a result, for solving the challenge of machine learning from class-imbalanced datasets, we advocate using either EE or our method. [ABSTRACT FROM AUTHOR]

The NP-hard maximum monomial agreement problem consists of finding a single logical conjunction that is most consistent with or "best fits" a weighted data set of "positive" and "negative" binary vectors. Computing weighted voting classifiers using boosting methods involves a maximum agreement subproblem at each iteration, although such subproblems are typically solved in practice by heuristic methods. Here, we describe an exact branch-and-bound method for maximum agreement over Boolean monomials, improving on the earlier work of Goldberg and Shan [Goldberg, N., C. Shan. 2007. Boosting optimal logical patterns. Proc. 7th SIAM Internat. Conf. Data Mining, SIAM, Philadelphia, 228-236]. Specifically, we develop a tighter upper bounding function and an improved branching procedure that exploits knowledge of the bound and the particular data set, while having a lower branching factor. Experimental results show that the new method is able to solve larger problem instances and runs faster within a linear programming boosting procedure applied to medium-sized data sets from the UCI Machine Learning Repository. The new algorithm also runs much faster than applying a commercial mixed-integer programming solver, which uses linear programming relaxation-based bounds, to an integer linear programming formulation of the problem. [ABSTRACT FROM AUTHOR]

Machine learning techniques have been used to develop many regression models to make predictions based on experience and historical data. They might be used singly or in ensembles. Single models are either classification or regression models that use one technique, while ensemble models combine various single models. To construct or find the best model is very complex and time-consuming, so this study develops a new platform, called intelligent Machine Learner (iML), to automatically build popular models and identify the best one. The iML platform is benchmarked with WEKA by analyzing publicly available datasets. After that, four industrial experiments are conducted to evaluate the performance of iML. In all cases, the best models determined by iML are superior to prior studies in terms of accuracy and computation time. Thus, the iML is a powerful and efficient tool for solving regression problems in engineering informatics. [ABSTRACT FROM AUTHOR]