<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">JDAIP</journal-id><journal-title-group><journal-title>Journal of Data Analysis and Information Processing</journal-title></journal-title-group><issn pub-type="epub">2327-7211</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/jdaip.2024.122009</article-id><article-id pub-id-type="publisher-id">JDAIP-132739</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Computer Science&amp;Communications</subject><subject> Physics&amp;Mathematics</subject></subj-group></article-categories><title-group><article-title>
 
 
  A Hybrid Approach for Predicting Probability of Default in Peer-to-Peer (P2P) Lending Platforms Using Mixture-of-Experts Neural Network
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Christopher</surname><given-names>Watitwa Makokha</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Ananda</surname><given-names>Kube</given-names></name><xref ref-type="aff" rid="aff2"><sup>2</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Oscar</surname><given-names>Ngesa</given-names></name><xref ref-type="aff" rid="aff3"><sup>3</sup></xref></contrib></contrib-group><aff id="aff1"><addr-line>Department of Mathematics, Pan African University Institute of Basic Sciences, Technology and Innovation, Nairobi, Kenya</addr-line></aff><aff id="aff2"><addr-line>Department of Mathematics and Actuarial Sciences, Kenyatta University, Nairobi, Kenya</addr-line></aff><aff id="aff3"><addr-line>Department of Mathematics, Statistics and Physical Sciences, Taita Taveta University, Voi, Kenya</addr-line></aff><pub-date pub-type="epub"><day>12</day><month>04</month><year>2024</year></pub-date><volume>12</volume><issue>02</issue><fpage>151</fpage><lpage>162</lpage><history><date date-type="received"><day>27,</day>	<month>January</month>	<year>2024</year></date><date date-type="rev-recd"><day>23,</day>	<month>April</month>	<year>2024</year>	</date><date date-type="accepted"><day>26,</day>	<month>April</month>	<year>2024</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
  Peer-to-peer (P2P) lending offers an alternative way to access credit. Unlike established lending institutions with proven credit risk management practices, P2P platforms rely on numerous independent variables to evaluate loan applicants&amp;#8217; creditworthiness. This study aims to estimate default probabilities using a mixture-of-experts neural network in P2P lending. The approach involves coupling unsupervised clustering to capture essential data properties with a classification algorithm based on the mixture-of-experts structure. This classic design enhances model capacity without significant computational overhead. The model was tested using P2P data from Lending Club, comparing it to other methods like Logistic Regression, AdaBoost, Gradient Boosting, Decision Tree, Support Vector Machine, and Random Forest. The hybrid model demonstrated superior performance, with a Mean Squared Error reduction of at least 25%.
 
