Ranking Algorithm Research Articles

Evaluating the impact of urban sprawl on the urban ecological status using GIS and remote sensing from 2000 to 2021: a case study of Herat City, Afghanistan.

Urbanization often incurs environmental costs, as fertile agricultural and forested lands are converted into urban areas. Herat City is currently undergoing significant urban transformation. This research aims to assess the impact of urban sprawl on Herat City's urban ecological status during 2000, 2013, and 2021, using GIS and remote sensing. The urban expansion intensity index was used to measure urban sprawl. The Mean Remote Sensing Ecological Index (MRSEI), integrating known granulation entropy (KGE) and comprehensive distance-based ranking (COBRA) algorithms, was utilized to evaluate urban ecological status. The random forest (RF) supervised machine learning-based algorithm was used to classify the study area into four categories (Built-up, Bare-land, Water, and Vegetation). Findings indicate rapid development from 2000 to 2013, followed by moderate expansion until 2021. Urban ecological quality degradation is observed in various directions over time, with the southeast consistently demonstrating excellent status. Interestingly, while good and excellent urban ecological status decreases over two decades, poor and very poor conditions improve. The research underscores an inverse relationship between urban expansion intensity and ecological status, highlighting the need for improved strategies to mitigate environmental decline. These findings will inform Afghan governmental bodies and international organizations, enabling them to better address resource consumption, ecological disruptions, social inequalities, and foster sustainable development.

An alternating shifted higher order power method based algorithm for rank-[formula omitted] Hermitian approximation and solving Hermitian CP-decomposition problems

The Hermitian tensor is a higher order extension of the Hermitian matrix that can be used to represent quantum mixed states and solve problems such as entanglement and separability of quantum mixed states. In this paper, we propose a novel numerical algorithm, an alternating shifted higher order power method (AS-HOPM), for rank-R Hermitian approximation, which can also be used to compute Hermitian Candecomp/Parafac (CP) decomposition. At the same time, for the choice of initial points, we give a Broyden–Fletcher–Goldfarb–Shanno (BFGS) method based on unconstrained optimization, and propose a BFGS-AS-HOPM algorithm for rank-R Hermitian approximation. For solving the Hermitian CP-decomposition problem, numerical experiments show that using the BFGS-AS-HOPM algorithm has a higher success rate than using the AS-HOPM algorithm alone.

Optimal Algorithms for Online b-Matching with Variable Vertex Capacities

AbstractWe study the b-matching problem, which generalizes classical online matching introduced by Karp, Vazirani and Vazirani (STOC 1990). Consider a bipartite graph $$G=(S\dot{\cup }R,E)$$ G = ( S ∪ ˙ R , E ) . Every vertex $$s\in S$$ s ∈ S is a server with a capacity $$b_s$$ b s , indicating the number of possible matching partners. The vertices $$r\in R$$ r ∈ R are requests that arrive online and must be matched immediately to an eligible server. The goal is to maximize the cardinality of the constructed matching. In contrast to earlier work, we study the general setting where servers may have arbitrary, individual capacities. We prove that the most natural and simple online algorithms achieve optimal competitive ratios. As for deterministic algorithms, we give a greedy algorithm RelativeBalance and analyze it by extending the primal-dual framework of Devanur, Jain and Kleinberg (SODA 2013). In the area of randomized algorithms we study the celebrated Ranking algorithm by Karp, Vazirani and Vazirani. We prove that the original Ranking strategy, simply picking a random permutation of the servers, achieves an optimal competitiveness of $$1-1/e$$ 1 - 1 / e , independently of the server capacities. Hence it is not necessary to resort to a reduction, replacing every server s by $$b_s$$ b s vertices of unit capacity and to then run Ranking on this graph with $$\sum _{s\in S} b_s$$ ∑ s ∈ S b s vertices on the left-hand side. Additionally, we extend this result to the vertex-weighted b-matching problem. Technically, we formulate a new configuration LP for the b-matching problem and conduct a primal-dual analysis.

Investigation of the risk influential factors of maritime accidents: A novel topology and robustness analytical framework

