Search

Business operations have entered the digital era in which artificial intelligence (AI), machine learning (ML) and blockchain (BKC) have emerged as major disruptive forces. In AI and ML, deep learning is a critical area. In this paper, we aim to investigate how deep learning and BKC together can help improve business operations. We first examine the operations research (OR) literature related to the applications of deep learning for business operations. Then, we discuss the prior studies on using BKC for operations. After that, we explore deep learning's applications for BKC, BKC's applications for deep learning as well as how deep learning and BKC have been used together for business operations. Then, we construct a research framework and propose future research directions. [ABSTRACT FROM AUTHOR]

The paper examines whether the structure of the risk factor disclosure in an IPO prospectus helps explain the cross-section of first-day returns in a sample of Chinese initial public offerings. This paper analyzes the semantics and content of risk disclosure based on an unsupervised machine learning algorithm. From both long-term and short-term perspectives, this paper explores how the information effect and risk effect of risk disclosure play their respective roles. The results show that risk disclosure has a stronger risk effect at the semantic novelty level and a more substantial information effect at the risk content level. A novel aspect of the paper lies in the use of text analysis (semantic novelty and content richness) to characterize the structure of the risk factor disclosure. The study shows that initial IPO returns negatively correlate with semantic novelty and content richness. We show the interaction between risk effect and information effect on risk disclosure under the nature of the same stock plate. When enterprise information transparency is low, the impact of semantic novelty and content richness on the IPO market is respectively enhanced. [ABSTRACT FROM AUTHOR]

Understanding the data and reaching accurate conclusions are of paramount importance in the present era of big data. Machine learning and probability theory methods have been widely used for this purpose in various fields. One critically important yet less explored aspect is capturing and analyzing uncertainties in the data and model. Proper quantification of uncertainty helps to provide valuable information to obtain accurate diagnosis. This paper reviewed related studies conducted in the last 30 years (from 1991 to 2020) in handling uncertainties in medical data using probability theory and machine learning techniques. Medical data is more prone to uncertainty due to the presence of noise in the data. So, it is very important to have clean medical data without any noise to get accurate diagnosis. The sources of noise in the medical data need to be known to address this issue. Based on the medical data obtained by the physician, diagnosis of disease, and treatment plan are prescribed. Hence, the uncertainty is growing in healthcare and there is limited knowledge to address these problems. Our findings indicate that there are few challenges to be addressed in handling the uncertainty in medical raw data and new models. In this work, we have summarized various methods employed to overcome this problem. Nowadays, various novel deep learning techniques have been proposed to deal with such uncertainties and improve the performance in decision making. [ABSTRACT FROM AUTHOR]

Rating prediction is a crucial element of business analytics as it enables decision-makers to assess service performance based on expressive customer feedback. Enhancing rating score predictions and demand forecasting through incorporating performance features from verbatim text fields, particularly in service quality measurement and customer satisfaction modelling is a key objective in various areas of analytics. A range of methods has been identified in the literature for improving the predictability of customer feedback, including simple bag-of-words-based approaches and advanced supervised machine learning models, which are designed to work with response variables such as Likert-based rating scores. This paper presents a dynamic model that incorporates values from topic membership, an outcome variable from Latent Dirichlet Allocation, with sentiment analysis in an Extreme Gradient Boosting (XGBoost) model used for rating prediction. The results show that, by incorporating features from simple unsupervised machine learning approaches (LDA-based), an 86% prediction accuracy (AUC based) can be achieved on objective rating values. At the same time, a combination of polarity and single-topic membership can yield an even higher accuracy when compared with sentiment text detection tasks both at the document and sentence levels. This study carries significant practical implications since sentiment analysis tasks often require dictionary coverage and domain-specific adjustments depending on the task at hand. To further investigate this result, we used Shapley Additive Values to determine the additive predictability of topic membership values in combination with sentiment-based methods using a dataset of customer reviews from food delivery services. [ABSTRACT FROM AUTHOR]

