Kernels Sorting
Kernels Sorting is a computational framework within automated sorting that utilizes kernel-based transformations to selectively categorize data instances by leveraging similarity metrics derived from kernel functions.
7
Publications
315
Citations
25
Authors
16
Institutions
Publications per year
2017–2026
3
Parents
7
Novi Quadrianto, Alex Smola, Le Song et al. · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2009 · 60 citations
Novi Quadrianto, Le Song, Alex Smola · neural information processing systems · 2008 · 34 citations
1–5 of 7
25
3
h-index
2
h-index
2
h-index
2
h-index
1
h-index
1–5 of 25
16

Data61
Sydney, Australia
3 h-index
4 publications
136 citations
Yahoo (United States)
Sunnyvale, United States
2 h-index
2 publications
94 citations
KU Leuven
Leuven, Belgium
2 h-index
2 publications
81 citations
Temple College
Temple, United States
1 h-index
3 publications
72 citations

Cornell University
Ithaca, United States
1 h-index
3 publications
225 citations

Australian National University
Canberra, Australia
1 h-index
1 publications
60 citations
Temple University
Philadelphia, United States
1 h-index
3 publications
72 citations

International Livestock Research Institute
Nairobi, Kenya
1 h-index
1 publications
75 citations
1–8 of 16
Conference · 1 publications · 24 citations
1
h-index
1 publications · 84 citations
1
h-index
1 publications · 34 citations
1
h-index
1 publications · 75 citations
1
h-index
TPAMI · 1 publications · 60 citations
1
h-index
1–5