This study aims to develop a novel and fully data-driven approach to analyse the maritime accidents risk influential factors (RIFs) by integrating Association Rule Mining (ARM) and Complex Network (CN) modelling. Firstly, a comprehensive dataset comprising 21,206 maritime accident records from Marine Accident Investigation Branch and Transportation Safety Board is collected and processed to serve as the foundational data source supporting the development of the new approach. Secondly, a novel Combined Association Rule Mining method is proposed to extract the interconnections among RIFs, with the mined results mapped into a CN framework. Finally, two importance ranking algorithms, namely the PageRank-Information-Entropy algorithm and edge betweenness centrality, are applied to identify the key RIFs and their information transmission paths. By simulating deliberate and random attacks within networks, a robustness analysis is conducted to further explore the evolution of RIFs. The findings reveal that ship-related factors demonstrate greater centrality and connectivity, exerting a more substantial influence on information propagation within the network structure. The robustness analysis illustrates that strategic node and edge removals are effective in preventing risk propagation. It therefore makes contributions to the development of a theoretical basis for stakeholders to develop cost-effective preventive measures against specific RIFs, ultimately enhancing maritime safety.

AI-Powered Search Systems : Integrating Machine Learning with Search Technology for High-Scalability Applications

This article comprehensively analyzes integrating Artificial Intelligence (AI) and machine learning techniques into high-scalability search systems. We explore AI-powered search's theoretical foundations and practical implementations, focusing on advanced ranking algorithms, natural language processing for query understanding, and optimized distributed architectures. We demonstrate significant improvements in search relevance and efficiency through experiments conducted on a large-scale dataset comprising 100 million web pages and 1 million real-world queries. Our AI-powered system showed a 15% increase in Normalized Discounted Cumulative Gain (NDCG) for complex queries and a 12% improvement in Mean Reciprocal Rank (MRR) for navigational queries compared to traditional keyword-based approaches. We also address critical challenges in maintaining system scalability and performance, including data synchronization, real-time model updates, and resource management in distributed environments. The article further discusses emerging trends, such as graph neural networks and multimodal search capabilities, alongside ethical considerations and data privacy concerns. Our findings provide valuable insights for researchers and practitioners aiming to develop next-generation search platforms capable of handling the increasing complexity and volume of digital information while ensuring responsible AI integration.

Prediction and clustering of Alzheimer’s disease by race and sex: a multi-head deep-learning approach to analyze irregular and heterogeneous data

Early detection of Alzheimer’s disease (AD) is crucial to maximize clinical outcomes. Most disease progression analyses include people with diagnoses of cognitive impairment, limiting understanding of AD risk among those with normal cognition. The objective was to establish AD progression models through a deep learning approach to analyze heterogeneous, multi-modal datasets, including clustering analyses of population subsets. A multi-head deep-learning architecture was built to process and learn from biomedical and imaging data from the National Alzheimer’s Coordinating Center. Shapley additive explanation algorithms for feature importance ranking and pairwise correlation analysis were used to identify predictors of disease progression. Four primary disease progression clusters (slow, moderate and rapid converters or non-converters) were subdivided into groups by race and sex, yielding 16 sub-clusters of participants with distinct progression patterns. A multi-head and early-fusion convolutional neural network achieved the most competitive performance and demonstrated superiority over a single-head deep learning architecture and conventional tree-based machine-learning methods, with 97% test accuracy, 96% F1 score and 0.19 root mean square error. From 447 features, 2 sets of 100 predictors of disease progression were extracted. Feature importance ranking, correlation analysis and descriptive statistics further enriched cluster analysis and validation of the heterogeneity of risk factors.

A Hybrid Ranking Algorithm for Secure and Efficient Iris Template Protection

Indexing methods are mostly used to protect sensitive biometric data stored in templates. As such, iris template protection has been used as a way of securing the efficiency of biometric templates acquired from iris images. The four requirements, namely irreversibility, unlinkability, renewability, and performance are stipulated by the ISO/IEC 24745 standard for biometric template protection, but these have not been met simultaneously by most of the recent indexing methods while striving to maintain efficient iris recognition. Therefore, this study designs three new ranking algorithms, which are dense ranks (denseR), ordinal ranks (ordinalR), and hybrid dense and ordinal ranks (hybridR) for iris template protection that aims to comply to the required standard. Four iris datasets Casia-Iris-Interval, Casia-Iris-Lamp, MMU-V1, and UBRIS-V1 were used to perform the experiments across the proposed three algorithms. The results showed that the hybridR algorithm outperformed others with an Equal Error Rate of 0.16313%. The hybridR algorithm also showed a time complexity of O(n log n), as well as preserved the sizes of the iris template (8192 bits), and effectively reduced the length of the template (to 1024 bits) using the shift technique. On the other hand, the worst performance is with an Equal Error Rate of 0.4402% with Casia-Lamp. The work is significant for applications such as local and remote access to the digital resources that relied on iris authentication.