Project risk management which has been rarely considered, especially in software projects, is a crucial process to complete projects successfully. This paper aims to propose a novel project risk management framework both to evaluate the project risks and to predict the success or failure of software projects based on their risk. This new framework uses Machine Learning (ML) and Multi-Attribute Decision-Making under a cloud model to effectively manage uncertainty. Based on the proposed framework, in the first stage, the important risks of the software projects are identified by an organized approach. Then, the risks are evaluated based on their probability and impacts on time, cost, and quality. In the second stage, the obtained results of the previous stage are entered into a new COPRAS method under the cloud model to rank the risks. Then, the risks are classified into various groups according to their rank. It helps project managers to gain a profound awareness of their high-priority project risks. In this paper, data on risks for fifty software projects has been collected. All the steps of the second stage are implemented on these projects in order to assess their risks. As a result, a data set whose features are nine types of software project risks and the label of success or failure of the projects is created. To recognize the pattern between risks' values and the success or failure of the projects, various efficient ML algorithms such as Naive Bayes, Logistic regression, Decision Tree, Bagging, Random Forest, and AdaBoost are applied. This framework can predict the success or failure of software projects based on their risks with good accuracy. The results depict that the Naive Bayes algorithm has the best results compared to others. [ABSTRACT FROM AUTHOR]

We carry on a long term analysis for Bitcoin price, which is currently among the most renowned crypto assets available on markets other than Forex. In the last decade Bitcoin has been under spotlights among traders all world wide, both because of its nature of pseudo–currency and for the high volatility its price has frequently experienced. Considering that Bitcoin price has earned over five orders of magnitude since 2009, the interest of investors has been increasingly motivated by the necessity of accurately predicting its value, not to mention that a comparative analysis with other assets as silver and gold has been under investigation, too. This paper reports two approaches for a long term Bitcoin price prediction. The first one follows more standard paradigms from regression and least squares frameworks. Our main contribution in this regard fosters conclusions which are able to justify the cyclic performance of Bitcoin price, in terms of its Stock–to–Flow. Our second approach is definitely novel in the literature, and indicates guidelines for long term forecasts of Bitcoin price based on Machine Learning (ML) methods, with a specific reference to Support Vector Machines (SVMs). Both these approaches are inherently data–driven, and the second one does not require any of the assumptions typically needed by solvers for classic regression problems. [ABSTRACT FROM AUTHOR]

Monte-Carlo based valuation in life insurance involves the simulation of various components of the balance sheet: portfolios, guarantees, assets mix, market conditions and many other specific risk factors; which can be time-consuming. In view of the time needed to achieve this task, insurers are then facing a trade-off of balancing the number of simulations against the uncertainty surrounding the estimated quantity. In the current paper, we propose a variance-reduction methodology using a machine learning technique. It roots from the unsupervised learning literature in conjunction with the quantization of random processes. The goal is to reduce the number of simulated Brownian paths, using auxiliary scenarios that can be seen as path clusters, which efficiently and accurately approximate the initial ones with regards to an adequate measure of distance. Moreover, we introduce penalty to accommodate for various inputs of the initial conditions of risk factors. By doing so, we implicitly assign labels to the scenarios and thus advocate using a semi-supervised learning to enhance the performance of the scenarios reduction by imposing an additional impurity condition on the clusters based on these labels. This is made possible thanks to a decomposition property of the insurers cash-flows, which allows to disentangle the initial conditions of risk factors from the Brownian motions driving their dynamics. The training of the proposed learning algorithm is based on an adaptation of the well-known k-means algorithm. An intensive numerical study is carried out over a range of simulation setups to compare the performances of the proposed methodology. We show, numerically, that the proposed methodology outperforms some classical variance reduction approach. Also, using a real-life dataset, we show that our methodology outperforms some conventional variance reduction used by life insurance practitioners. [ABSTRACT FROM AUTHOR]

Financial institutions, investors, mining companies and related firms need an effective accurate forecasting model to examine gold price fluctuations in order to make correct decisions. This paper proposes an innovative approach to accurately forecast gold price movements and to interpret predictions. First, it compares six machine learning models. These models include two very recent methods: the eXtreme Gradient Boosting (XGBoost) and CatBoost. The empirical findings indicate the superiority of XGBoost over other advanced machine learning models. Second, it proposes Shapley additive explanations (SHAP) in order to help policy makers to interpret the predictions of complex machine learning models and to examine the importance of various features that affect gold prices. Our results illustrate that the utilization of XGBoost along with SHAP approach could provide a significant boost in increasing the gold price forecasting performance. [ABSTRACT FROM AUTHOR]

