MultiLTR: Text Ranking with a Multi-Stage Learning-to-Rank Approach Article Swipe
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.3390/info16040308
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.
Related Topics
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.3390/info16040308
- https://www.mdpi.com/2078-2489/16/4/308/pdf?version=1744621286
- OA Status
- gold
- References
- 47
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4409437154
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4409437154Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.3390/info16040308Digital Object Identifier
- Title
-
MultiLTR: Text Ranking with a Multi-Stage Learning-to-Rank ApproachWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2025Year of publication
- Publication date
-
2025-04-13Full publication date if available
- Authors
-
Hua Yang, Teresa GonçalvesList of authors in order
- Landing page
-
https://doi.org/10.3390/info16040308Publisher landing page
- PDF URL
-
https://www.mdpi.com/2078-2489/16/4/308/pdf?version=1744621286Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
goldOpen access status per OpenAlex
- OA URL
-
https://www.mdpi.com/2078-2489/16/4/308/pdf?version=1744621286Direct OA link when available
- Concepts
-
Ranking (information retrieval), Rank (graph theory), Learning to rank, Stage (stratigraphy), Computer science, Information retrieval, Artificial intelligence, Mathematics, Biology, Combinatorics, PaleontologyTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- References (count)
-
47Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4409437154 |
|---|---|
| doi | https://doi.org/10.3390/info16040308 |
| ids.doi | https://doi.org/10.3390/info16040308 |
| ids.openalex | https://openalex.org/W4409437154 |
| fwci | 0.0 |
| type | article |
| title | MultiLTR: Text Ranking with a Multi-Stage Learning-to-Rank Approach |
| biblio.issue | 4 |
| biblio.volume | 16 |
| biblio.last_page | 308 |
| biblio.first_page | 308 |
| topics[0].id | https://openalex.org/T11550 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9745000004768372 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1702 |
| topics[0].subfield.display_name | Artificial Intelligence |
| topics[0].display_name | Text and Document Classification Technologies |
| is_xpac | False |
| apc_list.value | 1400 |
| apc_list.currency | CHF |
| apc_list.value_usd | 1515 |
| apc_paid.value | 1400 |
| apc_paid.currency | CHF |
| apc_paid.value_usd | 1515 |
| concepts[0].id | https://openalex.org/C189430467 |
| concepts[0].level | 2 |
| concepts[0].score | 0.7924088835716248 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q7293293 |
| concepts[0].display_name | Ranking (information retrieval) |
| concepts[1].id | https://openalex.org/C164226766 |
| concepts[1].level | 2 |
| concepts[1].score | 0.7201023101806641 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q7293202 |
| concepts[1].display_name | Rank (graph theory) |
| concepts[2].id | https://openalex.org/C86037889 |
| concepts[2].level | 3 |
| concepts[2].score | 0.60475093126297 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q4330127 |
| concepts[2].display_name | Learning to rank |
| concepts[3].id | https://openalex.org/C146357865 |
| concepts[3].level | 2 |
| concepts[3].score | 0.47242558002471924 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q1123245 |
| concepts[3].display_name | Stage (stratigraphy) |
| concepts[4].id | https://openalex.org/C41008148 |
| concepts[4].level | 0 |
| concepts[4].score | 0.4676762521266937 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[4].display_name | Computer science |
| concepts[5].id | https://openalex.org/C23123220 |
| concepts[5].level | 1 |
| concepts[5].score | 0.42982643842697144 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q816826 |
| concepts[5].display_name | Information retrieval |
| concepts[6].id | https://openalex.org/C154945302 |
| concepts[6].level | 1 |
| concepts[6].score | 0.3700755536556244 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q11660 |
| concepts[6].display_name | Artificial intelligence |
| concepts[7].id | https://openalex.org/C33923547 |
| concepts[7].level | 0 |
| concepts[7].score | 0.2747168242931366 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[7].display_name | Mathematics |
| concepts[8].id | https://openalex.org/C86803240 |
| concepts[8].level | 0 |
| concepts[8].score | 0.09918475151062012 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q420 |
| concepts[8].display_name | Biology |
| concepts[9].id | https://openalex.org/C114614502 |
| concepts[9].level | 1 |
| concepts[9].score | 0.0949481725692749 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q76592 |
| concepts[9].display_name | Combinatorics |
| concepts[10].id | https://openalex.org/C151730666 |
| concepts[10].level | 1 |
| concepts[10].score | 0.0 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q7205 |
| concepts[10].display_name | Paleontology |
| keywords[0].id | https://openalex.org/keywords/ranking |
| keywords[0].score | 0.7924088835716248 |
| keywords[0].display_name | Ranking (information retrieval) |
| keywords[1].id | https://openalex.org/keywords/rank |
| keywords[1].score | 0.7201023101806641 |
| keywords[1].display_name | Rank (graph theory) |
| keywords[2].id | https://openalex.org/keywords/learning-to-rank |
| keywords[2].score | 0.60475093126297 |
| keywords[2].display_name | Learning to rank |
| keywords[3].id | https://openalex.org/keywords/stage |
| keywords[3].score | 0.47242558002471924 |
| keywords[3].display_name | Stage (stratigraphy) |
| keywords[4].id | https://openalex.org/keywords/computer-science |
| keywords[4].score | 0.4676762521266937 |
| keywords[4].display_name | Computer science |
| keywords[5].id | https://openalex.org/keywords/information-retrieval |
| keywords[5].score | 0.42982643842697144 |
| keywords[5].display_name | Information retrieval |
| keywords[6].id | https://openalex.org/keywords/artificial-intelligence |
| keywords[6].score | 0.3700755536556244 |
| keywords[6].display_name | Artificial intelligence |
| keywords[7].id | https://openalex.org/keywords/mathematics |
| keywords[7].score | 0.2747168242931366 |
| keywords[7].display_name | Mathematics |
| keywords[8].id | https://openalex.org/keywords/biology |
| keywords[8].score | 0.09918475151062012 |
| keywords[8].display_name | Biology |
| keywords[9].id | https://openalex.org/keywords/combinatorics |
| keywords[9].score | 0.0949481725692749 |
| keywords[9].display_name | Combinatorics |
| language | en |
| locations[0].id | doi:10.3390/info16040308 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4210219776 |
| locations[0].source.issn | 2078-2489 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | 2078-2489 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | True |
| locations[0].source.display_name | Information |
| locations[0].source.host_organization | https://openalex.org/P4310310987 |
| locations[0].source.host_organization_name | Multidisciplinary Digital Publishing Institute |
| locations[0].source.host_organization_lineage | https://openalex.org/P4310310987 |
| locations[0].source.host_organization_lineage_names | Multidisciplinary Digital Publishing Institute |
| locations[0].license | cc-by |
| locations[0].pdf_url | https://www.mdpi.com/2078-2489/16/4/308/pdf?version=1744621286 |
| locations[0].version | publishedVersion |
| locations[0].raw_type | journal-article |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | Information |
| locations[0].landing_page_url | https://doi.org/10.3390/info16040308 |
| locations[1].id | pmh:oai:doaj.org/article:cde8138597714a198eb5b267bc1cd0d0 |
| locations[1].is_oa | False |
| locations[1].source.id | https://openalex.org/S4306401280 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | False |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | DOAJ (DOAJ: Directory of Open Access Journals) |
| locations[1].source.host_organization | |
| locations[1].source.host_organization_name | |
| locations[1].license | |
| locations[1].pdf_url | |
| locations[1].version | submittedVersion |
| locations[1].raw_type | article |
| locations[1].license_id | |
| locations[1].is_accepted | False |
| locations[1].is_published | False |
| locations[1].raw_source_name | Information, Vol 16, Iss 4, p 308 (2025) |
| locations[1].landing_page_url | https://doaj.org/article/cde8138597714a198eb5b267bc1cd0d0 |
| indexed_in | crossref, doaj |
| authorships[0].author.id | https://openalex.org/A5075065160 |
| authorships[0].author.orcid | https://orcid.org/0000-0001-6720-4831 |
| authorships[0].author.display_name | Hua Yang |
| authorships[0].countries | CN, PT |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I21803372 |
| authorships[0].affiliations[0].raw_affiliation_string | VISTA Lab, Algoritmi Center, University of Évora, 7000-671 Évora, Portugal |
| authorships[0].affiliations[1].institution_ids | https://openalex.org/I132586189 |
| authorships[0].affiliations[1].raw_affiliation_string | School of Artificial Intelligence, Zhongyuan University of Technology, Zhengzhou 450007, China |
| authorships[0].institutions[0].id | https://openalex.org/I132586189 |
| authorships[0].institutions[0].ror | https://ror.org/0360zcg91 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I132586189 |
| authorships[0].institutions[0].country_code | CN |
| authorships[0].institutions[0].display_name | Zhongyuan University of Technology |
| authorships[0].institutions[1].id | https://openalex.org/I21803372 |
| authorships[0].institutions[1].ror | https://ror.org/02gyps716 |
| authorships[0].institutions[1].type | education |
| authorships[0].institutions[1].lineage | https://openalex.org/I21803372 |
| authorships[0].institutions[1].country_code | PT |
| authorships[0].institutions[1].display_name | University of Évora |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Hua Yang |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | School of Artificial Intelligence, Zhongyuan University of Technology, Zhengzhou 450007, China, VISTA Lab, Algoritmi Center, University of Évora, 7000-671 Évora, Portugal |
| authorships[1].author.id | https://openalex.org/A5085523573 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-1323-0249 |
| authorships[1].author.display_name | Teresa Gonçalves |
| authorships[1].countries | PT |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I21803372 |
| authorships[1].affiliations[0].raw_affiliation_string | VISTA Lab, Algoritmi Center, University of Évora, 7000-671 Évora, Portugal |
| authorships[1].affiliations[1].institution_ids | https://openalex.org/I21803372 |
| authorships[1].affiliations[1].raw_affiliation_string | Department of Computer Science, University of Évora, 7000-671 Évora, Portugal |
| authorships[1].institutions[0].id | https://openalex.org/I21803372 |
| authorships[1].institutions[0].ror | https://ror.org/02gyps716 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I21803372 |
| authorships[1].institutions[0].country_code | PT |
| authorships[1].institutions[0].display_name | University of Évora |
| authorships[1].author_position | last |
| authorships[1].raw_author_name | Teresa Gonçalves |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Department of Computer Science, University of Évora, 7000-671 Évora, Portugal, VISTA Lab, Algoritmi Center, University of Évora, 7000-671 Évora, Portugal |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://www.mdpi.com/2078-2489/16/4/308/pdf?version=1744621286 |
| open_access.oa_status | gold |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | MultiLTR: Text Ranking with a Multi-Stage Learning-to-Rank Approach |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T11550 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9745000004768372 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1702 |
| primary_topic.subfield.display_name | Artificial Intelligence |
| primary_topic.display_name | Text and Document Classification Technologies |
| related_works | https://openalex.org/W3127142483, https://openalex.org/W2118564381, https://openalex.org/W3160516639, https://openalex.org/W2163901716, https://openalex.org/W4385565564, https://openalex.org/W2898073868, https://openalex.org/W2138488530, https://openalex.org/W2152204162, https://openalex.org/W2739821120, https://openalex.org/W2088097596 |
| cited_by_count | 0 |
| locations_count | 2 |
| best_oa_location.id | doi:10.3390/info16040308 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4210219776 |
| best_oa_location.source.issn | 2078-2489 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | 2078-2489 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | True |
| best_oa_location.source.display_name | Information |
| best_oa_location.source.host_organization | https://openalex.org/P4310310987 |
| best_oa_location.source.host_organization_name | Multidisciplinary Digital Publishing Institute |
| best_oa_location.source.host_organization_lineage | https://openalex.org/P4310310987 |
| best_oa_location.source.host_organization_lineage_names | Multidisciplinary Digital Publishing Institute |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | https://www.mdpi.com/2078-2489/16/4/308/pdf?version=1744621286 |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | journal-article |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | Information |
| best_oa_location.landing_page_url | https://doi.org/10.3390/info16040308 |
| primary_location.id | doi:10.3390/info16040308 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4210219776 |
| primary_location.source.issn | 2078-2489 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | 2078-2489 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | True |
| primary_location.source.display_name | Information |
| primary_location.source.host_organization | https://openalex.org/P4310310987 |
| primary_location.source.host_organization_name | Multidisciplinary Digital Publishing Institute |
| primary_location.source.host_organization_lineage | https://openalex.org/P4310310987 |
| primary_location.source.host_organization_lineage_names | Multidisciplinary Digital Publishing Institute |
| primary_location.license | cc-by |
| primary_location.pdf_url | https://www.mdpi.com/2078-2489/16/4/308/pdf?version=1744621286 |
| primary_location.version | publishedVersion |
| primary_location.raw_type | journal-article |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | Information |
| primary_location.landing_page_url | https://doi.org/10.3390/info16040308 |
| publication_date | 2025-04-13 |
| publication_year | 2025 |
| referenced_works | https://openalex.org/W4323349240, https://openalex.org/W2342707026, https://openalex.org/W4402670051, https://openalex.org/W4396736277, https://openalex.org/W3216225167, https://openalex.org/W4353007257, https://openalex.org/W2136189984, https://openalex.org/W3034969702, https://openalex.org/W4306317315, https://openalex.org/W4327644099, https://openalex.org/W3123218467, https://openalex.org/W6766655008, https://openalex.org/W3198536471, https://openalex.org/W2922386288, https://openalex.org/W3152624702, https://openalex.org/W3134665270, https://openalex.org/W2539671052, https://openalex.org/W2250539671, https://openalex.org/W4406457862, https://openalex.org/W4401043166, https://openalex.org/W4284689925, https://openalex.org/W3129868498, https://openalex.org/W1678356000, https://openalex.org/W2143331230, https://openalex.org/W2142537246, https://openalex.org/W1990589796, https://openalex.org/W2162059449, https://openalex.org/W2108862644, https://openalex.org/W2911964244, https://openalex.org/W3022917197, https://openalex.org/W3133745687, https://openalex.org/W2796727080, https://openalex.org/W3035590471, https://openalex.org/W3212850139, https://openalex.org/W4280618561, https://openalex.org/W4205779174, https://openalex.org/W2149427297, https://openalex.org/W4386281023, https://openalex.org/W2069870183, https://openalex.org/W2007815473, https://openalex.org/W4237247744, https://openalex.org/W2341234495, https://openalex.org/W4230995645, https://openalex.org/W2648699835, https://openalex.org/W2799232306, https://openalex.org/W2898843412, https://openalex.org/W4400046281 |
| referenced_works_count | 47 |
| abstract_inverted_index.a | 48, 75, 96 |
| abstract_inverted_index.It | 60, 90 |
| abstract_inverted_index.as | 67 |
| abstract_inverted_index.at | 100 |
| abstract_inverted_index.in | 129 |
| abstract_inverted_index.of | 2, 116 |
| abstract_inverted_index.on | 107 |
| abstract_inverted_index.to | 9, 25, 73 |
| abstract_inverted_index.The | 0, 119 |
| abstract_inverted_index.and | 12, 71, 78, 111, 138 |
| abstract_inverted_index.are | 23 |
| abstract_inverted_index.but | 19 |
| abstract_inverted_index.has | 7 |
| abstract_inverted_index.new | 140 |
| abstract_inverted_index.out | 106 |
| abstract_inverted_index.the | 29, 38, 41 |
| abstract_inverted_index.top | 42 |
| abstract_inverted_index.yet | 33 |
| abstract_inverted_index.This | 45, 133 |
| abstract_inverted_index.body | 69 |
| abstract_inverted_index.each | 101 |
| abstract_inverted_index.from | 28, 63, 95 |
| abstract_inverted_index.into | 4, 142 |
| abstract_inverted_index.less | 20 |
| abstract_inverted_index.more | 34, 76 |
| abstract_inverted_index.pool | 99 |
| abstract_inverted_index.such | 66 |
| abstract_inverted_index.text | 62 |
| abstract_inverted_index.that | 122 |
| abstract_inverted_index.used | 24 |
| abstract_inverted_index.were | 104 |
| abstract_inverted_index.among | 14 |
| abstract_inverted_index.list. | 44 |
| abstract_inverted_index.study | 46, 134 |
| abstract_inverted_index.three | 114 |
| abstract_inverted_index.using | 113 |
| abstract_inverted_index.Faster | 18 |
| abstract_inverted_index.MQ2007 | 110 |
| abstract_inverted_index.Slower | 32 |
| abstract_inverted_index.across | 57 |
| abstract_inverted_index.entire | 30 |
| abstract_inverted_index.fields | 65 |
| abstract_inverted_index.models | 22, 36 |
| abstract_inverted_index.offers | 139 |
| abstract_inverted_index.refine | 37 |
| abstract_inverted_index.stage. | 102 |
| abstract_inverted_index.stages | 6 |
| abstract_inverted_index.tasks. | 132 |
| abstract_inverted_index.within | 40 |
| abstract_inverted_index.MQ2008, | 112 |
| abstract_inverted_index.applies | 54 |
| abstract_inverted_index.balance | 10 |
| abstract_inverted_index.carried | 105 |
| abstract_inverted_index.corpus. | 31 |
| abstract_inverted_index.diverse | 97 |
| abstract_inverted_index.evolved | 8 |
| abstract_inverted_index.method. | 52 |
| abstract_inverted_index.models. | 17 |
| abstract_inverted_index.phases. | 89 |
| abstract_inverted_index.precise | 35 |
| abstract_inverted_index.produce | 74 |
| abstract_inverted_index.rankers | 94 |
| abstract_inverted_index.ranking | 16, 39, 84, 126, 131, 136, 145 |
| abstract_inverted_index.refines | 83 |
| abstract_inverted_index.results | 27, 120 |
| abstract_inverted_index.selects | 92 |
| abstract_inverted_index.stages. | 59 |
| abstract_inverted_index.through | 86 |
| abstract_inverted_index.titles, | 68 |
| abstract_inverted_index.various | 15 |
| abstract_inverted_index.MultiLTR | 53, 81, 123 |
| abstract_inverted_index.accuracy | 85, 137 |
| abstract_inverted_index.accurate | 21, 79 |
| abstract_inverted_index.content, | 70 |
| abstract_inverted_index.division | 1 |
| abstract_inverted_index.improves | 135 |
| abstract_inverted_index.insights | 141 |
| abstract_inverted_index.multiple | 5, 58 |
| abstract_inverted_index.proposes | 47 |
| abstract_inverted_index.ranking. | 80 |
| abstract_inverted_index.retrieve | 26 |
| abstract_inverted_index.abstracts | 72 |
| abstract_inverted_index.benchmark | 108 |
| abstract_inverted_index.candidate | 43, 98 |
| abstract_inverted_index.datasets, | 109 |
| abstract_inverted_index.different | 64 |
| abstract_inverted_index.enhancing | 143 |
| abstract_inverted_index.retrieval | 3 |
| abstract_inverted_index.(MultiLTR) | 51 |
| abstract_inverted_index.categories | 115 |
| abstract_inverted_index.efficiency | 11 |
| abstract_inverted_index.processing | 88 |
| abstract_inverted_index.sequential | 87 |
| abstract_inverted_index.techniques | 56 |
| abstract_inverted_index.Experiments | 103 |
| abstract_inverted_index.algorithms. | 118 |
| abstract_inverted_index.approaches, | 127 |
| abstract_inverted_index.demonstrate | 121 |
| abstract_inverted_index.dynamically | 91 |
| abstract_inverted_index.field-based | 130 |
| abstract_inverted_index.iteratively | 82 |
| abstract_inverted_index.multi-stage | 49, 144 |
| abstract_inverted_index.outperforms | 124 |
| abstract_inverted_index.strategies. | 146 |
| abstract_inverted_index.incorporates | 61 |
| abstract_inverted_index.particularly | 128 |
| abstract_inverted_index.comprehensive | 77 |
| abstract_inverted_index.effectiveness | 13 |
| abstract_inverted_index.top-performing | 93 |
| abstract_inverted_index.learning-to-rank | 50, 55, 117 |
| abstract_inverted_index.state-of-the-art | 125 |
| cited_by_percentile_year | |
| countries_distinct_count | 2 |
| institutions_distinct_count | 2 |
| citation_normalized_percentile.value | 0.04992402 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | True |