Learning to rank anomalies: scalar performance criteria and maximization of rank statistics

AbstractThe ability to collect and store ever more massive data, unlabeled in many cases, has been accompanied by the need to process them efficiently in order to extract relevant information and possibly design solutions based on the latter. In various situations, the vast majority of the observations exhibit the same behavior, while a small proportion deviates from it. Detecting these outlier observations (or equivalently defined as anomalies) is now one of the major challenges for machine learning applications (e.g. fraud detection or predictive maintenance). We propose here a novel methodology for outlier/anomaly detection, by learning a scoring function defined on the feature space allowing for ranking the observations by degree of abnormality. The scoring function is built through maximization of an empirical performance criterion taking the form of a (two-sample) linear rank statistic. We show that bipartite ranking algorithms can thus be used to learn nearly optimal scoring function with provable theoretical guarantees. We illustrate our methodology with numerical experiments based on open access online code.

Evaluation of an Image-based Classification Model to Identify Glioma Subtypes Using Arterial Spin Labeling Perfusion MRI On the Publicly Available UCSF Glioma Dataset.

Glioma is acomplex cancer comprising various subtypes and mutations, which may have different metabolic characteristics that can potentially be investigated and identified using perfusion imaging. Therefore, the aim of this work was to use radiomics and machine learning analysis of arterial spin labeling MRI data to automatically differentiate glioma subtypes and mutations. Atotal of 495 Arterial Spin Labeling (ASL) perfusion imaging datasets from the UCSF Glioma database were used in this study. These datasets were segmented to delineate the tumor volume and classified according to tumor grade, pathological diagnosis, and IDH status. Perfusion image data was obtained from a3T MRI scanner using pseudo-continuous ASL. High level texture features were extracted for each ASL dataset using PyRadiomics after tumor volume segmentation and then analyzed using amachine learning framework consisting of ReliefF feature ranking and logistic model tree classification algorithms. The results of the evaluation revealed balanced accuracies for the three endpoints ranging from 55.76% (SD = 4.28, 95% CI: 53.90-57.65) for the tumor grade using 25.4 ± 37.21 features, 62.53% (SD = 2.86, 95% CI: 61.27-63.78) for the mutation status with 23.3 ± 29.17 picked features, and 80.97% (SD = 1.83, 95% CI: 80.17-81.78) for the pathological diagnosis which used 47.3 ± 32.72 selected features. Radiomics and machine learning analysis of ASL perfusion data in glioma patients hold potential for aiding in the diagnosis and treatment of glioma, mainly for discerning glioblastoma from astrocytoma, while performance for tumor grading and mutation status appears limited.

A framework for automatically generating composite keywords for geo-tagged street images

Due to the ubiquity of sensor-equipped cameras such as smartphones, images are associated with spatial metadata, including camera’s geographical location and viewing orientation, which can be used for automatically generating better semantic keywords about geo-tagged urban street images in addition to visual keywords extracted from image analysis. This study introduces a novel framework for auto-tagging images that integrates both spatial and visual properties to generate comprehensive and accurate tags. The framework operates through four phases: extraction, abstraction, composition, and assessment. Our research highlights the benefits of combining visual and spatial analyses, demonstrated through a case study using geo-tagged urban street images from Orlando, Pittsburgh, and Manhattan. Experimental results show that the proposed framework significantly enhances the accuracy of keyword-based searches compared to conventional methods. In particular, based on our experiments, image search using the tags generated by our proposed framework, referred to as descriptive tags, achieved an average precision improvement factor of 0.9 compared to conventional tags. Additionally, our proposed ranking algorithm, which extends the term frequency-inverse document frequency (TF-IDF) algorithm, resulted in improvement factors of 0.86 for mean average precision (MAP) and 0.57 for mean reciprocal rank (MRR). Moreover, our framework’s flexibility and robustness make it suitable for diverse applications, from smart cities to online shopping. The paper also includes a detailed evaluation and user study, confirming the precision and reliability of the generated tags.