Payment cards offer a simple and convenient method for making purchases. Owing to the increase in the usage of payment cards, especially in online purchases, fraud cases are on the rise. The rise creates financial risk and uncertainty, as in the commercial sector, it incurs billions of losses each year. However, real transaction records that can facilitate the development of effective predictive models for fraud detection are difficult to obtain, mainly because of issues related to confidentially of customer information. In this paper, we apply a total of 13 statistical and machine learning models for payment card fraud detection using both publicly available and real transaction records. The results from both original features and aggregated features are analyzed and compared. A statistical hypothesis test is conducted to evaluate whether the aggregated features identified by a genetic algorithm can offer a better discriminative power, as compared with the original features, in fraud detection. The outcomes positively ascertain the effectiveness of using aggregated features for undertaking real-world payment card fraud detection problems. [ABSTRACT FROM AUTHOR]

As the only largest source of revenue and cost in a hospital, the operation room (OR) scheduling problem is a hot research topic. Nonetheless, an integrated model is the missing key to managing and improving the efficiency of ORs. This paper presents a fully integrated model regarding three concepts: meditating elective patients and emergency patients together, considering ORs and downstream units, and proposing hierarchical weekly, daily, and rescheduling models. Due to the inherent randomness in emergency patient arrival, a random forest machine learning model and geographical information systems are used to obtain the emergency patient surgery duration and arrival time, respectively. According to the machine learning model in weekly and daily scheduling, initially, fixed capacity is reserved for emergency patients. When an emergency patient arrives, the surgery starts if a reserved OR is available. Otherwise, the first available OR will be dedicated to the patient due to an emergency patient's higher priority than an elective patient. In this case, it is needed to reschedule the OT schedule for the remaining patient. Moreover, the three-phase model guarantees that an emergency patient assigns to an OR within a specific time limit. To solve the models, genetic algorithm and particle swarm optimization are developed and compared. In addition, a real-world case study is undertaken at a hospital. The results of comparing the proposed approach to the hospital's current scheduling show that the three-phase model had a considerable positive effect on the ORs schedule. [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]

In the aftermath of the global financial crisis and ongoing COVID-19 pandemic, investors face challenges in understanding price dynamics across assets. This paper explores the performance of the various type of machine learning algorithms (MLAs) to predict mid-price movement for Bitcoin futures prices. We use high-frequency intraday data to evaluate the relative forecasting performances across various time frequencies, ranging between 5 and 60-min. Our findings show that the average classification accuracy for five out of the six MLAs is consistently above the 50% threshold, indicating that MLAs outperform benchmark models such as ARIMA and random walk in forecasting Bitcoin futures prices. This highlights the importance and relevance of MLAs to produce accurate forecasts for bitcoin futures prices during the COVID-19 turmoil. [ABSTRACT FROM AUTHOR]

This study utilizes classification models to provide a robust algorithm for imbalanced data where the minority class is of the interest, that is, in the context of default payments. In developing an integrated predictive accuracy algorithm, this study proposes machine learning classifiers and applies DNN, SVM, KNN, and ANN. The proposed algorithm utilizes a 30,000 imbalanced dataset to improve the accuracy of the prediction of default payments by implementing oversampling and undersampling strategies, such as synthetic minority oversampling technique (SMOTE), SVM SMOTE, random undersampling, and ALL-KNN. The results indicate that the SVM under the ALL-KNN sampling technique is able to achieve an accuracy of 98.6%, with the lowest cross entropy loss measurement of 0.028. Through the accurate implementation of the neural networks and neurons used in the proposed algorithm, this paper presents better insights into the functioning of the neural networks when used in conjunction with the resampling techniques. Using the methodology and algorithm presented in this study, credit risk assessments can be more accurately predicted in practical applications where most of the clients are categorized as non-default payments. [ABSTRACT FROM AUTHOR]

