A. Figure, 3: Quality measure Qp?q of the resulting Laplacians for 1 ´ n L n " 0

J. Bibliography-sameer-agarwal, L. Lim, P. Zelnik-manor, D. Perona, S. Kriegman et al., Beyond pairwise clustering, Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp.838-845, 2005.

S. Agarwal, K. Branson, and S. Belongie, Higher order learning with graphs, Proceedings of the 23rd international conference on Machine learning , ICML '06, pp.17-24, 2006.
DOI : 10.1145/1143844.1143847
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.4625

A. Argyriou, A. Charles, M. Micchelli, and . Pontil, Learning Convex Combinations of Continuously Parameterized Basic Kernels, Learning Theory, pp.338-352, 2005.
DOI : 10.1007/11503415_23

A. Argyriou, M. Herbster, and M. Pontil, Combining Graph Laplacians for Semi-Supervised Learning, Proceedings of the 20 th conference Annual Conference on Neural Information Processing Systems (NIPS-05), pp.67-74, 2006.

G. Ausiello, P. G. Franciosa, and D. Frigioni, Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach, Proceedings of the 7 th Italian Conference on Theoretical Computer Science, ICTCS '01, pp.312-327, 2001.
DOI : 10.1007/3-540-45446-2_20

C. Berge, Hypergraphs: combinatorics of finite sets. North-Holland Mathematical Library, 1989.

D. Boley, G. Ranjan, and Z. Zhang, Commute times for a directed graph using an asymmetric Laplacian, Linear Algebra and its Applications, vol.435, issue.2, pp.224-242, 2011.
DOI : 10.1016/j.laa.2011.01.030

M. Bolla, Spectra, Euclidean representations and clusterings of hypergraphs, Discrete Mathematics, vol.117, issue.1-3, pp.19-39, 1993.
DOI : 10.1016/0012-365X(93)90322-K

S. Bonnabel and R. Sepulchre, Riemannian Metric and Geometric Mean for Positive Semidefinite Matrices of Fixed Rank, SIAM Journal on Matrix Analysis and Applications, vol.31, issue.3, pp.1055-1070, 2009.
DOI : 10.1137/080731347

X. Bresson, D. Arthur, and . Szlam, Total Variation, Cheeger Cuts, Proceedings of the 27 th International Conference on Machine Learning (ICML-10), pp.1039-1046, 2010.

N. Buchbinder, . Feldman, R. Naor, and . Schwartz, Submodular Maximization with Cardinality Constraints, Proceedings of the 25 th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-14), pp.1433-1452, 2014.
DOI : 10.1137/1.9781611973402.106

M. Burgin, Interpretations of Negative Probabilities, 2010.

J. Cai and M. Strube, End-to-end coreference resolution via hypergraph partitioning, Proceedings of the 23 rd International Conference on Computational Linguistics (COLING-10), pp.143-151, 2010.

R. Cambini, G. Gallo, and M. Scutella, Flows on hypergraphs, Mathematical Programming, pp.195-217, 1997.
DOI : 10.1007/BF02614371

K. Ashok, P. Chandra, W. L. Raghavan, R. Ruzzo, P. Smolensky et al., The electrical resistance of a graph captures its commute and cover times, Computational Complexity, 1996.

K. Chiang, J. J. Whang, S. Inderjit, and . Dhillon, Scalable clustering of signed networks using balance normalized cut, Proceedings of the 21st ACM international conference on Information and knowledge management, CIKM '12, pp.615-624, 2012.
DOI : 10.1145/2396761.2396841

F. R. Chung, Spectral Graph Theory, 1997.
DOI : 10.1090/cbms/092

F. Chung, Laplacians and the Cheeger Inequality for Directed Graphs, Annals of Combinatorics, vol.9, issue.1, pp.1-19, 2005.
DOI : 10.1007/s00026-005-0237-z

H. Drucker, J. Chris, L. Burges, A. Kaufman, V. Smola et al., Support vector regression machines, Proceedings of the 10 th Conference on Neural Information Processing Systems (NIPS-96), pp.155-161, 1996.

J. Edmonds and R. M. Karp, Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems, Journal of the ACM, vol.19, issue.2, pp.248-264, 1972.
DOI : 10.1145/321694.321699

A. Emrick and E. , The Rating of Chess Players, Past and Present, 1978.