A novel ranked k-nearest neighbors algorithm for missing data imputation

Missing data is a common problem in many domains that rely on data analysis. The k Nearest Neighbors imputation method has been widely used to address this issue, but it has limitations in accurately imputing missing values, especially for datasets with small pairwise correlations and small values of k. In this study, we proposed a method, Ranked k Nearest Neighbors imputation that uses a similar approach to k Nearest Neighbor, but utilizing the concept of Ranked set sampling to select the most relevant neighbors for imputation. Our results show that the proposed method outperforms the standard k nearest neighbor method in terms of imputation accuracy both in case of Missing Completely at Random and Missing at Random mechanism, as demonstrated by consistently lower MSIE and MAIE values across all datasets. This suggests that the proposed method is a promising alternative for imputing missing values in datasets with small pairwise correlations and small values of k. Thus, the proposed Ranked k Nearest Neighbor method has important implications for data imputation in various domains and can contribute to the development of more efficient and accurate imputation methods without adding any computational complexity to an algorithm.

Image-based assessment of seismic damage in RC exterior beam-column joints

Seismic damage to reinforced concrete (RC) beam-column joints in reinforced concrete (RC) structures significantly impacts their stability and safety after an earthquake. Cracks caused by earthquakes weaken these joints, reducing their ductility, strength, and stiffness. Therefore, a systematic method for assessing damage in RC beam-column joints is crucial. This study introduces a new method that uses image analysis, along with ranking algorithms and machine learning, to assess seismic damage in RC exterior beam-column joints. The study identified three key indicators of severe damage in joints: drift ratio, strength, and stiffness. The method uses image analysis to extract features from preprocessed, binary images of cracks. These features capture both the texture and geometry of the cracks. The chosen features, including crack area, aspect ratio, and distribution of line widths, along with structural parameters like geometry and bond index, were selected using F-test and MRMR algorithms. Seismic damage assessments were conducted on 115 images from 37 specimens using four machine learning models (Regression Trees, Support Vector Machine, Gaussian Process Regression, and Gradient Boosting). The study achieved a high R-squared value of 0.80, indicating strong accuracy, for assessing seismic damage based on drift ratio using the image-based method. This demonstrates that image analysis techniques can effectively link surface crack patterns to quantifiable image features, leading to a more precise assessment of seismic damage.

Early fire detection using wavelet based features

In recent years, millions of hectares of vegetation worldwide have been destroyed by wildfires and forest fires. Computer vision-based fire classification, which separates pixels from image or video datasets into fire and non-fire categories, has gained more attention recently due to technological innovations. Fire pixels in an image or video can be classified using either a deep learning strategy or a traditional machine learning approach. Deep learning algorithms could process enormous volumes of data, but their training model performance is constrained because they fail to consider the differences in complexity between training samples. Moreover, it is not obvious to train a deep learning model without a dedicated GPU unit.Similarly, deep learning techniques that have a scarcity of training data and insufficient features exhibit poor performance in intricate real-world fire situations. Consequently, to categorize fire and non-fire pixels from the processed photos from the publicly accessible datasets, Corsican and FLAME, as well as the aerial private dataset Firefront_Gestosa, the current study uses a lightweight technique based on SVM and a refined set of features.The present research implemented a novel framework for fire detection and classification from a variety of RGB and Infra-red images acquired during real missions, addressing the significant requirement for swift and accurate recognition of diverse types of flames, ranging from wildfires to industrial and domestic fires. The framework employs wavelet decomposition-based features, including wavelet length, standard deviation, variance, energy, and Shannon’s entropy, extracted through a sliding window sampling method within a machine learning approach. It should be noted that managing multidimensional data to train a model is difficult in machine learning applications. This issue is solved adopting a feature selection approach, which eliminates redundant or unnecessary data that affects the functionality of the model. Thus, to enhance model performance, feature selection using ranking algorithms based on theoretical mutual information is applied in combination to the Support Vector Machine (SVM) with Radial Basis Function (RBF) kernel.Extensive experiments demonstrate exceptional results, notably with Haar wavelets, achieving an impressive overall accuracy of 99.43% and remarkable performance across specificity, precision, recall, F-measure, and G-mean metrics. Thus, the present study showcases the potential of advanced image processing techniques to significantly advance fire detection and classification, thereby contributing to fire prevention, management, and research in various contexts.