This paper studies continuous-time models for newsvendor problems with dynamic replenishment, financial hedging and Stackelberg competition. These factors are considered simultaneously and the high-dimensional stochastic control models are established. High-dimensional Hamilton-Jacobi-Bellman (HJB) equations are derived for the value functions. To circumvent the curse of dimensionality, a deep learning algorithm is proposed to solve the HJB equations. A projection is introduced in the algorithm to avoid the gradient explosion during the training phase. The deep learning algorithm is implemented for HJB equations derived from the newsvendor models with dimensions up to six. Numerical outcomes validate the algorithm's accuracy and demonstrate that the high-dimensional stochastic control models can successfully mitigate the risk. [ABSTRACT FROM AUTHOR]

It is standard cardiology practice for patients suffering from ventricular arrhythmias (the main cause of sudden cardiac death) belonging to high risk populations to be treated via the implantation of Subcutaneous Implantable cardioverter-defibrillators (S-ICDs). S-ICDs carry a risk of so-called T wave over sensing (TWOS), which can lead to inappropriate shocks that carry an inherent health risk. For this reason, according to current practice patients' Electrocardiograms (ECGs) are manually screened by a cardiologist over 10 s to assess the T:R ratio—the ratio between the amplitudes of the T and R waves which is used as a marker for the likelihood of TWOS—with a plastic template. Unfortunately, the temporal variability of a patient' T:R ratio can render such a screening procedure, which relies on an inevitably short ECG segment due to its manual nature, unreliable. In this paper, we propose and investigate a tool based on deep learning for the automatic prediction of the T:R ratios from multiple 10-second segments of ECG recordings capable of carrying out a 24-hour automated screening. Thanks to the significantly increased screening window, such a screening would provide far more reliable T:R ratio predictions than the currently utilized 10-second, template-based, manual screening is capable of. Our tool is the first, to the best of our knowledge, to fully automate such an otherwise manual and potentially inaccurate procedure. From a methodological perspective, we evaluate different deep learning model architectures for our tool, assess a range of stochastic-gradient-descent-based optimization methods for training their underlying deep-learning model, perform hyperparameter tuning, and create ensembles of the best performing models in order to identify which combination leads to the best performance. We find that the resulting model, which has been integrated into a prototypical tool for use by clinicians, is able to predict T:R ratios with very high accuracy. Thanks to this, our automated T:R ratio detection tool will enable clinicians to provide a completely automated assessment of whether a patient is eligible for S-ICD implantation which is more reliable than current practice thanks to adopting a significantly longer ECG screening window which better and more accurately captures the behavior of the patient's T:R ratio than the current manual practice. [ABSTRACT FROM AUTHOR]

Gastric Cancer is the most common malignancy of the digestive tract, which is the third leading cause of cancer-related mortality worldwide. The early prognosis methods, especially Machine Learning (ML)-based approaches are one of the main strategies against GC, which have become a necessity to identify and prognosticate the factors that affect the GC. They enable the specialists to accelerate the subsequent clinical management of patients, who suffer from the GC. This paper aims at creating an Ensemble Method inspired from ML to predict the most significant factors of the GC occurrence. The main objective of this research is to predict the probabilities of the GC occurrence and its associated deaths. To achieve this goal, the created EM benefits from some ML-based methods, including Least Absolute Shrinkage and Selection Operator (LASSO)/Ridge Regression, Elastic Net, Logistic Regression (LR), Random Forest (RF), Gradient Boosting Decision Trees (GBDTs), and Deep Neural Network (DNN). The purpose of the provided EM is to lessen the prediction errors for the large number of the patients' features. The main novelties of this research include: (i) A sequential EM created by a Stacking method to predict the probability of the GC and associated deaths; (ii) Benefiting from the significance level to make an accurate prediction; (iii) Employing two Chi-square tests to select the influent features; (iv) Tuning the parameters of the applied ML models to avoid over-fitting and intensifying the errors; (v) Applying different kinds of the regression methods to treat hyper-dimension cases; (vi) A new model for weighting the applied ML models. The outcomes of the implementation of the created EM in seven pioneer hospitals in the field of GC show that the designed EM generates more precise predictions with an accuracy of 97.9% and 76.3% to predict the GC and its associated deaths, respectively. Moreover, the obtained results from the Area Under Curve (AUC) validates and confirms the capability of the created EM to predict the probability of the GC and its related deaths with an accuracy of 98% and 90% to predict the GC and its associated deaths, respectively. [ABSTRACT FROM AUTHOR]

