Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (5)

Search Parameters:
Keywords = multiple rankers

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
22 pages, 2200 KB  
Article
MultiLTR: Text Ranking with a Multi-Stage Learning-to-Rank Approach
by Hua Yang and Teresa Gonçalves
Information 2025, 16(4), 308; https://doi.org/10.3390/info16040308 - 13 Apr 2025
Viewed by 2940
Abstract
The division of retrieval into multiple stages has evolved to balance efficiency and effectiveness among various ranking models. Faster but less accurate models are used to retrieve results from the entire corpus. Slower yet more precise models refine the ranking within the top [...] Read more.
The division of retrieval into multiple stages has evolved to balance efficiency and effectiveness among various ranking models. Faster but less accurate models are used to retrieve results from the entire corpus. Slower yet more precise models refine the ranking within the top candidate list. This study proposes a multi-stage learning-to-rank (MultiLTR) method. MultiLTR applies learning-to-rank techniques across multiple stages. It incorporates text from different fields such as titles, body content, and abstracts to produce a more comprehensive and accurate ranking. MultiLTR iteratively refines ranking accuracy through sequential processing phases. It dynamically selects top-performing rankers from a diverse candidate pool at each stage. Experiments were carried out on benchmark datasets, MQ2007 and MQ2008, using three categories of learning-to-rank algorithms. The results demonstrate that MultiLTR outperforms state-of-the-art ranking approaches, particularly in field-based ranking tasks. This study improves ranking accuracy and offers new insights into enhancing multi-stage ranking strategies. Full article
Show Figures

Figure 1

26 pages, 499 KB  
Article
DecoStrat: Leveraging the Capabilities of Language Models in D2T Generation via Decoding Framework
by Elias Lemuye Jimale, Wenyu Chen, Mugahed A. Al-antari, Yeong Hyeon Gu, Victor Kwaku Agbesi and Wasif Feroze
Mathematics 2024, 12(22), 3596; https://doi.org/10.3390/math12223596 - 17 Nov 2024
Cited by 1 | Viewed by 1597
Abstract
Current language models have achieved remarkable success in NLP tasks. Nonetheless, individual decoding methods face difficulties in realizing the immense potential of these models. The challenge is primarily due to the lack of a decoding framework that can integrate language models and decoding [...] Read more.
Current language models have achieved remarkable success in NLP tasks. Nonetheless, individual decoding methods face difficulties in realizing the immense potential of these models. The challenge is primarily due to the lack of a decoding framework that can integrate language models and decoding methods. We introduce DecoStrat, which bridges the gap between language modeling and the decoding process in D2T generation. By leveraging language models, DecoStrat facilitates the exploration of alternative decoding methods tailored to specific tasks. We fine-tuned the model on the MultiWOZ dataset to meet task-specific requirements and employed it to generate output(s) through multiple interactive modules of the framework. The Director module orchestrates the decoding processes, engaging the Generator to produce output(s) text based on the selected decoding method and input data. The Manager module enforces a selection strategy, integrating Ranker and Selector to identify the optimal result. Evaluations on the stated dataset show that DecoStrat effectively produces a diverse and accurate output, with MBR variants consistently outperforming other methods. DecoStrat with the T5-small model surpasses some baseline frameworks. Generally, the findings highlight DecoStrat’s potential for optimizing decoding methods in diverse real-world applications. Full article
Show Figures

Figure 1

27 pages, 556 KB  
Article
Analysis of Ordinal Populations from Judgment Post-Stratification
by Amirhossein Alvandi and Armin Hatefi
Stats 2023, 6(3), 812-838; https://doi.org/10.3390/stats6030052 - 9 Aug 2023
Cited by 2 | Viewed by 1476
Abstract
In surveys requiring cost efficiency, such as medical research, measuring the variable of interest (e.g., disease status) is expensive and/or time-consuming; however, we often have access to easily obtainable characteristics about sampling units. These characteristics are not typically employed in the data collection [...] Read more.
In surveys requiring cost efficiency, such as medical research, measuring the variable of interest (e.g., disease status) is expensive and/or time-consuming; however, we often have access to easily obtainable characteristics about sampling units. These characteristics are not typically employed in the data collection process. Judgment post-stratification (JPS) sampling enables us to supplement the random samples from the population of interest with these characteristics as ranking information. This paper develops methods based on the JPS samples for estimating categorical ordinal populations. We develop various estimators from the JPS data even for situations where the JPS suffers from empty strata. We also propose the JPS estimators using multiple ranking resources. Through extensive numerical studies, we evaluate the performance of the methods in estimating the population. Finally, the developed estimation methods are applied to bone mineral data to estimate the bone disorder status of women aged 50 and older. Full article
(This article belongs to the Section Statistical Methods)
Show Figures