F. Fouss, A. Pirotte, and M. Saerens, A Novel Way of Computing Similarities between Nodes of a Graph, with Application to Collaborative Recommendation, The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05), pp.550-556, 2005.
DOI : 10.1109/WI.2005.9

F. Fouss, A. Pirotte, J. Renders, and M. Saerens, Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. Knowledge and Data Engineering, IEEE Transactions on, vol.19, issue.3, pp.355-369, 2007.

Y. Freund, E. Robert, and . Schapire, A desicion-theoretic generalization of on-line learning and an application to boosting, Proceedings of the 2 nd European Conference On Computational Learning Theory (EuroCOLT- 95), pp.23-37, 1995.
DOI : 10.1007/3-540-59119-2_166

G. Gallo, G. Longo, S. Pallottino, and S. Nguyen, Directed hypergraphs and applications, Discrete Applied Mathematics, vol.42, issue.2-3, pp.177-201, 1993.
DOI : 10.1016/0166-218X(93)90045-P

G. Gallo, C. Gentile, D. Pretolani, and G. Rago, Max Horn SAT and the minimum cut problem in directed hypergraphs, Mathematical Programming, pp.213-237, 1998.
DOI : 10.1007/BF01581727

J. Gantz and D. Reinsel, The digital universe in 2020: Big data, bigger digital shadows, and biggest growth in the far east, IDC iView: IDC Analyze the Future, 2012.

M. Goemans and D. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, Journal of the ACM, vol.42, issue.6, pp.1-27, 1995.
DOI : 10.1145/227683.227684

B. Andrew, X. Goldberg, . Zhu, J. Stephen, and . Wright, Dissimilarity in graph-based semi-supervised classification, Proceedings of the 11 th International Conference on Artificial Intelligence and Statistics (AISTATS- 07), pp.155-162, 2007.

D. Greig, . Porteous, H. Allan, and . Seheult, Exact maximum a posteriori estimation for binary images, Journal of the Royal Statistical Society. Series B (Methodological), pp.271-279, 1989.

S. Hamilton, PythonSkills: Implementation of the TrueSkill, Glicko and Elo Ranking Algorithms, 2012.

F. Harary, On the notion of balance of a signed graph., The Michigan Mathematical Journal, vol.2, issue.2, pp.143-146, 1953.
DOI : 10.1307/mmj/1028989917

R. Herbrich, T. Minka, and T. Graepel, TrueSkill TM : A Bayesian Skill Rating System, Proceedings of the 20 th Conference on Neural Information Processing Systems (NIPS-06), pp.569-576, 2006.

M. Herbster, Exploiting cluster-structure to predict the labeling of a graph Algorithmic Learning Theory, 2008.

P. Yao and . Hou, Bounds for the least Laplacian eigenvalue of a signed graph, Acta Mathematica Sinica, vol.21, issue.4, pp.955-960, 2005.

K. Huang, Maximum Flow Problem in Assembly Manufacturing Networks, 2011.

S. Iwata, B. James, and . Orlin, A Simple Combinatorial Algorithm for Submodular Function Minimization, Proceedings of the 20 th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-09), pp.1230-1237, 2009.
DOI : 10.1137/1.9781611973068.133

R. David and . Karger, Global min-cuts in RNC, and other ramifications of a simple min-out algorithm, Proceedings of the 4 th Annual ACM-SIAM Symposium on Discrete algorithms, pp.21-30, 1993.

S. Klamt, U. Haus, and F. Theis, Hypergraphs and Cellular Networks, PLoS Computational Biology, vol.9, issue.5, 2009.
DOI : 10.1371/journal.pcbi.1000385.g002

J. Douglas, M. Klein, and . Randi´crandi´c, Resistance distance, Journal of Mathematical Chemistry, vol.12, issue.1, pp.81-95, 1993.

Y. Koren, L. Carmel, and D. Harel, ACE: a fast multiscale eigenvectors computation for drawing huge graphs, Proceedings of the 8 th IEEE Symposium on Information Visualization, pp.137-144, 2002.

N. Krislock, J. Malick, and F. Roupin, Improved semidefinite bounding procedure for solving Max-Cut problems to optimality, Mathematical Programming, vol.23, issue.4, pp.61-86, 2014.
DOI : 10.1007/s10107-012-0594-z
URL : https://hal.archives-ouvertes.fr/hal-00665968