In recent decades, breast cancer has become one of the leading causes of mortality among women. This disease is not preventable because of its unknown causes; however, its early diagnosis increases patients' recovery chances. Machine learning (ML) can be utilized to improve treatment outcomes in healthcare operations while diminishing costs and time. In this research, we suggest two novel feature selection (FS) methods based upon an imperialist competitive algorithm (ICA) and a bat algorithm (BA) and their combination with ML algorithms. This study aims to enhance diagnostic models' efficiency and present a comprehensive analysis to help clinical physicians make more precise and reliable decisions. K-nearest neighbors (KNN), support vector machine (SVM), decision tree (DT), Naive Bayes, AdaBoost (AB), linear discriminant analysis (LDA), random forest (RF), logistic regression (LR), and artificial neural network (ANN) are some of the methods employed. Sensitivity, accuracy, precision, mean absolute error F-score, root mean square error, Kappa, and relative absolute error calculated the performance of the methods. This paper applied a distinctive integration of evaluation measures and ML algorithms using the wrapper feature selection based on ICA (WFSIC) and BA (WFSB) separately. We compared two proposed approaches for the performance of the classifiers. Also, we compared our best diagnostic model with previous works reported in the literature survey. Experimentations were performed on the Wisconsin diagnostic breast cancer (WDBC) dataset. Results reveal that the proposed framework that uses the BA with an accuracy of 99.12% surpasses the framework using the ICA and most previous works. Additionally, the RF classifier in the approach of FS based on BA emerges as the best model and outperforms others regarding its criteria. Besides, the results illustrate the role of our techniques in reducing the dataset dimensions up to 90% and increasing the performance of diagnostic models by over 99%. Moreover, the result demonstrates that there are more critical features than the optimum dataset obtained by proposed FS approaches that have been selected by most ML models, including the standard error of area, concavity, smoothness, perimeter, the worst of texture, compactness, radius, symmetry, smoothness, concavity, and the mean of concave points, fractal dimension, compactness, concavity that can remarkably affect the efficiency of breast cancer prediction. This study illustrates the role of our approaches in enhancing treatment outcomes in healthcare operations. [ABSTRACT FROM AUTHOR]

Optimization models typically seek to maximize overall benefit or minimize total cost. Yet fairness is an important element of many practical decisions, and it is much less obvious how to express it mathematically. We provide a critical survey of various schemes that have been proposed for formulating ethics-related criteria, including those that integrate efficiency and fairness concerns. The survey covers inequality measures, Rawlsian maximin and leximax criteria, convex combinations of fairness and efficiency, alpha fairness and proportional fairness (also known as the Nash bargaining solution), Kalai–Smorodinsky bargaining, and recently proposed utility-threshold and fairness-threshold schemes for combining utilitarian with maximin or leximax criteria. The paper also examines group parity metrics that are popular in machine learning. We present what appears to be the best practical approach to formulating each criterion in a linear, nonlinear, or mixed integer programming model. We also survey axiomatic and bargaining derivations of fairness criteria from the social choice literature while taking into account interpersonal comparability of utilities. Finally, we cite relevant philosophical and ethical literature where appropriate. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel hybrid model that extends prior work involving ensemble empirical mode decomposition (EEMD) by using fuzzy entropy and extreme learning machine (ELM) methods. We demonstrate this 3-stage model by applying it to forecast carbon futures prices which are characterized by chaos and complexity. First, we employ the EEMD method to decompose carbon futures prices into a couple of intrinsic mode functions (IMFs) and one residue. Second, the fuzzy entropy and K-means clustering methods are used to reconstruct the IMFs and the residue to obtain three reconstructed components, specifically a high frequency series, a low frequency series, and a trend series. Third, the ARMA model is implemented for the stationary high and low frequency series, while the extreme learning machine (ELM) model is utilized for the non-stationary trend series. Finally, all the component forecasts are aggregated to form final forecasts of the carbon price for each model. The empirical results show that the proposed reconstruction algorithm can bring more than 40% improvement in prediction accuracy compared to the traditional fine-to-coarse reconstruction algorithm under the same forecasting framework. The hybrid forecasting model proposed in this paper also well captures the direction of the price changes, with strong and robust forecasting ability, which is significantly better than the single forecasting models and the other hybrid forecasting models. [ABSTRACT FROM AUTHOR]