An Attempt on Investment Selection Problem under Neutrosophic Environment based on Weighted Value Method

The main aim of this study is to develop a ranking algorithm in neutrosophic environment and applying this algorithm to choose the best option for investment selection problems. Firstly, the concept of single valued triangular neutrosophic numbers (SVTrN-numbers) and it’s characteristics are presented briefly. Here we define the λ-weighted value of SVTrN-numbers and applied it to the best selection of investment selection problem (ISP). Finally, to determine the feasibility and validity of this algorithm, we compared the resultant ranking by the proposed method with other existing approaches.

LongT5Rank: A Novel Integrated Hybrid Approach for Text Summarisation

Text summarisation reduces text length while retaining important information, helping individuals, especially students, in managing information overload during research or assignments. However, existing text summarisation methods often lose important details, generate irrelevant or redundant sentences, or produce incoherent summaries. This study introduces a hybrid approach, LongT5Rank (coined in this study), which combines TextRank, an extractive summarisation algorithm, with LongT5, an abstractive summarisation algorithm, to automate the summarisation process. TextRank utilizes GloVe, a pre-trained word embedding model, and PageRank, a graph-based ranking algorithm, to select representative sentences. LongT5, an encoder-decoder transformer model, condenses extracted sentences into a concise and coherent summary, handling input sequences up to 16,384 tokens, for long-range sequence-to-sequence tasks. The LongT5Rank approach has shown significant achievements, including a minimum 60% compression rate, a minimum 0.6 semantic textual similarity score, and an improved F-measure compared to employing TextRank alone. Furthermore, it received positive feedback from Human Level Performance (HLP), underlining the importance of evaluating results directly from human users. This emphasizes the belief that the performance of the proposed solution should be assessed natively by humans. By combining both extractive and abstractive methods, LongT5Rank excels in generating accurate and coherent summaries.

Identification of Key Genes in Fetal Gut Development at Single-Cell Level by Exploiting Machine Learning Techniques.

The study of fetal gut development is critical due to its substantial influence on immediate neonatal and long-term adult health. Current research largely focuses on microbiome colonization, gut immunity, and barrier function, alongside the impact of external factors on these phenomena. Limited research has been dedicated to the categorization of developing fetal gut cells. Our study aimed to enhance our understanding of fetal gut development by employing advanced machine-learning techniques on single-cell sequencing data. This dataset consisted of 62,849 samples, each characterized by 33,694 distinct gene features. Four feature ranking algorithms were utilized to sort features according to their significance, resulting in four feature lists. Then, these lists were fed into an incremental feature selection method to extract essential genes, classification rules, and build efficient classifiers. Several important genes were recognized by multiple feature ranking algorithms, such as FGG, MDK, RBP1, RBP2, IGFBP7, and SPON2. These features were key in differentiating specific developing intestinal cells, including epithelial, immune, mesenchymal, and vasculature cells of the colon, duo jejunum, and ileum cells. The classification rules showed special gene expression patterns on some intestinal cell types and the efficient classifiers can be useful tools for identifying intestinal cells.

Advancing Kidney Transplantation: A Machine Learning Approach to Enhance Donor-Recipient Matching.