J. Kunegis, S. Schmidt, A. Lommatzsch, J. Lerner, E. W. et al., Spectral Analysis of Signed Graphs for Clustering, Prediction and Visualization, Proceedings of the 10 th SIAM International Conference on Data Mining (SDM-10), pp.559-559, 2010.
DOI : 10.1137/1.9781611972801.49

L. Yen, F. Fouss, C. Decaestecker, P. Francq, and M. Saerens, Graph Nodes Clustering Based on the Commute-Time Kernel, Proceedings of the 11 th Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp.1037-1045, 2007.
DOI : 10.1007/978-3-540-71701-0_117

J. Lasek, Z. Szlávik, and S. Bhulai, The predictive power of ranking systems in association football, International Journal of Applied Pattern Recognition, vol.1, issue.1, pp.27-46, 2013.
DOI : 10.1504/IJAPR.2013.052339

H. Lee, Python implementation of Elo: A rating system for chess tournaments, 2013.

H. Lee, Python implementation of TrueSkill: The video game rating system, 2013.

L. Lovász, A. Grötschel, and . Schrijver, Geometric algorithms and combinatorial optimization, 1993.

L. Lovász, Submodular functions and convexity, Mathematical Programming The State of the Art, pp.235-257, 1983.
DOI : 10.1007/978-3-642-68874-4_10

M. Mcpherson, L. Smith-lovin, M. James, and . Cook, Birds of a feather: Homophily in social networks. Annual review of sociology, pp.415-444, 2001.

G. Nemhauser, L. Wolsey, and M. Fisher, An analysis of approximations for maximizing submodular set functions???I, Mathematical Programming, vol.16, issue.1, pp.265-294, 1978.
DOI : 10.1007/BF01588971

L. Page, S. Brin, R. Motwani, and T. Winograd, The PageRank Citation Ranking: Bringing Order to the Web, 1999.

H. Christos, M. Papadimitriou, and . Yannakakis, Optimization, approximation , and complexity classes, Journal of computer and system sciences, vol.43, issue.3, pp.425-440, 1991.

R. Penrose, A generalized inverse for matrices, Proceedings of the Cambridge Philosophical Society, pp.406-413, 1955.
DOI : 10.1093/qmath/2.1.189

J. Picard and M. Queyranne, On the structure of all minimum cuts in a network and applications, Combinatorial Optimization II Mathematical Programming Studies, vol.13, pp.8-16, 1980.

J. Rodríguez, On the Laplacian spectrum and walk-regular hypergraphs. Linear and Multilinear Algebra, pp.285-297, 2003.

K. Schmidt and G. Trenkler, The Moore?Penrose inverse of a semi-magic square is semi-magic, International Journal of Mathematical Education in Science and Technology, vol.31, issue.4, pp.624-629, 2001.
DOI : 10.1080/713816465

K. Tsuda, Propagating distributions on a hypergraph by dual information regularization, Proceedings of the 22nd international conference on Machine learning , ICML '05, pp.920-927, 2005.
DOI : 10.1145/1102351.1102467

V. Vapnik, Statistical learning theory, 1998.

U. Von and L. , A tutorial on spectral clustering, Statistics and computing, vol.17, issue.4, pp.395-416, 2007.

U. Von-luxburg, A. Radl, and M. Hein, Getting lost in space: Large sample analysis of the commute distance, Proceedings of the 24 th Conference on Neural Information Processing Systems (NIPS-10), pp.2622-2630, 2010.

S. Zhang, G. D. Sullivan, and K. D. Baker, The automatic construction of a view-independent relational model for 3-D object recognition . Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol.15, issue.6, pp.531-544, 1993.

D. Zhou, J. Huang, and B. Schölkopf, Learning from labeled and unlabeled data on a directed graph, Proceedings of the 22nd international conference on Machine learning , ICML '05, pp.1036-1043, 2005.
DOI : 10.1145/1102351.1102482

D. Zhou, J. Huang, and B. Schölkopf, Learning with hypergraphs: Clustering, classification, and embedding, Proceedings of the 20 th Conference on Neural Information Processing Systems (NIPS- 06), pp.1601-1608, 2006.

X. Zhu, Z. Ghahramani, and J. Lafferty, Semi-supervised learning using gaussian fields and harmonic functions, Proceedings of the 20 th International conference on Machine learning (ICML-03), pp.912-919, 2003.