This paper aims to analyze the green efficiency performance of the logistics industry in China's 30 provinces from 2008 to 2017. We first evaluate the green efficiency of the logistics industry through the non-directional distance function method. Then, we use the functional clustering method funHDDC, which is one of the popular machine learning methods, to divide 30 provinces into 4 clusters and analyze the similarities and differences in green efficiency performance patterns among different groups. Further, we explore the driving factors of dynamic changes in green efficiency through the decomposition method. The main conclusions of this paper are as follows: (1) in general, the level of green efficiency is closely related to the geographical location. From the clustering results, we can find that most of the eastern regions belong to the cluster with higher green efficiency, while most of the western regions belong to the cluster with lower green efficiency. However, the green efficiency performance in several regions with high economic levels, such as Beijing and Shanghai, is not satisfactory. (2) Based on the analysis of decomposition results, the innovation effect of China's logistics industry is the most obvious, but the efficiency change still needs to be improved, and technical leadership should be strengthened. Based on these conclusions, we further propose some policy recommendations for the green development of the logistics industry in China. [ABSTRACT FROM AUTHOR]

An introduction is presented in which the editor discusses various reports published within the issue which include issues about supervised learning, the relevance of vector machine, and data mining methodology.

Fantasy Sports allows individuals to assemble a virtual team to participate in free or paid tournaments and earn rewards. Selecting a good team forms a crucial decision in fantasy cricket. Existing team selection methods cater only to professional cricket and are not suited well to accommodate the differences between fantasy cricket and the on-field game. This paper proposes a two-step methodology for player assessment and team selection in fantasy cricket. Player assessment is carried out using recursive feature elimination in random forest, in which context relevant player metrics are considered and the selection of players is based on modified genetic algorithm. We illustrate the efficacy of the proposed method on Dream11, a popular fantasy sports application. The results show that the proposed method outshines the traditional team selection process in fantasy sports, which is based on hit and trial. Furthermore, we provide a typology to analyse the proposed algorithm along the dimensions of reward distribution and entry fee. [ABSTRACT FROM AUTHOR]

This paper proposes tools for spatial performance analysis in basketball. In detail, we aim at representing maps of the court visualizing areas with different levels of scoring probability of the analysed player or team. To do that, we propose the adoption of algorithmic modeling techniques. Firstly, following previous studies, we examine CART, highlighting strengths and weaknesses. With respect to what done in the past, here we propose the use of polar coordinates, which are more consistent with the basketball court geometry. In order to overcome CART's drawbacks while maintaining its points of force, we propose to resort to CART-based ensemble learning algorithms, namely to Random Forest and Extremely Randomized Trees, which are shown to be able to give excellent results in terms of interpretation and robustness. Finally, an index is defined in order to measure the map's graphical goodness, which can be used—jointly with measures of the out-of-sample error—to tune the algorithm's parameters. The functioning of the proposed approaches is shown by the analysis of real data of the NBA regular season 2020/2021. [ABSTRACT FROM AUTHOR]

Financial risks associated with Fintech have been increasing with its significant growth in recent years. Aiming at addressing the problem of identifying risks in online lending investment under a financial technology platform, we develop a Q&A text risk recognition model based on attention mechanism and Bi-directional Long Short-Term Memory. First, the Q&A pairing on the text data set is carried out, and the matching data set is selected for the next analysis. Secondly, the online loan investment platform is assessed by the named entity recognition of the question text. Finally, the risk level of the corresponding investment platform is evaluated based on the answer text. The experimental results show that the proposed model has achieved improved precision, recall, F1-score, and accuracy compared with other models. Our proposed model can be applied to identify the risks from the text posted on online loan investment platforms and can be used to guide investors' investment and improve the management of financial technology platforms. [ABSTRACT FROM AUTHOR]