(1) Background: Globally, the kidney donor shortage has made the allocation process critical for patients awaiting a kidney transplant. Adopting Machine Learning (ML) models for donor-recipient matching can potentially improve kidney allocation processes when compared with traditional points-based systems. (2) Methods: This study developed an ML-based approach for donor-recipient matching. A comprehensive evaluation was conducted using ten widely used classifiers (logistic regression, decision tree, random forest, support vector machine, gradient boosting, boost, CatBoost, LightGBM, naive Bayes, and neural networks) across three experimental scenarios to ensure a robust approach. The first scenario used the original dataset, the second used a merged version of the dataset, and the last scenario used a hierarchical architecture model. Additionally, a custom ranking algorithm was designed to identify the most suitable recipients. Finally, the ML-based donor-recipient matching model was integrated into a web-based platform called Nephron. (3) Results: The gradient boost model was the top performer, achieving a remarkable and consistent accuracy rate of 98% across the three experimental scenarios. Furthermore, the custom ranking algorithm outperformed the conventional cosine and Jaccard similarity methods in identifying the most suitable recipients. Importantly, the platform not only facilitated efficient patient selection and prioritisation for kidney allocation but can be flexibly adapted for other solid organ allocation systems built on similar criteria. (4) Conclusions: This study proposes an ML-based approach to optimize donor-recipient matching within the kidney allocation process. Successful implementation of this methodology demonstrates significant potential to enhance both efficiency and fairness in kidney transplantation.

Ranking guidance actions to support engineers in fulfilling process constraints

AbstractIn safety‐critical systems engineering, regulations such as Automotive SPICE, ISO26262, or ED‐109A mandate software quality assurance measures to provide evidence that the developed system is high quality. The constraints that define quality assurance conditions during the engineering life cycle are often non‐trivial. This paper addresses the challenges, engineers face who are unfamiliar with the precise constraints of various projects (e.g., when newly joining a company or switching between departments). Understanding how to fulfill a constraint is a time‐consuming and challenging task as an engineer needs to determine the most suitable option (out of potentially many) to fulfill a constraint violation. To this end, we propose a guidance action ranking framework to provide engineers with the most relevant guidance actions. Our primary ranking algorithm analyzes in the background the actions that engineers have made in the past to resolve a constraint violation without requiring explicit feedback from them. We evaluated our framework on two real‐world data sets: an open‐source drone management and an industrial air traffic control software system. Concretely, we replay past engineering activities and measured whether, in the case of a constraint violation, our suggested guidance actions were indeed selected by the engineer. The evaluation results revealed that learning from prior guidance actions effectively identifies the most appropriate guidance actions (ranked top 1 or 2) when compared to ranking algorithms based on action simplicity and artifact property change frequency. Specifically, we achieve a median MRR of 0.95 for the first case study and 0.94 for the second case study: an improvement of 80% and 100% over the baseline. Additionally, we observed that the simplicity of a guidance action does not reliably indicate its suitability for fulfilling a constraint, whereas learning from prior change operation property out‐performed simplicity‐based ranking but did not surpass guidance frequency‐based ranking.

Keyword Extraction in Arabic and English using Page Rank Algorithm

This paper shows a comparison in applying TextRank algorithm for keyword extraction to English and Arabic Text. TextRank algorithm is applied by constructing a graph whose vertices that are formed by candidate words extracted from the title and the abstract of the given Arabic and English after applying a tagging filter to that text to decide the importance of vertices within that graph.

Exogenous interactome analysis of bovine viral diarrhea virus-host using network based-approach and identification of hub genes and important pathways involved in virus pathogenesis

Bovine viral diarrhea (BVD) is one of the most important diseases in livestock, caused by BVD virus (BVDV). During the pathogenesis of the virus, many interactions occur between host and viral proteins. Studying these interactions can help better understand the pathogenesis of the virus, identify putative functional proteins, and find new treatment and prevention strategies. To this aim, a BVDV-host protein-protein interaction (PPI) network map was constructed using Cytoscape and analyzed with cytoHubba, Kyoto Encyclopedia of Genes and Genomics (KEGG), Gene Ontology (GO), and Protein Analysis Through Evolutionary Relationships (PANTHER). Npro with 125 connections had the greatest number of interactions with host proteins. CD46, EEF-2, and TXN genes were detected as hub genes using different ranking algorithms in cytoHubba. BVDV interactions with its host mainly focus on targeting translation, protein synthesis, and cellular metabolism pathways. Different classes of proteins including translational proteins, nucleic acid metabolism proteins, metabolite interconversion enzymes, and protein-modifying enzymes are affected by BVDV. These findings improve our understanding of the effects of the virus on the cell. Hub genes and key pathways identified in the present study can serve as targets for novel BVDV prevention or treatment strategies.