Old Web
English
Sign In
Acemap
>
Paper
>
Trimming the complexity of Ranking by Pairwise Comparison
Trimming the complexity of Ranking by Pairwise Comparison
2013
Samuel Hiard
Keywords:
Discrete optimization
Preference learning
Ranking SVM
Ranking
Trimming
Pairwise comparison
Machine learning
Reduction (complexity)
Artificial intelligence
Pattern recognition
Computer science
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]