Support vector machines (SVM) is one of the well known supervised classes of learning algorithms. Basic SVM models are dealing with the situation where the exact values of the data points are known. This paper studies SVM when the data points are uncertain. With some properties known for the distributions, chance-constrained SVM is used to ensure the small probability of misclassification for the uncertain data. As infinite number of distributions could have the known properties, the robust chance-constrained SVM requires efficient transformations of the chance constraints to make the problem solvable. In this paper, robust chance-constrained SVM with second-order moment information is studied and we obtain equivalent semidefinite programming and second order cone programming reformulations. The geometric interpretation is presented and numerical experiments are conducted. Three types of estimation errors for mean and covariance information are studied in this paper and the corresponding formulations and techniques to handle these types of errors are presented. [ABSTRACT FROM AUTHOR]

Support vector machine (SVM) is one of the most important class of machine learning models and algorithms, and has been successfully applied in various fields. Nonlinear optimization plays a crucial role in SVM methodology, both in defining the machine learning models and in designing convergent and efficient algorithms for large-scale training problems. In this paper we present the convex programming problems underlying SVM focusing on supervised binary classification. We analyze the most important and used optimization methods for SVM training problems, and we discuss how the properties of these problems can be incorporated in designing useful algorithms. [ABSTRACT FROM AUTHOR]

This paper discusses an allocation issue of promotion budget and traffic volume, faced by VIP.com that is the largest online flash-sales platform in China. Through flash sales mode, each day VIP.com provides consumers one hundred authorized brands of products on consignment, which last for a short period of time (frequently 3–5 days), called by VIP.com 'Dangqi'. As a consignee, VIP.com has no pricing rights of products but can allocate the promotion budget and traffic volume to each brand. Due to different categories of products and different brands of products having different responses to the same promotion budget and different profit margins, it is very necessary for VIP.com to allocate promotion budget and traffic volume among all brands of products offered in each 'Dangqi' reasonably in order to improve the usage efficiency of limited resources. Based on the real historical data of VIP.com, we first find main elements that influence the sales revenues of different brands of products through machine learning. We then predict the sales of all brands of products in each 'Dangqi' by multiplicative regression model, which has better accuracy of forecasting than other forecast models and obtain the function relationship between the total sales of each brand and its main impact elements. Finally, considering VIP.com's actual concerns, we develop allocation optimization models with objectives of maximizing VIP.com's total sales and total sales profit, respectively. The results from VIP.com's real data tests show that under the same resource investment the presented allocation optimization approach can yield a significant increase in VIP.com's total sales and sales profit in each 'Dangqi'. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of open shop scheduling on two machines with resources constraints. In the context of our study, in order to be executed, a job requires first, for its preparation for a given period of time, a number of resources which cannot exceed a given resource capacity. Then, it goes onto its execution while the resources allocated to it become available again. We seek a schedule that minimizes the makespan. We first prove the $\mathcal{N}\mathcal{P}$ -hardness of several versions of this problem. Then, we present a well solvable case, lower bounds, and heuristic algorithms along with an experimental study. [ABSTRACT FROM AUTHOR]

As stock data is characterized by highly noisy and non-stationary, stock price prediction is regarded as a knotty problem. In this paper, we propose new two-stage ensemble models by combining empirical mode decomposition (EMD) (or variational mode decomposition (VMD)), extreme learning machine (ELM) and improved harmony search (IHS) algorithm for stock price prediction, which are respectively named EMD–ELM–IHS and VMD–ELM–IHS. Furthermore, to demonstrate the efficiency and performance of the proposed models, the results were compared with those obtained by other methods, including EMD based ELM (EMD–ELM), VMD based ELM (VMD–ELM), autoregressive integrated moving average (ARIMA), ELM, multi-layer perception (MLP), support vector regression (SVR), and long short-term memory (LSTM) models. The results show that the proposed models have superior performance in terms of its accuracy and stability as compared to the other models. Also, we find that the sizes of sliding window and training set have a significant impact on the predictive performance. [ABSTRACT FROM AUTHOR]