Figure 1

14 pages, 2090 KB  
Article
RankerGUI: A Computational Framework to Compare Differential Gene Expression Profiles Using Rank Based Statistics
by Amarinder Singh Thind, Kumar Parijat Tripathi and Mario Rosario Guarracino
Int. J. Mol. Sci. 2019, 20(23), 6098; https://doi.org/10.3390/ijms20236098 - 3 Dec 2019
Cited by 6 | Viewed by 6720
Abstract
The comparison of high throughput gene expression datasets obtained from different experimental conditions is a challenging task. It provides an opportunity to explore the cellular response to various biological events such as disease, environmental conditions, and drugs. There is a need for tools [...] Read more.
The comparison of high throughput gene expression datasets obtained from different experimental conditions is a challenging task. It provides an opportunity to explore the cellular response to various biological events such as disease, environmental conditions, and drugs. There is a need for tools that allow the integration and analysis of such data. We developed the “RankerGUI pipeline”, a user-friendly web application for the biological community. It allows users to use various rank based statistical approaches for the comparison of full differential gene expression profiles between the same or different biological states obtained from different sources. The pipeline modules are an integration of various open-source packages, a few of which are modified for extended functionality. The main modules include rank rank hypergeometric overlap, enriched rank rank hypergeometric overlap and distance calculations. Additionally, preprocessing steps such as merging differential expression profiles of multiple independent studies can be added before running the main modules. Output plots show the strength, pattern, and trends among complete differential expression profiles. In this paper, we describe the various modules and functionalities of the developed pipeline. We also present a case study that demonstrates how the pipeline can be used for the comparison of differential expression profiles obtained from multiple platforms’ data of the Gene Expression Omnibus. Using these comparisons, we investigate gene expression patterns in kidney and lung cancers. Full article
(This article belongs to the Special Issue Data Analysis and Integration in Cancer Research)
Show Figures

Figure 1

19 pages, 1775 KB  
Article
Unified Channel Management for Cognitive Radio Sensor Networks Aided Internet of Things
by Saleem Aslam, Ansar-ul-Haq, Ju Wook Jang and Kyung-Geun Lee
Sensors 2018, 18(8), 2665; https://doi.org/10.3390/s18082665 - 14 Aug 2018
Cited by 7 | Viewed by 3544
Abstract
Cognitive capabilities are indispensable for the Internet of Things (IoT) not only to equip them with learning, thinking, and decision-making capabilities but also to cater to their unprecedented huge spectrum requirements due to their gigantic numbers and heterogeneity. Therefore, in this paper, a [...] Read more.
Cognitive capabilities are indispensable for the Internet of Things (IoT) not only to equip them with learning, thinking, and decision-making capabilities but also to cater to their unprecedented huge spectrum requirements due to their gigantic numbers and heterogeneity. Therefore, in this paper, a novel unified channel management framework (CMF) is introduced for cognitive radio sensor networks (CRSNs), which comprises an (1) opportunity detector (ODR), (2) opportunity scheduler (OSR), and (3) opportunity ranker (ORR) to specifically address the immense and diverse spectrum requirements of CRSN-aided IoT. The unified CMF is unique for its type as it covers all three angles of spectrum management. The ODR is a double threshold based multichannel spectrum sensor that allows an IoT device to concurrently sense multiple channels to maximize spectrum opportunities. OSR is an integer linear programming (ILP) based channel allocation mechanism that assigns channels to heterogeneous IoT devices based on their minimal quality of service (QoS) requirements. ORR collects feedback from IoT devices about their transmission experience and generates special channel-sensing order (CSO) for each IoT device based on the data rate and idle-time probabilities. The simulation results demonstrate that the proposed CMF outperforms the existing ones in terms of collision probability, detection probability, blocking probability, idle-time probability, and data rate. Full article
Show Figures

Figure 1

Back to TopTop