Learning-based Sorting
Learning-Based Sorting is a computational methodology within automated sorting systems that employs machine learning models to classify or order items by learning patterns and decision rules from data, distinguishing it from rule-based or heuristic sorting approaches through its reliance on adaptive, data-driven inference.
15
Publications
616
Citations
41
Authors
21
Institutions
Publications per year
2017–2026
5
Parents
15
Nallapaneni Manoj Kumar, Mazin Abed Mohammed, Karrar Hameed Abdulkareem et al. · Process Safety and Environmental Protection · 2021 · 137 citations
Kumiko Tanaka‐Ishii, Satoshi Tezuka, Hiroshi Terada · Computational Linguistics · 2010 · 79 citations · Full text
The Case for a Learned Sorting Algorithm
Ani Kristo, Kapil Vaidya, Uğur Çetintemel et al. · 2020 · 44 citations · Full text
1–5 of 15
41
2
h-index
2
h-index
2
h-index
2
h-index
1
h-index
1–5 of 41
21
Çanakkale Onsekiz Mart Üniversitesi
Çanakkale, Türkiye
2 h-index
2 publications
151 citations
Michigan State University
East Lansing, United States
2 h-index
2 publications
151 citations

City University of Hong Kong
Hong Kong, Hong Kong
1 h-index
2 publications
274 citations

University of Aberdeen
Aberdeen, United Kingdom
1 h-index
1 publications
24 citations
Massachusetts Institute of Technology
Cambridge, United States
1 h-index
2 publications
88 citations
De Nederlandsche Bank
Amsterdam, The Netherlands
1 h-index
2 publications
46 citations
Suan Sunandha Rajabhat University
Dusit, Thailand
1 h-index
3 publications
75 citations
The University of Tokyo
Tokyo, Japan
1 h-index
3 publications
237 citations
1–8 of 21
2 publications · 151 citations
2
h-index
2 publications · 94 citations
2
h-index
1 publications · 22 citations
1
h-index
Repository · 1 publications · 24 citations
1
h-index
Conference · 1 publications · 20 citations
1
h-index
1–5