This paper reviews real estate price estimation in France, a market that has received little attention. We compare seven popular machine learning techniques by proposing a different approach that quantifies the relevance of location features in real estate price estimation with high and fine levels of granularity. We take advantage of a newly available open dataset provided by the French government that contains 5 years of historical data of real estate transactions. At a high level of granularity, we obtain important differences regarding the models' prediction powers between cities with medium and high standards of living (precision differences beyond 70% in some cases). At a low level of granularity, we use geocoding to add precise geographical location features to the machine learning algorithm inputs. We obtain important improvements regarding the models' forecasting powers relative to models trained without these features (improvements beyond 50% for some forecasting error measures). Our results also reveal that neural networks and random forest techniques particularly outperform other methods when geocoding features are not accounted for, while random forest, adaboost and gradient boosting perform well when geocoding features are considered. For identifying opportunities in the real estate market through real estate price prediction, our results can be of particular interest. They can also serve as a basis for price assessment in revenue management for durable and non-replenishable products such as real estate. [ABSTRACT FROM AUTHOR]

Artificial Intelligence (AI) is critical for data-driven decision making to increase resource utilization, operational performance, and service quality in various industry domains, particularly in healthcare. Using AI in healthcare operations can significantly improve treatment outcomes and enhance patient satisfaction while reducing costs. In this paper, we propose a multi-stage framework to build an AI-based decision support tool that can predict the 5-year survivability of lung cancer patients. We evaluate the proposed framework using the Surveillance, Epidemiology, and End Results dataset pertaining to the 1973–2015 period obtained from the National Institutes of Health. The first stage entails data preprocessing and target creation. The second stage applies six AI algorithms with feature selection through Particle Swarm Optimization and hyperparameter tuning with Cross-Validation. These Algorithms include Logistic Regression, Decision Trees, Random Forests (RF), Adaptive Boosting (AdaBoost), Artificial Neural Network, and Naïve Bayes. The results show that RF and AdaBoost models yield an AUC rate of 0.94 and outperform the other models. Stage 3 utilizes permutation importance to interpret the RF and AdaBoost models and applies Tree-based Augmented Naïve Bayes to gain insights regarding the interrelations among important features. The results of Stage 3 delineate that the number of lymph nodes containing metastases), the number of tumors that patients have had in their lifetime, the patient's age, and the microscopic composition of cells rank among the topmost important features and can significantly impact patient survivability. We think this study has significant practical implications in helping physicians predict prognosis and develop treatment plans for lung cancer patients. [ABSTRACT FROM AUTHOR]

This survey paper attempts to cover a broad range of topics related to computational biomedicine. The field has been attracting great attention due to a number of benefits it can provide the society with. New technological and theoretical advances have made it possible to progress considerably. Traditionally, problems emerging in this field are challenging from many perspectives. In this paper, we considered the influence of big data on the field, problems associated with massive datasets in biomedicine and ways to address these problems. We analyzed the most commonly used machine learning and feature mining tools and several new trends and tendencies such as deep learning and biological networks for computational biomedicine. [ABSTRACT FROM AUTHOR]

This paper addresses a generalization of the coupled-operations scheduling problem in the context of a flow shop environment. We consider the two-machine scheduling problem with the objective of minimizing the makespan. Each job consists of a coupled-operation to be processed first on the first machine and a single operation to be then processed on the second machine. A coupled-operation contains two operations separated by an exact time delay. The single operation can start on the second machine only when the coupled-operation on the first machine is completed. We prove the NP-completeness of two restricted versions of the general problem, whereas we also exhibit several other well solvable cases. [ABSTRACT FROM AUTHOR]

Feature selection is a fundamental preprocessing step for many machine learning and pattern recognition systems. Notably, some mutual-information-based and correlation-based feature selection problems can be formulated as fractional programs with a single ratio of polynomial 0–1 functions. In this paper, we study approaches that ensure globally optimal solutions for these feature selection problems. We conduct computational experiments with several real datasets and report encouraging results. The considered solution methods perform well for medium- and reasonably large-sized datasets, where the existing mixed-integer linear programs from the literature fail. [ABSTRACT FROM AUTHOR]