<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.0 20120330//EN" "JATS-journalpublishing1.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">INFORMATICA</journal-id>
<journal-title-group><journal-title>Informatica</journal-title></journal-title-group>
<issn pub-type="epub">1822-8844</issn><issn pub-type="ppub">0868-4952</issn><issn-l>0868-4952</issn-l>
<publisher>
<publisher-name>Vilnius University</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">INFOR618</article-id>
<article-id pub-id-type="doi">10.15388/26-INFOR618</article-id>
<article-categories><subj-group subj-group-type="heading">
<subject>Research Article</subject></subj-group></article-categories>
<title-group>
<article-title>A Novel Hybrid Portfolio Optimization Framework: Integrating HRP with MEREC and WEDBA Methods<xref ref-type="fn" rid="j_infor618_fn_001"><sup>✩</sup></xref></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-7586-1169</contrib-id>
<name><surname>Katranci</surname><given-names>Ali</given-names></name><email xlink:href="akatranci@pau.edu.tr">akatranci@pau.edu.tr</email><xref ref-type="aff" rid="j_infor618_aff_001">1</xref><bio>
<p><bold>A. Katrancı</bold> works at Pamukkale University, Türkiye. He received his PhD in business administration-quantitative methods from Pamukkale University. His research interests include multi-criteria decision-making, fuzzy decision models, optimization techniques, portfolio optimization, and machine learning-based decision models.</p></bio>
</contrib>
<contrib contrib-type="author">
<contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-7283-320X</contrib-id>
<name><surname>Kundakci</surname><given-names>Nilsen</given-names></name><email xlink:href="nilsenk@pau.edu.tr">nilsenk@pau.edu.tr</email><xref ref-type="aff" rid="j_infor618_aff_002">2</xref><xref ref-type="corresp" rid="cor2">∗</xref><bio>
<p><bold>N. Kundakcı</bold> is a professor in the Department of Business Administration at Pamukkale University, Denizli, Türkiye. She received her PhD in business administration-quantitative methods from Pamukkale University. She has authored and co-authored more than 70 publications in international and national peer-reviewed journals and conference proceedings. Her research interests include fuzzy logic, multi-criteria decision-making methods, and heuristic algorithms.</p></bio>
</contrib>
<aff id="j_infor618_aff_001"><label>1</label>Social Sciences Institute, Major of Business Administration, <institution>Pamukkale University</institution>, Denizli, <country>Türkiye</country></aff>
<aff id="j_infor618_aff_002"><label>2</label>Department of Business Administration, <institution>Pamukkale University</institution>, Denizli, <country>Türkiye</country></aff>
</contrib-group>
<author-notes>
<fn id="j_infor618_fn_001"><label>✩</label>
<p>This study was produced from the PhD thesis titled “<italic>Portfolio Optimization with Hierarchical Risk Parity and Multi-Criteria Decision Making: BIST 100 Application</italic>”.</p></fn><corresp id="cor2"><label>∗</label>Corresponding author.</corresp>
</author-notes>
<pub-date pub-type="ppub"><year>2026</year></pub-date><pub-date pub-type="epub"><day>11</day><month>2</month><year>2026</year></pub-date><volume content-type="ahead-of-print">0</volume><issue>0</issue><fpage>1</fpage><lpage>39</lpage><history><date date-type="received"><month>7</month><year>2025</year></date><date date-type="accepted"><month>1</month><year>2026</year></date></history>
<permissions><copyright-statement>© 2026 Vilnius University</copyright-statement><copyright-year>2026</copyright-year>
<license license-type="open-access" xlink:href="http://creativecommons.org/licenses/by/4.0/">
<license-p>Open access article under the <ext-link ext-link-type="uri" xlink:href="http://creativecommons.org/licenses/by/4.0/">CC BY</ext-link> license.</license-p></license></permissions>
<abstract>
<p>This research presents a novel hybrid portfolio optimization framework that combines the Hierarchical Risk Parity (HRP) algorithm with two Multi-Criteria Decision-Making (MCDM) methods, MEREC and WEDBA, specifically to overcome fundamental shortcomings in the standard HRP model. The central goal is to alleviate the chaining problem and resolve HRP’s difficulty in identifying the optimal number of clusters, issues known to negatively affect portfolio diversification and risk allocation. To achieve this structural improvement, the Elbow method is integrated directly into the HRP process, ensuring a robust cluster structure is defined before any weight allocation occurs. The MEREC method is then utilized to calculate objective criterion weights, while the WEDBA approach is employed to assess the financial performance of individual assets within each cluster generated by HRP. This HRP–MCDM algorithm is tested using daily closing price data for stocks on the BIST 100 Index covering the 2018–2022 period. The performance of portfolios generated across seven distinct linkage methods (Ward, single, complete, average, weighted, centroid, and median) is rigorously benchmarked against the outcomes from the traditional HRP approach. Findings demonstrate that the HRP–MCDM framework significantly boosts both return levels and risk-adjusted metrics, especially when using the single and Ward linkage method, thereby surpassing the standard HRP algorithm in the majority of test cases. By strategically blending machine-learning-based risk clustering with objective, multi-criteria evaluation, this study makes a vital methodological contribution to the portfolio optimization domain, equipping investors with a more stable, transparent, and performance-focused asset allocation instrument.</p>
</abstract>
<kwd-group>
<label>Key words</label>
<kwd>machine learning</kwd>
<kwd>multi-criteria decision making (MCDM)</kwd>
<kwd>MEREC</kwd>
<kwd>WEDBA</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="j_infor618_s_001">
<label>1</label>
<title>Introduction</title>
<p>Investors frequently allocate a portion of their earnings to savings to safeguard their financial future. Their goal is typically to maximize investment efficiency, leading them to pursue instruments that promise the highest possible return relative to an acceptable level of risk (Çetin <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_015">2025</xref>). However, the intricate and dynamic nature of contemporary financial markets introduces significant uncertainty, mandating the adoption of risk-mitigation strategies. The construction of optimal portfolios is primarily guided by two historical theoretical approaches: Traditional Portfolio Theory and Modern Portfolio Theory (MPT) (Yılmaz, <xref ref-type="bibr" rid="j_infor618_ref_106">2025</xref>). Traditional portfolio theory, which was dominant until the 1950s, relied on the principle of simple diversification (Deniz and Okuyan, <xref ref-type="bibr" rid="j_infor618_ref_021">2018</xref>). This perspective suggested that risk could be reduced merely by assembling securities with varying characteristics and quantities, largely disregarding the correlations between them (Leković, <xref ref-type="bibr" rid="j_infor618_ref_059">2021</xref>).</p>
<p>Modern Portfolio Theory, pioneered by Harry Markowitz in 1952, fundamentally changed this view, asserting that asset correlations are essential considerations for constructing optimal portfolios (Uyar, <xref ref-type="bibr" rid="j_infor618_ref_103">2019</xref>). MPT emphasizes that simply increasing the number of assets is insufficient to reduce risk; instead, incorporating securities with low correlation significantly enhances diversification benefits (Wysocki and Sakowski, <xref ref-type="bibr" rid="j_infor618_ref_104">2022</xref>). Markowitz’s work, which presented the Mean–Variance Optimization (MVO) model, established the foundation for modern portfolio theory (Curtis, <xref ref-type="bibr" rid="j_infor618_ref_016">2004</xref>).</p>
<p>MVO instructs investors to select the portfolio with the lowest variance (risk) from all portfolios capable of meeting a specified return target. Portfolios exhibiting higher variance are, by definition, deemed inefficient (Kolm <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_054">2014</xref>). Despite its theoretical importance, MVO faces practical issues, including high sensitivity to estimation errors and a dependence on extensive historical data series (Lorenzo and Arroyo, <xref ref-type="bibr" rid="j_infor618_ref_062">2023</xref>). These limitations frequently lead to unstable or suboptimal results, particularly in scenarios involving a high-dimensional set of assets. These inherent weaknesses have spurred researchers to develop alternative optimization models, such as the Arbitrage Pricing Model (Ross, <xref ref-type="bibr" rid="j_infor618_ref_086">1976</xref>), the Mean Absolute Deviation (MAD) method (Konno and Yamazaki, <xref ref-type="bibr" rid="j_infor618_ref_056">1991</xref>), the Black–Litterman model (Black and Litterman, <xref ref-type="bibr" rid="j_infor618_ref_013">1991</xref>), the Capital Asset Pricing Model (CAPM) (Sharpe, <xref ref-type="bibr" rid="j_infor618_ref_093">1963</xref>; Lintner, <xref ref-type="bibr" rid="j_infor618_ref_060">1965</xref>; Mossin, <xref ref-type="bibr" rid="j_infor618_ref_068">1966</xref>), and the Fama–French Three-Factor Model (Fama and French, <xref ref-type="bibr" rid="j_infor618_ref_028">1993</xref>).</p>
<p>Multi-Criteria Decision Making (MCDM) methods are now extensively used in portfolio formation, as they facilitate the concurrent assessment of multiple criteria in complex decision landscapes. Furthermore, heuristic algorithms and artificial intelligence (AI)-based approaches are frequently preferred due to their demonstrated capacity to manage large datasets efficiently. The Hierarchical Risk Parity (HRP) algorithm is one such machine-learning-based methodology.</p>
<p>Introduced by De Prado (<xref ref-type="bibr" rid="j_infor618_ref_018">2016</xref>), the HRP algorithm was specifically engineered to overcome the deficiencies of conventional optimization techniques. HRP merges risk-based allocation with hierarchical clustering, effectively mitigating the instability, concentration, and underperformance issues commonly associated with quadratic optimization. It enables portfolio construction using only a single covariance matrix (Kaae <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_042">2022</xref>). However, subsequent analyses have identified two critical limitations in HRP: the chaining problem and the inability to determine the optimal number of clusters (Kaae <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_042">2022</xref>).</p>
<p>The core purpose of this research is to design a novel hybrid portfolio optimization algorithm that directly addresses both the chaining problem and the challenge of optimal cluster determination within the HRP framework. Our approach employs a comprehensive three-stage methodology. The initial phase involved a literature review focusing on HRP, the MEREC (Method based on the Removal Effects of Criteria) technique, and the WEDBA (Weighted Euclidean Distance Based Approach) method. The second phase executed portfolio optimization using seven distinct linkage methods (Ward, single, complete, average, weighted, centroid, and median) within the HRP structure. The third phase incorporated the Elbow method into the HRP algorithm specifically to resolve the chaining and optimal cluster identification issues. This analysis was further enriched by the HRP-MCDM approach. Finally, we conducted a rigorous comparison between the performance of portfolios generated by the standalone HRP algorithm and those from the hybrid HRP-MCDM approach to thoroughly evaluate their relative effectiveness.</p>
<p>This study seeks to provide substantial insights into enhancing clustering techniques and refining decision-making processes in financial management, thereby making a significant contribution to the portfolio optimization field. The HRP, MEREC, and WEDBA methods were selected for this study because their respective strengths are complementary and highly suitable for overcoming the limitations of traditional portfolio optimization models. The HRP algorithm was chosen over conventional mean-variance models because it reduces concentration risk, avoids covariance matrix inversion, and yields more stable weight allocations even when financial data is noisy. However, given HRP’s acknowledged weaknesses—specifically the chaining problem and the lack of a mechanism for optimal cluster determination—additional methodological support is essential. Consequently, the MEREC method was included as an objective and data-driven weighting technique. It calculates the influence of each criterion without relying on subjective expert judgment, making it superior to many subjective or hybrid weighting methods used in MCDM. Similarly, the WEDBA method was preferred over other ranking techniques because it assesses alternatives based on weighted Euclidean distances to ideal and non-ideal solutions, allowing for a more robust performance evaluation within the HRP-derived clusters. Together, these three methods establish a powerful hybrid framework that merges machine-learning-based risk clustering with objective multi-criteria evaluation, providing a solution that is more resilient and practically applicable than any of the individual components used in isolation.</p>
</sec>
<sec id="j_infor618_s_002">
<label>2</label>
<title>Literature Review</title>
<p>The literature review for this study was structured using a three-stage methodological framework. The initial stage involved a detailed examination of the HRP algorithm and previous research that proposed enhancements to its core structure. The second stage concentrated on studies that have employed the MEREC method, while the third stage reviewed research utilizing the WEDBA method. The general design of the methods explored in this study, along with the overall flow of the literature review, is visually represented in Fig. <xref rid="j_infor618_fig_001">1</xref>.</p>
<sec id="j_infor618_s_003">
<label>2.1</label>
<title>Literature Review on the HRP Method</title>
<p>In the initial phase of this review, we conducted a systematic examination of the Hierarchical Risk Parity (HRP) algorithm, along with various scholarly works aimed at refining or expanding its core methodology. Since its original introduction by De Prado (<xref ref-type="bibr" rid="j_infor618_ref_018">2016</xref>), HRP has quickly captured the interest of the portfolio optimization community, prompting numerous researchers to apply and adapt the approach across a wide spectrum of financial markets and distinct asset classes.</p>
<fig id="j_infor618_fig_001">
<label>Fig. 1</label>
<caption>
<p>Flowchart of the literature review process.</p>
</caption>
<graphic xlink:href="infor618_g001.jpg"/>
</fig>
<p>Early studies immediately recognized HRP’s potential. Alipour <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_002">2016</xref>), for instance, benchmarked HRP against Minimum Variance, Inverse Variance Parity (IVP), and Quantum-Inspired HRP (QHRP) across a global set of 38 futures contracts, which included equity, bond, and commodities like oil, wheat, and gold. Their comparative analysis clearly established QHRP as the superior performer among all models tested. Focusing on the Indian market, Jothimani (<xref ref-type="bibr" rid="j_infor618_ref_041">2017</xref>) pioneered an HRP model based on Gerber statistics (HRP-GS), employing machine-learning-driven optimization techniques. This model’s efficacy was evaluated against both the standard HRP and Global Minimum Variance portfolios derived from historical correlations and Gerber statistics. Subsequently, Raffinot (<xref ref-type="bibr" rid="j_infor618_ref_081">2018</xref>) put forward the Hierarchical Equal Risk Contribution (HERC) model, which integrates HRP with the HCAA method. By testing this model on European, US, and 365 S&amp;P 500 stocks, Raffinot demonstrated that HERC portfolios structured using Conditional Value at Risk (CVaR) provided statistically superior risk-adjusted performance, especially when incorporating Conditional Drawdown at Risk (CDaR) structures.</p>
<p>Further validating the model’s attractiveness, Liutov (<xref ref-type="bibr" rid="j_infor618_ref_061">2018</xref>) analysed closing prices for 30 DJIA stocks between 1990 and 2017 and concluded that HRP offered a more appealing option for investors compared to the traditional Mean-Variance Optimization (MVO) model. Building on this, Jothimani and Bener (<xref ref-type="bibr" rid="j_infor618_ref_040">2019</xref>) introduced the HRP-HC (Historical Correlation–Based HRP) alongside the HRP-GS models, evaluating them against 250 firms on the Toronto Stock Exchange over a decade (2007–2016). Their findings consistently pointed to the HRP-GS model’s superiority. Contrasting results were noted by Uyar (<xref ref-type="bibr" rid="j_infor618_ref_103">2019</xref>), who assessed HRP, Minimum Variance, and IVP portfolios using BIST, FTSE, and DAX index returns. Uyar’s work indicated that HRP’s performance lagged on the BIST and FTSE indices but proved positive on the DAX. In 2020, Bechis constructed various portfolios using 30 DJIA stocks and 15 ETFs, prioritizing profitability, diversification, and risk minimization. Compared to models like Minimum Variance, IVP, CLA, equally weighted, and Randomized Weighted Portfolios (RWP), HRP consistently delivered well-diversified portfolios. Supporting this, Barziy and Chlebus (<xref ref-type="bibr" rid="j_infor618_ref_009">2020</xref>) conducted an evaluation of 32 ETFs spanning US, Asian, and European markets using high-frequency, 30-minute data, which confirmed that HRP successfully outperformed MVO, IVP, and CLA.</p>
<p>The application of HRP has also rapidly expanded to the volatile cryptocurrency space. For instance, Papenbrock <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_075">2021</xref>) developed a tree-based HRP model leveraging Adaptive Serial Risk Parity (ASRP), showing that it performed better than the classical HRP using data from the 14 largest cryptocurrencies. Similarly, Jaeger <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_037">2021</xref>) compared HRP with the Equal Risk Contribution (ERC) model using a comprehensive 2000–2020 dataset, ultimately concluding that HRP generated more favourable outcomes. Additionally, Burggraf (<xref ref-type="bibr" rid="j_infor618_ref_014">2021</xref>) confirmed HRP’s risk-reduction advantage using a large dataset of 61 cryptocurrencies. Outside of crypto, Nourahmadi and Sadeqi (<xref ref-type="bibr" rid="j_infor618_ref_071">2021</xref>) applied HRP to the 50 largest stocks on the Tehran Stock Exchange, identifying performance that was superior to Minimum Variance, equal weighting, and standard Risk Parity portfolios.</p>
<p>Subsequently, several researchers focused on introducing enhanced HRP variations. The upHRP algorithm, proposed by Amor <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_004">2022</xref>), successfully demonstrated improvements over Minimum Variance, IVP, and the baseline HRP. Likewise, Shahbazi and Byun (<xref ref-type="bibr" rid="j_infor618_ref_091">2022</xref>), analysing 61 cryptocurrencies, identified HRP as the most effective strategy in terms of risk-adjusted returns. Nourahmadi and Sadeqi (<xref ref-type="bibr" rid="j_infor618_ref_072">2022</xref>) revisited the Tehran Stock Exchange, testing HRP against Minimum Variance on 30 stocks, and once again reported stronger performance from the HRP method.</p>
<p>In 2023, Sen and Dutta applied HRP and Eigen Portfolios across seven sectors of the Indian National Stock Exchange, concluding that the HRP approach generated higher performance. A related study by Sen (<xref ref-type="bibr" rid="j_infor618_ref_090">2023</xref>) compared HRP with Reinforcement Learning (RL)–based portfolios, finding that RL portfolios achieved better results based on metrics like returns, risk, and Sharpe ratios. Reis <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_085">2023</xref>) conducted a critical out-of-sample comparison, evaluating HRP against various traditional allocation methods using pre- and post-pandemic data for 25 Brazilian stocks, where HRP was shown to generally outperform its alternatives. Further methodological improvements came from Uyar and Yavuz (<xref ref-type="bibr" rid="j_infor618_ref_102">2023</xref>), who introduced the FRAKTAL-HRP method, which demonstrated a stronger Sharpe ratio performance than Minimum Variance portfolios when tested on the 30 largest Frankfurt Stock Exchange stocks.</p>
<p>Contemporary contributions continue to evaluate and build upon the HRP framework. Palit and Prybutok (<xref ref-type="bibr" rid="j_infor618_ref_074">2024</xref>) confirmed HRP’s superior performance over MVO using sector-level S,P 500 data. Deković and Šimović (<xref ref-type="bibr" rid="j_infor618_ref_019">2025</xref>) presented methodological enhancements to the HRP algorithm that resulted in significantly increased computational efficiency for large-scale, real-time portfolio management. Through extensive Monte Carlo simulations, Antonov <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_005">2025</xref>) compared HRP with the classical Markowitz model and successfully validated HRP’s inherent advantage. Arian <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_006">2025</xref>) addressed HRP’s limitation to a single feature by introducing QHRP and Kernel-based HRP (KHRP), with both variations proving to outperform the original HRP. Finally, Ramirez-Carrillo <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_083">2025</xref>) applied HRP to the NUAM region (Chile, Colombia, and Peru). While their comparative study showed that the maximum Sharpe ratio portfolio generated the highest returns, HRP was observed to offer a more balanced and favourable risk–return trade-off. A summary of the literature review on the HRP method is presented in Table <xref rid="j_infor618_tab_001">1</xref>.</p>
<table-wrap id="j_infor618_tab_001">
<label>Table 1</label>
<caption>
<p>Studies on HRP and enhanced HRP approaches.</p>
</caption>
<table>
<thead>
<tr>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Study</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Objective/problem addressed</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Methodology/model</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Dataset/area</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Key findings</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Relevance to this study</td>
</tr>
</thead>
<tbody>
<tr>
<td style="vertical-align: top; text-align: left">De Prado (<xref ref-type="bibr" rid="j_infor618_ref_018">2016</xref>)</td>
<td style="vertical-align: top; text-align: left">Overcome limitations of MVO; propose risk-based clustering</td>
<td style="vertical-align: top; text-align: left">HRP (tree clustering, quasi-diagonalization, recursive bisection)</td>
<td style="vertical-align: top; text-align: left">US equities</td>
<td style="vertical-align: top; text-align: left">HRP outperforms MVO and IVP</td>
<td style="vertical-align: top; text-align: left">Foundation of HRP framework</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Alipour <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_002">2016</xref>)</td>
<td style="vertical-align: top; text-align: left">Compare classical, quantum-inspired HRP</td>
<td style="vertical-align: top; text-align: left">HRP, IVP, Minimum Variance, QHRP</td>
<td style="vertical-align: top; text-align: left">Futures: equities, bonds, commodities</td>
<td style="vertical-align: top; text-align: left">QHRP performs best</td>
<td style="vertical-align: top; text-align: left">Shows potential for HRP extensions</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Jothimani (<xref ref-type="bibr" rid="j_infor618_ref_041">2017</xref>)</td>
<td style="vertical-align: top; text-align: left">Improve HRP performance</td>
<td style="vertical-align: top; text-align: left">HRP-GS</td>
<td style="vertical-align: top; text-align: left">Indian market assets</td>
<td style="vertical-align: top; text-align: left">HRP-GS superior to correlation-based HRP</td>
<td style="vertical-align: top; text-align: left">Highlights enhancements to HRP</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Raffinot (<xref ref-type="bibr" rid="j_infor618_ref_081">2018</xref>)</td>
<td style="vertical-align: top; text-align: left">Reduce chaining issue</td>
<td style="vertical-align: top; text-align: left">HERC (HRP + HCAA)</td>
<td style="vertical-align: top; text-align: left">EU, US stocks; S&amp;P500</td>
<td style="vertical-align: top; text-align: left">CVaR-HERC yields better diversification</td>
<td style="vertical-align: top; text-align: left">Directly supports using Elbow to resolve chaining</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Liutov (<xref ref-type="bibr" rid="j_infor618_ref_061">2018</xref>)</td>
<td style="vertical-align: top; text-align: left">Test HRP vs MVO</td>
<td style="vertical-align: top; text-align: left">HRP</td>
<td style="vertical-align: top; text-align: left">DJIA stocks</td>
<td style="vertical-align: top; text-align: left">HRP more attractive for investors</td>
<td style="vertical-align: top; text-align: left">Confirms HRP benefits</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Jothimani and Bener (<xref ref-type="bibr" rid="j_infor618_ref_040">2019</xref>)</td>
<td style="vertical-align: top; text-align: left">Extend HRP with Gerber statistics</td>
<td style="vertical-align: top; text-align: left">HRP-HC, HRP-GS</td>
<td style="vertical-align: top; text-align: left">Toronto Stock Exchange</td>
<td style="vertical-align: top; text-align: left">HRP-GS outperforms HRP-HC</td>
<td style="vertical-align: top; text-align: left">Shows role of alternative correlation structures</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Uyar (<xref ref-type="bibr" rid="j_infor618_ref_103">2019</xref>)</td>
<td style="vertical-align: top; text-align: left">Compare HRP with MVO, IVP</td>
<td style="vertical-align: top; text-align: left">HRP, IVP, MinVar</td>
<td style="vertical-align: top; text-align: left">BIST, FTSE, DAX</td>
<td style="vertical-align: top; text-align: left">HRP poor on BIST, FTSE but good on DAX</td>
<td style="vertical-align: top; text-align: left">Shows market-dependent behaviour</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Bechis (<xref ref-type="bibr" rid="j_infor618_ref_011">2020</xref>)</td>
<td style="vertical-align: top; text-align: left">Create diversified low-risk portfolios</td>
<td style="vertical-align: top; text-align: left">HRP, MVO, IVP, CLA, RWP</td>
<td style="vertical-align: top; text-align: left">DJIA + ETF data</td>
<td style="vertical-align: top; text-align: left">HRP creates well-diversified portfolios</td>
<td style="vertical-align: top; text-align: left">Supports HRP’s diversification strength</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Barziy and Chlebus (<xref ref-type="bibr" rid="j_infor618_ref_009">2020</xref>)</td>
<td style="vertical-align: top; text-align: left">Test HRP on high-frequency ETFs</td>
<td style="vertical-align: top; text-align: left">HRP, MVO, IVP, CLA</td>
<td style="vertical-align: top; text-align: left">30-min ETF data</td>
<td style="vertical-align: top; text-align: left">HRP outperforms other strategies</td>
<td style="vertical-align: top; text-align: left">Shows robustness on high-frequency data</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Papenbrock <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_075">2021</xref>)</td>
<td style="vertical-align: top; text-align: left">Optimize crypto portfolios</td>
<td style="vertical-align: top; text-align: left">Tree-based HRP + ASRP</td>
<td style="vertical-align: top; text-align: left">14 cryptocurrencies</td>
<td style="vertical-align: top; text-align: left">Tree-HRP outperforms classical HRP</td>
<td style="vertical-align: top; text-align: left">Shows HRP applicability to volatile assets</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Jaeger <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_037">2021</xref>)</td>
<td style="vertical-align: top; text-align: left">Compare ERC and HRP</td>
<td style="vertical-align: top; text-align: left">HRP, ERC</td>
<td style="vertical-align: top; text-align: left">Multi-asset portfolio</td>
<td style="vertical-align: top; text-align: left">HRP superior</td>
<td style="vertical-align: top; text-align: left">Validates HRP against risk parity</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Burggraf (<xref ref-type="bibr" rid="j_infor618_ref_014">2021</xref>)</td>
<td style="vertical-align: top; text-align: left">Compare HRP with traditional methods</td>
<td style="vertical-align: top; text-align: left">HRP</td>
<td style="vertical-align: top; text-align: left">61 cryptocurrencies</td>
<td style="vertical-align: top; text-align: left">HRP reduces risk more effectively</td>
<td style="vertical-align: top; text-align: left">Confirms HRP’s risk-reduction role</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Nourahmadi and Sadeqi (<xref ref-type="bibr" rid="j_infor618_ref_071">2021</xref>)</td>
<td style="vertical-align: top; text-align: left">Test HRP on TSE</td>
<td style="vertical-align: top; text-align: left">HRP vs MinVar, Equal Weighting</td>
<td style="vertical-align: top; text-align: left">50 TSE stocks</td>
<td style="vertical-align: top; text-align: left">HRP best risk-adjusted returns</td>
<td style="vertical-align: top; text-align: left">Local evidence for HRP strength</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Amor <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_004">2022</xref>)</td>
<td style="vertical-align: top; text-align: left">Improve HRP performance</td>
<td style="vertical-align: top; text-align: left">upHRP</td>
<td style="vertical-align: top; text-align: left">ETFs</td>
<td style="vertical-align: top; text-align: left">upHRP outperforms HRP, IVP, MinVar</td>
<td style="vertical-align: top; text-align: left">Supports development of HRP variants</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Shahbazi and Byun (<xref ref-type="bibr" rid="j_infor618_ref_091">2022</xref>)</td>
<td style="vertical-align: top; text-align: left">Crypto risk mgmt</td>
<td style="vertical-align: top; text-align: left">HRP vs IV, MinVar, MaxDiv</td>
<td style="vertical-align: top; text-align: left">61 cryptocurrencies</td>
<td style="vertical-align: top; text-align: left">HRP performs best</td>
<td style="vertical-align: top; text-align: left">Confirms HRP suitability in crypto</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Nourahmadi and Sadeqi (<xref ref-type="bibr" rid="j_infor618_ref_072">2022</xref>)</td>
<td style="vertical-align: top; text-align: left">HRP vs MinVar</td>
<td style="vertical-align: top; text-align: left">HRP</td>
<td style="vertical-align: top; text-align: left">30 TSE stocks</td>
<td style="vertical-align: top; text-align: left">HRP outperforms MinVar</td>
<td style="vertical-align: top; text-align: left">More evidence for HRP validity</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Sen and Dutta (<xref ref-type="bibr" rid="j_infor618_ref_089">2023</xref>)</td>
<td style="vertical-align: top; text-align: left">HRP vs Eigen Portfolios</td>
<td style="vertical-align: top; text-align: left">HRP</td>
<td style="vertical-align: top; text-align: left">NSE sectors</td>
<td style="vertical-align: top; text-align: left">HRP superior</td>
<td style="vertical-align: top; text-align: left">Shows HRP works well sector-wise</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Sen (<xref ref-type="bibr" rid="j_infor618_ref_090">2023</xref>)</td>
<td style="vertical-align: top; text-align: left">HRP vs RL</td>
<td style="vertical-align: top; text-align: left">Reinforcement Learning, HRP</td>
<td style="vertical-align: top; text-align: left">13 sectors</td>
<td style="vertical-align: top; text-align: left">RL outperforms HRP</td>
<td style="vertical-align: top; text-align: left">Notes limitations of HRP</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Reis <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_085">2023</xref>)</td>
<td style="vertical-align: top; text-align: left">Pre-, post-pandemic performance</td>
<td style="vertical-align: top; text-align: left">HRP vs other allocations</td>
<td style="vertical-align: top; text-align: left">Brazilian market</td>
<td style="vertical-align: top; text-align: left">HRP superior</td>
<td style="vertical-align: top; text-align: left">Shows HRP robustness during crises</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Uyar and Yavuz (<xref ref-type="bibr" rid="j_infor618_ref_102">2023</xref>)</td>
<td style="vertical-align: top; text-align: left">FRAKTAL-HRP proposal</td>
<td style="vertical-align: top; text-align: left">FRAKTAL-HRP</td>
<td style="vertical-align: top; text-align: left">Frankfurt stocks</td>
<td style="vertical-align: top; text-align: left">FRAKTAL-HRP best Sharpe ratio</td>
<td style="vertical-align: top; text-align: left">Supports hybrid clustering designs</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Palit and Prybutok (<xref ref-type="bibr" rid="j_infor618_ref_074">2024</xref>)</td>
<td style="vertical-align: top; text-align: left">Long-term HRP performance</td>
<td style="vertical-align: top; text-align: left">HRP vs MVO</td>
<td style="vertical-align: top; text-align: left">S&amp;P500 sectors</td>
<td style="vertical-align: top; text-align: left">HRP higher performance</td>
<td style="vertical-align: top; text-align: left">Confirms earlier findings</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Deković and Šimović (<xref ref-type="bibr" rid="j_infor618_ref_019">2025</xref>)</td>
<td style="vertical-align: top; text-align: left">Improve computation speed</td>
<td style="vertical-align: top; text-align: left">Improved HRP</td>
<td style="vertical-align: top; text-align: left">Large-scale real-time data</td>
<td style="vertical-align: top; text-align: left">Improved efficiency</td>
<td style="vertical-align: top; text-align: left">Demonstrates scalability</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Antonov <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_005">2025</xref>)</td>
<td style="vertical-align: top; text-align: left">HRP vs Markowitz</td>
<td style="vertical-align: top; text-align: left">HRP</td>
<td style="vertical-align: top; text-align: left">Monte Carlo simulations</td>
<td style="vertical-align: top; text-align: left">HRP best performance</td>
<td style="vertical-align: top; text-align: left">Confirms HRP validity with simulations</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Arian <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_006">2025</xref>)</td>
<td style="vertical-align: top; text-align: left">Kernel, quantum HRP</td>
<td style="vertical-align: top; text-align: left">QHRP, KHRP</td>
<td style="vertical-align: top; text-align: left">Equity data</td>
<td style="vertical-align: top; text-align: left">Both outperform HRP</td>
<td style="vertical-align: top; text-align: left">Shows benefits of nonlinear extensions</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">Ramirez-Carrillo <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_083">2025</xref>)</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">HRP in Latin America</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">HRP vs EW, Sharpe-Max</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">Chile, Colombia, Peru</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">HRP best balanced profile</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">Regional evidence for HRP</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="j_infor618_s_004">
<label>2.2</label>
<title>Literature Review on the MEREC Method</title>
<p>The second stage of the literature review involved synthesizing relevant studies on the MEREC (Method based on the Removal Effects of Criteria) technique, which has demonstrated wide-ranging applicability across a multitude of domains. MEREC has established itself as a versatile tool, successfully addressing complex decision problems in sectors from technology and strategy to sustainability and regional economics.</p>
<p>In the realm of strategic decision-making and technology, MEREC has been instrumental in areas such as cloud service provider selection (Popović <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_078">2021</xref>), determining effective e-commerce development strategies (Popović <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_079">2022</xref>), and aiding in the selection of smart buildings (Elsayed, <xref ref-type="bibr" rid="j_infor618_ref_024">2024</xref>).</p>
<p>The method’s utility extends significantly to energy, materials, and logistics: it has been used for the selection of renewable energy sources (Goswami <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_032">2022</xref>), in the choice of phase change materials (Nicolalde <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_070">2022</xref>), for electric car selection (Puška <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_080">2023</xref>), developing low carbon tourism strategies (Mishra <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_066">2022</xref>), and in practical logistics applications like transport planning (Simić <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_094">2022</xref>) and the selection of pallet trucks (Ulutaş <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_101">2022</xref>) and even a spray-painting robot (Shanmugasundar <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_092">2022</xref>).</p>
<p>Furthermore, MEREC is frequently employed in performance evaluation and financial analysis. This includes portfolio construction for investment alternatives (Fidan, <xref ref-type="bibr" rid="j_infor618_ref_030">2022</xref>), hospital location selection (Hadi and Abdullah, <xref ref-type="bibr" rid="j_infor618_ref_034">2022</xref>), assessing the entrepreneurship and innovation performance of universities (Satıcı, <xref ref-type="bibr" rid="j_infor618_ref_088">2022</xref>; Yaşar and Ünlü, <xref ref-type="bibr" rid="j_infor618_ref_105">2023</xref>) and evaluating the vulnerability performance of countries (Altıntaş, <xref ref-type="bibr" rid="j_infor618_ref_003">2023</xref>).</p>
<p>More recent applications highlight its growing role in macro- and micro-economic analysis: evaluating the macroeconomic performance of OECD countries (Ersoy, <xref ref-type="bibr" rid="j_infor618_ref_025">2023</xref>), analysing the performance of the Serbian economy (Lukić, <xref ref-type="bibr" rid="j_infor618_ref_063">2023</xref>), assessing the vulnerability performance of nations (Altıntaş, <xref ref-type="bibr" rid="j_infor618_ref_003">2023</xref>), and evaluating countries’ innovation performance (Ecer and Ayçin, <xref ref-type="bibr" rid="j_infor618_ref_023">2023</xref>). Sectoral and financial studies also leverage MEREC, including analyses of Türkiye’s carbon emission profile (Pelit and Avşar, <xref ref-type="bibr" rid="j_infor618_ref_076">2025</xref>), the sustainable competitive position of Türkiye (Kara <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_043">2024a</xref>), sustainable industrial development potential (Komasi <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_055">2025</xref>), and the financial performance of banks in Bosnia and Herzegovina (Mastilo <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_065">2024</xref>), along with general financial performance evaluation (Oğuz and Satir, <xref ref-type="bibr" rid="j_infor618_ref_073">2024</xref>) (Table <xref rid="j_infor618_tab_002">2</xref>).</p>
<table-wrap id="j_infor618_tab_002">
<label>Table 2</label>
<caption>
<p>Summary of studies related to the MEREC method.</p>
</caption>
<table>
<thead>
<tr>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Study</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Application area</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Method</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Key findings</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Relevance</td>
</tr>
</thead>
<tbody>
<tr>
<td style="vertical-align: top; text-align: left">Popović <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_078">2021</xref>)</td>
<td style="vertical-align: top; text-align: left">Cloud services</td>
<td style="vertical-align: top; text-align: left">MEREC</td>
<td style="vertical-align: top; text-align: left">Stable objective weights</td>
<td style="vertical-align: top; text-align: left">Shows method reliability</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Popović <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_079">2022</xref>)</td>
<td style="vertical-align: top; text-align: left">E-commerce strategy</td>
<td style="vertical-align: top; text-align: left">MEREC</td>
<td style="vertical-align: top; text-align: left">Effective objective weighting</td>
<td style="vertical-align: top; text-align: left">Validates MEREC for decisions</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Mishra <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_066">2022</xref>)</td>
<td style="vertical-align: top; text-align: left">Sustainability, tourism</td>
<td style="vertical-align: top; text-align: left">MEREC</td>
<td style="vertical-align: top; text-align: left">Objective results</td>
<td style="vertical-align: top; text-align: left">Shows broad applicability</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Goswami <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_032">2022</xref>)</td>
<td style="vertical-align: top; text-align: left">Renewable energy</td>
<td style="vertical-align: top; text-align: left">MEREC</td>
<td style="vertical-align: top; text-align: left">Accurate weighting</td>
<td style="vertical-align: top; text-align: left">Demonstrates usefulness</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Fidan (<xref ref-type="bibr" rid="j_infor618_ref_030">2022</xref>)</td>
<td style="vertical-align: top; text-align: left">Portfolio construction</td>
<td style="vertical-align: top; text-align: left">MEREC</td>
<td style="vertical-align: top; text-align: left">Improves consistency</td>
<td style="vertical-align: top; text-align: left">Directly relevant to finance</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Shanmugasundar <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_092">2022</xref>)</td>
<td style="vertical-align: top; text-align: left">Robotics</td>
<td style="vertical-align: top; text-align: left">MEREC</td>
<td style="vertical-align: top; text-align: left">Effective selection tool</td>
<td style="vertical-align: top; text-align: left">General validation</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Hadi and Abdullah (<xref ref-type="bibr" rid="j_infor618_ref_034">2022</xref>)</td>
<td style="vertical-align: top; text-align: left">Hospital location</td>
<td style="vertical-align: top; text-align: left">MEREC</td>
<td style="vertical-align: top; text-align: left">Clear criteria impact</td>
<td style="vertical-align: top; text-align: left">Shows suitability for critical decisions</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Simić <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_094">2022</xref>)</td>
<td style="vertical-align: top; text-align: left">Transportation</td>
<td style="vertical-align: top; text-align: left">MEREC</td>
<td style="vertical-align: top; text-align: left">Accurate prioritization</td>
<td style="vertical-align: top; text-align: left">Confirms robustness</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Ulutaş <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_101">2022</xref>)</td>
<td style="vertical-align: top; text-align: left">Pallet trucks</td>
<td style="vertical-align: top; text-align: left">MEREC</td>
<td style="vertical-align: top; text-align: left">Strong discrimination</td>
<td style="vertical-align: top; text-align: left">Confirms reliability</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Nicolalde <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_070">2022</xref>)</td>
<td style="vertical-align: top; text-align: left">Materials</td>
<td style="vertical-align: top; text-align: left">MEREC</td>
<td style="vertical-align: top; text-align: left">Effective comparisons</td>
<td style="vertical-align: top; text-align: left">Supports technical decisions</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Satıcı (<xref ref-type="bibr" rid="j_infor618_ref_088">2022</xref>)</td>
<td style="vertical-align: top; text-align: left">Univ. performance</td>
<td style="vertical-align: top; text-align: left">MEREC</td>
<td style="vertical-align: top; text-align: left">Strong discrimination power</td>
<td style="vertical-align: top; text-align: left">Evaluation context</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Puška <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_080">2023</xref>)</td>
<td style="vertical-align: top; text-align: left">Electric car</td>
<td style="vertical-align: top; text-align: left">MEREC</td>
<td style="vertical-align: top; text-align: left">Clear consumer ranking</td>
<td style="vertical-align: top; text-align: left">Application diversity</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Lukić (<xref ref-type="bibr" rid="j_infor618_ref_063">2023</xref>)</td>
<td style="vertical-align: top; text-align: left">Macroeconomics</td>
<td style="vertical-align: top; text-align: left">MEREC</td>
<td style="vertical-align: top; text-align: left">Accurate country performance</td>
<td style="vertical-align: top; text-align: left">Validates large-scale decision-making</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Ersoy (<xref ref-type="bibr" rid="j_infor618_ref_025">2023</xref>)</td>
<td style="vertical-align: top; text-align: left">OECD macro performance</td>
<td style="vertical-align: top; text-align: left">MEREC</td>
<td style="vertical-align: top; text-align: left">Objective country ranking</td>
<td style="vertical-align: top; text-align: left">Supports financial usage</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Altıntaş (<xref ref-type="bibr" rid="j_infor618_ref_003">2023</xref>)</td>
<td style="vertical-align: top; text-align: left">Vulnerability assessment</td>
<td style="vertical-align: top; text-align: left">MEREC</td>
<td style="vertical-align: top; text-align: left">Reliable ranking</td>
<td style="vertical-align: top; text-align: left">Shows robustness</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Ecer and Ayçin (<xref ref-type="bibr" rid="j_infor618_ref_023">2023</xref>)</td>
<td style="vertical-align: top; text-align: left">Innovation performance</td>
<td style="vertical-align: top; text-align: left">MEREC</td>
<td style="vertical-align: top; text-align: left">Comparative clarity</td>
<td style="vertical-align: top; text-align: left">Suitable for multi-criteria data</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Yaşar and Ünlü (<xref ref-type="bibr" rid="j_infor618_ref_105">2023</xref>)</td>
<td style="vertical-align: top; text-align: left">Environmental universities</td>
<td style="vertical-align: top; text-align: left">MEREC</td>
<td style="vertical-align: top; text-align: left">Strong separation</td>
<td style="vertical-align: top; text-align: left">Cross-domain strength</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Oğuz and Satir (<xref ref-type="bibr" rid="j_infor618_ref_073">2024</xref>)</td>
<td style="vertical-align: top; text-align: left">Financial performance</td>
<td style="vertical-align: top; text-align: left">MEREC</td>
<td style="vertical-align: top; text-align: left">Effective weights</td>
<td style="vertical-align: top; text-align: left">Direct relevance</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Elsayed (<xref ref-type="bibr" rid="j_infor618_ref_024">2024</xref>)</td>
<td style="vertical-align: top; text-align: left">Smart building</td>
<td style="vertical-align: top; text-align: left">MEREC</td>
<td style="vertical-align: top; text-align: left">High objectivity</td>
<td style="vertical-align: top; text-align: left">Supports technical applications</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Kara <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_043">2024a</xref>)</td>
<td style="vertical-align: top; text-align: left">Türkiye competitiveness</td>
<td style="vertical-align: top; text-align: left">MEREC</td>
<td style="vertical-align: top; text-align: left">Objective evaluation</td>
<td style="vertical-align: top; text-align: left">Supports economic applications</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Mastilo <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_065">2024</xref>)</td>
<td style="vertical-align: top; text-align: left">Banks in Bosnia-Herzegovina</td>
<td style="vertical-align: top; text-align: left">MEREC</td>
<td style="vertical-align: top; text-align: left">Effective financial ranking</td>
<td style="vertical-align: top; text-align: left">Finance-focused validation</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Komasi <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_055">2025</xref>)</td>
<td style="vertical-align: top; text-align: left">Sustainable industry</td>
<td style="vertical-align: top; text-align: left">MEREC</td>
<td style="vertical-align: top; text-align: left">Strong multi-criteria capability</td>
<td style="vertical-align: top; text-align: left">Shows robustness</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">Pelit and Avşar (<xref ref-type="bibr" rid="j_infor618_ref_076">2025</xref>)</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">Carbon emission</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">MEREC</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">Accurate classification</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">Useful for environmental finance</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="j_infor618_s_005">
<label>2.3</label>
<title>Literature Review on the WEDBA Method</title>
<p>The final stage of the literature review involved summarizing the body of work related to the WEDBA (Weighted Euclidean Distance Based Approach) method. This technique has found extensive application across a diverse set of fields. Notable uses include the evaluation of e-learning websites (Garg, <xref ref-type="bibr" rid="j_infor618_ref_031">2017</xref>), selection of software reliability growth models (Gupta <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_033">2018</xref>), and the assessment of production system flexibility (Jain and Ajmera, <xref ref-type="bibr" rid="j_infor618_ref_039">2019</xref>).</p>
<p>WEDBA has also been applied to various machinery and technological selection problems, such as stacker selection (Ulutaş, <xref ref-type="bibr" rid="j_infor618_ref_100">2020</xref>) and the determination of appropriate blockchain technology (Kaska, <xref ref-type="bibr" rid="j_infor618_ref_048">2020</xref>), as well as technology selection for vertical farm alternatives (Tolga and Başar, <xref ref-type="bibr" rid="j_infor618_ref_098">2022</xref>).</p>
<p>Furthermore, the method is a popular tool in financial and performance analysis: it has been used for the evaluation of financial performance (Işık, <xref ref-type="bibr" rid="j_infor618_ref_035">2021</xref>; Erzurumlu and Gençtürk, <xref ref-type="bibr" rid="j_infor618_ref_027">2025</xref>), assessing the performance of banks (Keskin and Türkoğlu, <xref ref-type="bibr" rid="j_infor618_ref_052">2022</xref>; Şimşek, <xref ref-type="bibr" rid="j_infor618_ref_095">2022</xref>), and the evaluation of companies operating in the private pension system (Tuş and Aytaç Adalı, <xref ref-type="bibr" rid="j_infor618_ref_099">2025</xref>). Other significant applications include the evaluation of foundation universities (Demir, <xref ref-type="bibr" rid="j_infor618_ref_020">2021</xref>), analysing the performance of regions concerning information technology use (Ecemiş and Coşkun, <xref ref-type="bibr" rid="j_infor618_ref_022">2022</xref>), and cloud service provider selection (Arman and Kundakcı, <xref ref-type="bibr" rid="j_infor618_ref_007">2023</xref>).</p>
<p>On a broader scale, WEDBA has been instrumental in evaluating economic freedom sub-criteria (Karaköy <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_047">2023</xref>), assessing supply chain performance of countries (Kara <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_045">2024b</xref>), airport performance (Işıldak <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_036">2023</xref>), and the academic achievements of Turkish universities (Kara <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_044">2024c</xref>). Studies related to the WEDBA method were summarized and presented in Table <xref rid="j_infor618_tab_003">3</xref>.</p>
<table-wrap id="j_infor618_tab_003">
<label>Table 3</label>
<caption>
<p>Summary of studies related to the MEREC method.</p>
</caption>
<table>
<thead>
<tr>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Study</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Application area</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Method</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Key Findings</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Relevance</td>
</tr>
</thead>
<tbody>
<tr>
<td style="vertical-align: top; text-align: left">Garg (<xref ref-type="bibr" rid="j_infor618_ref_031">2017</xref>)</td>
<td style="vertical-align: top; text-align: left">E-learning</td>
<td style="vertical-align: top; text-align: left">WEDBA</td>
<td style="vertical-align: top; text-align: left">Clear ranking</td>
<td style="vertical-align: top; text-align: left">Early usage validation</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Gupta <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_033">2018</xref>)</td>
<td style="vertical-align: top; text-align: left">Software reliability</td>
<td style="vertical-align: top; text-align: left">WEDBA</td>
<td style="vertical-align: top; text-align: left">Strong discrimination</td>
<td style="vertical-align: top; text-align: left">Technical validation</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Jain and Ajmera (<xref ref-type="bibr" rid="j_infor618_ref_039">2019</xref>)</td>
<td style="vertical-align: top; text-align: left">Production flexibility</td>
<td style="vertical-align: top; text-align: left">WEDBA</td>
<td style="vertical-align: top; text-align: left">Effective evaluation</td>
<td style="vertical-align: top; text-align: left">Confirms adaptability</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Ulutaş (<xref ref-type="bibr" rid="j_infor618_ref_100">2020</xref>)</td>
<td style="vertical-align: top; text-align: left">Stacker selection</td>
<td style="vertical-align: top; text-align: left">WEDBA</td>
<td style="vertical-align: top; text-align: left">Precise rankings</td>
<td style="vertical-align: top; text-align: left">Practical relevance</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Kaska (<xref ref-type="bibr" rid="j_infor618_ref_048">2020</xref>)</td>
<td style="vertical-align: top; text-align: left">Blockchain tech</td>
<td style="vertical-align: top; text-align: left">WEDBA</td>
<td style="vertical-align: top; text-align: left">Good classification power</td>
<td style="vertical-align: top; text-align: left">Modern tech evaluation</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Işık (<xref ref-type="bibr" rid="j_infor618_ref_035">2021</xref>)</td>
<td style="vertical-align: top; text-align: left">Financial performance</td>
<td style="vertical-align: top; text-align: left">WEDBA</td>
<td style="vertical-align: top; text-align: left">Clear financial ranking</td>
<td style="vertical-align: top; text-align: left">Direct relevance</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Demir (<xref ref-type="bibr" rid="j_infor618_ref_020">2021</xref>)</td>
<td style="vertical-align: top; text-align: left">Foundation universities</td>
<td style="vertical-align: top; text-align: left">WEDBA</td>
<td style="vertical-align: top; text-align: left">High discriminative power</td>
<td style="vertical-align: top; text-align: left">Shows flexibility</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Keskin and Türkoğlu (<xref ref-type="bibr" rid="j_infor618_ref_052">2022</xref>)</td>
<td style="vertical-align: top; text-align: left">Bank performance</td>
<td style="vertical-align: top; text-align: left">WEDBA</td>
<td style="vertical-align: top; text-align: left">Accurate ranking</td>
<td style="vertical-align: top; text-align: left">Finance-specific</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Tolga and Başar (<xref ref-type="bibr" rid="j_infor618_ref_098">2022</xref>)</td>
<td style="vertical-align: top; text-align: left">Vertical farming</td>
<td style="vertical-align: top; text-align: left">WEDBA</td>
<td style="vertical-align: top; text-align: left">Effective multi-criteria</td>
<td style="vertical-align: top; text-align: left">Supports diverse data</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Şimşek (<xref ref-type="bibr" rid="j_infor618_ref_095">2022</xref>)</td>
<td style="vertical-align: top; text-align: left">Regional IT usage</td>
<td style="vertical-align: top; text-align: left">WEDBA</td>
<td style="vertical-align: top; text-align: left">Clear regional gaps</td>
<td style="vertical-align: top; text-align: left">Macro-level performance</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Arman and Kundakcı (<xref ref-type="bibr" rid="j_infor618_ref_007">2023</xref>)</td>
<td style="vertical-align: top; text-align: left">Cloud services</td>
<td style="vertical-align: top; text-align: left">WEDBA</td>
<td style="vertical-align: top; text-align: left">Strong performance differentiation</td>
<td style="vertical-align: top; text-align: left">Coherence with this study</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Karaköy <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_047">2023</xref>)</td>
<td style="vertical-align: top; text-align: left">Economic freedom</td>
<td style="vertical-align: top; text-align: left">WEDBA</td>
<td style="vertical-align: top; text-align: left">Effective sub-criteria scoring</td>
<td style="vertical-align: top; text-align: left">Economic relevance</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Işıldak <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_036">2023</xref>)</td>
<td style="vertical-align: top; text-align: left">Airport performance</td>
<td style="vertical-align: top; text-align: left">WEDBA</td>
<td style="vertical-align: top; text-align: left">Accurate ranking</td>
<td style="vertical-align: top; text-align: left">Operation-focused usage</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Kara <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_045">2024b</xref>)</td>
<td style="vertical-align: top; text-align: left">Supply chain</td>
<td style="vertical-align: top; text-align: left">WEDBA</td>
<td style="vertical-align: top; text-align: left">Country-level ranking</td>
<td style="vertical-align: top; text-align: left">Macro applications</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Kara <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_044">2024c</xref>)</td>
<td style="vertical-align: top; text-align: left">University achievements</td>
<td style="vertical-align: top; text-align: left">WEDBA</td>
<td style="vertical-align: top; text-align: left">Strong clarity</td>
<td style="vertical-align: top; text-align: left">Similar to MCDM structures</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">Tuş and Aytaç Adalı (<xref ref-type="bibr" rid="j_infor618_ref_099">2025</xref>)</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">Private pension firms</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">WEDBA</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">Financial clarity</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">Direct relevance</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The primary justification for selecting the HRP algorithm in this study rests on its capacity to minimize the risk of excessive concentration within portfolios and its ability to generate stable outcomes even when the covariance estimation is prone to errors. Nevertheless, the inherent limitations of HRP, namely the concatenation problem and its inability to accurately define the optimal number of clusters, necessitate a methodological adjustment. To directly address these issues, the Elbow method has been seamlessly integrated into the HRP framework.</p>
<p>The essential reason for incorporating the MEREC and WEDBA methods into the evaluation of HRP-derived portfolios is that these techniques offer objective, multi-criteria, and purely data-driven assessment capabilities. While MEREC provides an objective mechanism for calculating criterion weights, WEDBA ensures a more precise discernment of the performance differences among various investment alternatives. This synergistic combination significantly strengthens both the methodological originality and the practical applicability of the overall HRP-MCDM approach for professional investors.</p>
</sec>
</sec>
<sec id="j_infor618_s_006" sec-type="methods">
<label>3</label>
<title>Methodology</title>
<p>This research introduces a novel hybrid portfolio optimization model that integrates the HRP algorithm with MCDM methods for the analysis of stocks listed on the BIST 100 index. The core objective is two-fold: to significantly optimize risk distribution across the resulting portfolios and to evaluate firms’ financial performance, thereby yielding actionable, practical recommendations for investors. This integrated framework proceeds through three sequential, critical phases:</p>
<list>
<list-item id="j_infor618_li_001">
<label>•</label>
<p>Structural Determination: The first stage involves establishing the most suitable cluster configuration by incorporating the Elbow method directly into the HRP algorithm, which resolves the challenge of determining the optimal number of clusters.</p>
</list-item>
<list-item id="j_infor618_li_002">
<label>•</label>
<p>Performance Assessment: Next, an objective, data-driven financial performance evaluation is executed within every cluster established by HRP, utilizing both the MEREC and WEDBA multi-criteria decision methods.</p>
<p>
<fig id="j_infor618_fig_002">
<label>Fig. 2</label>
<caption>
<p>Flowchart of proposed approach.</p>
</caption>
<graphic xlink:href="infor618_g002.jpg"/>
</fig>
</p>
</list-item>
<list-item id="j_infor618_li_003">
<label>•</label>
<p>Portfolio Finalization: The third and final stage involves constructing the definitive portfolios by merging the HRP-derived weights (which reflect risk parity) with the MCDM-based rankings (which reflect financial performance).</p>
</list-item>
</list>
<p>The overall workflow of the proposed methodology is presented in Fig. <xref rid="j_infor618_fig_002">2</xref>. The proposed model underwent empirical testing using BIST 100 stock data spanning the 2018–2022 period. This analysis utilized seven distinct linkage method to ensure robustness. The process began with the initial phase, where the Elbow method was incorporated into the HRP framework. This direct integration was crucial for effectively mitigating the chaining effect and resolving the difficulty in determining the optimal number of clusters. Consequently, this enhancement allowed the HRP algorithm to construct risk clusters with greater accuracy and proportionality than the standard approach. The methodology then transitioned to the second phase, implementing the HRP-MCDM integrated structure. Here, the optimally structured clusters obtained via HRP were rigourously evaluated using both the MEREC and WEDBA methods. This step was essential for reliably identifying stocks with the highest potential performance within each established risk-based cluster. In the third and concluding phase, a direct comparative assessment was conducted. Portfolios generated using the standalone HRP method were benchmarked against those constructed using the hybrid HRP-MCDM approach. This comparison was designed to evaluate the relative effectiveness and superior performance of the integrated strategy.</p>
<p>Overall, the developed integrated framework successfully empowers investors to manage portfolio risk more effectively while simultaneously improving the quality of their financial performance evaluation. The synergistic combination of HRP’s inherent risk-based clustering capabilities with the multidimensional, objective evaluation features of MCDM methods provides a unique, practical, and valuable contribution to the field of portfolio optimization literature.</p>
<sec id="j_infor618_s_007">
<label>3.1</label>
<title>Hierarchical Risk Parity</title>
<p>Research in the field of finance consistently shows that investors fundamentally rely on two core strategies when constructing their portfolios. The first, rooted in traditional financial thought, emphasizes simple diversification. This traditional view operates on the principle that risk can be mitigated merely by ensuring assets are not excessively concentrated within a single group. The second, and more profound, approach originates from Harry Markowitz’s seminal 1952 work, which laid the groundwork for what is commonly known as Modern Portfolio Theory (MPT), the mean-variance framework, or Markowitz portfolio optimization. MPT fundamentally asserts that portfolio risk is best minimized not just by diversifying holdings, but by simultaneously considering the precise interrelationships (correlations) among those assets. Following Markowitz’s pioneering contribution, portfolio optimization problems have conventionally been formulated as quadratic programming models that map the risk–return profiles of various financial instruments (Pfitzinger and Katzke, <xref ref-type="bibr" rid="j_infor618_ref_077">2019</xref>). Given that this framework became the cornerstone of contemporary portfolio optimization, exhaustive research has been dedicated to mapping the portfolios located on the “efficient frontier”. This frontier represents the optimal set of portfolios that either maximize expected return for a predefined level of risk or minimize risk for a target return level (Nourahmadi and Sadeqi, <xref ref-type="bibr" rid="j_infor618_ref_071">2021</xref>; Reis <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_085">2023</xref>). Portfolios situated on this boundary are, by definition, deemed optimal.</p>
<p>Despite its enduring presence and theoretical importance, the practical application of MPT has introduced significant challenges. The concentration problem remains a persistent issue, often manifesting as optimal portfolios that allocate disproportionately large weights to a limited subset of assets. This drawback has prompted numerous studies to propose alternative mitigation strategies. Furthermore, as practitioners integrate an increasing number of assets into portfolios, the escalating complexity of inter-asset correlations necessitates deeper diversification, a process that ironically can lead to unstable solutions. De Prado (<xref ref-type="bibr" rid="j_infor618_ref_018">2016</xref>) famously dubbed this instability and pressure for excessive diversification the “Markowitz Curse” (De Prado, <xref ref-type="bibr" rid="j_infor618_ref_018">2016</xref>; Uyar, <xref ref-type="bibr" rid="j_infor618_ref_103">2019</xref>; Kaae <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_042">2022</xref>).</p>
<p>To bypass the deficiencies linked to quadratic optimization – such as instability, susceptibility to estimation errors, and concentration – De Prado (<xref ref-type="bibr" rid="j_infor618_ref_018">2016</xref>) introduced the Hierarchical Risk Parity (HRP) algorithm. HRP is a heuristic methodology explicitly designed to circumvent the practical limitations of MPT (De Prado, <xref ref-type="bibr" rid="j_infor618_ref_018">2016</xref>; De Lio Pérego, <xref ref-type="bibr" rid="j_infor618_ref_017">2021</xref>). It draws on concepts from mathematical modelling, graph theory, and machine learning, relying on hierarchical clustering to mirror the hypothesized layered structure inherent in financial markets. Crucially, HRP departs from the conventional assumption of direct pairwise relationships, acknowledging that many assets are only indirectly connected through a chain of intermediate relationships (De Lio Pérego, <xref ref-type="bibr" rid="j_infor618_ref_017">2021</xref>).</p>
<p>A substantial benefit of the HRP framework is its ability to eliminate the requirement to invert the covariance matrix. This matrix inversion is one of the primary drivers of estimation error in optimization, making HRP a more stable alternative (Sjöstrand <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_096">2020</xref>; Reis <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_085">2023</xref>). By utilizing a hierarchical clustering structure derived from machine learning, HRP successfully addresses the inherent weaknesses of conventional risk-based optimization methods (Jain and Jain, <xref ref-type="bibr" rid="j_infor618_ref_038">2019</xref>). The algorithm functions by iteratively assigning inverse-volatility weights to clusters of similar assets, recursively subdividing these clusters until each individual asset is isolated. This hierarchical process typically yields more stable portfolios that frequently demonstrate superior performance compared to those produced under MPT (Lagowski, <xref ref-type="bibr" rid="j_infor618_ref_058">2022</xref>).</p>
<p>HRP offers several clear advantages over the Markowitz model. While Markowitz-based portfolios are prone to assigning heavy weights to a limited number of assets, HRP achieves a more uniform distribution of risk through hierarchical diversification (Sen, <xref ref-type="bibr" rid="j_infor618_ref_090">2023</xref>). Furthermore, HRP applies inverse-variance weighting only within groups of correlated assets, and by narrowing these groups through recursive subdivision, it assigns weights solely among assets within the same cluster, rather than across the entire portfolio (Pfitzinger and Katzke, <xref ref-type="bibr" rid="j_infor618_ref_077">2019</xref>; Jain and Jain, <xref ref-type="bibr" rid="j_infor618_ref_038">2019</xref>; Bechis, <xref ref-type="bibr" rid="j_infor618_ref_011">2020</xref>). HRP also exhibits greater temporal stability than the Markowitz model, which is highly susceptible to abrupt allocation shifts triggered by minor changes in market conditions. HRP’s foundation in hierarchical structure makes it notably less sensitive to short-term volatility, resulting in smoother and more reliable allocation patterns over time (Sen, <xref ref-type="bibr" rid="j_infor618_ref_090">2023</xref>).</p>
<sec id="j_infor618_s_008">
<label>3.1.1</label>
<title>Tree Clustering</title>
<p>In the first stage of the HRP algorithm, tree clustering is performed. The steps to be performed in tree clustering, which is the first stage of the HRP algorithm, are explained in detail below (De Prado, <xref ref-type="bibr" rid="j_infor618_ref_018">2016</xref>; Uyar, <xref ref-type="bibr" rid="j_infor618_ref_103">2019</xref>; Lorenzo and Arroyo, <xref ref-type="bibr" rid="j_infor618_ref_062">2023</xref>).</p>
<p>In the tree clustering stage, a matrix of size <inline-formula id="j_infor618_ineq_001"><alternatives><mml:math>
<mml:mi mathvariant="italic">T</mml:mi>
<mml:mo>×</mml:mo>
<mml:mi mathvariant="italic">N</mml:mi></mml:math><tex-math><![CDATA[$T\times N$]]></tex-math></alternatives></inline-formula> with <italic>N</italic> variables over the time period <italic>T</italic> is first created. For each series, which is determined as <italic>N</italic> column-vectors, a clustering structure is to be created. For this process, a correlation matrix is first created in the form <inline-formula id="j_infor618_ineq_002"><alternatives><mml:math>
<mml:mi mathvariant="italic">ρ</mml:mi>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mo fence="true" stretchy="false">{</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">p</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo fence="true" stretchy="false">}</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>…</mml:mo>
<mml:mi mathvariant="italic">N</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[$\rho ={\{{p_{i,j}}\}_{i,j=1\dots N}}$]]></tex-math></alternatives></inline-formula>, <inline-formula id="j_infor618_ineq_003"><alternatives><mml:math>
<mml:mi mathvariant="italic">N</mml:mi>
<mml:mo>×</mml:mo>
<mml:mi mathvariant="italic">N</mml:mi></mml:math><tex-math><![CDATA[$N\times N$]]></tex-math></alternatives></inline-formula> with each element <inline-formula id="j_infor618_ineq_004"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">ρ</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mi mathvariant="italic">ρ</mml:mi>
<mml:mo fence="true" stretchy="false">[</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">X</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">X</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo fence="true" stretchy="false">]</mml:mo></mml:math><tex-math><![CDATA[${\rho _{i,j}}=\rho [{X_{i}},{X_{j}}]$]]></tex-math></alternatives></inline-formula>. The correlations are then used to calculate the distance measure between the series using equation (<xref rid="j_infor618_eq_001">1</xref>). 
<disp-formula id="j_infor618_eq_001">
<label>(1)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true" columnalign="right left" columnspacing="0pt">
<mml:mtr>
<mml:mtd class="align-odd"/>
<mml:mtd class="align-even">
<mml:mi mathvariant="italic">d</mml:mi>
<mml:mo>:</mml:mo>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">X</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">X</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:mo stretchy="false">⊂</mml:mo>
<mml:mi mathvariant="italic">B</mml:mi>
<mml:mo stretchy="false">→</mml:mo>
<mml:mi mathvariant="double-struck">R</mml:mi>
<mml:mo stretchy="false">∈</mml:mo>
<mml:mo fence="true" stretchy="false">[</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo fence="true" stretchy="false">]</mml:mo>
<mml:mo mathvariant="normal">,</mml:mo>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd class="align-odd"/>
<mml:mtd class="align-even">
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mi mathvariant="italic">d</mml:mi>
<mml:mo fence="true" stretchy="false">[</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">X</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">X</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo fence="true" stretchy="false">]</mml:mo>
<mml:mo>=</mml:mo>
<mml:msqrt>
<mml:mrow>
<mml:mn>0.5</mml:mn>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>−</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">ρ</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
</mml:mrow>
</mml:msqrt>
<mml:mo>.</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[\begin{aligned}{}& d:({X_{i}},{X_{j}})\subset B\to \mathbb{R}\in [0,1],\\ {} & {d_{i,j}}=d[{X_{i}},{X_{j}}]=\sqrt{0.5(1-{\rho _{i,j}})}.\end{aligned}\]]]></tex-math></alternatives>
</disp-formula>
</p>
<p>The expression <italic>B</italic> in this equation refers to the cartesian product of the set <inline-formula id="j_infor618_ineq_005"><alternatives><mml:math>
<mml:mo fence="true" stretchy="false">{</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mo>…</mml:mo>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mo>…</mml:mo>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">N</mml:mi>
<mml:mo fence="true" stretchy="false">}</mml:mo></mml:math><tex-math><![CDATA[$\{1,\dots ,i,\dots ,N\}$]]></tex-math></alternatives></inline-formula>. By calculating the distance measure, the distance matrix <inline-formula id="j_infor618_ineq_006"><alternatives><mml:math>
<mml:mi mathvariant="italic">X</mml:mi>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mo fence="true" stretchy="false">{</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo fence="true" stretchy="false">}</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>…</mml:mo>
<mml:mi mathvariant="italic">N</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[$X={\{{d_{i,j}}\}_{i,j=1\dots N}}$]]></tex-math></alternatives></inline-formula> of size <inline-formula id="j_infor618_ineq_007"><alternatives><mml:math>
<mml:mi mathvariant="italic">N</mml:mi>
<mml:mo>×</mml:mo>
<mml:mi mathvariant="italic">N</mml:mi></mml:math><tex-math><![CDATA[$N\times N$]]></tex-math></alternatives></inline-formula> is created, which is to be used in the clustering analysis. In the calculations, the <italic>X</italic> matrix is non-negative <inline-formula id="j_infor618_ineq_008"><alternatives><mml:math>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">d</mml:mi>
<mml:mo fence="true" stretchy="false">[</mml:mo>
<mml:mi mathvariant="italic">X</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">Y</mml:mi>
<mml:mo fence="true" stretchy="false">]</mml:mo>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo></mml:math><tex-math><![CDATA[$(d[X,Y])$]]></tex-math></alternatives></inline-formula>, coincidence <inline-formula id="j_infor618_ineq_009"><alternatives><mml:math>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">d</mml:mi>
<mml:mo fence="true" stretchy="false">[</mml:mo>
<mml:mi mathvariant="italic">X</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">Y</mml:mi>
<mml:mo fence="true" stretchy="false">]</mml:mo>
<mml:mo>=</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo stretchy="false">⇔</mml:mo>
<mml:mi mathvariant="italic">X</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi mathvariant="italic">Y</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo></mml:math><tex-math><![CDATA[$(d[X,Y]=0\Leftrightarrow X=Y)$]]></tex-math></alternatives></inline-formula>, symmetrical <inline-formula id="j_infor618_ineq_010"><alternatives><mml:math>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">d</mml:mi>
<mml:mo fence="true" stretchy="false">[</mml:mo>
<mml:mi mathvariant="italic">X</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">Y</mml:mi>
<mml:mo fence="true" stretchy="false">]</mml:mo>
<mml:mo>=</mml:mo>
<mml:mi mathvariant="italic">d</mml:mi>
<mml:mo fence="true" stretchy="false">[</mml:mo>
<mml:mi mathvariant="italic">Y</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">X</mml:mi>
<mml:mo fence="true" stretchy="false">]</mml:mo>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo></mml:math><tex-math><![CDATA[$(d[X,Y]=d[Y,X])$]]></tex-math></alternatives></inline-formula>, sub-additivity <inline-formula id="j_infor618_ineq_011"><alternatives><mml:math>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">d</mml:mi>
<mml:mo fence="true" stretchy="false">[</mml:mo>
<mml:mi mathvariant="italic">X</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">Z</mml:mi>
<mml:mo fence="true" stretchy="false">]</mml:mo>
<mml:mo>=</mml:mo>
<mml:mi mathvariant="italic">d</mml:mi>
<mml:mo fence="true" stretchy="false">[</mml:mo>
<mml:mi mathvariant="italic">X</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">Y</mml:mi>
<mml:mo fence="true" stretchy="false">]</mml:mo>
<mml:mo>+</mml:mo>
<mml:mi mathvariant="italic">d</mml:mi>
<mml:mo fence="true" stretchy="false">[</mml:mo>
<mml:mi mathvariant="italic">Y</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">Z</mml:mi>
<mml:mo fence="true" stretchy="false">]</mml:mo>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo></mml:math><tex-math><![CDATA[$(d[X,Z]=d[X,Y]+d[Y,Z])$]]></tex-math></alternatives></inline-formula>.</p>
<p>The second step of tree clustering is to calculate the Euclidean distances between the columns of the matrix. Equation (<xref rid="j_infor618_eq_002">2</xref>) is used for this process. 
<disp-formula id="j_infor618_eq_002">
<label>(2)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true" columnalign="right left" columnspacing="0pt">
<mml:mtr>
<mml:mtd class="align-odd"/>
<mml:mtd class="align-even">
<mml:mover accent="true">
<mml:mrow>
<mml:mi mathvariant="italic">d</mml:mi>
</mml:mrow>
<mml:mo>ˇ</mml:mo></mml:mover>
<mml:mo>:</mml:mo>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">D</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">D</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:mo stretchy="false">⊂</mml:mo>
<mml:mi mathvariant="italic">B</mml:mi>
<mml:mo stretchy="false">→</mml:mo>
<mml:mi mathvariant="double-struck">R</mml:mi>
<mml:mo stretchy="false">∈</mml:mo>
<mml:mo fence="true" stretchy="false">[</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:msqrt>
<mml:mrow>
<mml:mi mathvariant="italic">N</mml:mi>
</mml:mrow>
</mml:msqrt>
<mml:mo fence="true" stretchy="false">]</mml:mo>
<mml:mo mathvariant="normal">,</mml:mo>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd class="align-odd"/>
<mml:mtd class="align-even">
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi mathvariant="italic">d</mml:mi>
</mml:mrow>
<mml:mo>ˇ</mml:mo></mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo><mml:mover accent="true">
<mml:mrow>
<mml:mi mathvariant="italic">d</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">˜</mml:mo></mml:mover>
<mml:mo fence="true" stretchy="false">[</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">D</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">D</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo fence="true" stretchy="false">]</mml:mo>
<mml:msqrt>
<mml:mrow>
<mml:munderover accentunder="false" accent="false">
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:mo largeop="true" movablelimits="false">∑</mml:mo></mml:mstyle>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">n</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">N</mml:mi>
</mml:mrow>
</mml:munderover>
<mml:msup>
<mml:mrow>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">n</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>−</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">n</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:msqrt>
<mml:mo>.</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[\begin{aligned}{}& \check{d}:({D_{i}},{D_{j}})\subset B\to \mathbb{R}\in [0,\sqrt{N}],\\ {} & {\check{d}_{i,j}}=\tilde{d}[{D_{i}},{D_{j}}]\sqrt{{\sum \limits_{n=1}^{N}}{({d_{n,i}}-{d_{n,j}})^{2}}}.\end{aligned}\]]]></tex-math></alternatives>
</disp-formula>
</p>
<p>In this equation, <inline-formula id="j_infor618_ineq_012"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${d_{i,j}}$]]></tex-math></alternatives></inline-formula> is defined as the elements of the matrix <italic>X</italic>, while <inline-formula id="j_infor618_ineq_013"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi mathvariant="italic">d</mml:mi>
</mml:mrow>
<mml:mo>ˇ</mml:mo></mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${\check{d}_{i,j}}$]]></tex-math></alternatives></inline-formula> is defined as the elements of the matrix <italic>D</italic>.</p>
<p>In the third step of the tree clustering phase, the clustering algorithm is applied. In this step, each pair of columns is paired to <inline-formula id="j_infor618_ineq_014"><alternatives><mml:math>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msup></mml:math><tex-math><![CDATA[${i^{\ast }}$]]></tex-math></alternatives></inline-formula> and <inline-formula id="j_infor618_ineq_015"><alternatives><mml:math>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msup></mml:math><tex-math><![CDATA[${j^{\ast }}$]]></tex-math></alternatives></inline-formula> clusters and transformed according to the linkage method to obtain the matrix <italic>u</italic> [1]. There are seven linkage methods in the literature: single, complete, average, weighted, centroid, Ward and median. These linkage methods are explained below (Uyar, <xref ref-type="bibr" rid="j_infor618_ref_103">2019</xref>).</p>
<p>The so-called single linkage method was developed by Sneath in 1957 in the Nearest Point Algorithm and is the proximity of the closest elements of two clusters (Rajabi <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_082">2020</xref>; Nanakorn and Palmgren, <xref ref-type="bibr" rid="j_infor618_ref_069">2021</xref>). The single linkage method is calculated using equation (<xref rid="j_infor618_eq_003">3</xref>). 
<disp-formula id="j_infor618_eq_003">
<label>(3)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true">
<mml:mtr>
<mml:mtd>
<mml:mo mathvariant="normal" fence="true" maxsize="1.19em" minsize="1.19em">(</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo mathvariant="normal" fence="true" maxsize="1.19em" minsize="1.19em">)</mml:mo>
<mml:mo>=</mml:mo>
<mml:mo movablelimits="false">argmin</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo stretchy="false">≠</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo fence="true" stretchy="false">{</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi mathvariant="italic">d</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">˜</mml:mo></mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo fence="true" stretchy="false">}</mml:mo>
<mml:mo>.</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[ \big({i^{\ast }},{j^{\ast }}\big)=\operatorname{argmin}{(i,j)_{i\ne j}}\{{\tilde{d}_{i,j}}\}.\]]]></tex-math></alternatives>
</disp-formula>
</p>
<p>In the complete linkage method, which was developed by Sorensen in 1948 and is known as the furthest point or Voor Hess algorithm, the similarity between two clusters is the proximity of the most distant elements of the two clusters, in contrast to the single linkage method (Rajabi <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_082">2020</xref>). The complete linkage method is calculated using equation (<xref rid="j_infor618_eq_004">4</xref>). 
<disp-formula id="j_infor618_eq_004">
<label>(4)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true">
<mml:mtr>
<mml:mtd>
<mml:mo mathvariant="normal" fence="true" maxsize="1.19em" minsize="1.19em">(</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo mathvariant="normal" fence="true" maxsize="1.19em" minsize="1.19em">)</mml:mo>
<mml:mo>=</mml:mo>
<mml:mo movablelimits="false">argmax</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo stretchy="false">≠</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo fence="true" stretchy="false">{</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi mathvariant="italic">d</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">˜</mml:mo></mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo fence="true" stretchy="false">}</mml:mo>
<mml:mo>.</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[ \big({i^{\ast }},{j^{\ast }}\big)=\operatorname{argmax}{(i,j)_{i\ne j}}\{{\tilde{d}_{i,j}}\}.\]]]></tex-math></alternatives>
</disp-formula>
</p>
<p>The Unweighted Pair Group Method with Arithmetic mean (UPGMA) algorithm developed by Sokal and Michener in 1958, which is also known as the mean linkage method (average), determines the similarity between two clusters by averaging the distance of all elements in two clusters to the other cluster elements (Rajabi <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_082">2020</xref>). The average linkage method is calculated using equation (<xref rid="j_infor618_eq_005">5</xref>). The expressions <inline-formula id="j_infor618_ineq_016"><alternatives><mml:math>
<mml:mo stretchy="false">|</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo stretchy="false">|</mml:mo>
<mml:mspace width="2.5pt"/>
<mml:mtext>and</mml:mtext>
<mml:mspace width="2.5pt"/>
<mml:mo stretchy="false">|</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo stretchy="false">|</mml:mo></mml:math><tex-math><![CDATA[$|{i^{\ast }}|\hspace{2.5pt}\text{and}\hspace{2.5pt}|{j^{\ast }}|$]]></tex-math></alternatives></inline-formula>in this equation represent the number of times each cluster belongs to each cluster. 
<disp-formula id="j_infor618_eq_005">
<label>(5)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true">
<mml:mtr>
<mml:mtd>
<mml:mo mathvariant="normal" fence="true" maxsize="1.19em" minsize="1.19em">(</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo mathvariant="normal" fence="true" maxsize="1.19em" minsize="1.19em">)</mml:mo>
<mml:mo>=</mml:mo><mml:mstyle displaystyle="true">
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mo stretchy="false">|</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo stretchy="false">|</mml:mo>
<mml:mo stretchy="false">|</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo stretchy="false">|</mml:mo>
</mml:mrow>
</mml:mfrac>
</mml:mstyle>
<mml:munder>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:mo largeop="true" movablelimits="false">∑</mml:mo></mml:mstyle>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:munder>
<mml:mo fence="true" stretchy="false">{</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi mathvariant="italic">d</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">˜</mml:mo></mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo fence="true" stretchy="false">}</mml:mo>
<mml:mo>.</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[ \big({i^{\ast }},{j^{\ast }}\big)=\frac{1}{|{i^{\ast }}||{j^{\ast }}|}\sum \limits_{i,j}\{{\tilde{d}_{i,j}}\}.\]]]></tex-math></alternatives>
</disp-formula>
</p>
<p>The Weighted Pairwise Grouping Method with Arithmetic Mean (WPGMA), developed by McQuitty in 1966 and also known as the weighted linkage method, is calculated using the following equation (<xref rid="j_infor618_eq_006">6</xref>). The <inline-formula id="j_infor618_ineq_017"><alternatives><mml:math>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msup></mml:math><tex-math><![CDATA[${i^{\ast }}$]]></tex-math></alternatives></inline-formula>cluster in this equation is reconstructed using the <italic>s</italic> and <italic>t</italic> clusters and weighted again using this new group of <inline-formula id="j_infor618_ineq_018"><alternatives><mml:math>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msup></mml:math><tex-math><![CDATA[${j^{\ast }}$]]></tex-math></alternatives></inline-formula> clusters. 
<disp-formula id="j_infor618_eq_006">
<label>(6)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true">
<mml:mtr>
<mml:mtd>
<mml:mo mathvariant="normal" fence="true" maxsize="1.19em" minsize="1.19em">(</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo mathvariant="normal" fence="true" maxsize="1.19em" minsize="1.19em">)</mml:mo>
<mml:mo>=</mml:mo><mml:mstyle displaystyle="true">
<mml:mfrac>
<mml:mrow>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mo fence="true" stretchy="false">{</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi mathvariant="italic">d</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">˜</mml:mo></mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">s</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo fence="true" stretchy="false">}</mml:mo>
<mml:mo>+</mml:mo>
<mml:mo fence="true" stretchy="false">{</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi mathvariant="italic">d</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">˜</mml:mo></mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo fence="true" stretchy="false">}</mml:mo>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:mfrac>
</mml:mstyle>
<mml:mo>.</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[ \big({i^{\ast }},{j^{\ast }}\big)=\frac{(\{{\tilde{d}_{s,j}}\}+\{{\tilde{d}_{t,j}}\})}{2}.\]]]></tex-math></alternatives>
</disp-formula>
</p>
<p>The centroid developed by Sokal and Michener in 1958, also known as UPGMC (Unweighted Pair Group Method using Centroids), is calculated using equation (<xref rid="j_infor618_eq_007">7</xref>). In this equation, <inline-formula id="j_infor618_ineq_019"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi mathvariant="italic">c</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">→</mml:mo></mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${\vec{c}_{i}}$]]></tex-math></alternatives></inline-formula> and <inline-formula id="j_infor618_ineq_020"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi mathvariant="italic">c</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">→</mml:mo></mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${\vec{c}_{j}}$]]></tex-math></alternatives></inline-formula> represent the centroids of <italic>c</italic> clusters. 
<disp-formula id="j_infor618_eq_007">
<label>(7)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true">
<mml:mtr>
<mml:mtd>
<mml:mo mathvariant="normal" fence="true" maxsize="1.19em" minsize="1.19em">(</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo mathvariant="normal" fence="true" maxsize="1.19em" minsize="1.19em">)</mml:mo>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mo fence="true" maxsize="1.19em" minsize="1.19em" stretchy="true">‖</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi mathvariant="italic">c</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">→</mml:mo></mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>−</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi mathvariant="italic">c</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">→</mml:mo></mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo fence="true" maxsize="1.19em" minsize="1.19em" stretchy="true">‖</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>.</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[ \big({i^{\ast }},{j^{\ast }}\big)={\big\| {\vec{c}_{i}}-{\vec{c}_{j}}\big\| _{2}}.\]]]></tex-math></alternatives>
</disp-formula>
</p>
<p>The Ward connectivity method developed by Ward in 1963, also known as the Stepwise Algorithm, is calculated using equation (<xref rid="j_infor618_eq_008">8</xref>). 
<disp-formula id="j_infor618_eq_008">
<label>(8)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true">
<mml:mtr>
<mml:mtd>
<mml:mo mathvariant="normal" fence="true" maxsize="1.19em" minsize="1.19em">(</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo mathvariant="normal" fence="true" maxsize="1.19em" minsize="1.19em">)</mml:mo>
<mml:mo>=</mml:mo>
<mml:msqrt>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:mfrac>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mo stretchy="false">|</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo stretchy="false">|</mml:mo>
<mml:mo stretchy="false">|</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo stretchy="false">|</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mo stretchy="false">|</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo stretchy="false">|</mml:mo>
<mml:mo>+</mml:mo>
<mml:mo stretchy="false">|</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo stretchy="false">|</mml:mo>
</mml:mrow>
</mml:mfrac>
</mml:mstyle>
</mml:mrow>
</mml:msqrt>
<mml:msub>
<mml:mrow>
<mml:mo fence="true" maxsize="1.19em" minsize="1.19em" stretchy="true">‖</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi mathvariant="italic">c</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">→</mml:mo></mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>−</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi mathvariant="italic">c</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">→</mml:mo></mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo fence="true" maxsize="1.19em" minsize="1.19em" stretchy="true">‖</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>.</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[ \big({i^{\ast }},{j^{\ast }}\big)=\sqrt{\frac{2|{i^{\ast }}||{j^{\ast }}|}{|{i^{\ast }}|+|{j^{\ast }}|}}{\big\| {\vec{c}_{i}}-{\vec{c}_{j}}\big\| _{2}}.\]]]></tex-math></alternatives>
</disp-formula>
</p>
<p>In 1967, Gower developed the algorithm Weighted Pair Group Method using Centroids (WPGMC), also known as the median connectivity method, which is calculated using equation (<xref rid="j_infor618_eq_009">9</xref>). The expressions <inline-formula id="j_infor618_ineq_021"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi mathvariant="italic">ω</mml:mi>
</mml:mrow>
<mml:mo stretchy="true">→</mml:mo></mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${\overrightarrow{\omega }_{i}}$]]></tex-math></alternatives></inline-formula> and <inline-formula id="j_infor618_ineq_022"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi mathvariant="italic">ω</mml:mi>
</mml:mrow>
<mml:mo stretchy="true">→</mml:mo></mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${\overrightarrow{\omega }_{j}}$]]></tex-math></alternatives></inline-formula> in this equation indicate the median values of <inline-formula id="j_infor618_ineq_023"><alternatives><mml:math>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msup></mml:math><tex-math><![CDATA[${i^{\ast }}$]]></tex-math></alternatives></inline-formula>and <inline-formula id="j_infor618_ineq_024"><alternatives><mml:math>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msup></mml:math><tex-math><![CDATA[${j^{\ast }}$]]></tex-math></alternatives></inline-formula> clusters. 
<disp-formula id="j_infor618_eq_009">
<label>(9)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true">
<mml:mtr>
<mml:mtd>
<mml:mo mathvariant="normal" fence="true" maxsize="1.19em" minsize="1.19em">(</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo mathvariant="normal" fence="true" maxsize="1.19em" minsize="1.19em">)</mml:mo>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mo fence="true" maxsize="1.19em" minsize="1.19em" stretchy="true">‖</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi mathvariant="italic">ω</mml:mi>
</mml:mrow>
<mml:mo stretchy="true">→</mml:mo></mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>−</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi mathvariant="italic">ω</mml:mi>
</mml:mrow>
<mml:mo stretchy="true">→</mml:mo></mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo fence="true" maxsize="1.19em" minsize="1.19em" stretchy="true">‖</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>.</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[ \big({i^{\ast }},{j^{\ast }}\big)={\big\| {\overrightarrow{\omega }_{i}}-{\overrightarrow{\omega }_{j}}\big\| _{2}}.\]]]></tex-math></alternatives>
</disp-formula>
</p>
<p>After the tree clustering process has been carried out, a “linkage matrix” of the size <inline-formula id="j_infor618_ineq_025"><alternatives><mml:math>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">N</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:mo>×</mml:mo>
<mml:mn>4</mml:mn></mml:math><tex-math><![CDATA[$(N-1)\times 4$]]></tex-math></alternatives></inline-formula> and the form <inline-formula id="j_infor618_ineq_026"><alternatives><mml:math>
<mml:mi mathvariant="italic">Y</mml:mi>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mo fence="true" stretchy="false">{</mml:mo>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">m</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mspace width="2.5pt"/>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">m</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mspace width="2.5pt"/>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">m</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mn>3</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mspace width="2.5pt"/>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">m</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mn>4</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:mo fence="true" stretchy="false">}</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">m</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mo>…</mml:mo>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">N</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[$Y={\{({y_{m,1}},\hspace{2.5pt}{y_{m,2}},\hspace{2.5pt}{y_{m,3}},\hspace{2.5pt}{y_{m,4}})\}_{m=1,\dots ,N-1}}$]]></tex-math></alternatives></inline-formula> is obtained. The resulting linkage matrix <inline-formula id="j_infor618_ineq_027"><alternatives><mml:math>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">Y</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo></mml:math><tex-math><![CDATA[$(Y)$]]></tex-math></alternatives></inline-formula> contains four linkage data for each cluster. In the matrix, the “<inline-formula id="j_infor618_ineq_028"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">m</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mspace width="2.5pt"/>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">m</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mn>2</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mo>″</mml:mo>
</mml:mrow>
</mml:msubsup></mml:math><tex-math><![CDATA[${y_{m,1}},\hspace{2.5pt}{y^{\prime\prime }_{m,2}}$]]></tex-math></alternatives></inline-formula> elements represent the component data; the <inline-formula id="j_infor618_ineq_029"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">m</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mn>3</mml:mn>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${y_{m,3}}$]]></tex-math></alternatives></inline-formula> element represents the distance between the components <inline-formula id="j_infor618_ineq_030"><alternatives><mml:math>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">m</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mn>3</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi mathvariant="italic">d</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">˜</mml:mo></mml:mover>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">m</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">m</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo></mml:math><tex-math><![CDATA[$({y_{m,3}}={\tilde{d}_{{y_{m,1}},{y_{m,2}}}})$]]></tex-math></alternatives></inline-formula>; <inline-formula id="j_infor618_ineq_031"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">m</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mn>4</mml:mn>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${y_{m,4}}$]]></tex-math></alternatives></inline-formula> and other elements <inline-formula id="j_infor618_ineq_032"><alternatives><mml:math>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">m</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mn>4</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>⩽</mml:mo>
<mml:mi mathvariant="italic">N</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo></mml:math><tex-math><![CDATA[$({y_{m,4}}\leqslant N)$]]></tex-math></alternatives></inline-formula> represent the original number of connected elements (Uyar, <xref ref-type="bibr" rid="j_infor618_ref_103">2019</xref>).</p>
</sec>
<sec id="j_infor618_s_009">
<label>3.1.2</label>
<title>Quasi-Diagonalization</title>
<p>The second stage of the HRP algorithm is quasi-diagonalization. In quasi-diagonalization, the largest values in the rows and columns of the covariance matrix are arranged along the diagonal. In this process, assets with high covariance are placed together, while assets with low covariance are placed far apart. The process to be performed in the semi-diagonalization phase groups all elements of the link matrix as recursive <inline-formula id="j_infor618_ineq_033"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">N</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${y_{N-1,1}}$]]></tex-math></alternatives></inline-formula>, <inline-formula id="j_infor618_ineq_034"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">N</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${y_{N-1,2}}$]]></tex-math></alternatives></inline-formula> (De Prado, <xref ref-type="bibr" rid="j_infor618_ref_018">2016</xref>).</p>
<p>Fig. <xref rid="j_infor618_fig_003">3</xref> shows the state of the entities before the quasi-diagonalization process. Fig. <xref rid="j_infor618_fig_004">4</xref> shows the state of the covariance matrices after the second step of the HRP algorithm, quasi-diagonalization. The colours in both matrices represent high and low covariances. Since the darker colours here have higher covariances, these units are concentrated around the diagonal.</p>
<fig id="j_infor618_fig_003">
<label>Fig. 3</label>
<caption>
<p>Unclustered correlation matrix (Bechis, <xref ref-type="bibr" rid="j_infor618_ref_011">2020</xref>).</p>
</caption>
<graphic xlink:href="infor618_g003.jpg"/>
</fig>
<fig id="j_infor618_fig_004">
<label>Fig. 4</label>
<caption>
<p>Clustered correlation matrix (Bechis, <xref ref-type="bibr" rid="j_infor618_ref_011">2020</xref>).</p>
</caption>
<graphic xlink:href="infor618_g004.jpg"/>
</fig>
</sec>
<sec id="j_infor618_s_010">
<label>3.1.3</label>
<title>Recursive Bisection</title>
<p>Recursive bisection is the last stage of the HRP algorithm. This stage is extremely important, as it is the stage where the final weights of the securities in the portfolio are determined (Bechis, <xref ref-type="bibr" rid="j_infor618_ref_011">2020</xref>). In this stage, the weights of the securities are determined using a tree structure and inverse variance (Nanakorn and Palmgren, <xref ref-type="bibr" rid="j_infor618_ref_069">2021</xref>). The steps to be followed in the recursive bisection phase can be listed as follows (De Prado, <xref ref-type="bibr" rid="j_infor618_ref_018">2016</xref>):</p>
<list>
<list-item id="j_infor618_li_004">
<label>1)</label>
<p>Before starting to the algorithm, some definitions can be made as:</p>
<list>
<list-item id="j_infor618_li_005">
<label>a)</label>
<p>List of items are set as: <inline-formula id="j_infor618_ineq_035"><alternatives><mml:math>
<mml:mi mathvariant="italic">L</mml:mi>
<mml:mo>=</mml:mo>
<mml:mo fence="true" stretchy="false">{</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">L</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo fence="true" stretchy="false">}</mml:mo></mml:math><tex-math><![CDATA[$L=\{{L_{0}}\}$]]></tex-math></alternatives></inline-formula> ve <inline-formula id="j_infor618_ineq_036"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">L</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mo fence="true" stretchy="false">{</mml:mo>
<mml:mi mathvariant="italic">n</mml:mi>
<mml:mo fence="true" stretchy="false">}</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">n</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mo>…</mml:mo>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">N</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${L_{0}}={\{n\}_{n=1,\dots ,N}}$]]></tex-math></alternatives></inline-formula>,</p>
</list-item>
<list-item id="j_infor618_li_006">
<label>b)</label>
<p>A unit weight to all items is assigned: <inline-formula id="j_infor618_ineq_037"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">w</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn></mml:math><tex-math><![CDATA[${w_{1}}=1$]]></tex-math></alternatives></inline-formula>, <inline-formula id="j_infor618_ineq_038"><alternatives><mml:math>
<mml:mo>∀</mml:mo>
<mml:mi mathvariant="italic">n</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mo>…</mml:mo>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">N</mml:mi></mml:math><tex-math><![CDATA[$\forall n=1,\dots ,N$]]></tex-math></alternatives></inline-formula>.</p>
</list-item>
</list>
</list-item>
<list-item id="j_infor618_li_007">
<label>2)</label>
<p>If <inline-formula id="j_infor618_ineq_039"><alternatives><mml:math>
<mml:mo stretchy="false">|</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">L</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo stretchy="false">|</mml:mo>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mspace width="2.5pt"/>
<mml:mo>∀</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">L</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo stretchy="false">∈</mml:mo>
<mml:mi mathvariant="italic">L</mml:mi></mml:math><tex-math><![CDATA[$|{L_{i}}|=1,\hspace{2.5pt}\forall {L_{i}}\in L$]]></tex-math></alternatives></inline-formula>, then stop.</p>
</list-item>
<list-item id="j_infor618_li_008">
<label>3)</label>
<p>For each <inline-formula id="j_infor618_ineq_040"><alternatives><mml:math>
<mml:mo>∀</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">L</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo stretchy="false">∈</mml:mo>
<mml:mi mathvariant="italic">L</mml:mi></mml:math><tex-math><![CDATA[$\forall {L_{i}}\in L$]]></tex-math></alternatives></inline-formula> such that <inline-formula id="j_infor618_ineq_041"><alternatives><mml:math>
<mml:mo stretchy="false">|</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">L</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo stretchy="false">|</mml:mo>
<mml:mo mathvariant="normal">&gt;</mml:mo>
<mml:mn>1</mml:mn></mml:math><tex-math><![CDATA[$|{L_{i}}|\gt 1$]]></tex-math></alternatives></inline-formula>:</p>
<list>
<list-item id="j_infor618_li_009">
<label>a)</label>
<p><inline-formula id="j_infor618_ineq_042"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">L</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${L_{i}}$]]></tex-math></alternatives></inline-formula> is bisected into two subsets, <inline-formula id="j_infor618_ineq_043"><alternatives><mml:math>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">L</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
</mml:mrow>
</mml:msubsup>
<mml:mo>∪</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">L</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mn>2</mml:mn>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
</mml:mrow>
</mml:msubsup>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">L</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${L_{i}^{(1)}}\cup {L_{i}^{(2)}}={L_{i}}$]]></tex-math></alternatives></inline-formula>, here <inline-formula id="j_infor618_ineq_044"><alternatives><mml:math>
<mml:mo stretchy="false">|</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">L</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
</mml:mrow>
</mml:msubsup>
<mml:mo stretchy="false">|</mml:mo>
<mml:mo>=</mml:mo>
<mml:mo movablelimits="false">int</mml:mo>
<mml:mo maxsize="1.19em" minsize="1.19em" fence="true">[</mml:mo><mml:mstyle displaystyle="false">
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:mfrac>
</mml:mstyle>
<mml:mo stretchy="false">|</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">L</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
</mml:mrow>
</mml:msubsup>
<mml:mo stretchy="false">|</mml:mo>
<mml:mo maxsize="1.19em" minsize="1.19em" fence="true">]</mml:mo></mml:math><tex-math><![CDATA[$|{L_{i}^{(1)}}|=\operatorname{int}\big[\frac{1}{2}|{L_{i}^{(1)}}|\big]$]]></tex-math></alternatives></inline-formula>, and the order is maintained.</p>
</list-item>
<list-item id="j_infor618_li_010">
<label>b)</label>
<p>The variance of <inline-formula id="j_infor618_ineq_045"><alternatives><mml:math>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">L</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
</mml:mrow>
</mml:msubsup></mml:math><tex-math><![CDATA[${L_{i}^{(j)}}$]]></tex-math></alternatives></inline-formula>, <inline-formula id="j_infor618_ineq_046"><alternatives><mml:math>
<mml:mi mathvariant="italic">j</mml:mi>
<mml:mo>=</mml:mo>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mn>2</mml:mn>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo></mml:math><tex-math><![CDATA[$j=(1,2)$]]></tex-math></alternatives></inline-formula> is defined, as the quadratic form <inline-formula id="j_infor618_ineq_047"><alternatives><mml:math>
<mml:msubsup>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi mathvariant="italic">V</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">˜</mml:mo></mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
</mml:mrow>
</mml:msubsup>
<mml:mo stretchy="false">≡</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi mathvariant="italic">w</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">˜</mml:mo></mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mo>′</mml:mo>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:msubsup>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
</mml:mrow>
</mml:msubsup>
<mml:msubsup>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi mathvariant="italic">w</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">˜</mml:mo></mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
</mml:mrow>
</mml:msubsup></mml:math><tex-math><![CDATA[${\tilde{V}_{i}^{(j)}}\equiv {\tilde{w}_{i}^{{(j)^{\prime }}}}{V_{i}^{(j)}}{\tilde{w}_{i}^{(j)}}$]]></tex-math></alternatives></inline-formula>, where <inline-formula id="j_infor618_ineq_048"><alternatives><mml:math>
<mml:msubsup>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi mathvariant="italic">V</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">˜</mml:mo></mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
</mml:mrow>
</mml:msubsup></mml:math><tex-math><![CDATA[${\tilde{V}_{i}^{(j)}}$]]></tex-math></alternatives></inline-formula> is the covariance matrix between the constituents of the <inline-formula id="j_infor618_ineq_049"><alternatives><mml:math>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">L</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
</mml:mrow>
</mml:msubsup></mml:math><tex-math><![CDATA[${L_{i}^{(j)}}$]]></tex-math></alternatives></inline-formula> bisection, and <inline-formula id="j_infor618_ineq_050"><alternatives><mml:math>
<mml:msubsup>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi mathvariant="italic">w</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">˜</mml:mo></mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
</mml:mrow>
</mml:msubsup>
<mml:mo>=</mml:mo>
<mml:mtext>diag</mml:mtext>
<mml:msup>
<mml:mrow>
<mml:mo fence="true" stretchy="false">[</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
</mml:mrow>
</mml:msubsup>
<mml:mo fence="true" stretchy="false">]</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msup><mml:mstyle displaystyle="false">
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mtext>tr</mml:mtext>
<mml:mo fence="true" stretchy="false">[</mml:mo>
<mml:mtext>diag</mml:mtext>
<mml:msup>
<mml:mrow>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
</mml:mrow>
</mml:msubsup>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msup>
<mml:mo fence="true" stretchy="false">]</mml:mo>
</mml:mrow>
</mml:mfrac>
</mml:mstyle></mml:math><tex-math><![CDATA[${\tilde{w}_{i}^{(j)}}=\text{diag}{[{V_{i}^{(j)}}]^{-1}}\frac{1}{\text{tr}[\text{diag}{({V_{i}^{(j)}})^{-1}}]}$]]></tex-math></alternatives></inline-formula> where <inline-formula id="j_infor618_ineq_051"><alternatives><mml:math>
<mml:mtext>diag</mml:mtext>
<mml:mo fence="true" stretchy="false">[</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo fence="true" stretchy="false">]</mml:mo></mml:math><tex-math><![CDATA[$\text{diag}[.]$]]></tex-math></alternatives></inline-formula> and <inline-formula id="j_infor618_ineq_052"><alternatives><mml:math>
<mml:mo movablelimits="false">tr</mml:mo>
<mml:mo fence="true" stretchy="false">[</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo fence="true" stretchy="false">]</mml:mo></mml:math><tex-math><![CDATA[$\operatorname{tr}[.]$]]></tex-math></alternatives></inline-formula> are the diagonal and trace operators.</p>
</list-item>
<list-item id="j_infor618_li_011">
<label>c)</label>
<p>Compute the split factor: <inline-formula id="j_infor618_ineq_053"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">α</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>−</mml:mo><mml:mstyle displaystyle="false">
<mml:mfrac>
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi mathvariant="italic">V</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">˜</mml:mo></mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi mathvariant="italic">V</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">˜</mml:mo></mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
</mml:mrow>
</mml:msubsup>
<mml:mo>+</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi mathvariant="italic">V</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">˜</mml:mo></mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mn>2</mml:mn>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mfrac>
</mml:mstyle></mml:math><tex-math><![CDATA[${\alpha _{i}}=1-\frac{{\tilde{V}_{i}^{(1)}}}{{\tilde{V}_{i}^{(1)}}+{\tilde{V}_{i}^{(2)}}}$]]></tex-math></alternatives></inline-formula>, so that <inline-formula id="j_infor618_ineq_054"><alternatives><mml:math>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>⩽</mml:mo>
<mml:mi mathvariant="italic">α</mml:mi>
<mml:mo>⩽</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo></mml:math><tex-math><![CDATA[$(0\leqslant \alpha \leqslant 1)$]]></tex-math></alternatives></inline-formula>.</p>
</list-item>
<list-item id="j_infor618_li_012">
<label>d)</label>
<p><inline-formula id="j_infor618_ineq_055"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">w</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">n</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${w_{n}}$]]></tex-math></alternatives></inline-formula> allocations are re-scaled by a factor of <inline-formula id="j_infor618_ineq_056"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">α</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${\alpha _{i}}$]]></tex-math></alternatives></inline-formula>, <inline-formula id="j_infor618_ineq_057"><alternatives><mml:math>
<mml:mo>∀</mml:mo>
<mml:mi mathvariant="italic">n</mml:mi>
<mml:mo stretchy="false">∈</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">L</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
</mml:mrow>
</mml:msubsup></mml:math><tex-math><![CDATA[$\forall n\in {L_{i}^{(1)}}$]]></tex-math></alternatives></inline-formula>.</p>
</list-item>
<list-item id="j_infor618_li_013">
<label>e)</label>
<p><inline-formula id="j_infor618_ineq_058"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">w</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">n</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${w_{n}}$]]></tex-math></alternatives></inline-formula> allocations are re-scaled by a factor of <inline-formula id="j_infor618_ineq_059"><alternatives><mml:math>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>−</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">α</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo></mml:math><tex-math><![CDATA[$(1-{\alpha _{i}})$]]></tex-math></alternatives></inline-formula>, <inline-formula id="j_infor618_ineq_060"><alternatives><mml:math>
<mml:mo>∀</mml:mo>
<mml:mi mathvariant="italic">n</mml:mi>
<mml:mo stretchy="false">∈</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">L</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mn>2</mml:mn>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
</mml:mrow>
</mml:msubsup></mml:math><tex-math><![CDATA[$\forall n\in {L_{i}^{(2)}}$]]></tex-math></alternatives></inline-formula>.</p>
</list-item>
</list>
</list-item>
<list-item id="j_infor618_li_014">
<label>4)</label>
<p>Loop to step 2.</p>
</list-item>
</list>
<p>In the subsequent phase of recursive bisection, the last phase of the HRP algorithm, the portfolio weights obtained from the previous phase are divided into two separate parts, where these weights must be between zero and one <inline-formula id="j_infor618_ineq_061"><alternatives><mml:math>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>⩽</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">w</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>⩽</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo></mml:math><tex-math><![CDATA[$(0\leqslant {w_{i}}\leqslant 1)$]]></tex-math></alternatives></inline-formula> and the sum of the weights must equal one (<inline-formula id="j_infor618_ineq_062"><alternatives><mml:math>
<mml:mo>∀</mml:mo>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mo>…</mml:mo>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">N</mml:mi></mml:math><tex-math><![CDATA[$\forall i=1,\dots ,N$]]></tex-math></alternatives></inline-formula> ve <inline-formula id="j_infor618_ineq_063"><alternatives><mml:math>
<mml:msubsup>
<mml:mrow>
<mml:mo largeop="false" movablelimits="false">∑</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">N</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">w</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn></mml:math><tex-math><![CDATA[${\textstyle\sum _{i=1}^{N}}{w_{i}}=1$]]></tex-math></alternatives></inline-formula>) (De Prado, <xref ref-type="bibr" rid="j_infor618_ref_018">2016</xref>; Uyar, <xref ref-type="bibr" rid="j_infor618_ref_103">2019</xref>). In the third and final step of the quasi-diagonalization phase, the weighting values are determined for all assets that the investor has included in his portfolio.</p>
<p>De Prado (<xref ref-type="bibr" rid="j_infor618_ref_018">2016</xref>) attempts to close the gap in the literature by solving the problems of the Markowitz model such as instability, concentration problems and underperformance with the HRP algorithm and creating portfolios that can outperform traditional risk-based portfolio strategies. However, the HRP algorithm also has some drawbacks. These disadvantages can be explained as follows Sen (<xref ref-type="bibr" rid="j_infor618_ref_090">2023</xref>): 
<list>
<list-item id="j_infor618_li_015">
<label>•</label>
<p>With a large number of entities, the hierarchical clustering algorithm used by the HRP algorithm can be very time-consuming.</p>
</list-item>
<list-item id="j_infor618_li_016">
<label>•</label>
<p>The HRP algorithm does not explicitly consider the expected return on assets. The HRP algorithm merely attempts to balance the risk across all assets in the portfolio. This leads to lower expected returns than with other portfolio optimization methods.</p>
</list-item>
<list-item id="j_infor618_li_017">
<label>•</label>
<p>The HRP algorithm assumes that the returns of the assets follow a normal distribution. Since asset returns are not normally distributed in real life, this can affect the accuracy of the HRP algorithm.</p>
</list-item>
<list-item id="j_infor618_li_018">
<label>•</label>
<p>Since the HRP algorithm is a relatively new method, portfolio performance has not been comprehensively tested over a long period of time. Therefore, the HRP algorithm may lead to unforeseen risks and limitations.</p>
</list-item>
</list>
</p>
</sec>
</sec>
<sec id="j_infor618_s_011">
<label>3.2</label>
<title>Elbow Method</title>
<p>The Elbow method is a commonly recognized heuristic for determining the optimal number of clusters (<italic>k</italic>) within a given dataset. The fundamental principle underpinning this technique is that the ideal cluster count corresponds to the point where introducing further clusters results in only a marginal, negligible improvement in the model’s performance or the variance explained by the clustering structure.</p>
<p>This methodology relies heavily on a graphical interpretation of the results. To apply it, the proportion of variance accounted for by the clustering is plotted against different values for <italic>k</italic>. Initial clusters naturally capture a significant amount of the dataset’s inherent information. However, as <italic>k</italic> continues to increase, the incremental benefit—the addition to the explained variance—experiences a sharp decline, creating a distinct “elbow” shape on the graph. This inflection point is interpreted as the most appropriate number of clusters, signifying the optimal value for <italic>k</italic>.</p>
<p>Implementation of the Elbow method is systematic: the value of <italic>k</italic> is typically initiated at two and is increased sequentially. At each step, clusters are computed, and a corresponding cost metric (often a measure of within-cluster variance) is calculated. While this cost metric decreases substantially for lower <italic>k</italic> values, it inevitably reaches a plateau as <italic>k</italic> continues to rise. The point at which this levelling-off begins effectively signals the optimal cluster size; beyond this threshold, additional clusters offer diminishing returns, as they become increasingly similar to existing ones, thus contributing little to the overall model’s explanatory power.</p>
<p>The Elbow method is a widely used approach for identifying the optimal number of clusters or groups within a dataset (Kodinariya and Makwana, <xref ref-type="bibr" rid="j_infor618_ref_053">2013</xref>; Bholowalia and Kumar, <xref ref-type="bibr" rid="j_infor618_ref_012">2014</xref>; Abrar <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_001">2023</xref>). The fundamental principle of this method is that the ideal number of clusters corresponds to the point beyond which adding an additional cluster yields only marginal improvement in model performance (Bholowalia and Kumar, <xref ref-type="bibr" rid="j_infor618_ref_012">2014</xref>).</p>
</sec>
<sec id="j_infor618_s_012">
<label>3.3</label>
<title>MEREC Method</title>
<p>The MEREC method is one of the objective methods for criteria weighting developed by Keshavarz-Ghorabaee <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_051">2021</xref>). In contrast to other criteria weighting methods, the MEREC method focuses on the changes in the overall weighting of the criteria by excluding the relevant criterion when calculating the importance of each criterion (Keshavarz-Ghorabaee <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_051">2021</xref>).</p>
<p>The implementation steps of the MEREC method are shown in equations (<xref rid="j_infor618_eq_010">10</xref>)–(<xref rid="j_infor618_eq_018">18</xref>) (Keshavarz-Ghorabaee <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_051">2021</xref>; Keshavarz-Ghorabaee, <xref ref-type="bibr" rid="j_infor618_ref_050">2021</xref>).</p>
<p><underline>Step 1</underline>: The first step of the MEREC method is to create the decision matrix. The decision matrix, which consists of <italic>m</italic> alternatives and <italic>n</italic> criteria, is created using equation (<xref rid="j_infor618_eq_010">10</xref>). 
<disp-formula id="j_infor618_eq_010">
<label>(10)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true">
<mml:mtr>
<mml:mtd>
<mml:mi mathvariant="italic">X</mml:mi>
<mml:mo>=</mml:mo>
<mml:mfenced separators="" open="[" close="]">
<mml:mrow>
<mml:mtable columnspacing="4.0pt 4.0pt 4.0pt" equalrows="false" columnlines="none none none" equalcolumns="false" columnalign="center center center center">
<mml:mtr>
<mml:mtd class="array">
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>11</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mspace width="1em"/>
</mml:mtd>
<mml:mtd class="array">
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>12</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mspace width="1em"/>
</mml:mtd>
<mml:mtd class="array">
<mml:mo>…</mml:mo>
<mml:mspace width="1em"/>
</mml:mtd>
<mml:mtd class="array">
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mi mathvariant="italic">n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd class="array">
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>21</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mspace width="1em"/>
</mml:mtd>
<mml:mtd class="array">
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>22</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mspace width="1em"/>
</mml:mtd>
<mml:mtd class="array">
<mml:mo>…</mml:mo>
<mml:mspace width="1em"/>
</mml:mtd>
<mml:mtd class="array">
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mi mathvariant="italic">n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd class="array">
<mml:mo>⋮</mml:mo>
<mml:mspace width="1em"/>
</mml:mtd>
<mml:mtd class="array">
<mml:mo>⋮</mml:mo>
<mml:mspace width="1em"/>
</mml:mtd>
<mml:mtd class="array">
<mml:mo>⋮</mml:mo>
<mml:mspace width="1em"/>
</mml:mtd>
<mml:mtd class="array">
<mml:mo>⋮</mml:mo>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd class="array">
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">m</mml:mi>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mspace width="1em"/>
</mml:mtd>
<mml:mtd class="array">
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">m</mml:mi>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mspace width="1em"/>
</mml:mtd>
<mml:mtd class="array">
<mml:mo>…</mml:mo>
<mml:mspace width="1em"/>
</mml:mtd>
<mml:mtd class="array">
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">m</mml:mi>
<mml:mi mathvariant="italic">n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
<mml:mo>.</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[ X=\left[\begin{array}{c@{\hskip4.0pt}c@{\hskip4.0pt}c@{\hskip4.0pt}c}{x_{11}}\hspace{1em}& {x_{12}}\hspace{1em}& \dots \hspace{1em}& {x_{1n}}\\ {} {x_{21}}\hspace{1em}& {x_{22}}\hspace{1em}& \dots \hspace{1em}& {x_{2n}}\\ {} \vdots \hspace{1em}& \vdots \hspace{1em}& \vdots \hspace{1em}& \vdots \\ {} {x_{m1}}\hspace{1em}& {x_{m2}}\hspace{1em}& \dots \hspace{1em}& {x_{mn}}\end{array}\right].\]]]></tex-math></alternatives>
</disp-formula>
</p>
<p>In the decision matrix in equation (<xref rid="j_infor618_eq_010">10</xref>), <inline-formula id="j_infor618_ineq_064"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${x_{ij}}$]]></tex-math></alternatives></inline-formula> shows the value of alternative <italic>i</italic> in relation to criterion <italic>j</italic>. This value should be greater than zero. If there is a negative value <inline-formula id="j_infor618_ineq_065"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${x_{ij}}$]]></tex-math></alternatives></inline-formula> in the decision matrix, it should be converted to a positive value using appropriate methods. In this study, negative values were converted to positive values using the Z-score standardization transformation. Equation (<xref rid="j_infor618_eq_011">11</xref>) and equation (<xref rid="j_infor618_eq_012">12</xref>) were used for the Z-score standardization transformation (Zhang <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_107">2014</xref>; Ayçin and Güçlü, <xref ref-type="bibr" rid="j_infor618_ref_008">2020</xref>; Kundakcı and Arman, <xref ref-type="bibr" rid="j_infor618_ref_057">2023</xref>). <disp-formula-group id="j_infor618_dg_001">
<disp-formula id="j_infor618_eq_011">
<label>(11)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true" columnalign="right left" columnspacing="0pt">
<mml:mtr>
<mml:mtd class="align-odd"/>
<mml:mtd class="align-even">
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">z</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo><mml:mstyle displaystyle="true">
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>−</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mover accent="false">
<mml:mrow>
<mml:mi mathvariant="italic">x</mml:mi>
</mml:mrow>
<mml:mo accent="true">‾</mml:mo></mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">σ</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mstyle>
<mml:mspace width="1em"/>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mn>2</mml:mn>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mo>…</mml:mo>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">m</mml:mi>
<mml:mo>;</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mn>2</mml:mn>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mo>…</mml:mo>
<mml:mi mathvariant="italic">n</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:mo mathvariant="normal">,</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[\begin{aligned}{}& {z_{ij}}=\frac{{x_{ij}}-{\overline{x}_{j}}}{{\sigma _{i}}}\hspace{1em}(i=1,2,\dots ,m;j=1,2,\dots n),\end{aligned}\]]]></tex-math></alternatives>
</disp-formula>
<disp-formula id="j_infor618_eq_012">
<label>(12)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true" columnalign="right left" columnspacing="0pt">
<mml:mtr>
<mml:mtd class="align-odd"/>
<mml:mtd class="align-even">
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">z</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>′</mml:mo>
</mml:mrow>
</mml:msubsup>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">z</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>+</mml:mo>
<mml:mi mathvariant="italic">A</mml:mi>
<mml:mspace width="1em"/>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mn>2</mml:mn>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mo>…</mml:mo>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">m</mml:mi>
<mml:mo>;</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mn>2</mml:mn>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mo>…</mml:mo>
<mml:mi mathvariant="italic">n</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:mo>.</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[\begin{aligned}{}& {z^{\prime }_{ij}}={z_{ij}}+A\hspace{1em}(i=1,2,\dots ,m;j=1,2,\dots n).\end{aligned}\]]]></tex-math></alternatives>
</disp-formula>
</disp-formula-group></p>
<p>In equation (<xref rid="j_infor618_eq_012">12</xref>), the value of <inline-formula id="j_infor618_ineq_066"><alternatives><mml:math>
<mml:mi mathvariant="italic">A</mml:mi>
<mml:mspace width="2.5pt"/>
<mml:mtext>stands for</mml:mtext>
<mml:mspace width="2.5pt"/>
<mml:mo mathvariant="normal">&gt;</mml:mo>
<mml:mo stretchy="false">|</mml:mo>
<mml:mo movablelimits="false">min</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">z</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo stretchy="false">|</mml:mo></mml:math><tex-math><![CDATA[$A\hspace{2.5pt}\text{stands for}\hspace{2.5pt}\gt |\min {z_{ij}}|$]]></tex-math></alternatives></inline-formula>.</p>
<p><underline>Step 2</underline>: The decision matrix is normalized using equation (<xref rid="j_infor618_eq_013">13</xref>) for benefit criteria and equation (<xref rid="j_infor618_eq_014">14</xref>) for cost criteria. <disp-formula-group id="j_infor618_dg_002">
<disp-formula id="j_infor618_eq_013">
<label>(13)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true" columnalign="right left" columnspacing="0pt">
<mml:mtr>
<mml:mtd class="align-odd"/>
<mml:mtd class="align-even">
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msubsup>
<mml:mo>=</mml:mo><mml:mstyle displaystyle="true">
<mml:mfrac>
<mml:mrow>
<mml:mo movablelimits="false">min</mml:mo>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mstyle>
<mml:mo mathvariant="normal">,</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[\begin{aligned}{}& {x_{ij}^{\ast }}=\frac{\min ({x_{ij}})}{{x_{ij}}},\end{aligned}\]]]></tex-math></alternatives>
</disp-formula>
<disp-formula id="j_infor618_eq_014">
<label>(14)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true" columnalign="right left" columnspacing="0pt">
<mml:mtr>
<mml:mtd class="align-odd"/>
<mml:mtd class="align-even">
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msubsup>
<mml:mo>=</mml:mo><mml:mstyle displaystyle="true">
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:mo movablelimits="false">max</mml:mo>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mfrac>
</mml:mstyle>
<mml:mo>.</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[\begin{aligned}{}& {x_{ij}^{\ast }}=\frac{{x_{ij}}}{\max ({x_{ij}})}.\end{aligned}\]]]></tex-math></alternatives>
</disp-formula>
</disp-formula-group></p>
<p>The normalization process is similar to the process used in methods such as WASPAS but differs in that it switches between formulas for benefit and cost criteria. In contrast to many other studies, the MEREC method converts all criteria into minimization-type criteria (Keshavarz-Ghorabaee <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_051">2021</xref>).</p>
<p><underline>Step 3</underline>: A logarithmic measure with equal criteria weighting is used to determine the overall performance values of the alternatives. This logarithmic measure is based on a non-linear function shown in Fig. <xref rid="j_infor618_fig_005">5</xref>.</p>
<fig id="j_infor618_fig_005">
<label>Fig. 5</label>
<caption>
<p>The Weights of the comparative analysis (Keshavarz-Ghorabaee <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_051">2021</xref>).</p>
</caption>
<graphic xlink:href="infor618_g005.jpg"/>
</fig>
<p>Using the values obtained with the normalization matrix, it can be ensured that smaller values of <inline-formula id="j_infor618_ineq_067"><alternatives><mml:math>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msubsup></mml:math><tex-math><![CDATA[${x_{ij}^{\ast }}$]]></tex-math></alternatives></inline-formula> result in a larger overall performance value. This value is calculated using equation (<xref rid="j_infor618_eq_015">15</xref>). 
<disp-formula id="j_infor618_eq_015">
<label>(15)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true">
<mml:mtr>
<mml:mtd>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">S</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mo movablelimits="false">ln</mml:mo>
<mml:mo mathvariant="normal" fence="true" maxsize="2.03em" minsize="2.03em">(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>+</mml:mo>
<mml:mo mathvariant="normal" fence="true" maxsize="2.03em" minsize="2.03em">(</mml:mo><mml:mstyle displaystyle="true">
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">n</mml:mi>
</mml:mrow>
</mml:mfrac>
</mml:mstyle>
<mml:munder>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:mo largeop="true" movablelimits="false">∑</mml:mo></mml:mstyle>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:munder>
<mml:mo fence="true" maxsize="1.19em" minsize="1.19em" stretchy="true">|</mml:mo>
<mml:mo movablelimits="false">ln</mml:mo>
<mml:mo mathvariant="normal" fence="true" maxsize="1.19em" minsize="1.19em">(</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msubsup>
<mml:mo mathvariant="normal" fence="true" maxsize="1.19em" minsize="1.19em">)</mml:mo>
<mml:mo fence="true" maxsize="1.19em" minsize="1.19em" stretchy="true">|</mml:mo>
<mml:mo mathvariant="normal" fence="true" maxsize="2.03em" minsize="2.03em">)</mml:mo>
<mml:mo mathvariant="normal" fence="true" maxsize="2.03em" minsize="2.03em">)</mml:mo>
<mml:mo>.</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[ {S_{i}}=\ln \bigg(1+\bigg(\frac{1}{n}\sum \limits_{j}\big|\ln \big({x_{ij}^{\ast }}\big)\big|\bigg)\bigg).\]]]></tex-math></alternatives>
</disp-formula>
</p>
<p><underline>Step 4:</underline> As with the determination of the overall performance value of the alternatives, a logarithmic criterion is also used in this step. In contrast to the previous step, in this step the performance values of the alternatives are calculated by subtracting them individually for each criterion. These values are calculated using equation (<xref rid="j_infor618_eq_016">16</xref>). 
<disp-formula id="j_infor618_eq_016">
<label>(16)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true">
<mml:mtr>
<mml:mtd>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">S</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>′</mml:mo>
</mml:mrow>
</mml:msubsup>
<mml:mo>=</mml:mo>
<mml:mo movablelimits="false">ln</mml:mo>
<mml:mo mathvariant="normal" fence="true" maxsize="2.03em" minsize="2.03em">(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>+</mml:mo>
<mml:mo mathvariant="normal" fence="true" maxsize="2.03em" minsize="2.03em">(</mml:mo><mml:mstyle displaystyle="true">
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">n</mml:mi>
</mml:mrow>
</mml:mfrac>
</mml:mstyle>
<mml:munder>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:mo largeop="true" movablelimits="false">∑</mml:mo></mml:mstyle>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">k</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">k</mml:mi>
<mml:mo stretchy="false">≠</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:munder>
<mml:mo fence="true" maxsize="1.19em" minsize="1.19em" stretchy="true">|</mml:mo>
<mml:mo movablelimits="false">ln</mml:mo>
<mml:mo mathvariant="normal" fence="true" maxsize="1.19em" minsize="1.19em">(</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msubsup>
<mml:mo mathvariant="normal" fence="true" maxsize="1.19em" minsize="1.19em">)</mml:mo>
<mml:mo fence="true" maxsize="1.19em" minsize="1.19em" stretchy="true">|</mml:mo>
<mml:mo mathvariant="normal" fence="true" maxsize="2.03em" minsize="2.03em">)</mml:mo>
<mml:mo mathvariant="normal" fence="true" maxsize="2.03em" minsize="2.03em">)</mml:mo>
<mml:mo>.</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[ {S^{\prime }_{i}}=\ln \bigg(1+\bigg(\frac{1}{n}\sum \limits_{k,k\ne j}\big|\ln \big({x_{ij}^{\ast }}\big)\big|\bigg)\bigg).\]]]></tex-math></alternatives>
</disp-formula>
</p>
<p><underline>Step 5:</underline> The <inline-formula id="j_infor618_ineq_068"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">E</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${E_{j}}$]]></tex-math></alternatives></inline-formula> value, which is determined with the help of equation (<xref rid="j_infor618_eq_015">15</xref>) and equation (<xref rid="j_infor618_eq_016">16</xref>) and indicates the removal effect of the <italic>j</italic>. criterion, is calculated for each criterion with the help of equation (<xref rid="j_infor618_eq_017">17</xref>). 
<disp-formula id="j_infor618_eq_017">
<label>(17)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true">
<mml:mtr>
<mml:mtd>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">E</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:munder>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:mo largeop="true" movablelimits="false">∑</mml:mo></mml:mstyle>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:munder>
<mml:mo fence="true" maxsize="1.19em" minsize="1.19em" stretchy="true">|</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">S</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>′</mml:mo>
</mml:mrow>
</mml:msubsup>
<mml:mo>−</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">S</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo fence="true" maxsize="1.19em" minsize="1.19em" stretchy="true">|</mml:mo>
<mml:mo>.</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[ {E_{j}}=\sum \limits_{i}\big|{S^{\prime }_{i}}-{S_{i}}\big|.\]]]></tex-math></alternatives>
</disp-formula>
</p>
<p><underline>Step 6:</underline> Using the <inline-formula id="j_infor618_ineq_069"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">E</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${E_{j}}$]]></tex-math></alternatives></inline-formula> values calculated by equation (<xref rid="j_infor618_eq_017">17</xref>), the importance weights of each criterion are calculated by equation (<xref rid="j_infor618_eq_018">18</xref>). 
<disp-formula id="j_infor618_eq_018">
<label>(18)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true">
<mml:mtr>
<mml:mtd>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">w</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo><mml:mstyle displaystyle="true">
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">E</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mo largeop="false" movablelimits="false">∑</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">k</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">E</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">k</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mstyle>
<mml:mo>.</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[ {w_{j}}=\frac{{E_{j}}}{{\textstyle\sum _{k}}{E_{k}}}.\]]]></tex-math></alternatives>
</disp-formula>
</p>
</sec>
<sec id="j_infor618_s_013">
<label>3.4</label>
<title>WEDBA Method</title>
<p>The WEDBA method, introduced by Rao and Singh (<xref ref-type="bibr" rid="j_infor618_ref_084">2012</xref>), is an MCDM technique grounded in the principle that the most favourable alternative is the one with the shortest Euclidean distance to the ideal solution, whereas the least desirable alternative is the farthest from the non-ideal solution (Rao and Singh, <xref ref-type="bibr" rid="j_infor618_ref_084">2012</xref>). In this framework, the overall performance index of each alternative is computed based on its Euclidean distance to both the ideal and all non-ideal reference points. This structure ensures that alternatives are evaluated relative to ideal and non-ideal benchmarks rather than being compared directly with one another, thereby necessitating the use of Euclidean distance as the primary measure (Rao and Singh, <xref ref-type="bibr" rid="j_infor618_ref_084">2012</xref>).</p>
<p>The procedural steps of the WEDBA method are presented in equations (<xref rid="j_infor618_eq_019">19</xref>)–(<xref rid="j_infor618_eq_028">28</xref>) (Rao and Singh, <xref ref-type="bibr" rid="j_infor618_ref_084">2012</xref>; Işık, <xref ref-type="bibr" rid="j_infor618_ref_035">2021</xref>).</p>
<p><underline>Step 1</underline>: The first step of the WEDBA method is to construct the decision matrix. The decision matrix is created using equation (<xref rid="j_infor618_eq_010">10</xref>).</p>
<p><underline>Step 2:</underline> The decision matrix is normalized using equation (<xref rid="j_infor618_eq_019">19</xref>) for benefit criteria and equation (<xref rid="j_infor618_eq_020">20</xref>) for cost criteria. <disp-formula-group id="j_infor618_dg_003">
<disp-formula id="j_infor618_eq_019">
<label>(19)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true" columnalign="right left" columnspacing="0pt">
<mml:mtr>
<mml:mtd class="align-odd"/>
<mml:mtd class="align-even">
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msubsup>
<mml:mo>=</mml:mo><mml:mstyle displaystyle="true">
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:mo movablelimits="false">max</mml:mo>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mfrac>
</mml:mstyle>
<mml:mo mathvariant="normal">,</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[\begin{aligned}{}& {x_{ij}^{\ast }}=\frac{{x_{ij}}}{\max ({x_{ij}})},\end{aligned}\]]]></tex-math></alternatives>
</disp-formula>
<disp-formula id="j_infor618_eq_020">
<label>(20)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true" columnalign="right left" columnspacing="0pt">
<mml:mtr>
<mml:mtd class="align-odd"/>
<mml:mtd class="align-even">
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msubsup>
<mml:mo>=</mml:mo><mml:mstyle displaystyle="true">
<mml:mfrac>
<mml:mrow>
<mml:mo movablelimits="false">min</mml:mo>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mstyle>
<mml:mo>.</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[\begin{aligned}{}& {x_{ij}^{\ast }}=\frac{\min ({x_{ij}})}{{x_{ij}}}.\end{aligned}\]]]></tex-math></alternatives>
</disp-formula>
</disp-formula-group></p>
<p><underline>Step 3:</underline> The normalized values obtained by equation (<xref rid="j_infor618_eq_019">19</xref>) and equation (<xref rid="j_infor618_eq_020">20</xref>) are standardized by equation (<xref rid="j_infor618_eq_021">21</xref>). 
<disp-formula id="j_infor618_eq_021">
<label>(21)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true">
<mml:mtr>
<mml:mtd>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo><mml:mstyle displaystyle="true">
<mml:mfrac>
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msubsup>
<mml:mo>−</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">μ</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">σ</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mstyle>
<mml:mo>.</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[ {y_{ij}}=\frac{{x_{ij}^{\ast }}-{\mu _{j}}}{{\sigma _{j}}}.\]]]></tex-math></alternatives>
</disp-formula>
</p>
<p>The expressions <inline-formula id="j_infor618_ineq_070"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">μ</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${\mu _{j}}$]]></tex-math></alternatives></inline-formula> and <inline-formula id="j_infor618_ineq_071"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">σ</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${\sigma _{j}}$]]></tex-math></alternatives></inline-formula> in equation (<xref rid="j_infor618_eq_021">21</xref>) indicate the mean and standard deviation of criterion <italic>j</italic>. respectively. The value of <inline-formula id="j_infor618_ineq_072"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">μ</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${\mu _{j}}$]]></tex-math></alternatives></inline-formula> is calculated using equation (<xref rid="j_infor618_eq_022">22</xref>) and <inline-formula id="j_infor618_ineq_073"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">σ</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${\sigma _{j}}$]]></tex-math></alternatives></inline-formula> is calculated using equation (<xref rid="j_infor618_eq_023">23</xref>). <disp-formula-group id="j_infor618_dg_004">
<disp-formula id="j_infor618_eq_022">
<label>(22)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true" columnalign="right left" columnspacing="0pt">
<mml:mtr>
<mml:mtd class="align-odd"/>
<mml:mtd class="align-even">
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">μ</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo><mml:mstyle displaystyle="true">
<mml:mfrac>
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mo largeop="false" movablelimits="false">∑</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">m</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">m</mml:mi>
</mml:mrow>
</mml:mfrac>
</mml:mstyle>
<mml:mo mathvariant="normal">,</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[\begin{aligned}{}& {\mu _{j}}=\frac{{\textstyle\textstyle\sum _{i=1}^{m}}{x_{ij}^{\ast }}}{m},\end{aligned}\]]]></tex-math></alternatives>
</disp-formula>
<disp-formula id="j_infor618_eq_023">
<label>(23)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true" columnalign="right left" columnspacing="0pt">
<mml:mtr>
<mml:mtd class="align-odd"/>
<mml:mtd class="align-even">
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">σ</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:msqrt>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:mfrac>
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mo largeop="false" movablelimits="false">∑</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">m</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:msup>
<mml:mrow>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>∗</mml:mo>
</mml:mrow>
</mml:msubsup>
<mml:mo>−</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">μ</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msup>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">m</mml:mi>
</mml:mrow>
</mml:mfrac>
</mml:mstyle>
</mml:mrow>
</mml:msqrt>
<mml:mo>.</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[\begin{aligned}{}& {\sigma _{j}}=\sqrt{\frac{{\textstyle\textstyle\sum _{i=1}^{m}}{({x_{ij}^{\ast }}-{\mu _{j}})^{2}}}{m}}.\end{aligned}\]]]></tex-math></alternatives>
</disp-formula>
</disp-formula-group></p>
<p><underline>Step 4</underline>: Ideal values are calculated using equation (<xref rid="j_infor618_eq_024">24</xref>) and anti-ideal values using equation (<xref rid="j_infor618_eq_025">25</xref>). <disp-formula-group id="j_infor618_dg_005">
<disp-formula id="j_infor618_eq_024">
<label>(24)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true" columnalign="right left" columnspacing="0pt">
<mml:mtr>
<mml:mtd class="align-odd"/>
<mml:mtd class="align-even">
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>+</mml:mo>
</mml:mrow>
</mml:msubsup>
<mml:mo>=</mml:mo>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:mo mathvariant="normal">,</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[\begin{aligned}{}& {y_{ij}^{+}}=({y_{ij}}),\end{aligned}\]]]></tex-math></alternatives>
</disp-formula>
<disp-formula id="j_infor618_eq_025">
<label>(25)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true" columnalign="right left" columnspacing="0pt">
<mml:mtr>
<mml:mtd class="align-odd"/>
<mml:mtd class="align-even">
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>−</mml:mo>
</mml:mrow>
</mml:msubsup>
<mml:mo>=</mml:mo>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:mo>.</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[\begin{aligned}{}& {y_{ij}^{-}}=({y_{ij}}).\end{aligned}\]]]></tex-math></alternatives>
</disp-formula>
</disp-formula-group></p>
<p><underline>Step 5</underline>: The weighted Euclidean distances of the alternatives to the ideal points are calculated with the help of equation (<xref rid="j_infor618_eq_026">26</xref>) and the weighted Euclidean distances to the non-ideal points are calculated by using equation (<xref rid="j_infor618_eq_027">27</xref>). <disp-formula-group id="j_infor618_dg_006">
<disp-formula id="j_infor618_eq_026">
<label>(26)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true" columnalign="right left" columnspacing="0pt">
<mml:mtr>
<mml:mtd class="align-odd"/>
<mml:mtd class="align-even">
<mml:msubsup>
<mml:mrow>
<mml:mtext mathvariant="italic">WED</mml:mtext>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>+</mml:mo>
</mml:mrow>
</mml:msubsup>
<mml:mo>=</mml:mo>
<mml:msqrt>
<mml:mrow>
<mml:munderover accentunder="false" accent="false">
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:mo largeop="true" movablelimits="false">∑</mml:mo></mml:mstyle>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">n</mml:mi>
</mml:mrow>
</mml:munderover>
<mml:msup>
<mml:mrow>
<mml:mo fence="true" maxsize="1.19em" minsize="1.19em">{</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">w</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mi mathvariant="italic">x</mml:mi>
<mml:mo mathvariant="normal" fence="true" maxsize="1.19em" minsize="1.19em">(</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>−</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>+</mml:mo>
</mml:mrow>
</mml:msubsup>
<mml:mo mathvariant="normal" fence="true" maxsize="1.19em" minsize="1.19em">)</mml:mo>
<mml:mo fence="true" maxsize="1.19em" minsize="1.19em">}</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:msqrt>
<mml:mo mathvariant="normal">,</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[\begin{aligned}{}& {\textit{WED}_{i}^{+}}=\sqrt{{\sum \limits_{j=1}^{n}}{\big\{{w_{j}}x\big({y_{ij}}-{y_{ij}^{+}}\big)\big\}^{2}}},\end{aligned}\]]]></tex-math></alternatives>
</disp-formula>
<disp-formula id="j_infor618_eq_027">
<label>(27)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true" columnalign="right left" columnspacing="0pt">
<mml:mtr>
<mml:mtd class="align-odd"/>
<mml:mtd class="align-even">
<mml:msubsup>
<mml:mrow>
<mml:mtext mathvariant="italic">WED</mml:mtext>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>−</mml:mo>
</mml:mrow>
</mml:msubsup>
<mml:mo>=</mml:mo>
<mml:msqrt>
<mml:mrow>
<mml:munderover accentunder="false" accent="false">
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:mo largeop="true" movablelimits="false">∑</mml:mo></mml:mstyle>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">n</mml:mi>
</mml:mrow>
</mml:munderover>
<mml:msup>
<mml:mrow>
<mml:mo fence="true" maxsize="1.19em" minsize="1.19em">{</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">w</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mi mathvariant="italic">x</mml:mi>
<mml:mo mathvariant="normal" fence="true" maxsize="1.19em" minsize="1.19em">(</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>−</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>−</mml:mo>
</mml:mrow>
</mml:msubsup>
<mml:mo mathvariant="normal" fence="true" maxsize="1.19em" minsize="1.19em">)</mml:mo>
<mml:mo fence="true" maxsize="1.19em" minsize="1.19em">}</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:msqrt>
<mml:mo>.</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[\begin{aligned}{}& {\textit{WED}_{i}^{-}}=\sqrt{{\sum \limits_{j=1}^{n}}{\big\{{w_{j}}x\big({y_{ij}}-{y_{ij}^{-}}\big)\big\}^{2}}}.\end{aligned}\]]]></tex-math></alternatives>
</disp-formula>
</disp-formula-group></p>
<p><underline>Step 6</underline>: Equation (<xref rid="j_infor618_eq_028">28</xref>) is used to calculate the index score, which is the last step of the WEDBA method. 
<disp-formula id="j_infor618_eq_028">
<label>(28)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true">
<mml:mtr>
<mml:mtd>
<mml:msub>
<mml:mrow>
<mml:mtext mathvariant="italic">IS</mml:mtext>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo><mml:mstyle displaystyle="true">
<mml:mfrac>
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mtext mathvariant="italic">WED</mml:mtext>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>−</mml:mo>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mtext mathvariant="italic">WED</mml:mtext>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>−</mml:mo>
</mml:mrow>
</mml:msubsup>
<mml:mo>+</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mtext mathvariant="italic">WED</mml:mtext>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>+</mml:mo>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mfrac>
</mml:mstyle>
<mml:mo>.</mml:mo>
<mml:mspace width="2.5pt"/>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[ {\textit{IS}_{i}}=\frac{{\textit{WED}_{i}^{-}}}{{\textit{WED}_{i}^{-}}+{\textit{WED}_{i}^{+}}}.\hspace{2.5pt}\]]]></tex-math></alternatives>
</disp-formula>
</p>
<p>An increase in an alternative’s index value indicates that it is closer to the ideal solution. Therefore, the alternative with the highest index value is the best in terms of performance, while the one with the lowest index value is the weakest alternative.</p>
</sec>
<sec id="j_infor618_s_014">
<label>3.5</label>
<title>Portfolio Performance Evaluation Criteria</title>
<p>To compare the portfolios created using the HRP algorithm and the MCDM methods, evaluation criteria are needed. Although there are many alternatives in the literature for comparing portfolio performance, the Sharpe ratio, also known as the reward to volatility ratio based on standard deviation, is preferred in this study. The Sharpe ratio, which helps investors understand how well their investments are compensated for the risk they bear, is calculated using equation (<xref rid="j_infor618_eq_029">29</xref>) (Samarakoon and Hasan, <xref ref-type="bibr" rid="j_infor618_ref_087">2006</xref>; Bechis, <xref ref-type="bibr" rid="j_infor618_ref_011">2020</xref>). 
<disp-formula id="j_infor618_eq_029">
<label>(29)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true">
<mml:mtr>
<mml:mtd>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">S</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">p</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo><mml:mstyle displaystyle="true">
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">r</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">p</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>−</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">r</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">σ</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">p</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mstyle>
<mml:mo>.</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[ {S_{p}}=\frac{{r_{p}}-{r_{j}}}{{\sigma _{p}}}.\]]]></tex-math></alternatives>
</disp-formula>
</p>
<p><inline-formula id="j_infor618_ineq_074"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">S</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">p</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${S_{p}}$]]></tex-math></alternatives></inline-formula>: Sharpe ratio,</p>
<p><inline-formula id="j_infor618_ineq_075"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">r</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">p</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${r_{p}}$]]></tex-math></alternatives></inline-formula>: Portfolio return,</p>
<p><inline-formula id="j_infor618_ineq_076"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">r</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">f</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${r_{f}}$]]></tex-math></alternatives></inline-formula>: Risk-free interest rate,</p>
<p><inline-formula id="j_infor618_ineq_077"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">σ</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">p</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${\sigma _{p}}$]]></tex-math></alternatives></inline-formula>: Represents the standard deviation of the portfolio.</p>
<p>Diversifying the portfolio with securities with low or negative correlation increases the Sharpe ratio as it reduces the risk of the portfolio in general (Srivastava and Mazhar, <xref ref-type="bibr" rid="j_infor618_ref_097">2018</xref>). In other words, a high portfolio return, and a low standard deviation increase the Sharpe ratio, while a low portfolio return and a high standard deviation decrease the Sharpe ratio. Therefore, among alternative investment portfolio strategies, investors should favour the portfolio with a high Sharpe ratio.</p>
</sec>
</sec>
<sec id="j_infor618_s_015">
<label>4</label>
<title>Application</title>
<p>The primary objective of this research is to evaluate firms’ financial performance and generate actionable insights for investors by leveraging the Hierarchical Risk Parity (HRP) algorithm—a machine learning-based portfolio optimization technique introduced by De Prado (<xref ref-type="bibr" rid="j_infor618_ref_018">2016</xref>)—in conjunction with Multi-Criteria Decision-Making (MCDM) methods.</p>
<p>To facilitate this analysis, we obtained the daily closing prices for all companies listed on the BIST 100 index, covering the 2018–2022 period, with data retrieved from the Bloomberg Terminal. The BIST 100 was specifically chosen because it encapsulates Turkey’s 100 largest corporations in terms of both market capitalization and trading volume. Furthermore, it functions as the central barometer for overall market dynamics in the Turkish economy, serving as the benchmark index for the BIST Equity Market and the foundation for the international MSCI Türkiye Index. Appendix <xref rid="j_infor618_app_001">A</xref> provides a complete list of the companies included in the analysis and their respective BIST 100 codes (Table <xref rid="j_infor618_tab_007">A1</xref>).</p>
<p>Following the definition of the dataset and research scope, the empirical analysis was structured and executed in three distinct stages:</p>
<p><bold>Stage 1:</bold> HRP Implementation. Portfolio optimization was initially conducted using the standalone HRP algorithm, applied to the daily closing price data of the BIST 100 stocks. The algorithm was implemented using Python, and seven distinct linkage method—namely Ward, single, complete, average, weighted, centroid, and median—were employed throughout the clustering process.</p>
<p><bold>Stage 2:</bold> Integrated HRP–MCDM Framework. This stage represents one of the study’s core novel contributions: the application of the integrated HRP–MCDM framework. To ensure a robust and transparent financial performance evaluation, the criteria themselves were established using the Delphi method. This was done through consultation with five portfolio management experts, triangulated with evidence drawn from the existing literature and relevant reports published by the Central Bank of the Republic of Türkiye (TCMB). This systematic and expert-informed selection process is intended to yield a meaningful contribution to current research. The specific criteria utilized in this evaluation are summarized in Table <xref rid="j_infor618_tab_004">4</xref>.</p>
<table-wrap id="j_infor618_tab_004">
<label>Table 4</label>
<caption>
<p>Criteria used in the study.</p>
</caption>
<table>
<thead>
<tr>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Criteria</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Method of calculation</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Criteria type</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">References</td>
</tr>
</thead>
<tbody>
<tr>
<td style="vertical-align: top; text-align: left">Current Ratio</td>
<td style="vertical-align: top; text-align: left">Current assets/current liabilities</td>
<td style="vertical-align: top; text-align: left">Benefit</td>
<td style="vertical-align: top; text-align: left">Katrancı <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_049">2025</xref>), Ertuğrul and Karakaşoğlu (<xref ref-type="bibr" rid="j_infor618_ref_026">2009</xref>)</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Liquidity Ratio</td>
<td style="vertical-align: top; text-align: left">(Current assets-inventories)/current liabilities</td>
<td style="vertical-align: top; text-align: left">Benefit</td>
<td style="vertical-align: top; text-align: left">Ertuğrul and Karakaşoğlu (<xref ref-type="bibr" rid="j_infor618_ref_026">2009</xref>)</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Leverage Ratio</td>
<td style="vertical-align: top; text-align: left">(Long-term liabilities-current liabilities)/total assets</td>
<td style="vertical-align: top; text-align: left">Cost</td>
<td style="vertical-align: top; text-align: left">(Farrokh <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor618_ref_029">2016</xref>)</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Inventory Turnover Ratio</td>
<td style="vertical-align: top; text-align: left">Cost of goods sold/average inventory</td>
<td style="vertical-align: top; text-align: left">Benefit</td>
<td style="vertical-align: top; text-align: left">Moghimi and Anvari (<xref ref-type="bibr" rid="j_infor618_ref_067">2014</xref>); Katrancı <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_049">2025</xref>)</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Receivables Turnover Ratio</td>
<td style="vertical-align: top; text-align: left">Total net sales/accounts receivables</td>
<td style="vertical-align: top; text-align: left">Cost</td>
<td style="vertical-align: top; text-align: left">Moghimi and Anvari (<xref ref-type="bibr" rid="j_infor618_ref_067">2014</xref>); Katrancı <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor618_ref_049">2025</xref>)</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Return on Equity (ROE)</td>
<td style="vertical-align: top; text-align: left">Net income/common equity</td>
<td style="vertical-align: top; text-align: left">Benefit</td>
<td style="vertical-align: top; text-align: left">Baydaş and Pamucar (<xref ref-type="bibr" rid="j_infor618_ref_010">2022</xref>)</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">Return on Assets (ROA)</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">Net income/total assets</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">Benefit</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">Karadeniz and İskenderoğlu (<xref ref-type="bibr" rid="j_infor618_ref_046">2011</xref>)</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The financial assessment relies on several critical ratios, each offering a distinct perspective on a firm’s operational efficiency, solvency, and profitability.</p>
<p>The <bold>Current Ratio</bold> is a foundational measure of a firm’s capacity to satisfy its short-term financial obligations, thus acting as a central indicator of working capital adequacy. It is calculated simply by dividing current assets by current liabilities. Companies whose current ratios align closely with the relevant industry benchmark are typically perceived as financially robust, whereas lower ratios signal a potentially increased liquidity risk.</p>
<p>The <bold>Liquidity Ratio</bold>, often known interchangeably as the acid-test ratio or quick ratio, offers a more immediate view of a company’s solvency position and overall financial resilience. This ratio specifically measures the firm’s ability to cover all its short-term liabilities using only its most liquid assets. The calculation is performed by deducting inventories from current assets and then dividing the remainder by current liabilities.</p>
<p>The <bold>Leverage Ratio</bold> quantifies the extent to which a company’s total assets are financed through external debt. Consequently, it reflects the firm’s capacity to service both its short-term and long-term financial obligations. It is derived by dividing total liabilities (encompassing both current and non-current debt) by total assets. A higher ratio suggests that a greater proportion of the firm’s asset base is reliant on debt funding.</p>
<p>The <bold>Inventory Turnover Ratio</bold> is a key indicator of supply chain and operational efficiency, showing how frequently a firm manages to replenish and sell off its inventories over a specified reporting period. It is obtained by dividing the cost of goods sold by the average inventory balance. In most cases, higher turnover rates imply effective inventory management and a relatively rapid conversion cycle from stock to sales.</p>
<p>The <bold>Receivables Turnover Ratio</bold> is a critical metric for evaluating the effectiveness of a company’s credit collection processes. It measures how efficiently a company collects revenue from its credit sales within a defined time frame. The ratio is computed by dividing net sales by the average balance of trade receivables. A high turnover rate—which should always be interpreted in light of the firm’s specific credit policies—suggests strong collection performance, while consistently lower values may signal collection inefficiencies or potential credit risk issues.</p>
<p><bold>Return on Equity (ROE)</bold> directly reflects the profitability generated for shareholders relative to the capital they have invested in the firm. Calculated by dividing net profit by total equity, ROE is a vital metric for current and prospective investors, as well as for corporate strategists. Significantly higher ROE values are typically interpreted as signaling robust value creation, thereby enhancing the firm’s overall attractiveness for investment.</p>
<p><bold>Return on Assets (ROA)</bold> assesses the efficiency with which a company utilizes its entire asset base to generate earnings. This profitability measure is calculated by dividing net profit after tax by the average total assets for the corresponding fiscal period. A high ROA value indicates a superior and more efficient use of the company’s assets in generating profit.</p>
<p><bold>Stage 3:</bold> The comparative performance of portfolios constructed using both the standalone HRP algorithm and the hybrid HRP-MCDM framework was meticulously assessed through the calculation and analysis of Sharpe ratios.</p>
<sec id="j_infor618_s_016">
<label>4.1</label>
<title>Clustering with HRP</title>
<p>In this study, portfolios were systematically constructed based on the Ward, single, complete, average, weighted, centroid, and median linkage methods within the HRP algorithm. The analysis utilized the daily closing prices of stocks listed in the BIST 100 Index for the period spanning January 2018 to December 2022. The dataset used in this study consists of the daily closing prices of BIST 100 Index stocks and is available for open access at <uri>https://zenodo.org/records/18140067</uri>.</p>
<p>The data acquisition and initial processing were conducted using the Python programming language. Yahoo Finance was selected as the primary data source due to its extensive coverage of major global indices (such as the Dow Jones, NASDAQ, and S&amp;P 500) and its proven reliability for empirical finance research. However, because comprehensive historical data for all 100 BIST constituents were not fully available throughout the 2018–2022 period, the final, clean dataset was limited to 72 stocks for which complete information could be retrieved.</p>
<p>In strict adherence to the HRP framework, portfolio weights were precisely calculated using the following equations for each linkage method: equation (<xref rid="j_infor618_eq_003">3</xref>) for the single linkage method, equation (<xref rid="j_infor618_eq_004">4</xref>) for the complete linkage method, equation (<xref rid="j_infor618_eq_005">5</xref>) for the average linkage method, equation (<xref rid="j_infor618_eq_006">6</xref>) for the weighted linkage method, equation (<xref rid="j_infor618_eq_007">7</xref>) for the centroid linkage method, equation (<xref rid="j_infor618_eq_008">8</xref>) for the Ward linkage method, and equation (<xref rid="j_infor618_eq_009">9</xref>) for the median linkage method. The resulting final portfolio allocations are comprehensively detailed in Table <xref rid="j_infor618_tab_005">5</xref>.</p>
<table-wrap id="j_infor618_tab_005">
<label>Table 5</label>
<caption>
<p>Portfolio results according to HRP algorithm.</p>
</caption>
<table>
<thead>
<tr>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin"/>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Average return</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Maximum return</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Minimum return</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Range</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Standard deviation</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Skewness</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Kurtosis</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Sharpe ratio</td>
</tr>
</thead>
<tbody>
<tr>
<td style="vertical-align: top; text-align: left">Single</td>
<td style="vertical-align: top; text-align: left">0.001601</td>
<td style="vertical-align: top; text-align: left">0.062471</td>
<td style="vertical-align: top; text-align: left">−0.102362</td>
<td style="vertical-align: top; text-align: left">0.164833</td>
<td style="vertical-align: top; text-align: left">0.015062</td>
<td style="vertical-align: top; text-align: left">−1.624831</td>
<td style="vertical-align: top; text-align: left">8.214356</td>
<td style="vertical-align: top; text-align: left">%10.63</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Complete</td>
<td style="vertical-align: top; text-align: left">0.001566</td>
<td style="vertical-align: top; text-align: left">0.061674</td>
<td style="vertical-align: top; text-align: left">−0.102188</td>
<td style="vertical-align: top; text-align: left">0.163861</td>
<td style="vertical-align: top; text-align: left">0.015050</td>
<td style="vertical-align: top; text-align: left">−1.629962</td>
<td style="vertical-align: top; text-align: left">8.228505</td>
<td style="vertical-align: top; text-align: left">%10.41</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Average</td>
<td style="vertical-align: top; text-align: left">0.001574</td>
<td style="vertical-align: top; text-align: left">0.061440</td>
<td style="vertical-align: top; text-align: left">−0.102709</td>
<td style="vertical-align: top; text-align: left">0.164149</td>
<td style="vertical-align: top; text-align: left">0.014969</td>
<td style="vertical-align: top; text-align: left">−1.632317</td>
<td style="vertical-align: top; text-align: left">8.374082</td>
<td style="vertical-align: top; text-align: left">%10.51</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Centroid</td>
<td style="vertical-align: top; text-align: left">0.001582</td>
<td style="vertical-align: top; text-align: left">0.061115</td>
<td style="vertical-align: top; text-align: left">−0.102220</td>
<td style="vertical-align: top; text-align: left">0.163335</td>
<td style="vertical-align: top; text-align: left">0.014852</td>
<td style="vertical-align: top; text-align: left">−1.629135</td>
<td style="vertical-align: top; text-align: left">8.260917</td>
<td style="vertical-align: top; text-align: left">%10.65</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Median</td>
<td style="vertical-align: top; text-align: left">0.001576</td>
<td style="vertical-align: top; text-align: left">0.061519</td>
<td style="vertical-align: top; text-align: left">−0.102424</td>
<td style="vertical-align: top; text-align: left">0.163943</td>
<td style="vertical-align: top; text-align: left">0.014940</td>
<td style="vertical-align: top; text-align: left">−1.645647</td>
<td style="vertical-align: top; text-align: left">8.352952</td>
<td style="vertical-align: top; text-align: left">%10.55</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Weighted</td>
<td style="vertical-align: top; text-align: left">0.001592</td>
<td style="vertical-align: top; text-align: left">0.062312</td>
<td style="vertical-align: top; text-align: left">−0.102403</td>
<td style="vertical-align: top; text-align: left">0.164715</td>
<td style="vertical-align: top; text-align: left">0.015051</td>
<td style="vertical-align: top; text-align: left">−1.615115</td>
<td style="vertical-align: top; text-align: left">8.159211</td>
<td style="vertical-align: top; text-align: left">%10.58</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">Ward</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">0.001562</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">0.063521</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">−0.102474</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">0.165994</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">0.015076</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">−1.601175</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">8.074427</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">%10.36</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Table <xref rid="j_infor618_tab_005">5</xref> presents a comprehensive overview of the portfolio outcomes generated by applying the standalone HRP algorithm to the BIST 100 Index data.</p>
<p>An initial review of the results reveals that portfolios constructed using the single and centroid linkage methods exhibited the most robust performance, delivering the strongest results in terms of both average returns and Sharpe ratios (a key risk-adjusted performance metric).</p>
<p>When the portfolios are assessed solely based on risk, as measured by standard deviation, the Ward linkage method resulted in the highest recorded level of volatility. Conversely, the centroid linkage method was the most effective in reducing risk, producing the lowest volatility across all tested criteria.</p>
<p>Further examination of the return distribution statistics indicates that the skewness values for all linkage approaches are left-skewed relative to a standard normal distribution. This finding suggests a financial reality where there is a greater concentration and frequency of negative returns than positive ones. Regarding kurtosis (a measure of the”tailedness” of the distribution), the highest values were observed in portfolios formed using the average and median linkage methods. The lowest kurtosis values, however, were associated with the weighted and Ward linkage approaches. These results imply that portfolios constructed with the weighted and Ward linkage methods exhibit a higher probability of experiencing extreme price fluctuations (both large gains and large losses) compared to those created using the other clustering criteria.</p>
</sec>
<sec id="j_infor618_s_017">
<label>4.2</label>
<title>Determining the Number of Clusters with Elbow</title>
<p>Since the introduction of the HRP algorithm by De Prado (<xref ref-type="bibr" rid="j_infor618_ref_018">2016</xref>), various researchers have successfully identified several inherent shortcomings and weaknesses. The most significant of these practical issues are the concatenation problem and the algorithm’s inability to determine the optimal number of clusters.</p>
<p>The chaining problem stems from the sensitivity of HRP’s linking methods to specific data values. This sensitivity can cause clusters to become unduly long, distributed, and heterogeneous, resulting in groupings that contain assets which, based on their risk profile, should not logically be clustered together. This situation is highly undesirable for both researchers and investors, as the addition of a seemingly minor asset can disproportionately alter a cluster’s variance. Such structural instability leads to distorted asset weighting and potentially erroneous investment decisions.</p>
<p>The second major issue arises when the optimal number of clusters cannot be determined accurately. In this scenario, the algorithm may treat every individual entity as a separate cluster, effectively failing to recognize the relevant underlying structure of the data. This failure can be characterized as a form of overfitting, which carries potentially detrimental consequences. Overfitting occurs when a model is so closely tailored to specific, potentially noisy, historical observations that it fails to capture the true, general structure of the market. Attempting to fit the model too tightly to these slightly erroneous data points can introduce significant biases and substantially diminish the model’s predictive power.</p>
<p>To effectively eliminate the structural problems caused by the HRP algorithm and to establish the necessary framework for the Multi-Criteria Decision-Making (MCDM) methods, the popular Elbow method has been integrated into the HRP algorithm.</p>
<p>This integration was performed specifically to determine the optimal number of clusters. The first practical step of this enhanced HRP algorithm was to partition the assets—based on the daily closing data of companies traded in the BIST 100 Index—into distinct clusters according to the predefined linkage methods.</p>
<p>Based on the single linkage method, companies listed on the BIST 100 Index are grouped into six clusters, as shown in Fig. <xref rid="j_infor618_fig_006">6</xref>.</p>
<fig id="j_infor618_fig_006">
<label>Fig. 6</label>
<caption>
<p>Companies in clusters based on the single linkage method.</p>
</caption>
<graphic xlink:href="infor618_g006.jpg"/>
</fig>
<fig id="j_infor618_fig_007">
<label>Fig. 7</label>
<caption>
<p>Companies in clusters based on the complete linkage method.</p>
</caption>
<graphic xlink:href="infor618_g007.jpg"/>
</fig>
<p>Based on the complete linkage method, companies listed on the BIST 100 Index are grouped into six clusters, as shown in Fig. <xref rid="j_infor618_fig_007">7</xref>.</p>
<p>Based on the average linkage method, companies listed on the BIST 100 Index are grouped into six clusters, as shown in Fig. <xref rid="j_infor618_fig_008">8</xref>.</p>
<fig id="j_infor618_fig_008">
<label>Fig. 8</label>
<caption>
<p>Companies in clusters based on the average linkage method.</p>
</caption>
<graphic xlink:href="infor618_g008.jpg"/>
</fig>
<fig id="j_infor618_fig_009">
<label>Fig. 9</label>
<caption>
<p>Companies in clusters based on the centroid linkage method.</p>
</caption>
<graphic xlink:href="infor618_g009.jpg"/>
</fig>
<p>Based on the centroid linkage method, companies listed on the BIST 100 Index are grouped into six clusters, as shown in Fig. <xref rid="j_infor618_fig_009">9</xref>.</p>
<p>Based on the median linkage method, companies listed on the BIST 100 Index are grouped into seven clusters, as shown in Fig. <xref rid="j_infor618_fig_010">10</xref>.</p>
<fig id="j_infor618_fig_010">
<label>Fig. 10</label>
<caption>
<p>Companies in clusters based on the median linkage method.</p>
</caption>
<graphic xlink:href="infor618_g010.jpg"/>
</fig>
<fig id="j_infor618_fig_011">
<label>Fig. 11</label>
<caption>
<p>Companies in clusters based on the weighted linkage method.</p>
</caption>
<graphic xlink:href="infor618_g011.jpg"/>
</fig>
<p>Based on the weighted linkage method, companies listed on the BIST 100 Index are grouped into seven clusters, as shown in Fig. <xref rid="j_infor618_fig_011">11</xref>.</p>
<p>Based on the Ward linkage method, companies listed on the BIST 100 Index are grouped into eight clusters, as shown in Fig. <xref rid="j_infor618_fig_012">12</xref>.</p>
<fig id="j_infor618_fig_012">
<label>Fig. 12</label>
<caption>
<p>Companies in clusters based on the Ward linkage method.</p>
</caption>
<graphic xlink:href="infor618_g012.jpg"/>
</fig>
</sec>
<sec id="j_infor618_s_018">
<label>4.3</label>
<title>Portfolio Transactions with HRP-MCDM Approach</title>
<p>The distinct cluster structures derived from the enhanced HRP algorithm—integrated with the Elbow method—are presented across the various linkage methods as follows: Fig. <xref rid="j_infor618_fig_005">5</xref> illustrates the clusters generated using single linkage, Fig. <xref rid="j_infor618_fig_006">6</xref> depicts those obtained via complete linkage, Fig. <xref rid="j_infor618_fig_007">7</xref> shows the results for average linkage, Fig. <xref rid="j_infor618_fig_008">8</xref> for centroid linkage, Fig. <xref rid="j_infor618_fig_009">9</xref> for median linkage, Fig. <xref rid="j_infor618_fig_011">11</xref> for weighted linkage, and Fig. <xref rid="j_infor618_fig_012">12</xref> for Ward linkage.</p>
<p>Following this robust clustering phase, a separate MCDM procedure was applied to the asset sets produced under each linkage method. Within this hybrid framework, the assignment of criterion weights is a critical step, as it has a direct and substantial influence on the final portfolio outcomes. For this reason, the necessary criterion weights corresponding to each specific cluster were computed independently using the MEREC method, an objective weighting technique.</p>
<p>The MEREC method was selected for several strategic reasons: it is a relatively recent addition to the literature, has only been utilized in a limited number of financial studies, and its characteristics align well with the BIST 100 dataset used in this research. Methodologically, MEREC offers notable advantages: it possesses a solid mathematical foundation, avoids unnecessary computational complexity, operates entirely without subjective input from decision makers, and has been applied in conjunction with the WEDBA method in a small number of prior studies. Crucially, its integration with the HRP algorithm is novel, further validating its use in this research.</p>
<p>Once the criterion weights for every cluster were objectively determined, the financial performance of the firms within each cluster was rigourously assessed using the WEDBA method. WEDBA was chosen because, despite being one of the earlier techniques in the MCDM literature, it remains underutilized in practical financial decision-making applications. It has appeared in only a few finance-related studies—often in combination with MEREC—and, like MEREC, has not been previously employed alongside the HRP algorithm. Additionally, its established computational structure is highly suitable for analysing the characteristics of the specific dataset used in this study.</p>
<p>The final portfolio outcomes produced through the integrated HRP-MCDM framework—using the Ward, single, complete, average, weighted, centroid, and median linkage methods—are concisely summarized in Table <xref rid="j_infor618_tab_006">6</xref>. In addition, the application steps for the MEREC and WEDBA methods are available for open access at <uri>https://zenodo.org/records/18140067</uri> for the clusters obtained under each linkage criterion.</p>
<table-wrap id="j_infor618_tab_006">
<label>Table 6</label>
<caption>
<p>Portfolio results according to HRP-MCDM approach.</p>
</caption>
<table>
<thead>
<tr>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin"/>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Average return</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Maximum return</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Minimum return</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Range</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Standard deviation</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Skewness</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Kurtosis</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Sharpe ratio</td>
</tr>
</thead>
<tbody>
<tr>
<td style="vertical-align: top; text-align: left">Single</td>
<td style="vertical-align: top; text-align: left">0.001752</td>
<td style="vertical-align: top; text-align: left">0.067922</td>
<td style="vertical-align: top; text-align: left">−0.106825</td>
<td style="vertical-align: top; text-align: left">0.174746</td>
<td style="vertical-align: top; text-align: left">0.015754</td>
<td style="vertical-align: top; text-align: left">−1.574484</td>
<td style="vertical-align: top; text-align: left">7.912521</td>
<td style="vertical-align: top; text-align: left">%11.12</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Complete</td>
<td style="vertical-align: top; text-align: left">0.001654</td>
<td style="vertical-align: top; text-align: left">0.070020</td>
<td style="vertical-align: top; text-align: left">−0.103507</td>
<td style="vertical-align: top; text-align: left">0.173527</td>
<td style="vertical-align: top; text-align: left">0.015485</td>
<td style="vertical-align: top; text-align: left">−1.513177</td>
<td style="vertical-align: top; text-align: left">7.551657</td>
<td style="vertical-align: top; text-align: left">%10.68</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Average</td>
<td style="vertical-align: top; text-align: left">0.001602</td>
<td style="vertical-align: top; text-align: left">0.067084</td>
<td style="vertical-align: top; text-align: left">−0.109381</td>
<td style="vertical-align: top; text-align: left">0.176465</td>
<td style="vertical-align: top; text-align: left">0.015970</td>
<td style="vertical-align: top; text-align: left">−1.516512</td>
<td style="vertical-align: top; text-align: left">7.653730</td>
<td style="vertical-align: top; text-align: left">%10.03</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Centroid</td>
<td style="vertical-align: top; text-align: left">0.001682</td>
<td style="vertical-align: top; text-align: left">0.068849</td>
<td style="vertical-align: top; text-align: left">−0.103575</td>
<td style="vertical-align: top; text-align: left">0.172424</td>
<td style="vertical-align: top; text-align: left">0.015659</td>
<td style="vertical-align: top; text-align: left">−1.531529</td>
<td style="vertical-align: top; text-align: left">7.662994</td>
<td style="vertical-align: top; text-align: left">%10.47</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Median</td>
<td style="vertical-align: top; text-align: left">0.001650</td>
<td style="vertical-align: top; text-align: left">0.068843</td>
<td style="vertical-align: top; text-align: left">−0.103370</td>
<td style="vertical-align: top; text-align: left">0.172213</td>
<td style="vertical-align: top; text-align: left">0.015610</td>
<td style="vertical-align: top; text-align: left">−1.579865</td>
<td style="vertical-align: top; text-align: left">7.985782</td>
<td style="vertical-align: top; text-align: left">%10.57</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Weighted</td>
<td style="vertical-align: top; text-align: left">0.001565</td>
<td style="vertical-align: top; text-align: left">0.066707</td>
<td style="vertical-align: top; text-align: left">−0.102828</td>
<td style="vertical-align: top; text-align: left">0.169534</td>
<td style="vertical-align: top; text-align: left">0.015265</td>
<td style="vertical-align: top; text-align: left">−1.553718</td>
<td style="vertical-align: top; text-align: left">7.988663</td>
<td style="vertical-align: top; text-align: left">%10.25</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Ward</td>
<td style="vertical-align: top; text-align: left">0.001728</td>
<td style="vertical-align: top; text-align: left">0.070793</td>
<td style="vertical-align: top; text-align: left">−0.102738</td>
<td style="vertical-align: top; text-align: left">0.173531</td>
<td style="vertical-align: top; text-align: left">0.015478</td>
<td style="vertical-align: top; text-align: left">−1.544393</td>
<td style="vertical-align: top; text-align: left">7.992812</td>
<td style="vertical-align: top; text-align: left">%11.17</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">MCDM</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">0.001630</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">0.068443</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">−0.103784</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">0.172228</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">0.015673</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">−1.609712</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">8.070063</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">%10.40</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Table <xref rid="j_infor618_tab_006">6</xref> provides the detailed performance outcomes for the portfolios constructed under the hybrid HRP-MCDM framework using the stocks listed in the BIST 100 Index.</p>
<p>A meticulous inspection of these results reveals that the portfolios generated using the single and Ward linkage methods delivered the most robust overall performance, particularly in relation to both mean return and the crucial Sharpe ratio.</p>
<p>When the portfolios are comparatively assessed based on risk (standard deviation), the average-linkage portfolios exhibited the highest recorded volatility. Conversely, the weighted-linkage portfolios successfully displayed the lowest risk levels.</p>
<p>In terms of distribution characteristics, the skewness values consistently suggest that the return distributions across all linkage methods are negatively skewed relative to the standard normal distribution, implying a tendency toward larger negative return events. Concerning kurtosis, the single and Ward linkage portfolios demonstrated the most pronounced “heavy-tail” behaviour (leptokurtosis), while the complete and average linkage portfolios showed the lowest values. These findings suggest that the complete and average linkage methods are associated with a greater likelihood of extreme return fluctuations compared to other methods.</p>
<p>Finally, following the implementation of portfolio optimization using the traditional MEREC and WEDBA MCDM methods alone, a key finding emerged: a comparative analysis of the results in Table <xref rid="j_infor618_tab_006">6</xref> indicates that the hybrid HRP-MCDM portfolios generally outperform those created exclusively through traditional, standalone MCDM procedures.</p>
<p>Beyond this general performance comparison, a more nuanced evaluation yields several additional insights into the structural behaviour of the proposed hybrid model. The consistent increase in Sharpe ratios—most prominently observed for the single and Ward linkage strategies—demonstrates that augmenting HRP with objective MCDM-based evaluation effectively reduces the algorithm’s sensitivity to clustering noise and substantially enhances the overall risk–return alignment.</p>
<p>The empirical evidence also suggests that linkage techniques which inherently produce more homogeneous or economically meaningful clusters benefit disproportionately from the MCDM integration. This indicates that cluster quality directly mediates the effectiveness of the hybrid model. Although the HRP-MCDM approach might marginally increase volatility for some specific linkage configurations, this is typically offset by a corresponding increase in average returns, which ultimately strengthens the risk-adjusted performance. This observed pattern confirms that the combination of MEREC-based weighting and WEDBA-based ranking systematically shifts allocations toward financially stronger firms within each HRP-generated cluster.</p>
<p>Overall, the empirical results decisively demonstrate that the hybrid model not only optimizes weight reallocation but also systematically mitigates structural weaknesses inherent in the original HRP algorithm—particularly its tendency to over-allocate to underperforming assets in elongated cluster structures—thereby establishing a more resilient, balanced, and superior portfolio optimization procedure.</p>
</sec>
</sec>
<sec id="j_infor618_s_019">
<label>5</label>
<title>Conclusions and Recommendations</title>
<p>One of the most complex challenges facing both individual and institutional investors is the identification of securities capable of delivering sustained superior returns. In response to this need, Markowitz (<xref ref-type="bibr" rid="j_infor618_ref_064">1952</xref>) established the foundation for modern finance with the Mean-Variance Optimization (MVO) model, designed to maximize expected return for a given risk level. Despite its historical significance, the MVO framework has attracted widespread criticism, primarily for its persistent tendency to yield highly concentrated portfolios comprising only a limited selection of assets—a structural flaw that has resisted resolution through conventional methodological advances.</p>
<p>In light of these practical constraints, the field has transitioned toward alternative models. The technological explosion of financial data has strained the scalability of traditional optimization, accelerating the adoption of artificial intelligence–based techniques. Among these, the Hierarchical Risk Parity (HRP) algorithm—rooted in graph theory and machine learning—has emerged as a powerful countermeasure to the concentration problem. However, HRP’s performance superiority over MVO often remains constrained. Therefore, this study advanced the HRP algorithm by integrating MCDM methods—specifically MEREC and WEDBA—to create a novel hybrid portfolio framework capable of offering more comprehensive and robust investment recommendations. Using real market data from the BIST 100 Index, the hybrid construction was carried out in two principal phases.</p>
<p>The analysis first involved portfolio weighting via the HRP algorithm across seven distinct linkage methods (Ward, single, complete, average, weighted, centroid, and median). This was enhanced in the second phase by incorporating the Elbow method into HRP, which successfully identified the optimal number of clusters for refinement (e.g., eight clusters under Ward, six under single, etc.). Following clustering, each configuration was analysed using the MEREC method for objective criterion weighting (based on financial criteria such as current ratio, ROE, and leverage) and the WEDBA method for asset ranking.</p>
<p>A rigourous evaluation of the findings yielded the following critical observations:</p>
<p>Mean Return Dominance: The HRP-MCDM portfolios successfully yielded the highest mean returns under six of the seven linkage methods (Ward, single, complete, average, centroid, and median). The original HRP algorithm proved marginally superior only under the weighted linkage configuration.</p>
<p>Risk and Distribution: The HRP-MCDM approach demonstrated higher volatility (standard deviation) across all linkage types when compared against the baseline HRP. However, the return distributions for both the HRP and HRP-MCDM portfolios were consistently left-skewed (negatively skewed), and both approaches exhibited relatively heavy tails (high kurtosis), indicating a consistent, heightened probability of extreme market movements.</p>
<p>Sharpe Ratio Superiority: The most critical finding emerged from the risk-adjusted comparison: HRP-MCDM significantly outperformed HRP based on the Sharpe ratio under the Ward, single, complete, and median linkage methods. Conversely, HRP produced superior Sharpe ratios under the average, centroid, and weighted linkage methods.</p>
<p>Overall, the empirical evidence overwhelmingly suggests that investors seeking to enhance risk-adjusted portfolio performance and increase capital value should strategically consider adopting the HRP-MCDM approach, particularly when utilizing linkage methods that favour cluster homogeneity (like Ward and single linkage).</p>
<p>There are several directions that future research could take to further refine and broaden the scope of this study. To begin with, both investors and researchers who intend to apply the extended HRP–MCDM framework may obtain more meaningful insights by working with datasets that include a wider range of asset classes and cover different market environments. Expanding the data in this way would offer a clearer view of how the model behaves under varying economic conditions. Another line of inquiry could involve comparing the proposed HRP–MCDM approach with more traditional optimization techniques, such as the classic Mean–Variance Optimization (MVO). Such comparisons would help reveal whether the extended framework provides noticeable improvements in terms of risk management or portfolio stability. It may also be worthwhile to explore hybrid designs in future studies. Integrating alternative distance metrics or incorporating other MCDM methods into the HRP–MCDM structure could make the model more versatile and adaptable to different decision-making settings. Finally, developing a practical coding framework that can automatically retrieve up-to-date market data and present it to users would greatly enhance the applicability of the approach, particularly for investors who rely on timely information.</p>
<p><bold>Disclosure statement</bold> No potential conflict of interest was reported by the author(s).</p>
<p><bold>Funding</bold> No funding was received for this research.</p>
</sec>
</body>
<back>
<app-group>
<app id="j_infor618_app_001"><label>A</label>
<title>Appendix</title>
<table-wrap id="j_infor618_tab_007">
<label>Table A1</label>
<caption>
<p>BIST 100 companies in the scope of the study.</p>
</caption>
<table>
<thead>
<tr>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin"/>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Name of the companies</td>
</tr>
</thead>
<tbody>
<tr>
<td style="vertical-align: top; text-align: left">AEFES</td>
<td style="vertical-align: top; text-align: left">Anadolu Efes Biracılık ve Malt Sanayii A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">AGHOL</td>
<td style="vertical-align: top; text-align: left">Ag Anadolu Grubu Holding A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">AKFGY</td>
<td style="vertical-align: top; text-align: left">Akfen Gayrimenul Yatırım Ortaklığı A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">AKSA</td>
<td style="vertical-align: top; text-align: left">Aksa Akrilik Kimya Sanayii A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">AKSEN</td>
<td style="vertical-align: top; text-align: left">Aksa Enerji Üretim A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">ALARK</td>
<td style="vertical-align: top; text-align: left">Alarko Holding A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">ALGYO</td>
<td style="vertical-align: top; text-align: left">Alarko Gayrimenkul Yatırım Ortaklığı A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">ALKIM</td>
<td style="vertical-align: top; text-align: left">Alkim Alkali Kimya A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">ARCLK</td>
<td style="vertical-align: top; text-align: left">Arçelik A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">ASELS</td>
<td style="vertical-align: top; text-align: left">Aselsan Elektronik Sanayi ve Ticaret A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">BAGFS</td>
<td style="vertical-align: top; text-align: left">Bagfaş Bandırma Gübre Fabrikaları A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">BERA</td>
<td style="vertical-align: top; text-align: left">Bera Holding A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">BIMAS</td>
<td style="vertical-align: top; text-align: left">Bim Birleşik Mağazalar A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">BUCIM</td>
<td style="vertical-align: top; text-align: left">Bursa Çimento Fabrikası A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">CEMTS</td>
<td style="vertical-align: top; text-align: left">Çemtaş Çelik Makine Sanayi ve Ticaret A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">CIMSA</td>
<td style="vertical-align: top; text-align: left">Çimsa Çimento Sanayi ve Ticaret A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">DEVA</td>
<td style="vertical-align: top; text-align: left">Deva Holding A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">DOAS</td>
<td style="vertical-align: top; text-align: left">Doğuş Otomotiv Servis ve Ticaret A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">DOHOL</td>
<td style="vertical-align: top; text-align: left">Doğan Şirketler Grubu Holding A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">ECILC</td>
<td style="vertical-align: top; text-align: left">Eis Eczacıbaşı İlaç Sınai ve Finansal Yatırımlar Sanayi ve Ticaret A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">EGEEN</td>
<td style="vertical-align: top; text-align: left">Ege Endüstri ve Ticaret A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">EKGYO</td>
<td style="vertical-align: top; text-align: left">Emlak Konut Gayrimenkul Yatırım Ortaklığı A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">ENJSA</td>
<td style="vertical-align: top; text-align: left">Enerjisa Enerji A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">ENKAI</td>
<td style="vertical-align: top; text-align: left">Enka İnşaat ve Sanayi A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">ERBOS</td>
<td style="vertical-align: top; text-align: left">Erbosan Erciyas Boru Sanayii ve Ticaret A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">EREGL</td>
<td style="vertical-align: top; text-align: left">Ereğli Demir ve Çelik Fabrikaları T.A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">FROTO</td>
<td style="vertical-align: top; text-align: left">Ford Otomotiv Sanayi A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">GLYHO</td>
<td style="vertical-align: top; text-align: left">Global Yatırım Holding A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">GOZDE</td>
<td style="vertical-align: top; text-align: left">Gözde Girişim Sermayesi Yatırım Ortaklığı A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">GSDHO</td>
<td style="vertical-align: top; text-align: left">Gsd Holding A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">GUBRF</td>
<td style="vertical-align: top; text-align: left">Gübre Fabrikaları T.A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">HEKTS</td>
<td style="vertical-align: top; text-align: left">Hektaş Ticaret T.A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">IPEKE</td>
<td style="vertical-align: top; text-align: left">İpek Doğal Enerji Kaynakları Araştırma ve Üretim A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">ISMEN</td>
<td style="vertical-align: top; text-align: left">İş Yatırım Menkul Değerler A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">JANTS</td>
<td style="vertical-align: top; text-align: left">Jantsa Jant Sanayi ve Ticaret A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">KARSN</td>
<td style="vertical-align: top; text-align: left">Karsan Otomotiv Sanayii ve Ticaret A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">KARTN</td>
<td style="vertical-align: top; text-align: left">Kartonsan Karton Sanayi ve Ticaret A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">KCHOL</td>
<td style="vertical-align: top; text-align: left">Koç Holding A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">KORDS</td>
<td style="vertical-align: top; text-align: left">Kordsa Teknik Tekstil A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">KOZAA</td>
<td style="vertical-align: top; text-align: left">Koza Anadolu Metal Madencilik İşletmeleri A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">KOZAL</td>
<td style="vertical-align: top; text-align: left">Koza Altın İşletmeleri A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">KRDMD</td>
<td style="vertical-align: top; text-align: left">Kardemir Karabük Demir Çelik Sanayi ve Ticaret A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">LOGO</td>
<td style="vertical-align: top; text-align: left">Logo Yazılım Sanayi ve Ticaret A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">MGROS</td>
<td style="vertical-align: top; text-align: left">Migros Ticaret A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">NTHOL</td>
<td style="vertical-align: top; text-align: left">Net Holding A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">NUGYO</td>
<td style="vertical-align: top; text-align: left">Nurol Gayrimenkul Yatırım Ortaklığı A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">ODAS</td>
<td style="vertical-align: top; text-align: left">Odaş Elektrik Üretim Sanayi Ticaret A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">OTKAR</td>
<td style="vertical-align: top; text-align: left">Otokar Otomotiv ve Savunma Sanayi A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">OYAKC</td>
<td style="vertical-align: top; text-align: left">Oyak Çimento Fabrikaları A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">PETKM</td>
<td style="vertical-align: top; text-align: left">Petkim Petrokimya Holding A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">PGSUS</td>
<td style="vertical-align: top; text-align: left">Pegasus Hava Taşımacılığı A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">PRKAB</td>
<td style="vertical-align: top; text-align: left">Türk Prysmian Kablo ve Sistemleri A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">SAHOL</td>
<td style="vertical-align: top; text-align: left">Hacı Ömer Sabancı Holding A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">SASA</td>
<td style="vertical-align: top; text-align: left">Sasa Polyester Sanayi A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">SELEC</td>
<td style="vertical-align: top; text-align: left">Selçuk Ecza Deposu Ticaret ve Sanayi A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">SISE</td>
<td style="vertical-align: top; text-align: left">Türkiye Şişe ve Cam Fabrikaları A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">SNGYO</td>
<td style="vertical-align: top; text-align: left">Sinpaş Gayrimenkul Yatırım Ortaklığı A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">TAVHL</td>
<td style="vertical-align: top; text-align: left">Tav Havalimanları Holding A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">TCELL</td>
<td style="vertical-align: top; text-align: left">Turkcell İletişim Hizmetleri A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">THYAO</td>
<td style="vertical-align: top; text-align: left">Türk Hava Yolları A.O.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">TKFEN</td>
<td style="vertical-align: top; text-align: left">Tekfen Holding A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">TMSN</td>
<td style="vertical-align: top; text-align: left">Tümosan Motor ve Traktör Sanayi A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">TOASO</td>
<td style="vertical-align: top; text-align: left">Tofaş Türk Otomobil Fabrikası A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">TRGYO</td>
<td style="vertical-align: top; text-align: left">Torunlar Gayrimenkul Yatırım Ortaklığı A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">TSPOR</td>
<td style="vertical-align: top; text-align: left">Trabzonspor Sportif Yatırım ve Futbol İşletmeciliği Ticaret A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">TTKOM</td>
<td style="vertical-align: top; text-align: left">Türk Telekomünikasyon A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">TTRAK</td>
<td style="vertical-align: top; text-align: left">Türk Traktör ve Ziraat Makineleri A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">TUKAS</td>
<td style="vertical-align: top; text-align: left">Tukaş Gıda Sanayi ve Ticaret A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">TUPRS</td>
<td style="vertical-align: top; text-align: left">Tüpraş-Türkiye Petrol Rafinerileri A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">ULKER</td>
<td style="vertical-align: top; text-align: left">Ülker Bisküvi Sanayi A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">VESBE</td>
<td style="vertical-align: top; text-align: left">Vestel Beyaz Eşya Sanayi ve Ticaret A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">VESTL</td>
<td style="vertical-align: top; text-align: left">Vestel Elektronik Sanayi ve Ticaret A.Ş.</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">YATAS</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">Yataş Yatak ve Yorgan Sanayi Ticaret A.Ş.</td>
</tr>
</tbody>
</table>
</table-wrap> 
<table-wrap id="j_infor618_tab_008">
<label>Table A2</label>
<caption>
<p>Abbreviations.</p>
</caption>
<table>
<tbody>
<tr>
<td style="vertical-align: top; text-align: left; border-top: solid thin"><bold>ASRP</bold></td>
<td style="vertical-align: top; text-align: left; border-top: solid thin">Adaptive Serial Risk Parity</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"><bold>BIST</bold></td>
<td style="vertical-align: top; text-align: left">Borsa Istanbul</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"><bold>CAPM</bold></td>
<td style="vertical-align: top; text-align: left">Capital Asset Pricing Model</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"><bold>CLA</bold></td>
<td style="vertical-align: top; text-align: left">Critical Line Algorithm</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"><bold>cVAR</bold></td>
<td style="vertical-align: top; text-align: left">Conditional Value at Risk</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"><bold>DAX</bold></td>
<td style="vertical-align: top; text-align: left">Frankfurt Stock Exchange</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"><bold>DCC-GARCH</bold></td>
<td style="vertical-align: top; text-align: left">Dynamic Conditional Correlation GARCH</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"><bold>DJIA</bold></td>
<td style="vertical-align: top; text-align: left">Dow Jones Industrial Average</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"><bold>ETFs</bold></td>
<td style="vertical-align: top; text-align: left">Exchange-Traded Funds</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"><bold>EWMA</bold></td>
<td style="vertical-align: top; text-align: left">Exponentially Weighted Moving Average</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"><bold>FTSE</bold></td>
<td style="vertical-align: top; text-align: left">London Stock Exchange</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"><bold>HCAA</bold></td>
<td style="vertical-align: top; text-align: left">Hierarchical Clustering-based Asset Allocation</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"><bold>HERC</bold></td>
<td style="vertical-align: top; text-align: left">Hierarchical Equal Risk Contribution</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"><bold>HRP</bold></td>
<td style="vertical-align: top; text-align: left">Hierarchical Risk Parity</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"><bold>HRP-GS</bold></td>
<td style="vertical-align: top; text-align: left">Hierarchical Risk Parity based on Geber Statistics</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"><bold>IVP</bold></td>
<td style="vertical-align: top; text-align: left">Inverse Variance Parity</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"><bold>MAD</bold></td>
<td style="vertical-align: top; text-align: left">Mean Absolute Deviation</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"><bold>MCDM</bold></td>
<td style="vertical-align: top; text-align: left">Multi-Criteria Decision-Making</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"><bold>MEREC</bold></td>
<td style="vertical-align: top; text-align: left">Method based on the Removal Effects of Criteria</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"><bold>MSCI</bold></td>
<td style="vertical-align: top; text-align: left">Morgan Stanley Capital International</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"><bold>MVO</bold></td>
<td style="vertical-align: top; text-align: left">Mean Variance Model</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"><bold>OECD</bold></td>
<td style="vertical-align: top; text-align: left">Organization for Economic Co-Operation and Development</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"><bold>QHRP</bold></td>
<td style="vertical-align: top; text-align: left">Quantum Inspired Hierarchical Risk Parity</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"><bold>ROA</bold></td>
<td style="vertical-align: top; text-align: left">Return on Equity</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"><bold>ROE</bold></td>
<td style="vertical-align: top; text-align: left">Return on Assets</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"><bold>RL</bold></td>
<td style="vertical-align: top; text-align: left">Reinforcement Learning</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"><bold>RWP</bold></td>
<td style="vertical-align: top; text-align: left">Randomized Weighted Portfolio</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"><bold>SMPL</bold></td>
<td style="vertical-align: top; text-align: left">Sample-Based Covariance</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"><bold>SPA</bold></td>
<td style="vertical-align: top; text-align: left">Superior Predictive Ability</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"><bold>UPGMA</bold></td>
<td style="vertical-align: top; text-align: left">Unweighted Pair Group Method with Arithmetic</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"><bold>UPGMC</bold></td>
<td style="vertical-align: top; text-align: left">Unweighted Pair Group Method using Centroids</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"><bold>upHRP</bold></td>
<td style="vertical-align: top; text-align: left">Enhanced Hierarchical Risk Parity</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"><bold>WEDBA</bold></td>
<td style="vertical-align: top; text-align: left">Weighted Euclidian Distance Based Approach</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"><bold>WPGMA</bold></td>
<td style="vertical-align: top; text-align: left">Weighted Pair Group Method with Arithmetic</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin"><bold>WPGMC</bold></td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">Weighted Pair Group Method using Centroids</td>
</tr>
</tbody>
</table>
</table-wrap>
</app></app-group>
<ref-list id="j_infor618_reflist_001">
<title>References</title>
<ref id="j_infor618_ref_001">
<mixed-citation publication-type="journal"><string-name><surname>Abrar</surname>, <given-names>I.N.</given-names></string-name>, <string-name><surname>Abdullah</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Sucipto</surname>, <given-names>S.</given-names></string-name> (<year>2023</year>). <article-title>Liver disease classification using the elbow method to determine optimal K in the K-nearest neighbor (K-NN) algorithm</article-title>. <source>Jurnal Sisfokom (Sistem Informasi Dan Komputer)</source>, <volume>12</volume>(<issue>2</issue>), <fpage>218</fpage>–<lpage>228</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.32736/sisfokom.v12i2.1643" xlink:type="simple">https://doi.org/10.32736/sisfokom.v12i2.1643</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_002">
<mixed-citation publication-type="other"><string-name><surname>Alipour</surname>, <given-names>E.</given-names></string-name>, <string-name><surname>Adolphs</surname>, <given-names>C.</given-names></string-name>, <string-name><surname>Zaribafiyan</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Rounds</surname>, <given-names>M.</given-names></string-name> (<year>2016</year>). Quantum-inspired hierarchical risk parity. <italic>1QB Information Technologies</italic>, 1–10.</mixed-citation>
</ref>
<ref id="j_infor618_ref_003">
<mixed-citation publication-type="journal"><string-name><surname>Altıntaş</surname>, <given-names>F.F.</given-names></string-name> (<year>2023</year>). <article-title>Analysis of vulnerability performances with the MEREC-based RAFSI method: G7 group countries</article-title>. <source>KMU Journal of Social and Economic Research</source>, <volume>25</volume>(<issue>44</issue>), <fpage>464</fpage>–<lpage>490</lpage>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_004">
<mixed-citation publication-type="journal"><string-name><surname>Amor</surname>, <given-names>S.B.</given-names></string-name>, <string-name><surname>Althof</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Härdle</surname>, <given-names>W.K.</given-names></string-name> (<year>2022</year>). <article-title>Financial risk meter for emerging markets</article-title>. <source>Research in International Business and Finance</source>, <volume>60</volume>, <fpage>1</fpage>–<lpage>26</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1016/j.ribaf.2021.101594" xlink:type="simple">https://doi.org/10.1016/j.ribaf.2021.101594</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_005">
<mixed-citation publication-type="chapter"><string-name><surname>Antonov</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Lipton</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>de Prado</surname>, <given-names>M.L.</given-names></string-name> (<year>2025</year>). <chapter-title>Overcoming Markowitz’s instability with the help of the Hierarchical Risk Parity (HRP): theoretical evidence</chapter-title>. In: <source>Transactions of ADIA Lab: Interdisciplinary Advances in Data and Computational Science</source>, pp. <fpage>87</fpage>–<lpage>121</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1142/9789819813049_0003" xlink:type="simple">https://doi.org/10.1142/9789819813049_0003</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_006">
<mixed-citation publication-type="other"><string-name><surname>Arian</surname>, <given-names>H.R.</given-names></string-name>, <string-name><surname>Kondratyev</surname>, <given-names>O.</given-names></string-name>, <string-name><surname>Norouzi M</surname>, <given-names>D.</given-names></string-name> (<year>2025</year>). Quantum hierarchical risk parity and its classical counterpart. Available at SSRN: <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.2139/ssrn.5330108" xlink:type="simple">https://doi.org/10.2139/ssrn.5330108</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_007">
<mixed-citation publication-type="journal"><string-name><surname>Arman</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Kundakcı</surname>, <given-names>N.</given-names></string-name> (<year>2023</year>). <article-title>Cloud service provider selection for a business with a new integrated FUCOM-WEDBA approach</article-title>. <source>Pamukkale University Journal of Social Sciences Institute</source>, <volume>56</volume>, <fpage>281</fpage>–<lpage>295</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.30794/pausbed.1212975" xlink:type="simple">https://doi.org/10.30794/pausbed.1212975</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_008">
<mixed-citation publication-type="journal"><string-name><surname>Ayçin</surname>, <given-names>E.</given-names></string-name>, <string-name><surname>Güçlü</surname>, <given-names>P.</given-names></string-name> (<year>2020</year>). <article-title>Evaluation of financial performance of businesses in BIST trade index with entropy and MAIRCA methods</article-title>. <source>The Journal of Accounting and Finance</source>, <volume>85</volume>, <fpage>287</fpage>–<lpage>312</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.25095/mufad.673739" xlink:type="simple">https://doi.org/10.25095/mufad.673739</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_009">
<mixed-citation publication-type="other"><string-name><surname>Barziy</surname>, <given-names>I.</given-names></string-name>, <string-name><surname>Chlebus</surname>, <given-names>M.</given-names></string-name> (<year>2020</year>). <italic>HRP performance comparison in portfolio optimization under various codependence and distance metrics</italic>. Working Papers 2020–21, Faculty of Economic Sciences, University of Warsaw.</mixed-citation>
</ref>
<ref id="j_infor618_ref_010">
<mixed-citation publication-type="journal"><string-name><surname>Baydaş</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Pamucar</surname>, <given-names>D.</given-names></string-name> (<year>2022</year>). <article-title>Determining objective characteristics of MCDM methods under uncertainty: an exploration study with financial data</article-title>. <source>Mathematics</source>, <volume>10</volume>(<issue>7</issue>), <fpage>1</fpage>–<lpage>25</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.3390/math10071115" xlink:type="simple">https://doi.org/10.3390/math10071115</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_011">
<mixed-citation publication-type="other"><string-name><surname>Bechis</surname>, <given-names>L.</given-names></string-name> (2020). <italic>Machine Learning Portfolio Optimization: Hierarchical Risk Parity and Modern Portfolio Theory</italic>. Master’s degree, Department of Business and Management, Libera Università Internazionale degli Studi Sociali Guido Carli.</mixed-citation>
</ref>
<ref id="j_infor618_ref_012">
<mixed-citation publication-type="journal"><string-name><surname>Bholowalia</surname>, <given-names>P.</given-names></string-name>, <string-name><surname>Kumar</surname>, <given-names>A.</given-names></string-name> (<year>2014</year>). <article-title>EBK-Means: a clustering technique based on elbow method and k-means in WSN</article-title>. <source>International Journal of Computer Applications</source>, <volume>105</volume>(<issue>9</issue>), <fpage>17</fpage>–<lpage>24</lpage>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_013">
<mixed-citation publication-type="journal"><string-name><surname>Black</surname>, <given-names>F.</given-names></string-name>, <string-name><surname>Litterman</surname>, <given-names>R.</given-names></string-name> (<year>1991</year>). <article-title>Asset allocation: combing investor views with market equilibrium</article-title>. <source>Journal of Fixed Income</source>, <volume>1</volume>, <fpage>7</fpage>–<lpage>18</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.3905/jfi.1991.408013" xlink:type="simple">https://doi.org/10.3905/jfi.1991.408013</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_014">
<mixed-citation publication-type="journal"><string-name><surname>Burggraf</surname>, <given-names>T.</given-names></string-name> (<year>2021</year>). <article-title>Beyond risk parity–a machine learning-based hierarchical risk parity approach on cryptocurrencies</article-title>. <source>Finance Research Letters</source>, <volume>38</volume>, <fpage>1</fpage>–<lpage>9</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1016/j.frl.2020.101523" xlink:type="simple">https://doi.org/10.1016/j.frl.2020.101523</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_015">
<mixed-citation publication-type="journal"><string-name><surname>Çetin</surname>, <given-names>E.</given-names></string-name>, <string-name><surname>İslamoglu</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Erer</surname>, <given-names>E.</given-names></string-name> (<year>2025</year>). <article-title>Portfolio optimization in financial investment instruments</article-title>. <source>Research of Financial Economic and Social Studies</source>, <volume>10</volume>(<issue>1</issue>), <fpage>87</fpage>–<lpage>105</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.29106/fesa.1598016" xlink:type="simple">https://doi.org/10.29106/fesa.1598016</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_016">
<mixed-citation publication-type="journal"><string-name><surname>Curtis</surname>, <given-names>G.</given-names></string-name> (<year>2004</year>). <article-title>Modern portfolio theory and behavioral finance</article-title>. <source>The Journal of Wealth Management</source>, <volume>7</volume>(<issue>2</issue>), <fpage>16</fpage>–<lpage>22</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.3905/jwm.2004.434562" xlink:type="simple">https://doi.org/10.3905/jwm.2004.434562</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_017">
<mixed-citation publication-type="other"><string-name><surname>De Lio Pérego</surname>, <given-names>F.</given-names></string-name> (2021). <italic>Hierarchical Portfolio Optimization</italic>. Bachelor’s thesis. Universitat Politècnica De Catalunya, Spain.</mixed-citation>
</ref>
<ref id="j_infor618_ref_018">
<mixed-citation publication-type="journal"><string-name><surname>De Prado</surname>, <given-names>M.L.</given-names></string-name> (<year>2016</year>). <article-title>Building diversified portfolios that outperform out of sample</article-title>. <source>The Journal of Portfolio Management</source>, <volume>42</volume>(<issue>4</issue>), <fpage>59</fpage>–<lpage>69</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.3905/jpm.2016.42.4.059" xlink:type="simple">https://doi.org/10.3905/jpm.2016.42.4.059</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_019">
<mixed-citation publication-type="journal"><string-name><surname>Deković</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Šimović</surname>, <given-names>P.P.</given-names></string-name> (<year>2025</year>). <article-title>Hierarchical risk parity: efficient implementation and real-world analysis</article-title>. <source>Future Generation Computer Systems</source>, <volume>167</volume>, <elocation-id>107744</elocation-id>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1016/j.future.2025.107744" xlink:type="simple">https://doi.org/10.1016/j.future.2025.107744</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_020">
<mixed-citation publication-type="journal"><string-name><surname>Demir</surname>, <given-names>G.</given-names></string-name> (<year>2021</year>). <article-title>Academic performance analysis foundation universities: CRITIC-WEDBA integrated model application</article-title>. <source>International Journal of Economic and Administrative Academic Research</source>, <volume>1</volume>(<issue>1</issue>), <fpage>39</fpage>–<lpage>50</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.29137/umagd.1098902" xlink:type="simple">https://doi.org/10.29137/umagd.1098902</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_021">
<mixed-citation publication-type="journal"><string-name><surname>Deniz</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Okuyan</surname>, <given-names>H.A.</given-names></string-name> (<year>2018</year>). <article-title>The comparison of the empirical results of traditional and modern portfolio management: BIST application</article-title>. <source>Journal of Mehmet Akif Ersoy University Economics and Administrative Sciences Faculty</source>, <volume>5</volume>(<issue>2</issue>), <fpage>467</fpage>–<lpage>482</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.30798/makuiibf.407200" xlink:type="simple">https://doi.org/10.30798/makuiibf.407200</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_022">
<mixed-citation publication-type="journal"><string-name><surname>Ecemiş</surname>, <given-names>O.</given-names></string-name>, <string-name><surname>Coşkun</surname>, <given-names>A.</given-names></string-name> (<year>2022</year>). <article-title>Examination of the use of information technologies in Turkey by MCDM methods: 2014–2021 period</article-title>. <source>European Journal of Science and Technology</source>, <volume>37</volume>, <fpage>81</fpage>–<lpage>89</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.31590/ejosat.1134753" xlink:type="simple">https://doi.org/10.31590/ejosat.1134753</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_023">
<mixed-citation publication-type="journal"><string-name><surname>Ecer</surname>, <given-names>F.</given-names></string-name>, <string-name><surname>Ayçin</surname>, <given-names>E.</given-names></string-name> (<year>2023</year>). <article-title>Novel comprehensive MEREC weighting-based score aggregation model for measuring innovation performance: the case of G7 countries</article-title>. <source>Informatica</source>, <volume>34</volume>(<issue>1</issue>), <fpage>53</fpage>–<lpage>83</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.15388/22-INFOR494" xlink:type="simple">https://doi.org/10.15388/22-INFOR494</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_024">
<mixed-citation publication-type="journal"><string-name><surname>Elsayed</surname>, <given-names>A.</given-names></string-name> (<year>2024</year>). <article-title>Comprehensive review MEREC weighting method for smart building selection for new capital using neutrosophic theory</article-title>. <source>Neutrosophic Sets and Systems</source>, <volume>63</volume>(<issue>1</issue>), <fpage>342</fpage>–<lpage>366</lpage>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_025">
<mixed-citation publication-type="journal"><string-name><surname>Ersoy</surname>, <given-names>N.</given-names></string-name> (<year>2023</year>). <article-title>Assessment of macroeconomic performances of OECD countries using the MEREC-MULTIMOOSRAL model</article-title>. <source>Gümüşhane University Journal of Social Sciences</source>, <volume>14</volume>(<issue>2</issue>), <fpage>471</fpage>–<lpage>491</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.36362/gumus.1203999" xlink:type="simple">https://doi.org/10.36362/gumus.1203999</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_026">
<mixed-citation publication-type="journal"><string-name><surname>Ertuğrul</surname>, <given-names>İ.</given-names></string-name>, <string-name><surname>Karakaşoğlu</surname>, <given-names>N.</given-names></string-name> (<year>2009</year>). <article-title>performance evaluation of Turkish cement firms with fuzzy analytic hierarchy process and TOPSIS methods</article-title>. <source>Expert Systems with Applications</source>, <volume>36</volume>(<issue>1</issue>), <fpage>702</fpage>–<lpage>715</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1016/j.eswa.2007.10.014" xlink:type="simple">https://doi.org/10.1016/j.eswa.2007.10.014</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_027">
<mixed-citation publication-type="journal"><string-name><surname>Erzurumlu</surname>, <given-names>E.A.</given-names></string-name>, <string-name><surname>Gençtürk</surname>, <given-names>M.</given-names></string-name> (<year>2025</year>). <article-title>A research on the financial performance of islamic banks: SD-WEDBA method</article-title>. <source>Alanya Akademik Bakış</source>, <volume>9</volume>(<issue>2</issue>), <fpage>639</fpage>–<lpage>650</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.29023/alanyaakademik.1622511" xlink:type="simple">https://doi.org/10.29023/alanyaakademik.1622511</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_028">
<mixed-citation publication-type="journal"><string-name><surname>Fama</surname>, <given-names>E.F.</given-names></string-name>, <string-name><surname>French</surname>, <given-names>K.R.</given-names></string-name> (<year>1993</year>). <article-title>Common risk factors in the returns on stocks and bonds</article-title>. <source>The Journal of Financial Economics</source>, <volume>33</volume>, <fpage>3</fpage>–<lpage>56</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1016/0304-405X(93)90023-5" xlink:type="simple">https://doi.org/10.1016/0304-405X(93)90023-5</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_029">
<mixed-citation publication-type="journal"><string-name><surname>Farrokh</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Heydari</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Janani</surname>, <given-names>H.</given-names></string-name> (<year>2016</year>). <article-title>Two comparative MCDM approaches for evaluating the financial performance of Iranian basic metals companies</article-title>. <source>Iranian Journal of Management Studies (IJMS)</source>, <volume>9</volume>(<issue>2</issue>), <fpage>359</fpage>–<lpage>382</lpage>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_030">
<mixed-citation publication-type="journal"><string-name><surname>Fidan</surname>, <given-names>Ü.</given-names></string-name> (<year>2022</year>). <article-title>Can bitcoin be an alternative to the portfolio diversification decision? MEREC-based VIKOR approach</article-title>. <source>Journal of Academic Approach</source>, <volume>13</volume>(<issue>2</issue>), <fpage>526</fpage>–<lpage>545</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.54688/ayd.1182620" xlink:type="simple">https://doi.org/10.54688/ayd.1182620</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_031">
<mixed-citation publication-type="journal"><string-name><surname>Garg</surname>, <given-names>R.</given-names></string-name> (<year>2017</year>). <article-title>Optimal selection of e-learning websites using multiattribute decision-making approaches</article-title>. <source>Journal of Multi-Criteria Decision Analysis</source>, <volume>24</volume>(<issue>3–4</issue>), <fpage>187</fpage>–<lpage>196</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1002/mcda.1612" xlink:type="simple">https://doi.org/10.1002/mcda.1612</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_032">
<mixed-citation publication-type="journal"><string-name><surname>Goswami</surname>, <given-names>S.S.</given-names></string-name>, <string-name><surname>Mohanty</surname>, <given-names>S.K.</given-names></string-name>, <string-name><surname>Behera</surname>, <given-names>D.K.</given-names></string-name> (<year>2022</year>). <article-title>selection of a green renewable energy source in India with the help of MEREC integrated PIV MCDM Tool</article-title>. <source>Materials Today: Proceedings</source>, <volume>52</volume>, <fpage>1153</fpage>–<lpage>1160</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1016/j.matpr.2021.11.019" xlink:type="simple">https://doi.org/10.1016/j.matpr.2021.11.019</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_033">
<mixed-citation publication-type="journal"><string-name><surname>Gupta</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Gupta</surname>, <given-names>N.</given-names></string-name>, <string-name><surname>Garg</surname>, <given-names>R.K.</given-names></string-name> (<year>2018</year>). <article-title>Implementing weighted entropy-distance based approach for the selection of software reliability growth models</article-title>. <source>International Journal of Computer Applications in Technology</source>, <volume>57</volume>(<issue>3</issue>), <fpage>255</fpage>–<lpage>266</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1504/IJCAT.2018.092990" xlink:type="simple">https://doi.org/10.1504/IJCAT.2018.092990</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_034">
<mixed-citation publication-type="journal"><string-name><surname>Hadi</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Abdullah</surname>, <given-names>M.Z.</given-names></string-name> (<year>2022</year>). <article-title>Web and iot-based hospital location determination with criteria weight analysis</article-title>. <source>Bulletin of Electrical Engineering and Informatics</source>, <volume>11</volume>(<issue>1</issue>), <fpage>386</fpage>–<lpage>395</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.11591/eei.v11i1.3214" xlink:type="simple">https://doi.org/10.11591/eei.v11i1.3214</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_035">
<mixed-citation publication-type="journal"><string-name><surname>Işık</surname>, <given-names>Ö.</given-names></string-name> (<year>2021</year>). <article-title>An Analysis of the Financial performance of AXA insurance company with an integrated MCDM model Including AHP, CRITIC, and WEDBA methods</article-title>. <source>International Journal of Business, Economics and Management Perspective</source>, <volume>5</volume>(<issue>2</issue>), <fpage>893</fpage>–<lpage>908</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.29228/ijbemp.55049" xlink:type="simple">https://doi.org/10.29228/ijbemp.55049</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_036">
<mixed-citation publication-type="journal"><string-name><surname>Işıldak</surname>, <given-names>B.</given-names></string-name>, <string-name><surname>Keleş</surname>, <given-names>M.K.</given-names></string-name>, <string-name><surname>Özdağoğlu</surname>, <given-names>A.</given-names></string-name> (<year>2023</year>). <article-title>Evaluation of Tekirdağ Çorlu Atatürk Airport’s performance by years with IDOCRIW and WEDBA methods</article-title>. <source>HUMANITAS – International Journal of Social Sciences</source>, <volume>11</volume>, <fpage>169</fpage>–<lpage>182</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.20304/humanitas.1271656" xlink:type="simple">https://doi.org/10.20304/humanitas.1271656</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_037">
<mixed-citation publication-type="journal"><string-name><surname>Jaeger</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Krügel</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Marinelli</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Papenbrock</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Schwendner</surname>, <given-names>P.</given-names></string-name> (<year>2021</year>). <article-title>Interpretable machine learning for diversified portfolio construction</article-title>. <source>The Journal of Financial Data Science</source>, <volume>3</volume>(<issue>3</issue>), <fpage>31</fpage>–<lpage>51</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.3905/jfds.2021.1.066" xlink:type="simple">https://doi.org/10.3905/jfds.2021.1.066</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_038">
<mixed-citation publication-type="journal"><string-name><surname>Jain</surname>, <given-names>P.</given-names></string-name>, <string-name><surname>Jain</surname>, <given-names>S.</given-names></string-name> (<year>2019</year>). <article-title>Can machine learning-based portfolios outperform traditional risk-based portfolios? The need to account for covariance misspecification</article-title>. <source>Risks</source>, <volume>7</volume>(<issue>3</issue>), <fpage>74</fpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.3390/risks7030074" xlink:type="simple">https://doi.org/10.3390/risks7030074</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_039">
<mixed-citation publication-type="journal"><string-name><surname>Jain</surname>, <given-names>V.</given-names></string-name>, <string-name><surname>Ajmera</surname>, <given-names>P.</given-names></string-name> (<year>2019</year>). <article-title>Application of MADM methods as MOORA and WEDBA for ranking of FMS flexibility</article-title>. <source>International Journal of Data and Network Science</source>, <volume>3</volume>(<issue>2</issue>), <fpage>119</fpage>–<lpage>136</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.5267/j.ijdns.2018.12.003" xlink:type="simple">https://doi.org/10.5267/j.ijdns.2018.12.003</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_040">
<mixed-citation publication-type="chapter"><string-name><surname>Jothimani</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Bener</surname>, <given-names>A.</given-names></string-name> (<year>2019</year>). <chapter-title>Risk parity models for portfolio optimization: a study of the toronto stock exchange</chapter-title>. In: <source>2019 International Conference on Deep Learning and Machine Learning in Emerging Applications (Deep-ML)</source>, pp. <fpage>27</fpage>–<lpage>32</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1109/Deep-ML.2019.00014" xlink:type="simple">https://doi.org/10.1109/Deep-ML.2019.00014</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_041">
<mixed-citation publication-type="other"><string-name><surname>Jothimani</surname>, <given-names>D.</given-names></string-name> (<year>2017</year>). <italic>Portfolio Optimization in Indian Market: A Study Using Financial Analytics</italic>. Doctoral Dissertation, Department of Management Studies Indian Institute of Technology, Delhi/Indian.</mixed-citation>
</ref>
<ref id="j_infor618_ref_042">
<mixed-citation publication-type="other"><string-name><surname>Kaae</surname>, <given-names>C.E.</given-names></string-name>, <string-name><surname>Karppinen</surname>, <given-names>J.A.</given-names></string-name>, <string-name><surname>Jakobsen</surname>, <given-names>J.S.</given-names></string-name> (2022). <italic>Hierarchical Risk Parity–A Hierarchical Clustering-Based Portfolio Optimization</italic>. Master’s Degree, Department of Finance and Investment, Copenhagen Business School, Denmark.</mixed-citation>
</ref>
<ref id="j_infor618_ref_043">
<mixed-citation publication-type="journal"><string-name><surname>Kara</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Yalçın</surname>, <given-names>G.C.</given-names></string-name>, <string-name><surname>Acar</surname>, <given-names>A.Z.</given-names></string-name>, <string-name><surname>Simic</surname>, <given-names>V.</given-names></string-name>, <string-name><surname>Konya</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Pamucar</surname>, <given-names>D.</given-names></string-name> (<year>2024</year>a). <article-title>The MEREC-AROMAN method for determining sustainable competitiveness levels: a case study for Turkey</article-title>. <source>Socio-Economic Planning Sciences</source>, <volume>91</volume>, <elocation-id>101762</elocation-id>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1016/j.seps.2023.101762" xlink:type="simple">https://doi.org/10.1016/j.seps.2023.101762</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_044">
<mixed-citation publication-type="journal"><string-name><surname>Kara</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Yalçın</surname>, <given-names>G.C.</given-names></string-name>, <string-name><surname>Kaygısız</surname>, <given-names>E.G.</given-names></string-name>, <string-name><surname>Edinsel</surname>, <given-names>S.</given-names></string-name> (<year>2024</year>c). <article-title>Assessing the academic performance of Turkish universities in 2023: a MEREC-WEDBA hybrid methodology approach</article-title>. <source>Journal of Operations Intelligence</source>, <volume>2</volume>(<issue>1</issue>), <fpage>252</fpage>–<lpage>272</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.31181/jopi21202422" xlink:type="simple">https://doi.org/10.31181/jopi21202422</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_045">
<mixed-citation publication-type="journal"><string-name><surname>Kara</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Yalçın</surname>, <given-names>G.C.</given-names></string-name>, <string-name><surname>Simic</surname>, <given-names>V.</given-names></string-name>, <string-name><surname>Baysal</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Pamucar</surname>, <given-names>D.</given-names></string-name> (<year>2024</year>b). <article-title>The alternative ranking using two-step logarithmic normalization method for benchmarking the supply chain performance of countries</article-title>. <source>Socio-Economic Planning Sciences</source>, <volume>96</volume>, <elocation-id>101822</elocation-id>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1016/j.seps.2024.101822" xlink:type="simple">https://doi.org/10.1016/j.seps.2024.101822</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_046">
<mixed-citation publication-type="journal"><string-name><surname>Karadeniz</surname>, <given-names>E.</given-names></string-name>, <string-name><surname>İskenderoğlu</surname>, <given-names>Ö.</given-names></string-name> (<year>2011</year>). <article-title>The analysis of the variables that effect return on assets of tourism companies quoted on Istanbul Stock Exchange</article-title>. <source>Anatolia: Journal of Tourism Research</source>, <volume>22</volume>(<issue>1</issue>), <fpage>65</fpage>–<lpage>75</lpage>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_047">
<mixed-citation publication-type="journal"><string-name><surname>Karaköy</surname>, <given-names>Ç.</given-names></string-name>, <string-name><surname>Ulutaş</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Karabasevic</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Üre</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Bayrakçıl</surname>, <given-names>A.O.</given-names></string-name> (<year>2023</year>). <article-title>The evaluation of economic freedom indexes of EU countries with a grey hybrid MCDM model</article-title>. <source>Romanian Journal of Economic Forecasting</source>, <volume>26</volume>(<issue>1</issue>), <fpage>129</fpage>–<lpage>144</lpage>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_048">
<mixed-citation publication-type="other"><string-name><surname>Kaska</surname>, <given-names>M.</given-names></string-name> (<year>2020</year>). <italic>Blockchain Applications in Maritime Industry</italic>. Unpublished Master’s Thesis, Galatasaray University Graduate School of Science and Engineering, Istanbul.</mixed-citation>
</ref>
<ref id="j_infor618_ref_049">
<mixed-citation publication-type="journal"><string-name><surname>Katrancı</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Kundakcı</surname>, <given-names>N.</given-names></string-name>, <string-name><surname>Pamucar</surname>, <given-names>D.</given-names></string-name> (<year>2025</year>). <article-title>Financial performance evaluation of firms in BIST 100 index with ITARA and COBRA methods</article-title>. <source>Financial Innovation</source>, <volume>11</volume>(<issue>1</issue>), <fpage>1</fpage>–<lpage>28</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1186/s40854-024-00704-5" xlink:type="simple">https://doi.org/10.1186/s40854-024-00704-5</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_050">
<mixed-citation publication-type="journal"><string-name><surname>Keshavarz-Ghorabaee</surname>, <given-names>M.</given-names></string-name> (<year>2021</year>). <article-title>Assessment of distribution center locations using a multi-expert subjective–objective decision-making approach</article-title>. <source>Scientific Reports</source>, <volume>11</volume>(<issue>1</issue>), <elocation-id>19461</elocation-id>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1038/s41598-021-98698-y" xlink:type="simple">https://doi.org/10.1038/s41598-021-98698-y</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_051">
<mixed-citation publication-type="journal"><string-name><surname>Keshavarz-Ghorabaee</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Amiri</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Zavadskas</surname>, <given-names>E.K.</given-names></string-name>, <string-name><surname>Turskis</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Antucheviciene</surname>, <given-names>J.</given-names></string-name> (<year>2021</year>). <article-title>Determination of objective weights using a new method based on the removal effects of criteria (MEREC)</article-title>. <source>Symmetry</source>, <volume>13</volume>(<issue>4</issue>), <fpage>525</fpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.3390/sym13040525" xlink:type="simple">https://doi.org/10.3390/sym13040525</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_052">
<mixed-citation publication-type="journal"><string-name><surname>Keskin</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Türkoğlu</surname>, <given-names>S.P.</given-names></string-name> (<year>2022</year>). <article-title>Performance evaluation of banks traded in BIST sustainable index with the WEDBA method</article-title>. <source>Social Sciences Studies Journal</source>, <volume>8</volume>(<issue>102</issue>), <fpage>3237</fpage>–<lpage>3244</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.29228/sssj.64364" xlink:type="simple">https://doi.org/10.29228/sssj.64364</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_053">
<mixed-citation publication-type="journal"><string-name><surname>Kodinariya</surname>, <given-names>T.M.</given-names></string-name>, <string-name><surname>Makwana</surname>, <given-names>P.R.</given-names></string-name> (<year>2013</year>). <article-title>Review on determining number of cluster in K-means clustering</article-title>. <source>International Journal</source>, <volume>1</volume>(<issue>6</issue>), <fpage>90</fpage>–<lpage>95</lpage>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_054">
<mixed-citation publication-type="journal"><string-name><surname>Kolm</surname>, <given-names>P.N.</given-names></string-name>, <string-name><surname>Tütüncü</surname>, <given-names>R.</given-names></string-name>, <string-name><surname>Fabozzi</surname>, <given-names>F.J.</given-names></string-name> (<year>2014</year>). <article-title>60 years of portfolio optimization: practical challenges and current trends</article-title>. <source>European Journal of Operational Research</source>, <volume>234</volume>(<issue>2</issue>), <fpage>356</fpage>–<lpage>371</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1016/j.ejor.2013.10.060" xlink:type="simple">https://doi.org/10.1016/j.ejor.2013.10.060</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_055">
<mixed-citation publication-type="journal"><string-name><surname>Komasi</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Yazdi</surname>, <given-names>A.K.</given-names></string-name>, <string-name><surname>Jamini</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Tan</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Ocampo</surname>, <given-names>L.</given-names></string-name> (<year>2025</year>). <article-title>Sustainable industrial development potential of Iranian provinces using the integration of MEREC and TRUST methods</article-title>. <source>Journal of Management Analytics</source>, <volume>1</volume>(<issue>33</issue>). <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1080/23270012.2025.2506748" xlink:type="simple">https://doi.org/10.1080/23270012.2025.2506748</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_056">
<mixed-citation publication-type="journal"><string-name><surname>Konno</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Yamazaki</surname>, <given-names>H.</given-names></string-name> (<year>1991</year>). <article-title>Mean-absolute deviation portfolio optimization model and its applications to Tokyo stock market</article-title>. <source>Management Science</source>, <volume>37</volume>(<issue>5</issue>), <fpage>519</fpage>–<lpage>531</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1287/mnsc.37.5.519" xlink:type="simple">https://doi.org/10.1287/mnsc.37.5.519</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_057">
<mixed-citation publication-type="journal"><string-name><surname>Kundakcı</surname>, <given-names>N.</given-names></string-name>, <string-name><surname>Arman</surname>, <given-names>K.</given-names></string-name> (<year>2023</year>). <article-title>Analysis of real estate investment companies traded in BIST corporate governance index with integrated MCDM approach</article-title>. <source>Pamukkale University Journal of Business Research (PIAR)</source>, <volume>10</volume>(<issue>1</issue>), <fpage>124</fpage>–<lpage>143</lpage>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_058">
<mixed-citation publication-type="other"><string-name><surname>Lagowski</surname>, <given-names>M.</given-names></string-name> (<year>2022</year>). <italic>Portfolio Optimisation: An Empirical Study of The Hierarchical Risk Parity and Mean-Variance Methods</italic>. Thesis for: BSc Economics and Finance, Lancaster University, England.</mixed-citation>
</ref>
<ref id="j_infor618_ref_059">
<mixed-citation publication-type="journal"><string-name><surname>Leković</surname>, <given-names>M.</given-names></string-name> (<year>2021</year>). <article-title>Historical development of portfolio theory</article-title>. <source>Tehnika</source>, <volume>76</volume>(<issue>2</issue>), <fpage>220</fpage>–<lpage>227</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.5937/tehnika2102220l" xlink:type="simple">https://doi.org/10.5937/tehnika2102220l</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_060">
<mixed-citation publication-type="journal"><string-name><surname>Lintner</surname>, <given-names>J.</given-names></string-name> (<year>1965</year>). <article-title>The valuation of risk assets and the selection of risky investments in stock portfolios and capital budgets</article-title>. <source>The Review of Economics and Statistics</source>, <volume>47</volume>(<issue>1</issue>), <fpage>13</fpage>–<lpage>37</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.2307/1924119" xlink:type="simple">https://doi.org/10.2307/1924119</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_061">
<mixed-citation publication-type="other"><string-name><surname>Liutov</surname>, <given-names>S.</given-names></string-name> (<year>2018</year>). <italic>Alternative Portfolio Diversification Approaches: An Empirical Comparison</italic>. Doctoral Dissertation, School of Economic, Kyiv, Ukraine.</mixed-citation>
</ref>
<ref id="j_infor618_ref_062">
<mixed-citation publication-type="journal"><string-name><surname>Lorenzo</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Arroyo</surname>, <given-names>J.</given-names></string-name> (<year>2023</year>). <article-title>Online risk-based portfolio allocation on subsets of crypto assets applying a prototype-based clustering algorithm</article-title>. <source>Financial Innovation</source>, <volume>9</volume>(<issue>1</issue>), <fpage>25</fpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1186/s40854-022-00438-2" xlink:type="simple">https://doi.org/10.1186/s40854-022-00438-2</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_063">
<mixed-citation publication-type="journal"><string-name><surname>Lukić</surname>, <given-names>R.</given-names></string-name> (<year>2023</year>). <article-title>Analysis of the performance of the serbian economy based on the MEREC-WASPAS method</article-title>. <source>MARSONIA: Časopis za Društvena i Humanistička Istraživanja</source>, <volume>2</volume>(<issue>1</issue>), <fpage>39</fpage>–<lpage>52</lpage>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_064">
<mixed-citation publication-type="journal"><string-name><surname>Markowitz</surname>, <given-names>H.M.</given-names></string-name> (<year>1952</year>). <article-title>Portfolio selection</article-title>. <source>Journal of Finance</source>, <volume>7</volume>(<issue>1</issue>), <fpage>77</fpage>–<lpage>91</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1111/j.1540-6261.1952.tb01525.x" xlink:type="simple">https://doi.org/10.1111/j.1540-6261.1952.tb01525.x</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_065">
<mixed-citation publication-type="journal"><string-name><surname>Mastilo</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Štilić</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Gligović</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Puška</surname>, <given-names>A.</given-names></string-name> (<year>2024</year>). <article-title>Assessing the banking sector of Bosnia and Herzegovina: an analysis of financial indicators through the MEREC and MARCOS methods</article-title>. <source>Journal of Central Banking Theory and Practice</source>, <volume>13</volume>(<issue>1</issue>), <fpage>167</fpage>–<lpage>197</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.2478/jcbtp-2024-0008" xlink:type="simple">https://doi.org/10.2478/jcbtp-2024-0008</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_066">
<mixed-citation publication-type="journal"><string-name><surname>Mishra</surname>, <given-names>A.R.</given-names></string-name>, <string-name><surname>Saha</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Rani</surname>, <given-names>P.</given-names></string-name>, <string-name><surname>Hezam</surname>, <given-names>I.M.</given-names></string-name>, <string-name><surname>Shrivastava</surname>, <given-names>R.</given-names></string-name>, <string-name><surname>Smarandache</surname>, <given-names>F.</given-names></string-name> (<year>2022</year>). <article-title>An integrated decision support framework using single-valued-MEREC-MULTIMOORA for low carbon tourism strategy assessment</article-title>. <source>IEEE Access</source>, <volume>10</volume>, <fpage>24411</fpage>–<lpage>24432</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1109/ACCESS.2022.3155171" xlink:type="simple">https://doi.org/10.1109/ACCESS.2022.3155171</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_067">
<mixed-citation publication-type="journal"><string-name><surname>Moghimi</surname>, <given-names>R.</given-names></string-name>, <string-name><surname>Anvari</surname>, <given-names>A.</given-names></string-name> (<year>2014</year>). <article-title>An integrated fuzzy MCDM approach and analysis to evaluate the financial performance of Iranian cement companies</article-title>. <source>The International Journal of Advanced Manufacturing Technology</source>, <volume>71</volume>(<issue>1–4</issue>), <fpage>685</fpage>–<lpage>698</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1007/s00170-013-5370-6" xlink:type="simple">https://doi.org/10.1007/s00170-013-5370-6</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_068">
<mixed-citation publication-type="journal"><string-name><surname>Mossin</surname>, <given-names>J.</given-names></string-name> (<year>1966</year>). <article-title>Equilibrium in a capital asset market</article-title>. <source>Econometrica: Journal of the Econometric Society</source>, <volume>34</volume>(<issue>3</issue>), <fpage>768</fpage>–<lpage>783</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.2307/1910098" xlink:type="simple">https://doi.org/10.2307/1910098</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_069">
<mixed-citation publication-type="book"><string-name><surname>Nanakorn</surname>, <given-names>N.</given-names></string-name>, <string-name><surname>Palmgren</surname>, <given-names>E.</given-names></string-name> (<year>2021</year>). <source>Hierarchical Clustering in Risk-Based Portfolio Construction</source>. <publisher-name>KTH Royal Institute of Technology School of Engineering Sciences</publisher-name>, <publisher-loc>Sweden</publisher-loc>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_070">
<mixed-citation publication-type="journal"><string-name><surname>Nicolalde</surname>, <given-names>J.F.</given-names></string-name>, <string-name><surname>Cabrera</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Martínez-Gómez</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Salazar</surname>, <given-names>R.B.</given-names></string-name>, <string-name><surname>Reyes</surname>, <given-names>E.</given-names></string-name> (<year>2022</year>). <article-title>Selection of a phase change material for energy storage by multi-criteria decision method regarding the thermal comfort in a vehicle</article-title>. <source>Journal of Energy Storage</source>, <volume>51</volume>, <fpage>1</fpage>–<lpage>14</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1016/j.est.2022.104437" xlink:type="simple">https://doi.org/10.1016/j.est.2022.104437</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_071">
<mixed-citation publication-type="journal"><string-name><surname>Nourahmadi</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Sadeqi</surname>, <given-names>H.</given-names></string-name> (<year>2021</year>). <article-title>Hierarchical risk parity as an alternative to conventional methods of portfolio optimization: a study of Tehran stock exchange</article-title>. <source>Iranian Journal of Finance</source>, <volume>5</volume>(<issue>4</issue>), <fpage>1</fpage>–<lpage>24</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.30699/ijf.2021.289848.1242" xlink:type="simple">https://doi.org/10.30699/ijf.2021.289848.1242</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_072">
<mixed-citation publication-type="journal"><string-name><surname>Nourahmadi</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Sadeqi</surname>, <given-names>H.</given-names></string-name> (<year>2022</year>). <article-title>A machine learning-based hierarchical risk parity approach: a case study of portfolio consisting of stocks of the top 30 companies on the Tehran stock exchange</article-title>. <source>Financial Research Journal</source>, <volume>24</volume>(<issue>2</issue>), <fpage>236</fpage>–<lpage>256</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.22059/frj.2021.319092.1007146" xlink:type="simple">https://doi.org/10.22059/frj.2021.319092.1007146</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_073">
<mixed-citation publication-type="journal"><string-name><surname>Oğuz</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Satir</surname>, <given-names>H.</given-names></string-name> (<year>2024</year>). <article-title>Analyzing profitability performance with the integrated MEREC-COBRA method: the case of BIST retail companies</article-title>. <source>Business and Economics Research Journal</source>, <volume>15</volume>(<issue>1</issue>), <fpage>33</fpage>–<lpage>50</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.20409/berj.2024.433" xlink:type="simple">https://doi.org/10.20409/berj.2024.433</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_074">
<mixed-citation publication-type="journal"><string-name><surname>Palit</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Prybutok</surname>, <given-names>V.R.</given-names></string-name> (<year>2024</year>). <article-title>A study of hierarchical risk parity in portfolio construction</article-title>. <source>Journal of Economic Analysis</source>, <volume>3</volume>(<issue>3</issue>), <fpage>106</fpage>–<lpage>125</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.58567/jea03030006" xlink:type="simple">https://doi.org/10.58567/jea03030006</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_075">
<mixed-citation publication-type="other"><string-name><surname>Papenbrock</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Schwendner</surname>, <given-names>P.</given-names></string-name>, <string-name><surname>Sandner</surname>, <given-names>P.G.</given-names></string-name> (2021). Can adaptive seriational risk parity tame crypto portfolios? Available at SSRN: <uri>https://doi.org/10.2139/ssrn.3877143</uri>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_076">
<mixed-citation publication-type="journal"><string-name><surname>Pelit</surname>, <given-names>İ.</given-names></string-name>, <string-name><surname>Avşar</surname>, <given-names>İ.İ.</given-names></string-name> (<year>2025</year>). <article-title>Türkiye’s carbon emission profile: a global analysis with the MEREC-PROMETHEE hybrid method</article-title>. <source>Sustainability</source>, <volume>17</volume>(<issue>14</issue>), <fpage>6527</fpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.3390/su17146527" xlink:type="simple">https://doi.org/10.3390/su17146527</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_077">
<mixed-citation publication-type="other"><string-name><surname>Pfitzinger</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Katzke</surname>, <given-names>N.</given-names></string-name> (<year>2019</year>). <italic>A constrained hierarchical risk parity algorithm with cluster-based capital allocation</italic>. Working Papers 14/2019, Stellenbosch University, Department of Economics.</mixed-citation>
</ref>
<ref id="j_infor618_ref_078">
<mixed-citation publication-type="other"><string-name><surname>Popović</surname>, <given-names>G.</given-names></string-name>, <string-name><surname>Karabašević</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Stanujkić</surname>, <given-names>D.</given-names></string-name> (<year>2021</year>). Multiple-criteria framework for cloud service selection. In: <italic>PaKSoM 2021</italic>, pp. 377–382.</mixed-citation>
</ref>
<ref id="j_infor618_ref_079">
<mixed-citation publication-type="journal"><string-name><surname>Popović</surname>, <given-names>G.</given-names></string-name>, <string-name><surname>Pucar</surname>, <given-names>Ð.</given-names></string-name>, <string-name><surname>Smarandache</surname>, <given-names>F.</given-names></string-name> (<year>2022</year>). <article-title>MEREC-COBRA approach in e-commerce development strategy selection</article-title>. <source>Journal of Process Management and New Technologies</source>, <volume>10</volume>(<issue>3–4</issue>), <fpage>66</fpage>–<lpage>74</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.5937/jouproman2203066P" xlink:type="simple">https://doi.org/10.5937/jouproman2203066P</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_080">
<mixed-citation publication-type="other"><string-name><surname>Puška</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Božanić</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Mastilo</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Pamučar</surname>, <given-names>D.</given-names></string-name> (<year>2023</year>). A model based on MEREC-CRADIS objective decision-making methods and the application of double normalization: a case study of the selection of electric cars. <italic>Research Square</italic>, 1–19. <uri>https://doi.org/10.21203/rs.3.rs-2092146/v1</uri>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_081">
<mixed-citation publication-type="other"><string-name><surname>Raffinot</surname>, <given-names>T.</given-names></string-name> (<year>2018</year>). <italic>The Hierarchical Equal Risk Contribution Portfolio</italic>. Working Paper, PSL Research University, Paris, France. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.2139/ssrn.3237540" xlink:type="simple">https://doi.org/10.2139/ssrn.3237540</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_082">
<mixed-citation publication-type="journal"><string-name><surname>Rajabi</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Eskandari</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Ghadi</surname>, <given-names>M.J.</given-names></string-name>, <string-name><surname>Li</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Siano</surname>, <given-names>P.</given-names></string-name> (<year>2020</year>). <article-title>A comparative study of clustering techniques for electrical load pattern segmentation</article-title>. <source>Renewable and Sustainable Energy Reviews</source>, <volume>120</volume>, <elocation-id>109628</elocation-id>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1016/j.rser.2019.109628" xlink:type="simple">https://doi.org/10.1016/j.rser.2019.109628</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_083">
<mixed-citation publication-type="other"><string-name><surname>Ramirez-Carrillo</surname>, <given-names>G.</given-names></string-name>, <string-name><surname>Ortiz-Mora</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Aguilar-Larrotta</surname>, <given-names>A.</given-names></string-name> (<year>2025</year>). <italic>Hierarchical Risk Parity for Portfolio Allocation in the Latin American NUAM Market</italic>. arXiv preprint. arXiv:<ext-link ext-link-type="uri" xlink:href="https://arxiv.org/abs/2509.03712">2509.03712</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_084">
<mixed-citation publication-type="journal"><string-name><surname>Rao</surname>, <given-names>R.V.</given-names></string-name>, <string-name><surname>Singh</surname>, <given-names>D.</given-names></string-name> (<year>2012</year>). <article-title>Weighted euclidean distance-based approach as a multiple attribute decision making method for plant or facility layout design selection</article-title>. <source>International Journal of Industrial Engineering Computations</source>, <volume>3</volume>(<issue>3</issue>), <fpage>365</fpage>–<lpage>382</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.5267/j.ijiec.2012.01.003" xlink:type="simple">https://doi.org/10.5267/j.ijiec.2012.01.003</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_085">
<mixed-citation publication-type="other"><string-name><surname>Reis</surname>, <given-names>F.</given-names></string-name>, <string-name><surname>Sobreira</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Trucíos</surname>, <given-names>C.</given-names></string-name>, <string-name><surname>Asrilhant</surname>, <given-names>B.</given-names></string-name> (<year>2023</year>). <italic>Using Hierarchical Risk Parity in the Brazilian Market: an Out-of-Sample Analysis</italic>. Available at SSRN: <uri>https://doi.org/10.2139/ssrn.4545982</uri>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_086">
<mixed-citation publication-type="journal"><string-name><surname>Ross</surname>, <given-names>S.A.</given-names></string-name> (<year>1976</year>). <article-title>The arbitrage theory of capital asset pricing</article-title>. <source>Journal of Economic Theory</source>, <volume>13</volume>, <fpage>341</fpage>–<lpage>360</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1016/0022-0531(76)90046-6" xlink:type="simple">https://doi.org/10.1016/0022-0531(76)90046-6</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_087">
<mixed-citation publication-type="chapter"><string-name><surname>Samarakoon</surname>, <given-names>L.P.</given-names></string-name>, <string-name><surname>Hasan</surname>, <given-names>T.</given-names></string-name> (<year>2006</year>). <chapter-title>Portfolio performance evaluation</chapter-title>. In: <string-name><surname>Lee</surname>, <given-names>C.F.</given-names></string-name>, <string-name><surname>Lee</surname>, <given-names>A.C.</given-names></string-name> (Eds.), <source>Encyclopedia of Finance</source>. <publisher-name>Springer</publisher-name>, <publisher-loc>Boston, MA</publisher-loc>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_088">
<mixed-citation publication-type="journal"><string-name><surname>Satıcı</surname>, <given-names>S.</given-names></string-name> (<year>2022</year>). <article-title>Evaluation of entrepreneurial and innovative performance of universities with the MEREC-based WASPAS method</article-title>. <source>Journal of Entrepreneurship and Development</source>, <volume>17</volume>(<issue>2</issue>), <fpage>106</fpage>–<lpage>128</lpage>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_089">
<mixed-citation publication-type="chapter"><string-name><surname>Sen</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Dutta</surname>, <given-names>A.</given-names></string-name> (<year>2023</year>). <chapter-title>A comparative study of hierarchical risk parity portfolio and eigen portfolio on the NIFTY 50 stocks</chapter-title>. In: <source>Computational Intelligence and Data Analytics: Proceedings of ICCIDA 2022</source>. <publisher-name>Springer Nature Singapore</publisher-name>, <publisher-loc>Singapore</publisher-loc>, pp. <fpage>443</fpage>–<lpage>460</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1007/978-981-19-3391-2_34" xlink:type="simple">https://doi.org/10.1007/978-981-19-3391-2_34</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_090">
<mixed-citation publication-type="chapter"><string-name><surname>Sen</surname>, <given-names>J.</given-names></string-name> (<year>2023</year>). <chapter-title>Portfolio optimization using reinforcement learning and hierarchical risk parity approach</chapter-title>. In: <string-name><surname>Cruz-Reyes</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Dorronsoro</surname>, <given-names>B.</given-names></string-name>, <string-name><surname>Rivera</surname>, <given-names>R.</given-names></string-name>, <string-name><surname>Rosete</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Rosete</surname>, <given-names>A.</given-names></string-name> (Eds.) <source>Data Analytics and Computational Intelligence: Novel Models, Algorithm and Applications</source>, <series>Studies in Big Data</series>, Vol. <volume>132</volume>, <publisher-name>Springer</publisher-name>. pp. <fpage>509</fpage>–<lpage>554</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1007/978-3-031-38325-0_20" xlink:type="simple">https://doi.org/10.1007/978-3-031-38325-0_20</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_091">
<mixed-citation publication-type="journal"><string-name><surname>Shahbazi</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Byun</surname>, <given-names>Y.C.</given-names></string-name> (<year>2022</year>). <article-title>Machine learning-based analysis of cryptocurrency market financial risk management</article-title>. <source>IEEE Access</source>, <volume>10</volume>, <fpage>37848</fpage>–<lpage>37856</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1109/ACCESS.2022.3162858" xlink:type="simple">https://doi.org/10.1109/ACCESS.2022.3162858</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_092">
<mixed-citation publication-type="journal"><string-name><surname>Shanmugasundar</surname>, <given-names>G.</given-names></string-name>, <string-name><surname>Sapkota</surname>, <given-names>G.</given-names></string-name>, <string-name><surname>Čep</surname>, <given-names>R.</given-names></string-name>, <string-name><surname>Kalita</surname>, <given-names>K.</given-names></string-name> (<year>2022</year>). <article-title>Application of MEREC in multi-criteria selection of optimal spray-painting robot</article-title>. <source>Processes</source>, <volume>10</volume>(<issue>6</issue>), <fpage>1</fpage>–<lpage>16</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.3390/pr10061172" xlink:type="simple">https://doi.org/10.3390/pr10061172</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_093">
<mixed-citation publication-type="journal"><string-name><surname>Sharpe</surname>, <given-names>W.F.</given-names></string-name> (<year>1963</year>). <article-title>A simplified model for portfolio analysis</article-title>. <source>Management Science</source>, <volume>9</volume>(<issue>2</issue>), <fpage>277</fpage>–<lpage>293</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1287/mnsc.9.2.277" xlink:type="simple">https://doi.org/10.1287/mnsc.9.2.277</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_094">
<mixed-citation publication-type="journal"><string-name><surname>Simić</surname>, <given-names>V.</given-names></string-name>, <string-name><surname>Ivanović</surname>, <given-names>I.</given-names></string-name>, <string-name><surname>Ðorić</surname>, <given-names>V.</given-names></string-name>, <string-name><surname>Torkayesh</surname>, <given-names>A.E.</given-names></string-name> (<year>2022</year>). <article-title>Adapting urban transport planning to the covid-19 pandemic: an integrated fermatean fuzzy model</article-title>. <source>Sustainable Cities and Society</source>, <volume>79</volume>, <fpage>1</fpage>–<lpage>26</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1016/j.scs.2022.103669" xlink:type="simple">https://doi.org/10.1016/j.scs.2022.103669</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_095">
<mixed-citation publication-type="journal"><string-name><surname>Şimşek</surname>, <given-names>O.</given-names></string-name> (<year>2022</year>). <article-title>Financial performance evaluation in the Turkish banking sector with a hybrid MCDM model</article-title>. <source>Turkish Studies – Economy</source>, <volume>17</volume>(<issue>2</issue>), <fpage>447</fpage>–<lpage>470</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.7827/TurkishStudies.62308" xlink:type="simple">https://doi.org/10.7827/TurkishStudies.62308</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_096">
<mixed-citation publication-type="other"><string-name><surname>Sjöstrand</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Behnejad</surname>, <given-names>N.</given-names></string-name>, <string-name><surname>Richter</surname>, <given-names>M.</given-names></string-name> (<year>2020</year>). <italic>Exploration of Hierarchical Clustering in Long-Only Risk-Based Portfolio Optimization</italic>. Master Thesis, Master of Economics and Business Administration, Copenhagen Business School, Copenhagen/Denmark.</mixed-citation>
</ref>
<ref id="j_infor618_ref_097">
<mixed-citation publication-type="journal"><string-name><surname>Srivastava</surname>, <given-names>P.</given-names></string-name>, <string-name><surname>Mazhar</surname>, <given-names>S.</given-names></string-name> (<year>2018</year>). <article-title>Comparative analysis of sharpe and sortino ratio with reference to top ten banking and finance sector mutual funds</article-title>. <source>International Journal of Management Studies</source>, <volume>4</volume>(<issue>2</issue>), <fpage>93</fpage>–<lpage>100</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.18843/ijms/v5i4(2)/10" xlink:type="simple">https://doi.org/10.18843/ijms/v5i4(2)/10</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_098">
<mixed-citation publication-type="journal"><string-name><surname>Tolga</surname>, <given-names>A.Ç.</given-names></string-name>, <string-name><surname>Başar</surname>, <given-names>M.</given-names></string-name> (<year>2022</year>). <article-title>The assessment of a smart system in hydroponic vertical farming via fuzzy MCDM methods</article-title>. <source>Journal of Intelligent, Fuzzy Systems</source>, <volume>42</volume>(<issue>1</issue>), <fpage>1</fpage>–<lpage>12</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.3233/JIFS-219170" xlink:type="simple">https://doi.org/10.3233/JIFS-219170</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_099">
<mixed-citation publication-type="journal"><string-name><surname>Tuş</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Aytaç Adalı</surname>, <given-names>E.</given-names></string-name> (<year>2025</year>). <article-title>Enhancing private pension system evaluation using fermatean fuzzy sets and weighted euclidean distance-based approach</article-title>. <source>Operations Research Forum</source> <volume>6</volume>, <elocation-id>130</elocation-id>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1007/s43069-025-00527-9" xlink:type="simple">https://doi.org/10.1007/s43069-025-00527-9</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_100">
<mixed-citation publication-type="journal"><string-name><surname>Ulutaş</surname>, <given-names>A.</given-names></string-name> (<year>2020</year>). <article-title>Stacker selection with PSI and WEDBA methods</article-title>. <source>International Journal of Contemporary Economics and Administrative Sciences</source>, <volume>10</volume>(<issue>2</issue>), <fpage>493</fpage>–<lpage>504</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.5281/zenodo.4430021" xlink:type="simple">https://doi.org/10.5281/zenodo.4430021</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_101">
<mixed-citation publication-type="journal"><string-name><surname>Ulutaş</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Stanujkic</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Karabasevic</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Popovic</surname>, <given-names>G.</given-names></string-name>, <string-name><surname>Novaković</surname>, <given-names>S.</given-names></string-name> (<year>2022</year>). <article-title>Pallet truck selection with MEREC and WISP-S methods</article-title>. <source>Strategic Management – International Journal of Strategic Management and Decision Support Systems in Strategic Management</source> <volume>27</volume>(<issue>4</issue>), <fpage>23</fpage>–<lpage>29</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.5937/StraMan2200013U" xlink:type="simple">https://doi.org/10.5937/StraMan2200013U</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_102">
<mixed-citation publication-type="other"><string-name><surname>Uyar</surname>, <given-names>U.</given-names></string-name>, <string-name><surname>Yavuz</surname>, <given-names>M.</given-names></string-name> (<year>2023</year>). Fraktal-HRP: Hybrid Machine Learning Proposal in Portfolio Management. In: <italic>26th Finance Symposium Sivas Cumhuriyet University</italic>, pp. 293–307. <uri>https://hdl.handle.net/11499/66067</uri>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_103">
<mixed-citation publication-type="other"><string-name><surname>Uyar</surname>, <given-names>U.</given-names></string-name> (<year>2019</year>). Machine learning asset allocation: application from FTSE, DAX and BIST. In: <italic>23th Finance Symposium Marmara University</italic>, pp. 161–175.</mixed-citation>
</ref>
<ref id="j_infor618_ref_104">
<mixed-citation publication-type="other"><string-name><surname>Wysocki</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Sakowski</surname>, <given-names>P.</given-names></string-name> (<year>2022</year>). <italic>Investment Portfolio Optimization Based on Modern Portfolio Theory and Deep Learning Models</italic>. University of Warsaw. Faculty of Economic Sciences. <uri>https://doi.org/10.48550/arXiv.2508.14999</uri>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_105">
<mixed-citation publication-type="journal"><string-name><surname>Yaşar</surname>, <given-names>E.</given-names></string-name>, <string-name><surname>Ünlü</surname>, <given-names>M.</given-names></string-name> (<year>2023</year>). <article-title>Examining sustainability in universities: an analysis of green universities with LOPCOW and MEREC based CoCoSo methods</article-title>. <source>Journal of Business Academy</source>, <volume>4</volume>(<issue>2</issue>), <fpage>125</fpage>–<lpage>142</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.26677/TR1010.2023.1246" xlink:type="simple">https://doi.org/10.26677/TR1010.2023.1246</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_106">
<mixed-citation publication-type="journal"><string-name><surname>Yılmaz</surname>, <given-names>H.</given-names></string-name> (<year>2025</year>). <article-title>Portfolio optimization application with genetic algorithm based on mean variance model, Sharpe and Treynor criteria in BIST 30</article-title>. <source>Süleyman Demirel University Visionary Journal</source>, <volume>16</volume>(<issue>45</issue>), <fpage>90</fpage>–<lpage>112</lpage>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.21076/vizyoner.1498629" xlink:type="simple">https://doi.org/10.21076/vizyoner.1498629</ext-link>.</mixed-citation>
</ref>
<ref id="j_infor618_ref_107">
<mixed-citation publication-type="journal"><string-name><surname>Zhang</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>C.</given-names></string-name>, <string-name><surname>Li</surname>, <given-names>E.</given-names></string-name>, <string-name><surname>Xu</surname>, <given-names>C.</given-names></string-name> (<year>2014</year>). <article-title>Assessment model of ecoenvironmental vulnerability based on improved entropy weight method</article-title>. <source>Scientific World Journal</source>, <volume>1</volume>, <elocation-id>797814</elocation-id>. <ext-link ext-link-type="doi" xlink:href="https://doi.org/10.1155/2014/797814" xlink:type="simple">https://doi.org/10.1155/2014/797814</ext-link>.</mixed-citation>
</ref>
</ref-list>
</back>
</article>
