Ranking the vertices of a complete multipartite paired comparison digraph

被引：0

作者：

机构：

来源：

Discrete Appl Math | / 1-2卷 / 75期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

共 50 条

[31] Adapting Decision DAGs for Multipartite Ranking
Ramon Quevedo, Jose
Montanes, Elena
Luaces, Oscar
Jose del Coz, Juan
MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES, PT III, 2010, 6323 : 115 - 130
[32] Binary Decomposition Methods for Multipartite Ranking
Fuernkranz, Johannes
Huellermeier, Eyke
Vanderlooy, Stijn
MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES, PT I, 2009, 5781 : 359 - +
[33] Some Results on the Degree of Vertices of the Power Digraph and Its Complement
Thakur, Sanjay Kumar
Goswami, Pinkimani
Ray, Gautam Chandra
INTERNATIONAL JOURNAL OF ANALYSIS AND APPLICATIONS, 2024, 22
[34] Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles
Chiba, Shuya
DISCRETE APPLIED MATHEMATICS, 2023, 330 : 1 - 13
[35] Hybrid Paired Comparison Analysis, with Applications to the Ranking of College Football Teams
Annis, David H.
Craig, Bruce A.
JOURNAL OF QUANTITATIVE ANALYSIS IN SPORTS, 2005, 1 (01)
[36] DOMINANCE ASSESSMENT THROUGH PAIRED-COMPARISON IN OBJECT RANKING PROBLEMS
VARNAKOV, VV
POGODIN, VP
AUTOMATION AND REMOTE CONTROL, 1994, 55 (01) : 138 - 144
[37] CrowdDC: Ranking From Crowdsourced Paired Comparison With Divide-and-Conquer
Wang, Ming-Hung
Zhang, Chia-Yuan
Song, Jia-Ru
IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS, 2024, 11 (02) : 3015 - 3021
[38] How Close to Regular Must a Semicomplete Multipartite Digraph Be to Secure Hamiltonicity?
Anders Yeo
Graphs and Combinatorics, 1999, 15 : 481 - 493
[39] How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity?
Yeo, A
GRAPHS AND COMBINATORICS, 1999, 15 (04) : 481 - 493
[40] Statistical Optimality in Multipartite Ranking and Ordinal Regression
Uematsu, Kazuki
Lee, Yoonkyung
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2015, 37 (05) : 1080 - 1094

← 1 2 3 4 5 →