Abstract
Intransitivity is a critical issue in pairwise preference modeling. It refers to the intransitive pairwise preferences between a group of players or objects that potentially form a cyclic preference chain, and has been long discussed in social choice theory in the context of the dominance relationship. However, such multifaceted intransitivity between players and the corresponding player representations in high dimension are difficult to capture. In this paper, we propose a probabilistic model that joint learns the d-dimensional representation (\(d > 1\)) for each player and a dataset-specific metric space that systematically captures the distance metric in \(\mathbb {R}^d\) over the embedding space. Interestingly, by imposing additional constraints in the metric space, our proposed model degenerates to former models used in intransitive representation learning. Moreover, we present an extensive quantitative investigation of the wide existence of intransitive relationships between objects in various real-world benchmark datasets. To the best of our knowledge, this investigation is the first of this type. The predictive performance of our proposed method on various real-world datasets, including social choice, election, and online game datasets, shows that our proposed method outperforms several competing methods in terms of prediction accuracy.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bottou, L.: Large-scale machine learning with stochastic gradient descent. In: Lechevallier, Y., Saporta, G. (eds.) Proceedings of COMPSTAT 2010, pp. 177–186. Springer, Heidelberg (2010)
Bradley, R.A., Terry, M.E.: Rank analysis of incomplete block designs: I. The method of paired comparisons. Biometrika 39(3/4), 324–345 (1952)
Cao, Z., Qin, T., Liu, T.Y., Tsai, M.F., Li, H.: Learning to rank: from pairwise approach to listwise approach. In: Proceedings of the 24th International Conference on Machine Learning, pp. 129–136. ACM (2007)
Cattelan, M., Varin, C., Firth, D.: Dynamic Bradley-Terry modelling of sports tournaments. J. Roy. Stat. Soc.: Ser. C (Appl. Stat.) 62(1), 135–150 (2013)
Causeur, D., Husson, F.: A 2-dimensional extension of the Bradley-Terry model for paired comparisons. J. Stat. Plan. Infer. 135(2), 245–259 (2005)
Chen, S., Joachims, T.: Modeling intransitivity in matchup and comparison data. In: Proceedings of the 9th ACM International Conference on Web Search and Data Mining, pp. 227–236. ACM (2016)
Chen, S., Joachims, T.: Predicting matchups and preferences in context. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2016, NY, USA, pp. 775–784. ACM, New York (2016)
Chen, X., Bennett, P.N., Collins-Thompson, K., Horvitz, E.: Pairwise ranking aggregation in a crowdsourced setting. In: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, WSDM 2013, NY, USA, pp. 193–202. ACM, New York (2013)
Dangauthier, P., Herbrich, R., Minka, T., Graepel, T.: Trueskill through time: revisiting the history of chess. In: Advances in Neural Information Processing Systems, pp. 337–344 (2007)
Davidson, R.R.: On extending the Bradley-Terry model to accommodate ties in paired comparison experiments. J. Am. Stat. Assoc. 65(329), 317–328 (1970)
Elo, A.E.: The Rating of Chess Players, Past and Present. Arco Pub., New York (1978)
Globerson, A., Chechik, G., Pereira, F., Tishby, N.: Euclidean embedding of co-occurrence data. J. Mach. Learn. Res. 8, 2265–2295 (2007)
Herbrich, R., Minka, T., Graepel, T.: Trueskill: a Bayesian skill rating system. In: Advances in Neural Information Processing Systems, pp. 569–576 (2006)
Herlocker, J.L., Konstan, J.A., Borchers, A., Riedl, J.: An algorithmic framework for performing collaborative filtering. In: Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 230–237. ACM (1999)
Huang, T.K., Lin, C.J., Weng, R.C.: Ranking individuals by group comparisons. J. Mach. Learn. Res. 9, 2187–2216 (2008)
Hunter, D.R.: MM algorithms for generalized Bradley-Terry models. Ann. Stat. 32, 384–406 (2004)
Jamali, M., Ester, M.: A transitivity aware matrix factorization model for recommendation in social networks. In: International Joint Conference on Artificial Intelligence (IJCAI) (2011)
Johnson, D.B.: Finding all the elementary circuits of a directed graph. SIAM J. Comput. 4(1), 77–84 (1975)
Kamishima, T.: Nantonac collaborative filtering: recommendation based on order responses. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 583–588. ACM (2003)
Keener, J.P.: The Perron-Frobenius theorem and the ranking of football teams. SIAM Rev. 35(1), 80–93 (1993)
May, K.O.: Intransitivity, utility, and the aggregation of preference patterns. Econometrica: J. Econ. Soc. 22, 1–13 (1954)
Menke, J.E., Martinez, T.R.: A Bradley-Terry artificial neural network model for individual ratings in group competitions. Neural Comput. Appl. 17(2), 175–186 (2008)
Ou, M., Cui, P., Pei, J., Zhang, Z., Zhu, W.: Asymmetric transitivity preserving graph embedding. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2016, NY, USA, pp. 1105–1114. ACM, New York (2016)
Regenwetter, M., Dana, J., Davis-Stober, C.P.: Transitivity of preferences. Psychol. Rev. 118(1), 42 (2011)
Thurstone, L.L.: A law of comparative judgement. Psychol. Rev. 34(4), 273–286 (1927)
Tideman, N.: Collective Decisions and Voting: The Potential for Public Choice. Ashgate Publishing Ltd., Farnham (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Duan, J., Li, J., Baba, Y., Kashima, H. (2017). A Generalized Model for Multidimensional Intransitivity. In: Kim, J., Shim, K., Cao, L., Lee, JG., Lin, X., Moon, YS. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2017. Lecture Notes in Computer Science(), vol 10235. Springer, Cham. https://doi.org/10.1007/978-3-319-57529-2_65
Download citation
DOI: https://doi.org/10.1007/978-3-319-57529-2_65
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-57528-5
Online ISBN: 978-3-319-57529-2
eBook Packages: Computer ScienceComputer Science (R0)