</p></abstract><kwd-group><kwd>Credit-Scoring</kwd><kwd> Clustering</kwd><kwd> Classification</kwd><kwd> Neural Networks</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>Credit refers to money borrowed from financial institutions, which must be repaid with interest, typically in installments [<xref ref-type="bibr" rid="scirp.132739-ref1">1</xref>] . Predicting the risk associated with loans is imperative for financial institutions. This risk represents the likelihood that borrowers will default and fail to repay the entire loan amount. Accurate risk assessment ensures profitability for the institution while avoiding overburdening customers beyond their financial capacity [<xref ref-type="bibr" rid="scirp.132739-ref1">1</xref>] . Credit scoring involves placing individuals on a scale of creditworthiness, indicating their trustworthiness regarding credit. This scale guides decisions on granting credit to applicants [<xref ref-type="bibr" rid="scirp.132739-ref2">2</xref>] . Crowdfunding encompasses web-based fundraising, where users contribute small amounts to finance projects [<xref ref-type="bibr" rid="scirp.132739-ref3">3</xref>] . Crowdfunding can be either commercial, with expected financial returns, or non-commercial, relying on donations [<xref ref-type="bibr" rid="scirp.132739-ref3">3</xref>] . Peer-to-peer (P2P) lending falls under commercial crowdfunding, where online platforms collect funds from the “crowd” to collectively finance higher-value loans for individuals or businesses [<xref ref-type="bibr" rid="scirp.132739-ref4">4</xref>] .</p><p>Most classification algorithms operate in a batch mode, directly processing the dataset in memory. However, more sophisticated methods often create large data structures, resulting in a significant memory footprint. This can hinder their application to larger datasets. Even when these datasets can be accommodated, the algorithm’s complexity may lead to excessively long classification times. To mitigate these issues, one could allocate additional memory or extend the experiment duration. However, both options come with associated costs in terms of time and money. Furthermore, neither approach guarantees a solution if the dataset exceeds memory capacity at its maximum [<xref ref-type="bibr" rid="scirp.132739-ref5">5</xref>] .</p><p>This research addresses data mining for modeling credit risk default probabilities while minimizing information loss from large datasets. The proposed approach involves a mixture-of-experts neural network framework to assess default probabilities in P2P lending platforms. By combining unsupervised and supervised machine learning (ML) methods, one study evaluated credit risk for commercial customers. Hybrid models outperformed individual supervised ML models, particularly in complex scenarios with nonlinear predictor-target relationships [<xref ref-type="bibr" rid="scirp.132739-ref6">6</xref>] . Building on these findings, the study anticipates that preceding mixture-of-experts neural networks with an unsupervised clusterer will enhance overall model accuracy.</p><p>This study holds significance because it addresses the critical issue of credit risk, which directly impacts financial institutions’ lending capabilities. Given the widespread challenge of borrowers struggling to service their debt, modeling default probabilities becomes crucial for devising effective strategies within peer-to-peer lending platforms. Such efforts have the potential to revolutionize the P2P lending industry by enhancing loan repayment outcomes through informed policy decisions. Furthermore, this research contributes to the existing computer science literature by developing novel ML algorithms or techniques applicable to lending data. These innovations may find broader applications across various industries and fields of research. Future researchers can leverage these findings to extend the body of knowledge in this domain.</p></sec><sec id="s2"><title>2. Literature</title><p>A Hybrid Expert Neural Network model is a type of artificial neural network that combines different types of neural networks or other machine learning models to solve complex problems [<xref ref-type="bibr" rid="scirp.132739-ref7">7</xref>] . The structure and working principle of such a model can vary depending on the specific models being combined and the problem at hand. However, a common feature in many hybrid expert neural network models is the use of an expert function and a gating function.</p><p>The expert function in a hybrid expert neural network model refers to the individual models or “experts” that are trained to handle specific subtasks within the overall problem. These experts can be any type of model, including but not limited to neural networks, and they are typically designed to be highly specialized in their respective subtasks [<xref ref-type="bibr" rid="scirp.132739-ref7">7</xref>] .</p><p>The gating function, also known as the router, is responsible for determining which expert(s) should be used for a given input. This is typically done by assigning weights to the outputs of the experts based on the input, effectively controlling the influence of each expert on the final output.</p><p>The gating function is a key component of the model because it allows the model to dynamically adapt to different inputs by leveraging the strengths of its various experts. The gating function itself is often implemented as a neural network, and it is trained alongside the experts. The training process involves adjusting the parameters of the gating function and the experts to minimize the difference between the model’s output and the actual output for a set of training data.</p><p>A hybrid expert neural network model leverages the strengths of multiple expert models and uses a gating function to dynamically adapt to different inputs. This makes it a powerful tool for tackling complex problems that may be difficult to solve with a single model [<xref ref-type="bibr" rid="scirp.132739-ref7">7</xref>] .</p><p>Here are some advantages and disadvantages of Hybrid Expert Neural Networks (HENN) models compared to other models:</p><p>Advantages:</p><p>● Leveraging Strengths: HENNs can leverage the strengths of various neural network types, such as Convolutional Neural Networks (CNNs) for spatial data and Recurrent Neural Networks (RNNs) for sequential data [<xref ref-type="bibr" rid="scirp.132739-ref8">8</xref>] .</p><p>● Improved Performance: By combining different models, HENNs often achieve better performance on complex tasks that may be beyond the scope of a single model [<xref ref-type="bibr" rid="scirp.132739-ref8">8</xref>] .</p><p>● Flexibility: They offer flexibility in design, allowing for the creation of custom networks tailored to specific tasks [<xref ref-type="bibr" rid="scirp.132739-ref8">8</xref>] .</p><p>● Efficiency: HENNs can be more efficient in learning representations from data, as they can process diverse data types and handle complex patterns [<xref ref-type="bibr" rid="scirp.132739-ref8">8</xref>] .</p><p>Disadvantages:</p><p>● Complexity: The increased complexity of HENNs can make them harder to design, train, and optimize [<xref ref-type="bibr" rid="scirp.132739-ref8">8</xref>] .</p><p>● Interpretability: Like many neural networks, HENNs can act as “black boxes,” making it difficult to interpret how they make decisions [<xref ref-type="bibr" rid="scirp.132739-ref8">8</xref>] .</p><p>● Computational Resources: They may require more computational resources and data for training due to their complexity [<xref ref-type="bibr" rid="scirp.132739-ref8">8</xref>] .</p><p>● Risk of Overfitting: With a large number of parameters, there’s a risk of overfitting the model to the training data [<xref ref-type="bibr" rid="scirp.132739-ref8">8</xref>] .</p><p>Hybrid learning combines unsupervised and supervised learning methods. The process occurs in two stages. Initially, an unsupervised method identifies data clusters. In the subsequent stage, data transformation occurs based on the learned clusters, and a supervised learning algorithm constructs a function to differentiate between various class labels [<xref ref-type="bibr" rid="scirp.132739-ref7">7</xref>] .</p><p>Clustering serves two primary purposes:</p><p>● Data Exploration: Clustering methods identify similarities between instances and group them accordingly when such groups are formed, they can be named, and their attributes defined. For instance, one can choose the group mean as the representative prototype for instances within the group, or describe the possible attribute range. This simplifies data understanding [<xref ref-type="bibr" rid="scirp.132739-ref9">9</xref>] .</p><p>● Preprocessing Stage: Clustering can also be used as a preprocessing step. An advantage of preceding a supervised learner with an unsupervised clustering is that the latter doesn’t require labeled data. Labeling data is expensive. By using a large amount of unlabeled data to learn cluster parameters, we can subsequently use a smaller labeled dataset for the second stage of classification or regression [<xref ref-type="bibr" rid="scirp.132739-ref9">9</xref>] .</p><p>West [<xref ref-type="bibr" rid="scirp.132739-ref10">10</xref>] investigated the credit scoring accuracy of five neural network models. These included multi-layer perceptron, mixture-of-experts, radial basis function, learning vector quantization, and fuzzy adaptive resonance. Real-world datasets were split into training and independent test sets using 10-fold cross-validation. The results were compared to linear discriminant analysis, logistic regression, k-nearest neighbor, kernel density estimation, and decision trees. The study recommends considering Mixture-of-experts (MOE) and Radial Basis Function (RBF) neural network models. The MOE model’s superiority may stem from its ability to partition the input space and assign local expert networks to learn specific sub-spaces. This partitioning reduces learning interference, leading to a network that converges to more accurate locations in the error surface [<xref ref-type="bibr" rid="scirp.132739-ref10">10</xref>] .</p><p>Byanjakar et al. [<xref ref-type="bibr" rid="scirp.132739-ref11">11</xref>] proposed a credit scoring model using artificial neural networks to classify peer-to-peer loan applications into default and non-default groups. They utilized a publicly available dataset from Bandora, a leading European P2P lending platform. The dataset consisted of 15.77% defaulted loans and 84.23% non-defaulted loans. The neural network architecture included:</p><p>● Input layer: 14 neurons, corresponding to the number of independent variables in the data.</p><p>● Hidden layer: 5 neurons.</p><p>● Output layer: 1 neuron.</p><p>During training, the model achieved the following classification accuracy:</p><p>● Training data set: Non-default loans: 64.47% and default loans: 74.75%.</p><p>● Testing data set: Non-default loans: 62.70% and default loans: 74.38%.</p><p>The study’s findings suggest that financial attributes play a more influential role than demographic attributes in determining credit risk. Moreover, the neural network outperformed logistic regression in classifying default loans (74.38% vs. 61.03%). However, it is important to note that this study focused on a single P2P lending case. Byanjakar et al. [<xref ref-type="bibr" rid="scirp.132739-ref11">11</xref>] posited that future research should explore similarities and differences across various P2P lending cases operating in diverse financial environments.</p><p>In their research, [<xref ref-type="bibr" rid="scirp.132739-ref12">12</xref>] conducted an in-depth analysis of credit scoring methods, including discriminant analysis, logistic regression, neural networks, and Classification and Regression Trees (CART). Their study was based on a dataset from a Turkish bank, which included credit card information. The dataset, comprising 1260 entries, contained nine predictive variables for each customer: gender, age, marital status, level of education, occupation, job position, income, customer type, and ownership of credit cards from other banks. The outcome variable was the creditworthiness of the customer, categorized as good or bad credit. The artificial neural network model they developed included 13 neurons in the hidden layer. The findings of the study revealed that CART outperformed the other methods in terms of the average correct classification rate. However, the neural network model for credit scoring demonstrated fewer Type II errors, which are typically associated with higher misclassification costs, thereby indicating superior overall credit scoring performance.</p><p>Fernandes [<xref ref-type="bibr" rid="scirp.132739-ref13">13</xref>] conducted a study comparing Support Vector Machines (SVM) classification with several clustering methods to distinguish human from non-human users on Twitter. Their goal was to identify normal human activity within a random sample of 1000 accounts. The clustering techniques employed included K-Means, DBSCAN, and Gaussian Mixture Models. Here is a breakdown of their approach:</p><p>● Initial Classification: SVM with a Radial Basis Function (RBF) kernel was used. The feature set initially consisted of 70 variables. Feature selection reduced complexity and improved generalization performance.</p><p>● First Stage Classification: Both classification and clustering approaches achieved similar f 1 accuracy scores of 90%. However, they encountered challenges when classifying human users who exhibited abnormal behavior.</p><p>● Second Stage Classification: A second classification step further separates non-human users into categories; brands, celebrities, and promoters/information. The average f 1 accuracy achieved in this stage was 74%.</p><p>In summary, both classification and clustering methods effectively separated human and non-human users, but clustering had the advantage of not requiring pre-classified data.</p><p>Wang [<xref ref-type="bibr" rid="scirp.132739-ref14">14</xref>] explored multi-class cost-sensitive classifiers for credit rating using data from Lending Club. They selected four well-known classifiers—C4.5, Naive Bayes, Logistic Regression, and SVM—as base models for the cost-sensitive meta-algorithm. The cost matrices included uniform costs, linear costs, and partitioned-linear costs. Key findings include:</p><p>● Cost-sensitive SVM performed best in 2017Q2, indicating that predictive performance varied based on both the cost-sensitive classifier and cost matrix.</p><p>● The study emphasizes the importance of considering cost-based performance when selecting a cost-sensitive classifier and assigning costs to minimize losses.</p></sec><sec id="s3"><title>3. Methodology</title><p>There are two steps in this model i.e. clustering and classification respectively.</p><p>In the clustering phase, we apply the Mixture Models clustering technique to reduce large data sets to a size where classification algorithms can be run on them with minimum loss of information vital from those data sets.</p><p>In the classification phase, we apply Mixture-of-experts Neural Networks on the output of the clustering phase to classify the defaulting status of an individual.</p><p>Let y i be the outcome variable specifying the defaulting status of individual i. Assuming that X 1 , X 2 , ⋯ , X p are features that are collected together with y i . The interest is to use the features X 1 , X 2 , ⋯ , X p to make the classification.</p><sec id="s3_1"><title>3.1. Step 1: Mixture Models Clustering</title><p>Let X 1 , X 2 , ⋯ , X n denote a random sample of size n, where X j is a p-dimensional random vector with probability density function f ( x j ) on ℝ p .</p><p>X j contains the random variables corresponding to p measurements made on the jth recording of some features of the phenomenon under study.</p><p>Let X = ( X 1 T , ⋯ , X n T ) T , where superscript T denotes vector transpose.</p><p>We suppose that the density f ( x j ) of X can be written in the form f ( x j ) is as follows.</p><p>f ( x j ) = ∑ i = 1 g π i f i ( x j ) (1)</p><p>where f i ( x j ) are densities and the π i is non-negative quantities that sum to one; that is</p><p>0 ≤ π i ≤ 1 ;   ( i = 1 , ⋯ , g ) (2)</p><p>and</p><p>∑ i = 1 g π i = 1 (3)</p><p>The quantities π 1 , ⋯ , π g are called the mixing proportions or weights.</p><p>The f i ( x j ) is called the component densities of the mixture.</p><p>In this formulation of the mixture model, the number of components g is considered fixed.</p><p>The mixture density f ( x j ) can then be written as</p><p>f ( x j ; Ψ ) = ∑ i = 1 g π i f i ( x j ; θ i ) (4)</p><p>where the vector Ψ containing all the unknown parameters in the mixture model can be written as</p><p>Ψ = ( π 1 , ⋯ , π g − 1 , ξ T ) T (5)</p><p>where ξ is the vector containing all the parameters in θ 1 , ⋯ , θ g known in advance as distinct.</p><p>With a mixture model-based approach to clustering, it is assumed that the data to be clustered are from a mixture of an initially specified number g of groups in various proportions. That is, each data point is taken to be a realization of the mixture density Equation (4), where the g components correspond to the g groups. On specifying a parametric form for each component density f i ( x j ; θ i ) , the vector Ψ can be estimated by maximum likelihood (or some other method).</p><p>Once the mixture model has been fitted, a probabilistic clustering of the data into g clusters can be obtained in terms of the fitted posterior probabilities of component membership for the data. An outright assignment of the data into g clusters is achieved by assigning each data point to the component to which it has the highest estimated posterior probability of belonging.</p></sec><sec id="s3_2"><title>3.2. Step 2: Mixture-of-Experts Neural Network Classification</title><p>The task at hand is now simplified to using r 1 , r 2 , ⋯ , r k for the classification of y i . In this context, we employ a neural network classification algorithm known as the mixture-of-experts. This algorithm comprises K experts and a coordinating unit referred to as a gating network, which serves as a mediator among the expert networks. The assumption here is that different networks excel in different areas of the input space, hence the necessity for the gating network. Considering a regression problem where a regressor r yields a response represented by the random variable D, with a specific realization of this variable denoted by d, we opt for a scalar form of regression for ease of representation. Given the scalar nature of the regression problem, each expert network is composed of a linear filter [<xref ref-type="bibr" rid="scirp.132739-ref7">7</xref>] .</p><p>As shown in <xref ref-type="fig" rid="fig1">Figure 1</xref>, the output produced by expert k is the inner product of the input vector r and synaptic weight vector w k of this neuron.</p><p>y k = w k T ,   k = 1 , 2 , ⋯ , K (6)</p><p>The gating network is structured with a single layer composed of K neurons, where each neuron is designated to a particular network. The neurons within the gating network exhibit non-linearity, and their activation functions are determined by</p><p>g k = exp ( u k ) ∑ j = 1 k exp ( u j ) (7)</p><p>where u k is the inner product of the input vector r and synaptic weight vector a k .</p><p>u k = a k T ,   k = 1 , 2 , ⋯ , K (8)</p><p>g k satisfies the following conditions</p><p>0 ≤ g k ≤ 1 (9)</p><p>∑ k = 1 K g k = 1 (10)</p><p>Let y k denote the output of the kth expert in response to the input vector r.</p><p>The overall output of the MOE model is</p><p>y = ∑ i = k K g k y k (11)</p><p>where g k is a nonlinear function of r.</p><p>Consider an MOE model with two experts, and a gating network with two outputs denoted by g 1 and g 2 .</p><p>The output of g 1 is defined by</p><p>g 1 = exp ( u 1 ) exp ( u 1 ) + exp ( u 2 ) = 1 1 + exp ( − ( u 1 − u 2 ) ) (12)</p><p>Let a 1 and a 2 denote the two weight vectors of the gating network.</p><p>g 1 = 1 1 + exp ( − r T ( a 1 − a 2 ) ) (13)</p><p>g 2 = 1 − g 1 = 1 1 + exp ( − r T ( a 2 − a 1 ) ) (14)</p><p>Thus both g 1 and g 2 are in the form of a logistic function.</p><p>The orientation of g 1 is determined by the direction of the difference vector ( a 1 − a 2 ) , whereas the orientation of g 2 is determined by the direction of the difference vector ( a 2 − a 1 ) .</p><p>Along the ridge defined by a 1 = a 2 we have g 1 = g 2 = 1 2 and the two experts contribute equally to the output of the MOE model.</p><p>Away from the ridge, one or the other of the two experts assumes the dominant role.</p></sec></sec><sec id="s4"><title>4. Results</title><sec id="s4_1"><title>4.1. Description of the Data</title><p>The dataset, sourced from Kaggle, encompasses details about previous loan applicants and their default status. The objective is to discern patterns that suggest a likelihood of default. Such patterns could inform decisions like refusing the loan, decreasing the loan amount, or imposing a higher interest rate on loans to risk-prone applicants. The dataset comprises 1,382,352 records, each with 149 characteristics, gathered from 2007 through the fourth quarter of 2018. The large number of attributes provides a detailed view of the borrowers’ profiles, which can lead to more accurate predictions of loan defaults. Having a wide range of attributes helps in identifying the most significant predictors of default and can improve the performance of the classification models [<xref ref-type="bibr" rid="scirp.132739-ref15">15</xref>] .</p><p>Moreover, the use of such detailed data can aid in the design of financial products like credit derivatives, which can be used to hedge against the risk of default [<xref ref-type="bibr" rid="scirp.132739-ref15">15</xref>] . This approach to credit risk analysis and the subsequent financial product design is crucial for the sustainability and profitability of peer-to-peer lending platforms.</p><p>The selected time frame is significant because it includes a variety of economic conditions, from a major recession to a recovery phase, and periods of both expansion and contraction [<xref ref-type="bibr" rid="scirp.132739-ref16">16</xref>] . This diversity can enhance the robustness of a model by training it on data from different phases of the economic cycle, which is essential for creating a model that can generalize well to future conditions [<xref ref-type="bibr" rid="scirp.132739-ref16">16</xref>] .</p><p><xref ref-type="table" rid="table1">Table 1</xref> summarizes the performance of classification algorithms preceded by unsupervised clustering. The results indicate that preceding a classifier with an unsupervised clusterer improves the performance. Furthermore, there was at least 25% improvement in the performance of the mixture-of-experts neural network model by preceding it with an unsupervised clusterer.</p></sec><sec id="s4_2"><title>4.2. Discussion</title><p>The provided table displays metrics for both individual and hybrid models during validation. These models were assessed using various metrics, including accuracy, precision, recall, F1-score, and mean-squared error. Notably, the mixture-of-expert neural network model achieved the highest accuracy of 0.92, followed by the logistic regression model with an accuracy of 0.89. Conversely, the decision tree model had the lowest accuracy at 0.78. Additionally, the precision, recall, F1-score, and mean-squared error metrics exhibited variations across the different models.</p><table-wrap id="table1" ><label><xref ref-type="table" rid="table1">Table 1</xref></label><caption><title> Metrics for validation: individual and hybrid models</title></caption><table><tbody><thead><tr><th align="center" valign="middle"  rowspan="2"  >Clusterer</th><th align="center" valign="middle" >Classifier</th><th align="center" valign="middle" >Accuracy</th><th align="center" valign="middle" >Precision</th><th align="center" valign="middle" >Recall</th><th align="center" valign="middle" >f1-score</th><th align="center" valign="middle" >MSE</th></tr></thead><tr><td align="center" valign="middle" >LR</td><td align="center" valign="middle" >0.86</td><td align="center" valign="middle" >0.79</td><td align="center" valign="middle" >0.74</td><td align="center" valign="middle" >0.88</td><td align="center" valign="middle" >0.7548</td></tr><tr><td align="center" valign="middle" ></td><td align="center" valign="middle" >AdaBoost</td><td align="center" valign="middle" >0.89</td><td align="center" valign="middle" >0.80</td><td align="center" valign="middle" >0.78</td><td align="center" valign="middle" >0.89</td><td align="center" valign="middle" >0.7264</td></tr><tr><td align="center" valign="middle" ></td><td align="center" valign="middle" >Gradient Boosting</td><td align="center" valign="middle" >0.88</td><td align="center" valign="middle" >0.84</td><td align="center" valign="middle" >0.80</td><td align="center" valign="middle" >0.86</td><td align="center" valign="middle" >0.8288</td></tr><tr><td align="center" valign="middle" ></td><td align="center" valign="middle" >Decision Tree</td><td align="center" valign="middle" >0.78</td><td align="center" valign="middle" >0.85</td><td align="center" valign="middle" >0.82</td><td align="center" valign="middle" >0.85</td><td align="center" valign="middle" >0.8587</td></tr><tr><td align="center" valign="middle" ></td><td align="center" valign="middle" >Random Forest</td><td align="center" valign="middle" >0.77</td><td align="center" valign="middle" >0.76</td><td align="center" valign="middle" >0.84</td><td align="center" valign="middle" >0.82</td><td align="center" valign="middle" >0.8326</td></tr><tr><td align="center" valign="middle" ></td><td align="center" valign="middle" >SVM</td><td align="center" valign="middle" >0.80</td><td align="center" valign="middle" >0.82</td><td align="center" valign="middle" >0.85</td><td align="center" valign="middle" >0.81</td><td align="center" valign="middle" >0.7213</td></tr><tr><td align="center" valign="middle" ></td><td align="center" valign="middle" >MOE</td><td align="center" valign="middle" >0.81</td><td align="center" valign="middle" >0.83</td><td align="center" valign="middle" >0.86</td><td align="center" valign="middle" >0.80</td><td align="center" valign="middle" >0.6258</td></tr><tr><td align="center" valign="middle" >Mixture Models</td><td align="center" valign="middle" >LR</td><td align="center" valign="middle" >0.89</td><td align="center" valign="middle" >0.75</td><td align="center" valign="middle" >0.80</td><td align="center" valign="middle" >0.86</td><td align="center" valign="middle" >0.6385</td></tr><tr><td align="center" valign="middle" ></td><td align="center" valign="middle" >AdaBoost</td><td align="center" valign="middle" >0.86</td><td align="center" valign="middle" >0.83</td><td align="center" valign="middle" >0.79</td><td align="center" valign="middle" >0.87</td><td align="center" valign="middle" >0.7385</td></tr><tr><td align="center" valign="middle" ></td><td align="center" valign="middle" >Gradient Boosting</td><td align="center" valign="middle" >0.81</td><td align="center" valign="middle" >0.81</td><td align="center" valign="middle" >0.80</td><td align="center" valign="middle" >0.88</td><td align="center" valign="middle" >0.8325</td></tr><tr><td align="center" valign="middle" ></td><td align="center" valign="middle" >Decision Tree</td><td align="center" valign="middle" >0.80</td><td align="center" valign="middle" >0.84</td><td align="center" valign="middle" >0.91</td><td align="center" valign="middle" >0.81</td><td align="center" valign="middle" >0.8690</td></tr><tr><td align="center" valign="middle" ></td><td align="center" valign="middle" >Random Forest</td><td align="center" valign="middle" >0.79</td><td align="center" valign="middle" >0.86</td><td align="center" valign="middle" >0.90</td><td align="center" valign="middle" >0.82</td><td align="center" valign="middle" >0.8630</td></tr><tr><td align="center" valign="middle" ></td><td align="center" valign="middle" >SVM</td><td align="center" valign="middle" >0.82</td><td align="center" valign="middle" >0.90</td><td align="center" valign="middle" >0.88</td><td align="center" valign="middle" >0.85</td><td align="center" valign="middle" >0.7018</td></tr><tr><td align="center" valign="middle" ></td><td align="center" valign="middle" >MOE</td><td align="center" valign="middle" >0.92</td><td align="center" valign="middle" >0.90</td><td align="center" valign="middle" >0.86</td><td align="center" valign="middle" >0.86</td><td align="center" valign="middle" >0.4321</td></tr></tbody></table></table-wrap><p>The hybrid expert neural network model was chosen for its ability to handle complex and varied data through a combination of specialized networks.</p><p>The empirical contributions of this study results to the risk management and decision-making of P2P lending platforms are significant. They provide valuable insights that can help platforms:</p><p>● Identify Key Risk Factors: Research helps in identifying the variables that significantly influence the risk associated with lending, such as loan interest rates, loan duration, and borrower characteristics [<xref ref-type="bibr" rid="scirp.132739-ref17">17</xref>] .</p><p>● Improve Interest Rate Setting: Studies have shown how interest rates can be adjusted based on loan size, duration, and other factors, which is crucial for balancing risk and return [<xref ref-type="bibr" rid="scirp.132739-ref17">17</xref>] .</p><p>● Enhance Regulatory Frameworks: Empirical findings can guide regulators and policymakers in designing responses to market challenges, particularly during economic crises like the COVID-19 pandemic [<xref ref-type="bibr" rid="scirp.132739-ref17">17</xref>] .</p><p>● Facilitate Platform Management: Insights from research encourage government participation in platform management, promoting a healthier development of the P2P lending industry [<xref ref-type="bibr" rid="scirp.132739-ref17">17</xref>] .</p><p>As for the impacts on related fields:</p><p>● Financial Inclusion: P2P lending research contributes to financial inclusion by providing credit access to underserved populations, supporting small businesses, and fostering economic growth [<xref ref-type="bibr" rid="scirp.132739-ref15">15</xref>] .</p><p>● Economic Resilience: It extends the coverage of credit circulations and improves economic resilience, even during financial crises [<xref ref-type="bibr" rid="scirp.132739-ref15">15</xref>] .</p><p>● Competitiveness: Findings affect the competitiveness of P2P platforms by highlighting factors like volume, operation time, and investor numbers that give platforms a competitive edge [<xref ref-type="bibr" rid="scirp.132739-ref18">18</xref>] .</p><p>In essence, empirical research in P2P lending not only enhances the operational strategies of lending platforms but also has broader implications for financial inclusion, economic stability, and the competitive landscape of financial services.</p><p>Based on the results, we recommend further research in the following areas:</p><p>● Investigating the impact of different feature selection techniques on the performance of the models.</p><p>● Exploring the use of deep learning models for this classification task.</p><p>● Evaluating the performance of the models on larger datasets to determine their scalability.</p><p>● Comparing the performance of the models with other state-of-the-art machine learning algorithms.</p><p>Overall, the results suggest that the mixture-of-expert neural network model is the best-performing model, followed by the logistic regression model. However, the choice of model will depend on the specific needs of the user and the context in which the model will be used.</p><p>Based on the findings, we recommend further research in the following areas:</p><p>● Feature Selection Techniques: Investigate the impact of different feature selection methods on model performance. Understanding which features contribute most significantly can enhance model accuracy.</p><p>● Deep Learning Models: Explore the use of deep learning models for this classification task. Techniques like neural networks with multiple layers may offer improved predictive capabilities.</p><p>● Scalability Evaluation: Assess the models’ performance on larger datasets to determine their scalability. Ensuring robustness across varying data sizes is essential.</p><p>● Comparison with State-of-the-Art Algorithms: Compare the performance of the models with other advanced machine learning algorithms. Understanding how they fare against established methods provides valuable insights.</p></sec></sec><sec id="s5"><title>Conflicts of Interest</title><p>The authors declare no conflicts of interest regarding the publication of this paper.</p></sec><sec id="s6"><title>Cite this paper</title><p>Makokha, C.W., Kube, A. and Ngesa, O. (2024) A Hybrid Approach for Predicting Probability of Default in Peer-to-Peer (P2P) Lending Platforms Using Mixture-of-Experts Neural Network. Journal of Data Analysis and Information Processing, 12, 151-162. https://doi.org/10.4236/jdaip.2024.122009</p></sec></body><back><ref-list><title>References</title><ref id="scirp.132739-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">Alpaydin, E. (2004) Introduction to Machine Learning (Adaptive Computation and Machine Learning Series). Vol. 14, The MIT Press, Cambridge. </mixed-citation></ref><ref id="scirp.132739-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Blanco, A., Pino-Mej&amp;#237;as, R., Lara, J. and Rayo, S. (2013) Credit Scoring Models for the Microfinance Industry Using Neural Networks: Evidence from Peru. &lt;i&gt;Expert Systems with Applications&lt;/i&gt;,&lt;i&gt; &lt;/i&gt;40, 356-364. &lt;br&gt;https://doi.org/10.1016/j.eswa.2012.07.051</mixed-citation></ref><ref id="scirp.132739-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">Lenz, R. (2017) Peer-to-Peer Lending: Opportunities and Risks. &lt;i&gt;European Journal of Risk Regulation&lt;/i&gt;, 7, 688-700. &lt;br&gt;https://doi.org/10.1017/S1867299X00010126</mixed-citation></ref><ref id="scirp.132739-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">Ariza-Garz&amp;#243;n, M.J., Camacho-Mi&amp;#241;ano, M.D.M., Segovia-Vargas, M.J. and Arroyo, J. (2021) Risk-Return Modelling in the p2p Lending Market: Trends, Gaps, Recommendations and Future Directions. &lt;i&gt;Electronic Commerce Research and Applic&lt;/i&gt;&lt;i&gt;a&lt;/i&gt;&lt;i&gt;tions&lt;/i&gt;,&lt;i&gt; &lt;/i&gt;49, 1-16. &lt;br&gt;https://doi.org/10.1016/j.elerap.2021.101079</mixed-citation></ref><ref id="scirp.132739-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">Evans, R., Pfahringer, B. and Holmes, G. (2011) Clustering for Classification. 2011 7&lt;i&gt;th International Conference on Information Technology in Asia: Emerging Co&lt;/i&gt;&lt;i&gt;n&lt;/i&gt;&lt;i&gt;vergences and Singularity of Forms-Proceedings of &lt;/i&gt;CITA&amp;#8217;11, Sarawak, 12-13 July 2011, 1-8. &lt;br&gt;https://doi.org/10.1109/CITA.2011.5998839</mixed-citation></ref><ref id="scirp.132739-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">Machado, M.R. and Karray, S. (2022) Assessing Credit Risk of Commercial Customers Using Hybrid Machine Learning Algorithms. &lt;i&gt;Expert Systems with Applic&lt;/i&gt;&lt;i&gt;a&lt;/i&gt;&lt;i&gt;tions&lt;/i&gt;,&lt;i&gt; &lt;/i&gt;200, 116889. &lt;br&gt;https://doi.org/10.1016/j.eswa.2022.116889</mixed-citation></ref><ref id="scirp.132739-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">Guti, P.A. (2011) Hybrid Artificial Neural Networks: Models. 177-184. &lt;br&gt;https://doi.org/10.1007/978-3-642-21498-1_23</mixed-citation></ref><ref id="scirp.132739-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">Albahri, A.S., Alnoor, A., Zaidan, A.A., Albahri, O.S., Hameed, H., Zaidan, B.B., Peh, S.S., Zain, A.B., Siraj, S.B., Masnan, A.H.B. and Yass, A.A. (2022) Hybrid Artificial Neural Network and Structural Equation Modelling Techniques: A Survey. &lt;i&gt;Complex and Intelligent Systems&lt;/i&gt;,&lt;i&gt; &lt;/i&gt;8, 1781-1801. &lt;br&gt;https://doi.org/10.1007/s40747-021-00503-w</mixed-citation></ref><ref id="scirp.132739-ref9"><label>9</label><mixed-citation publication-type="book" xlink:type="simple">Ba&amp;#351;tanlarm Y. and Ozuysal, M. (2014) Introduction to Machine Learning. In: Yousef, M. and Allmer, J., Eds., &lt;i&gt;miRNomics&lt;/i&gt;: &lt;i&gt;MicroRNA Biology a&lt;/i&gt;&lt;i&gt;nd&lt;/i&gt; &lt;i&gt;Computational Anal&lt;/i&gt;&lt;i&gt;y&lt;/i&gt;&lt;i&gt;sis&lt;/i&gt;. &lt;i&gt;Methods in Molecular Biology&lt;/i&gt;, Vol. 1107, Humana Press, Totowa, NJ, 105-128. &lt;br&gt;https://doi.org/10.1007/978-1-62703-748-8_7</mixed-citation></ref><ref id="scirp.132739-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">West, D. (2000) Neural Network Credit Scoring Models. &lt;i&gt;Computers and Oper&lt;/i&gt;&lt;i&gt;a&lt;/i&gt;&lt;i&gt;tions Research&lt;/i&gt;, 27, 1131-1152. &lt;br&gt;https://doi.org/10.1016/S0305-0548(99)00149-5</mixed-citation></ref><ref id="scirp.132739-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">Byanjankar, A., Heikkila, M. and Mezei, J. (2015) Predicting Credit Risk in Peer-to-Peer Lending: A Neural Network Approach. &lt;i&gt;Proceedings-&lt;/i&gt;2015&lt;i&gt; IEEE Symp&lt;/i&gt;&lt;i&gt;o&lt;/i&gt;&lt;i&gt;sium Series on Computational Intelligence&lt;/i&gt; (&lt;i&gt;SSCI&lt;/i&gt; 2015), Cape Town, 7-10 December 2015, 719-725. &lt;br&gt;https://doi.org/10.1109/SSCI.2015.109</mixed-citation></ref><ref id="scirp.132739-ref12"><label>12</label><mixed-citation publication-type="other" xlink:type="simple">Ince, H. and Aktan, B. (2009) A Comparison of Data Mining Techniques for Credit Scoring in Banking: A Managerial Perspective. &lt;i&gt;Journal of Business Economics and Management&lt;/i&gt;,&lt;i&gt; &lt;/i&gt;10, 233-240. &lt;br&gt;https://doi.org/10.3846/1611-1699.2009.10.233-240</mixed-citation></ref><ref id="scirp.132739-ref13"><label>13</label><mixed-citation publication-type="other" xlink:type="simple">Wang, Z., Jiang, C., Ding, Y., Lyu, X. andLiu, Y. (2018) A Novel Behavioral Scoring Model for Estimating Probability of Default over Time in Peer-to-Peer Lending. &lt;i&gt;Electronic Commerce Research and Applications&lt;/i&gt;,&lt;i&gt; &lt;/i&gt;27, 74-82. &lt;br&gt;https://doi.org/10.1016/j.elerap.2017.12.006</mixed-citation></ref><ref id="scirp.132739-ref14"><label>14</label><mixed-citation publication-type="other" xlink:type="simple">Fernandes, M.A., Patel, P. and Marwala, T. (2015) Automated Detection of Human Users in Twitter. &lt;i&gt;Procedia Computer Science&lt;/i&gt;,&lt;i&gt; &lt;/i&gt;53, 224-231. &lt;br&gt;https://doi.org/10.1016/j.procs.2015.07.298</mixed-citation></ref><ref id="scirp.132739-ref15"><label>15</label><mixed-citation publication-type="other" xlink:type="simple">Weinstock, R.L. (2023) Introduction to U.S. Economy: The Business Cycle and Growth-Congressional Research Service. </mixed-citation></ref><ref id="scirp.132739-ref16"><label>16</label><mixed-citation publication-type="other" xlink:type="simple">Moran, O. and Ido, T. (2021) An Empirical View of Peer-to-Peer (P2P) Lending Platforms. &lt;i&gt;Berkeley Business Law Journal&lt;/i&gt;. (Forthcoming)</mixed-citation></ref><ref id="scirp.132739-ref17"><label>17</label><mixed-citation publication-type="other" xlink:type="simple">Frigui, H. (2008) Clustering: Algorithms and Applications. 2008 &lt;i&gt;First Workshops on Image Processing Theory&lt;/i&gt;, &lt;i&gt;Tools and Applications&lt;/i&gt;, Sousse, 23-26 November 2008, 1-11. &lt;br&gt;https://doi.org/10.1109/IPTA.2008.4743793</mixed-citation></ref><ref id="scirp.132739-ref18"><label>18</label><mixed-citation publication-type="other" xlink:type="simple">Yan, X.X. and An, Q.S. (2020) Research on the Factors Affecting the Competitiveness of P2P Online Loan Platform. &lt;i&gt;Advances in Economics, Business and Manag&lt;/i&gt;&lt;i&gt;e&lt;/i&gt;&lt;i&gt;ment Research&lt;/i&gt;, 126, 270-276. &lt;br&gt;https://doi.org/10.2991/aebmr.k.200306.047</mixed-citation></ref></ref-list></back></article>