Members

Marco Saerens

Contact Information

Marco Saerens
Professor
UCL / EPL / ICTEAM / INGI and SSH / ILSM
Place des Doyens 1 bte L2.01.02
1348 Louvain-la-Neuve
Belgium

Office: SH1C B.108 (1st floor)
Phone: +32 10 47 92 46
Email: marco [period] saerens [snail] uclouvain [period] be -> mailto:marco [period] saerens [snail] uclouvain [period] be
Personal home page

Biography

Marco Saerens



Publications

Article de périodique (Journal article)
2016
  • Kivimäki, Ilkka ; Lebichot, Bertrand ; Saramäki, Jari ; Saerens, Marco. Two betweenness centrality measures based on Randomized Shortest Paths. In: Scientific Reports, Vol. 2016, no.6, p. 1-15 (2016). doi:10.1038. http://hdl.handle.net/2078.1/177331

  • 2015
  • Panzacchi, Manuela ; Van Moorter, Bram ; Strand, Olav ; Saerens, Marco ; Kivimäki, Ilkka. Predicting the continuum between corridors and barriers to animal movements using Step Selection Functions and Randomized Shortest Paths. In: Journal of Animal Ecology, p. 32-42 (2015). doi:10.1111/1365-2656.12386. http://hdl.handle.net/2078.1/165505

  • 2014
  • Kivimäki, Ilkka ; Shimbo, Masashi ; Saerens, Marco. Developments in the theory of randomized shortest paths with a comparison of graph node distances. In: Physica A: Statistical Mechanics and its Applications, Vol. 393, no.393, p. 600-616 (2014). doi:10.1016/j.physa.2013.09.016. http://hdl.handle.net/2078.1/136971

  • Senelle, Mathieu ; Garcia Diez, Silvia ; Mantrach, Amin ; Shimbo, Masashi ; Saerens, Marco ; Fouss, François. The Sum-over-Forests density index: identifying dense regions in a graph. In: IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 36, no. 6, p. 1268-1274 (2014). doi:10.1109/TPAMI.2013.227. http://hdl.handle.net/2078.1/139805

  • 2013
  • Garcia Diez, Silvia ; Laforge, Jérôme ; Saerens, Marco. Rminimax: an optimally randomized minimax algorithm. In: IEEE Transactions on Cybernetics, Vol. 43, no.1, p. 385-393 (February 2013). doi:10.1109/TSMCB.2012.2207951. http://hdl.handle.net/2078.1/177487

  • Lebichot, Bertrand ; Kivimäki, Ilkka ; Françoisse, Kevin ; Saerens, Marco. Semi-Supervised Classification through the Bag-of-Paths Group Betweenness. In: IEEE Transactions on Neural Networks and Learning Systems, Vol. 25, no.6, p. 1173 - 1186 (June 2014). doi:10.1109/TNNLS.2013.2290281. http://hdl.handle.net/2078/145159

  • 2012
  • Françoisse, Kevin ; Fouss, François ; Saerens, Marco. A Link-Analysis-Based Discriminant Analysis for Exploring Partially Labeled Graphs. In: Pattern Recognition Letters, Vol. 34, no. 2, p. 146?154 (2013). doi:10.1016/j.patrec.2012.07.025. http://hdl.handle.net/2078.1/115183

  • Fouss, François ; Françoisse, Kevin ; Yen, Luh ; Pirotte, Alain ; Saerens, Marco. An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification. In: Neural Networks, Vol. 31, p. 53-72 (2012). doi:10.1016/j.neunet.2012.03.001. http://hdl.handle.net/2078.1/115176

  • Lopez, Xavier Moles ; Debeir, Olivier ; Maris, Calliope ; Rorive, Sandrine ; Roland, Isabelle ; Saerens, Marco ; Salmon, Isabelle ; Decaestecker, Christine. Clustering methods applied in the detection of Ki67 hot-spots in whole tumor slide images: An efficient way to characterize heterogeneous tissue-based biomarkers. In: Cytometry. Part A, Vol. 81A, no. 9, p. 765-775 (2012). doi:10.1002/cyto.a.22085. http://hdl.handle.net/2078.1/115274

  • Garcia Diez, Silvia ; Laforge, Jérôme ; Saerens, Marco. ?minimax: An Optimally Randomized MINIMAX Algorithm. In: IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, Vol. 43, no. 1 (2012). doi:10.1109/TSMCB.2012.2207951. http://hdl.handle.net/2078.1/115173

  • 2011
  • Yen, Luh ; Saerens, Marco ; Fouss, François. A Link Analysis Extension of Correspondence Analysis for Mining Relational Databases. In: IEEE Transactions on Knowledge and Data Engineering, Vol. 23, no.4, p. 481-495 (2011). doi:10.1109/TKDE.2010.142. http://hdl.handle.net/2078.1/114989

  • Garcia Diez, Silvia ; Fouss, François ; Shimbo, Masashi ; Saerens, Marco. A sum-over-paths extension of edit distances accounting for all sequence alignments. In: Pattern Recognition, Vol. 44, no.6, p. 1172-1182 (2011). doi:10.1016/j.patcog.2010.11.020. http://hdl.handle.net/2078.1/114991

  • Mantrach, Amin ; van Zeebroeck, Nicolas ; Francq, Pascal ; Shimbo, Masashi ; Bersini, Hugues ; Saerens, Marco. Semi-supervised classification and betweenness computation on large, sparse, directed graphs. In: Pattern Recognition, Vol. 44, no. 6, p. 1212-1224 (2011). doi:10.1016/j.patcog.2010.11.019. http://hdl.handle.net/2078.1/114992

  • 2010
  • Fouss, François ; Achbany, Youssef ; Saerens, Marco. A probabilistic reputation model based on transaction ratings. In: Information Sciences, Vol. 180, no. 11, p. 2095-2123 (Juin 2010). doi:10.1016/j.ins.2010.01.020. http://hdl.handle.net/2078/32122

  • Mantrach, Amin ; Yen, Luh ; Callut, Jerome ; Francoisse, Kevin ; Shimbo, Masashi ; Saerens, Marco. The Sum-over-Paths Covariance Kernel: A Novel Covariance Measure between Nodes of a Directed Graph. In: IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 32, no. 6, p. 1112-1126 (2010). doi:10.1109/TPAMI.2009.78. http://hdl.handle.net/2078.1/34395

  • 2009
  • Yen, Luh ; Fouss, François ; Decaestecker, Christine ; Francq, Pascal ; Saerens, Marco. Graph nodes clustering with the sigmoid commute-time kernel: A comparative study. In: Data and Knowledge Engineering, Vol. 68, no. 3, p. 338-361 (Mars 2009). doi:10.1016/j.datak.2008.10.006. http://hdl.handle.net/2078/32120

  • Saerens, Marco ; Fouss, François ; Achbany, Youssef ; Yen, Luh. Randomized shortest-path problems: Two related models. In: Neural computation, Vol. 21, no. 8, p. 2363-2404 (Août 2009). doi:10.1162/neco.2009.11-07-643. http://hdl.handle.net/2078/32121

  • 2008
  • Frénay, Benoît ; Saerens, Marco. QL2, a simple reinforcement learning scheme for two-player zero-sum Markov games. In: Neurocomputing, Vol. 72, no. 7-9, p. 1494-1507 (2008). http://hdl.handle.net/2078/24537

  • Achbany, Youssef ; Fouss, François ; Yen, Luh ; Pirotte, Alain ; Saerens, Marco. Tuning continual exploration in reinforcement learning: An optimality property of the Boltzmann strategy. In: Neurocomputing, Vol. 71, no. 13-15, p. 2507-2520 (2008). doi:10.1016/j.neucom.2007.11.040. http://hdl.handle.net/2078.1/36380

  • 2007
  • Yen, Luh ; Saerens, Marco ; Francq, Pascal ; Decaestecker, Christine ; Fouss, François. Graph Nodes Clustering based on the Commute-Time Kernel. In: Lecture Notes in Computer Science, Vol. 4426, p. 1037-1045 (2007). doi:10.1007/978-3-540-71701-0_117. http://hdl.handle.net/2078/18668

  • Fouss, François ; Pirotte, Alain ; Renders, Jean-Michel ; Saerens, Marco. Random-walk computation of similarities between nodes of a graph, with application to collaborative recommendation. In: IEEE Transactions on Knowledge and Data Engineering, Vol. 19, no. 3, p. 355-369 (Mars 2007). doi:10.1109/TKDE.2007.46. http://hdl.handle.net/2078/69093

  • 2006
  • Achbany, Youssef ; Saerens, Marco ; Pirotte, Alain ; Yen, Luh ; Fouss, François. Optimal Tuning of Continual Online Exploration in Reinforcement Learning. In: Lecture Notes in Computer Science, Vol. 4131 (2006). http://hdl.handle.net/2078/18670

  • 2004
  • Saerens, Marco ; Decaestecker, Christine. Neural networks for classification : An Introduction. In: Handbook of Computational Intelligence, (2004). http://hdl.handle.net/2078/18156

  • Fouss, François ; Saerens, Marco. Yet another method for combining classifiers outputs: A maximum entropy approach. In: Lecture Notes in Computer Science, Vol. 3077 (2004). http://hdl.handle.net/2078/18672

  • 2002
  • Saerens, Marco ; Latinne, Patrice ; Decaestecker, Christine. Adjusting the Outputs of a Classifier to New a Priori Probabilities : A Simple Procedure. In: Neural Computation, Vol. 14, no. 1, p. 21-41 (Janvier 2002). doi:10.1162/089976602753284446. http://hdl.handle.net/2078/18151

  • Saerens, Marco ; Latinne, Patrice ; Decaestecker, Christine. Any reasonable cost function can be used for a posteriori probability approximation. In: IEEE Transactions on Neural Networks, Vol. 13, no. 1, p. 1204-1210 (2002). doi:10.1109/TNN.2002.1031952. http://hdl.handle.net/2078/18152

  • Communication à un colloque (Conference Paper)
    2016
  • Lebichot, Bertrand ; Braun, Fabian ; Caelen, Olivier ; Saerens, Marco. A graph-based, semi-supervised, credit card fraud detection system. 5th International Workshop on Complex Networks and their Applications (Milan, Italy, du 30/11/2016 au 02/12/2016). In: Complex Networks & Their Applications V, Proceedings of the 5th International Workshop on Complex Networks and their Applications (Studies in Computational Intelligence; 693), Springer International Publishing, 2016. 978-3-319-50900-6, p. 721-733. doi:10.1007/978-3-319-50901-3. http://hdl.handle.net/2078.1/187298

  • Brognaux, Sandrine ; François, Thomas ; Saerens, Marco. Combining manual and automatic prosodic annotation for expressive speech synthesis. 10th International Language Resources and Evaluation Conference (LREC 2016) (Portoro?, Slovenia, du 23/05/2016 au 28/05/2016). http://hdl.handle.net/2078.1/187105

  • Sommer, Félix ; Fouss, François ; Saerens, Marco. Comparison of Graph Node Distances on Clustering Tasks. 25th International Conference on Artificial Neural Networks (ICANN 2016) (Barcelona, Spain, du 06/09/2016 au 09/09/2016). In: Artificial Neural Networks and Machine Learning (Lecture Notes in Computer Science book series; volume 9886), Springer: Switzerland, 2016. 978-3-319-44777-3, p. 192?201. doi:10.1007/978-3-319-44778-0_23. http://hdl.handle.net/2078.1/187106

  • Sommer, Félix ; Fouss, François ; Saerens, Marco. Comparison of graph node distances on clustering tasks. International Conference on Artificial Neural Netwokrs (Barcelone, du 06/09/2016 au 09/09/2016). http://hdl.handle.net/2078.1/176613

  • 2014
  • Vaca, Carmen ; Mantrach , Amin ; Jaimes, Alejandro ; Saerens, Marco. A Time-based Collective Factorization for Topic Discovery and Monitoring in News. International conference on World wide web (Seoul, Korea, du 07/04/2014 au 11/04/2014). In: WWW '14 Proceedings of the 23rd international conference on World wide web, ACM: New-York, 2014. 978-1-4503-2744-2, p. 527-538. doi:10.1145/2566486.2568041. http://hdl.handle.net/2078.1/165461

  • Devooght, Robin ; Mantrach, Amin ; Kivimäki, Ilkka ; Bersini, Hugues ; Jaimes, Alejandro ; Saerens, Marco. Random Walks Based Modularity : Application to Semi-Supervised Learning. International conference on World wide web (Seoul, Korea, du 07/04/2014 au 11/04/2014). In: WWW '14 Proceedings of the 23rd international conference on World wide web, ACM: New-York, 2014. 978-1-4503-2744-2, p. 213-224. doi:10.1145/2566486.2567986. http://hdl.handle.net/2078.1/165497

  • Brognaux, Sandrine ; Drugman, Thomas ; Saerens, Marco. Synthesizing sports commentaries: One or several emphatic stresses?. Speech Prosody 7 (Trinity College Dublin, du 20/05/2014 au 23/05/2014). In: Social and Linguistic Speech Prosody. Proceedings of the 7th international conference on Speech Prosody (Speech Prosody), 2014, p. 270-274. http://hdl.handle.net/2078.1/150964

  • Senelle, Mathieu ; Saerens, Marco ; Fouss, François. The Sum-over-Forests clustering. European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning (Bruges). In: Proceedings of the European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, 2014. http://hdl.handle.net/2078.1/139927

  • 2013
  • Panchenko, Alexander ; Kivimäki, Ilkka ; Dessy, Adrien ; Verdegem, Dries ; Francq, Pascal ; Fairon, Cédrick ; Bersini, Hugues ; Saerens, Marco. A Graph-Based Approach to Skill Extraction from Text. TextGraphs-8 Graph-based Methods for Natural Language Processing (Seattle, USA, du 18/10/2013 au 19/10/2013). http://hdl.handle.net/2078.1/136968

  • Suzuki, Ikumi ; Hara, Kazuo ; Shimbo, Masashi ; Saerens, Marco. Centering Similarity Measures to Reduce Hubs. Conference on Empirical Methods in Natural Language Processing (Seattle, Washington, USA, du 18/10/2013 au 21/10/2013). In: Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing, 2013, p. 613-623. http://hdl.handle.net/2078.1/165458

  • 2012
  • Suzuki, I. ; Hara, K. ; Shimbo, M. ; Matsumoto, Y. ; Saerens, Marco. Investigating the effectiveness of laplacian-based kernels in hub reduction. Association for the Advancement of Artificial Intelligence Conference (AAAI 2012) (du Date de début au Date de fin). In: Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (AAAI 2012), 2012. 978-1-57735-568-7. http://hdl.handle.net/2078/121012

  • 2011
  • Garcia Diez, Silvia ; Saerens, Marco ; Senelle, Mathieu ; Fouss, François. A Simple-cycles weighted kernel based on harmony structure for similarity retrieval. Proceedings of the 12th International Society for Music Information Retrieval Conference (ISMIR 2011) (Miami, Florida, USA, du 24/10/2011 au 28/10/2011). http://hdl.handle.net/2078.1/114987

  • Garcia Diez, Silvia ; Vandenbussche, Eric ; Saerens, Marco. A continuous-state version of discrete randomized shortest-paths, with application to path planning. 2011 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011 (Orlando, FL, du 12 December 2011 au 15 December 2011). In: 2011 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011, 2011, 6570-6577. doi:10.1109/CDC.2011.6160770. http://hdl.handle.net/2078.1/115159

  • 2010
  • Kevers, Laurent ; Mantrach, Amin ; Fairon, Cédrick ; Bersini, Hugues ; Saerens, Marco. Classification hybride par motifs lexicaux étendus et classificateurs SVM. Journées Internationales d'Analyse statistiques des Données Textuelles (JADT 2010) (Rome, du 09/06/2010 au 10/06/2010). http://hdl.handle.net/2078.1/81856

  • Kevers, Laurent ; Mantrach Amin ; Fairon, Cédrick ; Bersini Hugues ; Saerens, Marco. Classification supervisée hybride par motifs lexicaux étendus et classificateurs SVM. 10th International Conference on statistical analysis of textual data (JADT 2010) (Rome, du 09/06/2010 au 11/06/2010). http://hdl.handle.net/2078.1/81859

  • Garcia Diez, Silvia ; Fouss, François ; Shimbo, Masashi ; Saerens, Marco. Normalized Sum-over-Paths Edit Distances. International Conference on Pattern Recognition (Istanbul, Turkey, du 23/08/2010au 26/08/2010). http://hdl.handle.net/2078/32569

  • 2009
  • Frénay, Benoît ; Saerens, Marco. QL2, a simple reinforcement learning scheme for two-player zero-sum Markov games. 18th European Symposium on Artificial Neural Networks (Brugge(Belgium), Apr, 2008). In: Proceedings of the 16th European Symposium on Artificial Neural Networks, 2009. http://hdl.handle.net/2078.1/58983

  • 2008
  • Yen, Luh ; Mantrach, Amin ; Shimbo, Masashi ; Saerens, Marco. A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances. SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2008). In: Proceedings of the 14th SIGKDD International Conference on Knowledge Discovery and Data Mining, 2008. 978-1-60558-193-4. http://hdl.handle.net/2078/121009

  • Callut, Jérome ; Dupont, Pierre ; Saerens, Marco ; Françoisse, Kevin. Classification in Graphs using Discriminative Random Walks : Semi-supervised learning, large graphs, betweenness measure, passage times. 6th International Workshop on Mining and Learning with Graphs (MLG) (Helsinki, Finland, du 04/07/2008 au 05/07/2008). http://hdl.handle.net/2078/17748

  • Fouss, François ; Saerens, Marco. Evaluating performance of recommender systems: An experimental comparison. IEEE/WIC/ACM International Conference on Web Intelligence (Sydney, Australia, du 09/12/2008 au 12/12/2008). http://hdl.handle.net/2078/20768

  • Callut, Jérome ; Dupont, Pierre ; Saerens, Marco ; Françoisse, Kevin. Semi-supervised Classification in Graphs using Bounded Random Walks. 17th Annual Machine Learning Conference of Belgium and the Netherlands (Benelearn) (Liège, Belgium, du 18/05/2008 au 20/05/2008). http://hdl.handle.net/2078/17749

  • Callut, Jérome ; Françoisse, Kevin ; Dupont, Pierre ; Saerens, Marco. Semi-supervised classification from discriminative random walks. European Conference on Machine Learning (ECML 2008). In: Proceedings of the European Conference on Machine Learning, 2008. 978-3-540-87479-9, p. 162-177. http://hdl.handle.net/2078/121017

  • 2007
  • Jureta, Ivan ; Faulkner, Stéphane ; Achbany, Youssef ; Saerens, Marco. Dynamic Task Allocation Wihin an Open Service-Oriented Architecture. 6th international joint conference on Autonomous agents and multiagent systems (Honolulu, Hawaii, du 14/05/2007 au 18/05/2007). In: Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems, ACM Press: New York, 2007. 978-81-904262-7-5, p. 1237-1239. http://hdl.handle.net/2078/18519

  • Jureta, Ivan ; Faulkner, Stéphane ; Achbany, Youssef ; Saerens, Marco. Dynamic Web Service Composition within a Service-Oriented Architecture. 5th International Conference on Web Services (Salk Lake City, du 09/07/2007 au 13/07/2007), Vol. 9-13, p. 304-311 (Juillet 2007). In: IEEE International Conference on Web Services (ICWS 2007), IEEE Press: USA, 2007. doi:10.1109/ICWS.2007.79. http://hdl.handle.net/2078/18520

  • Jureta, Ivan ; Faulkner, Stéphane ; Achbany, Youssef ; Saerens, Marco. Dynamic task allocation within an open service-oriented MAS architecture. 2007 International Conference on Autonomous Agents & Multiagent Systems (Honolulu, Hawaii). In: Proceedings of the 2007 International Conference on Autonomous Agents & Multiagent Systems, no. 206. http://hdl.handle.net/2078/18494

  • 2006
  • Fouss, François ; Yen, Luh ; Pirotte, Alain ; Saerens, Marco. An experimental investigation of graph kernels on a collaborative recommendation task. IEEE International Conference on Data Mining (ICDM 2006) (Hong Kong, China, du 18/12/2006 au 22/12/2006). http://hdl.handle.net/2078/19014

  • Achbany, Youssef ; Fouss, François ; Yen, Luh ; Pirotte, Alain ; Saerens, Marco. Optimal tuning of continual, online, exploration in reinforcement learning. 16th International Conference on Artificial Neural Networks (Berlin, 2006). In: Lecture Notes in Computer Science, Springer: Berlin, 2006. 978-3-540-38625-4, Vol. 4131, p. 790-800 (2006). http://hdl.handle.net/2078/18245

  • 2005
  • Fouss, François ; Renders, Jean-Michel ; Pirotte, Alain ; Saerens, Marco. A novel way of computing similarities between nodes of a graph, with application to collaborative recommendation. IEEE WIC/ACM International Joint Conference on Web Intelligence (Compiègne, France, du 19/09/2005 au 22/09/2005). http://hdl.handle.net/2078/19015

  • Yen, Luh ; VanVyve, Denise J. ; Wouters, Fabien ; Fouss, François ; Verleysen, Michel ; Saerens, Marco. Clustering using a random walk-based distance measure. 13th European Symposium on Artificial Neural Networks (du 27/04/2005 au 2005/04/29). In: Proceedings of the 13th European Symposium on Artificial Neural Networks, 2005. 2-930307-05-6, p. 317-324. http://hdl.handle.net/2078/18498

  • Saerens, Marco ; Fouss, François. HITS is principal components analysis. 2005 IEEE/ACM International Joint Conference on Web Intelligence (du 2005/09/19 au 2005/09/22), p. 782-785 (2005). http://hdl.handle.net/2078/18496

  • Fouss, François ; Saerens, Marco ; Pirotte, Alain ; Kolp, Manuel ; Faulkner, Stéphane. Web recommendation system based on a Markov-chain model. International Conference on Enterprise Information Systems (ICEIS 2005) (Miami, USA, du 24/05/2005 au 28/05/2005). http://hdl.handle.net/2078/19017

  • 2004
  • Fouss, François ; Pirotte, Alain ; Saerens, Marco. A Novel Way of Computing Dissimilarities between Nodes of a Graph, with Application to Collaborative Filtering. Proceedings of the Workshop on Statistical Approaches for Web Mining, p. 26-37 (2004). http://hdl.handle.net/2078/18499

  • Saerens, Marco ; Fouss, François ; Dupont, Pierre ; Pirotte, Alain. Collaborative filtering based on random walks on a graph. Workshop on Large Networks (UCL, LLN, December 1, 2004). http://hdl.handle.net/2078/17472

  • Fouss, François ; Renders, Jean-Michel ; Saerens, Marco. Some relationships between Kleinberg's hubs and authorities, correspondence analysis, and the Salsa algorithm. International Conference on the Statistical Analysis of Textual Data (JADT 2004) (Louvain-la-Neuve, Belgium). http://hdl.handle.net/2078/19020

  • Fouss, François ; Renders, Jean-Marc ; Saerens, Marco. Some relationships between between Kleinberg?s hubs and authorities, correspondence analysis and Markov chains. 7th International Conference on the Statistical Analysis of Textual Data, p. 445-455 (2004). http://hdl.handle.net/2078/18500

  • Fouss, François ; Pirotte, Alain ; Saerens, Marco. The Application of New Concepts of Dissimilarities between Nodes of a Graph to Collaborative Filtering. Workshop on Statistical Approaches for Web Mining (SAWM) (Pisa, Italy). http://hdl.handle.net/2078/19019

  • Saerens, Marco ; Fouss, François ; Yen, Luh ; Dupont, Pierre. The principal components analysis of a graph, and its relationships to spectral clustering. Machine Learning: ECML 2004, 15th European Conference on Machine Learning. In: Lecture Notes in Computer Science, Vol. 3201, p. 371-383 (2004). http://hdl.handle.net/2078/18671

  • Saerens, Marco ; Fouss, François ; Yen, Luh ; Dupont, Pierre. The principle components analysis of a graph, and its relationships to spectral clustering. Machine Learning: ECML 2004. 15th European Conference on Machine Learning. Proceedings (Pisa, Italy, 20-24 September 2004). In: Machine Learning: ECML 2004. 15th European Conference on MachineLearning. Proceedings (Lecture Notes in Artificial IntelligenceVol.3201), Springer-verlag, 2004. 3-540-23105-6, p. 371-383. http://hdl.handle.net/2078.1/67992

  • Saerens, Marco ; Fouss, François. Yet another method for combining experts opinions. 5th International Workshop on Multiple Classifier Systems, Vol. 3077, p. 82-91 (2004). http://hdl.handle.net/2078/18298

  • 2003
  • Fouss, François ; Renders, Jean-Michel ; Saerens, Marco. Links between Kleinberg's hubs and authorities, correspondence analysis and Markov chains. IEEE International Conference on Data Mining (ICDM 2003) (Melbourne, USA). http://hdl.handle.net/2078/19021

  • 2001
  • Latinne, Patrice ; Saerens, Marco ; Decaestecker, Christine. Adjusting the outputs of a classifier to new a priori probabilities may significantly improve classification accuracy: Evidence from a multi-class problem in remote sensing. International Conference on Machine Learning. In: Proceedings of the 18th International Conference on Machine Learning, 2001. 1-55860-778-1, p. 298-305. http://hdl.handle.net/2078/121008

  • Contribution à ouvrage collectif (Book Chapter)
    2008
  • Callut, Jérome ; Dupont, Pierre ; Saerens, Marco ; Françoisse, Kevin. Semi-supervised Classification from Discriminative Random Walks (Lecture Notes in Artificial Intelligence), Springer-Verlag, 2008. http://hdl.handle.net/2078/17997

  • Document de travail (Working Paper)
  • Fouss, François ; Achbany, Youssef ; Saerens, Marco. A probabilistic reputation model (IAG - LSM Working Papers; 08/20), 2008. http://hdl.handle.net/2078/18313

  • 2007
  • Jureta, Ivan ; Faulkner, Stéphane ; Achbany, Youssef ; Saerens, Marco. Dynamic Web Service Composition within a Service-Oriented Architecture (IAG Working Papers; 2007/03), 2007. http://hdl.handle.net/2078.1/5515

  • 2006
  • Fouss, François ; Pirotte, Alain ; Saerens, Marco ; Renders, Jean-Michel ; Yen, Luh. A novel way of computing similarities between nodes of a graph, with application to collaborative filtering and subspace projection of the graph nodes (IAG - LSM Working Papers; 06/08), 2006. 43 p. http://hdl.handle.net/2078/18303

  • 2005
  • Saerens, Marco ; Fouss, François. Hits is PCA (IAG Working Papers; 2005/125), 2005. http://hdl.handle.net/2078.1/5476

  • Saerens, Marco ; Fouss, François ; Yen, Luh ; Dupont, Pierre. The principal components analysis of a graph and its relationships to spectral clustering (IAG Working Papers; 2005/124), 2005. http://hdl.handle.net/2078.1/5475

  • Fouss, François ; Faulkner, Stéphane ; Kolp, Manuel ; Pirotte, Alain ; Saerens, Marco. Web recommendation system based on a markov-chain model (IAG Working Papers; 2005/123), 2005. http://hdl.handle.net/2078.1/5474

  • 2004
  • Fouss, François ; Saerens, Marco. A maximum entropy approach to multiple classifiers combination (IAG - LSM Working Papers; 04/107), 2004. 15 p. http://hdl.handle.net/2078/18217

  • 2003
  • Fouss, François ; Renders, Jean-Michel ; Saerens, Marco. Links between Kleinberg's hubs and authorities, correspondence analysis, and Markov chains (ECON Discussion Papers IAG Working Papers; 2003/101 2003/102), 2003. http://hdl.handle.net/2078.1/5429

  • 2002
  • Saerens, Marco ; Latinne, Patrice ; Decaestecker, Christine. Any Reasonable Cost Function Can Be Used for a Posteriori Probability Approximation (IAG Working Papers; 2002/73), 2002. http://hdl.handle.net/2078.1/5421

  • Monographie (Book)
    2016
  • Fouss, François ; Saerens, Marco ; Shimbo, Masashi. Algorithms and Models for Network Data and Link Analysis, Cambridge University Press, 2016. 9781107125773. 543 p. http://hdl.handle.net/2078.1/176612