default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarco Saerens
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j36]Théo Guilbert, Olivier Caelen, Andrei Chirita, Marco Saerens:
Calibration methods in imbalanced binary classification. Ann. Math. Artif. Intell. 92(5): 1319-1352 (2024)- [j35]Chloe Satinet
, François Fouss, Marco Saerens, Pierre Leleux:
In-processing and post-processing strategies for balancing accuracy and sustainability in product recommendations. Electron. Commer. Res. Appl. 67: 101433 (2024) - [j34]Pierre Leleux, Bertrand Lebichot, Guillaume Guex, Marco Saerens:
Sparse randomized policies for Markov decision processes based on Tsallis divergence regularization. Knowl. Based Syst. 300: 112105 (2024) - 2023
- [j33]Sylvain Courtain, Guillaume Guex, Ilkka Kivimäki, Marco Saerens:
Relative entropy-regularized optimal transport on a graph: a new algorithm and an experimental comparison. Int. J. Mach. Learn. Cybern. 14(4): 1365-1390 (2023) - 2021
- [j32]Guillaume Guex, Sylvain Courtain, Marco Saerens:
Covariance and correlation measures on a graph in a generalized bag-of-paths formalism. J. Complex Networks 8(6) (2021) - [j31]Pierre Leleux, Sylvain Courtain, Guillaume Guex, Marco Saerens:
Sparse randomized shortest paths routing with Tsallis divergence regularization. Data Min. Knowl. Discov. 35(3): 986-1031 (2021) - [j30]Sylvain Courtain, Pierre Leleux, Ilkka Kivimäki, Guillaume Guex, Marco Saerens:
Randomized shortest paths with net flows and capacity constraints. Inf. Sci. 556: 341-360 (2021) - [c42]Sylvain Courtain, Marco Saerens:
A Simple Extension of the Bag-of-Paths Model Weighting Path Lengths by a Poisson Distribution. COMPLEX NETWORKS 2021: 220-233 - [i11]Sylvain Courtain, Guillaume Guex, Ilkka Kivimäki, Marco Saerens:
Relative Entropy-Regularized Optimal Transport on a Graph: a new algorithm and an experimental comparison. CoRR abs/2108.10004 (2021) - [i10]Ilkka Kivimäki, Bram Van Moorter, Manuela Panzacchi, Jari Saramäki, Marco Saerens:
Maximum likelihood estimation for randomized shortest paths with trajectory data. CoRR abs/2112.08481 (2021) - 2020
- [j29]Ilkka Kivimäki, Bram Van Moorter, Manuela Panzacchi, Jari Saramäki, Marco Saerens:
Maximum likelihood estimation for randomized shortest paths with trajectory data. J. Complex Networks 8(4) (2020) - [j28]Bertrand Lebichot, Marco Saerens:
An experimental study of graph-based semi-supervised classification with additional node information. Knowl. Inf. Syst. 62(11): 4337-4371 (2020) - [i9]Pierre Leleux, Sylvain Courtain, Guillaume Guex, Marco Saerens:
Sparse Randomized Shortest Paths Routing with Tsallis Divergence Regularization. CoRR abs/2007.00419 (2020)
2010 – 2019
- 2019
- [j27]Guillaume Guex, Ilkka Kivimäki, Marco Saerens:
Randomized optimal transport on a graph: framework and new distance measures. Netw. Sci. 7(1): 88-122 (2019) - [c41]Sylvain Courtain, Bertrand Lebichot, Ilkka Kivimäki, Marco Saerens:
Graph-Based Fraud Detection with the Free Energy Distance. COMPLEX NETWORKS (2) 2019: 40-52 - [i8]Guillaume Guex, Sylvain Courtain, Marco Saerens:
Covariance and Correlation Kernels on a Graph in the Generalized Bag-of-Paths Formalism. CoRR abs/1902.03002 (2019) - [i7]Sylvain Courtain, Pierre Leleux, Ilkka Kivimäki, Guillaume Guex, Marco Saerens:
Randomized Shortest Paths with Net Flows and Capacity Constraints. CoRR abs/1910.01849 (2019) - 2018
- [j26]Bertrand Lebichot, Marco Saerens:
A bag-of-paths node criticality measure. Neurocomputing 275: 224-236 (2018) - [i6]Guillaume Guex, Ilkka Kivimäki, Marco Saerens:
Randomized Optimal Transport on a Graph: Framework and New Distance Measures. CoRR abs/1806.03232 (2018) - [i5]Bertrand Lebichot, Guillaume Guex, Ilkka Kivimäki, Marco Saerens:
A Constrained Randomized Shortest-Paths Framework for Optimal Exploration. CoRR abs/1807.04551 (2018) - 2017
- [j25]Kevin Françoisse, Ilkka Kivimäki, Amin Mantrach, Fabrice Rossi, Marco Saerens:
A bag-of-paths framework for network data analysis. Neural Networks 90: 90-111 (2017) - [c40]Felix Sommer, François Fouss, Marco Saerens:
Modularity-Driven Kernel k-means for Community Detection. ICANN (2) 2017: 423-433 - [i4]Bertrand Lebichot, Marco Saerens:
A Bag-of-Paths Node Criticality Measure. CoRR abs/1705.08720 (2017) - 2016
- [c39]Bertrand Lebichot, Fabian Braun, Olivier Caelen, Marco Saerens:
A graph-based, semi-supervised, credit card fraud detection system. COMPLEX NETWORKS 2016: 721-733 - [c38]Felix Sommer, François Fouss, Marco Saerens:
Comparison of Graph Node Distances on Clustering Tasks. ICANN (1) 2016: 192-201 - [c37]Sandrine Brognaux, Thomas François, Marco Saerens:
Combining Manual and Automatic Prosodic Annotation for Expressive Speech Synthesis. LREC 2016 - 2015
- [i3]Ilkka Kivimäki, Bertrand Lebichot, Jari Saramäki, Marco Saerens:
Two betweenness centrality measures based on Randomized Shortest Paths. CoRR abs/1509.03147 (2015) - 2014
- [j24]Mathieu Senelle, Silvia García-Díez, Amin Mantrach, Masashi Shimbo, Marco Saerens, François Fouss:
The Sum-over-Forests Density Index: Identifying Dense Regions in a Graph. IEEE Trans. Pattern Anal. Mach. Intell. 36(6): 1268-1274 (2014) - [j23]Bertrand Lebichot, Ilkka Kivimäki, Kevin Françoisse, Marco Saerens:
Semisupervised Classification Through the Bag-of-Paths Group Betweenness. IEEE Trans. Neural Networks Learn. Syst. 25(6): 1173-1186 (2014) - [c36]Mathieu Senelle, Marco Saerens, François Fouss:
The Sum-over-Forests clustering. ESANN 2014 - [c35]Robin Devooght, Amin Mantrach, Ilkka Kivimäki, Hugues Bersini, Alejandro Jaimes, Marco Saerens:
Random walks based modularity: application to semi-supervised learning. WWW 2014: 213-224 - [c34]Carmen K. Vaca, Amin Mantrach, Alejandro Jaimes, Marco Saerens:
A time-based collective factorization for topic discovery and monitoring in news. WWW 2014: 527-538 - 2013
- [j22]Kevin Françoisse, François Fouss, Marco Saerens:
A link-analysis-based discriminant analysis for exploring partially labeled graphs. Pattern Recognit. Lett. 34(2): 146-154 (2013) - [j21]Silvia García-Díez, Jérôme Laforge, Marco Saerens:
Rminimax: An Optimally Randomized MINIMAX Algorithm. IEEE Trans. Cybern. 43(1): 385-393 (2013) - [c33]Ikumi Suzuki, Kazuo Hara, Masashi Shimbo, Marco Saerens, Kenji Fukumizu:
Centering Similarity Measures to Reduce Hubs. EMNLP 2013: 613-623 - [c32]Ilkka Kivimäki, Alexander Panchenko, Adrien Dessy, Dries Verdegem, Pascal Francq, Hugues Bersini, Marco Saerens:
A Graph-Based Approach to Skill Extraction from Text. TextGraphs@EMNLP 2013: 79-87 - [i2]Mathieu Senelle, Silvia García-Díez, Amin Mantrach, Masashi Shimbo, Marco Saerens, François Fouss:
The Sum-over-Forests density index: identifying dense regions in a graph. CoRR abs/1301.0725 (2013) - 2012
- [j20]François Fouss, Kevin Françoisse, Luh Yen, Alain Pirotte, Marco Saerens:
An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification. Neural Networks 31: 53-72 (2012) - [c31]Ikumi Suzuki, Kazuo Hara, Masashi Shimbo, Yuji Matsumoto, Marco Saerens:
Investigating the Effectiveness of Laplacian-Based Kernels in Hub Reduction. AAAI 2012: 1112-1118 - [i1]Bertrand Lebichot, Ilkka Kivimäki, Kevin Françoisse, Marco Saerens:
Semi-Supervised Classification Through the Bag-of-Paths Group Betweenness. CoRR abs/1210.4276 (2012) - 2011
- [j19]Silvia García-Díez, François Fouss, Masashi Shimbo, Marco Saerens:
A sum-over-paths extension of edit distances accounting for all sequence alignments. Pattern Recognit. 44(6): 1172-1182 (2011) - [j18]Amin Mantrach, Nicolas van Zeebroeck, Pascal Francq, Masashi Shimbo, Hugues Bersini, Marco Saerens:
Semi-supervised classification and betweenness computation on large, sparse, directed graphs. Pattern Recognit. 44(6): 1212-1224 (2011) - [j17]Luh Yen, Marco Saerens, François Fouss:
A Link Analysis Extension of Correspondence Analysis for Mining Relational Databases. IEEE Trans. Knowl. Data Eng. 23(4): 481-495 (2011) - [c30]Silvia García-Díez, Eric Vandenbussche, Marco Saerens:
A continuous-state version of discrete randomized shortest-paths, with application to path planning. CDC/ECC 2011: 6570-6577 - [c29]Silvia García-Díez, Marco Saerens, Mathieu Senelle, François Fouss:
A simple-cycles weighted kernel based on harmony structure for similarity retrieval. ISMIR 2011: 61-66 - 2010
- [j16]François Fouss, Youssef Achbany, Marco Saerens:
A probabilistic reputation model based on transaction ratings. Inf. Sci. 180(11): 2095-2123 (2010) - [j15]Amin Mantrach, Luh Yen, Jérôme Callut, Kevin Françoisse, Masashi Shimbo, Marco Saerens:
The Sum-over-Paths Covariance Kernel: A Novel Covariance Measure between Nodes of a Directed Graph. IEEE Trans. Pattern Anal. Mach. Intell. 32(6): 1112-1126 (2010) - [c28]Silvia García-Díez, François Fouss, Masashi Shimbo, Marco Saerens:
Normalized Sum-over-Paths Edit Distances. ICPR 2010: 1044-1047
2000 – 2009
- 2009
- [j14]Luh Yen, François Fouss, Christine Decaestecker, Pascal Francq, Marco Saerens:
Graph nodes clustering with the sigmoid commute-time kernel: A comparative study. Data Knowl. Eng. 68(3): 338-361 (2009) - [j13]Benoît Frénay, Marco Saerens:
2S2, a simple reinforcement learning scheme for two-player zero-sum Markov games. Neurocomputing 72(7-9): 1494-1507 (2009) - [j12]Marco Saerens, Youssef Achbany, François Fouss, Luh Yen:
Randomized Shortest-Path Problems: Two Related Models. Neural Comput. 21(8): 2363-2404 (2009) - 2008
- [j11]Youssef Achbany, François Fouss, Luh Yen, Alain Pirotte, Marco Saerens:
Tuning continual exploration in reinforcement learning: An optimality property of the Boltzmann strategy. Neurocomputing 71(13-15): 2507-2520 (2008) - [c27]Benoît Frénay, Marco Saerens:
QL2, a simple reinforcement learning scheme for two-player zero-sum Markov games. ESANN 2008: 137-142 - [c26]Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shimbo:
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances. KDD 2008: 785-793 - [c25]Jérôme Callut, Kevin Françoisse, Marco Saerens, Pierre Dupont:
Semi-supervised Classification from Discriminative Random Walks. ECML/PKDD (1) 2008: 162-177 - [c24]François Fouss, Marco Saerens:
Evaluating Performance of Recommender Systems: An Experimental Comparison. Web Intelligence 2008: 735-738 - 2007
- [j10]François Fouss, Alain Pirotte, Jean-Michel Renders, Marco Saerens:
Random-Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation. IEEE Trans. Knowl. Data Eng. 19(3): 355-369 (2007) - [c23]Ivan Jureta, Stéphane Faulkner, Youssef Achbany, Marco Saerens:
Dynamic task allocation within an open service-oriented MAS architecture. AAMAS 2007: 206 - [c22]Ivan Jureta, Stéphane Faulkner, Youssef Achbany, Marco Saerens:
Dynamic Web Service Composition within a Service-Oriented Architecture. ICWS 2007: 304-311 - [c21]Luh Yen, François Fouss, Christine Decaestecker, Pascal Francq, Marco Saerens:
Graph Nodes Clustering Based on the Commute-Time Kernel. PAKDD 2007: 1037-1045 - 2006
- [j9]Marco Saerens:
Hung T. Nguyen, Nadipuram R. Prasad, Carol L. Walker and Elbert A. Walker, Editors, A First Course in Fuzzy 3 and Neural Control, Chapman & Hall/CRC Press (2003). Fuzzy Sets Syst. 157(16): 2286-2288 (2006) - [c20]Youssef Achbany, François Fouss, Luh Yen, Alain Pirotte, Marco Saerens:
Optimal Tuning of Continual Online Exploration in Reinforcement Learning. ICANN (1) 2006: 790-800 - [c19]François Fouss, Luh Yen, Alain Pirotte, Marco Saerens:
An Experimental Investigation of Graph Kernels on a Collaborative Recommendation Task. ICDM 2006: 863-868 - 2005
- [c18]Luh Yen, Denis Vanvyve, Fabien Wouters, François Fouss, Michel Verleysen, Marco Saerens:
clustering using a random walk based distance measure. ESANN 2005: 317-324 - [c17]François Fouss, Stéphane Faulkner, Manuel Kolp, Alain Pirotte, Marco Saerens:
Web Recommendation System Based on a Markov-Chainmodel. ICEIS (4) 2005: 56-63 - [c16]François Fouss, Alain Pirotte, Marco Saerens:
A Novel Way of Computing Similarities between Nodes of a Graph, with Application to Collaborative Recommendation. Web Intelligence 2005: 550-556 - [c15]Marco Saerens, François Fouss:
HITS is Principal Components Analysis. Web Intelligence 2005: 782-785 - 2004
- [c14]Marco Saerens, François Fouss, Luh Yen, Pierre Dupont:
The Principal Components Analysis of a Graph, and Its Relationships to Spectral Clustering. ECML 2004: 371-383 - [c13]Marco Saerens, François Fouss:
Yet Another Method for Combining Classifiers Outputs: A Maximum Entropy Approach. Multiple Classifier Systems 2004: 82-91 - 2003
- [c12]François Fouss, Marco Saerens, Jean-Michel Renders:
Links Between Kleinberg's Hubs and Authorities, Correspondence Analysis, and Markov Chains. ICDM 2003: 521-524 - 2002
- [j8]Marco Saerens, Patrice Latinne, Christine Decaestecker:
Adjusting the Outputs of a Classifier to New a Priori Probabilities: A Simple Procedure. Neural Comput. 14(1): 21-41 (2002) - [j7]Marco Saerens, Patrice Latinne, Christine Decaestecker:
Any reasonable cost function can be used for a posteriori probability approximation. IEEE Trans. Neural Networks 13(5): 1204-1210 (2002) - 2001
- [c11]Patrice Latinne, Marco Saerens, Christine Decaestecker:
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. ICML 2001: 298-305 - 2000
- [j6]Marco Saerens:
Building cost functions minimizing to some summary statistics. IEEE Trans. Neural Networks Learn. Syst. 11(6): 1263-1271 (2000)
1990 – 1999
- 1997
- [j5]Jean-Michel Renders, Marco Saerens, Hugues Bersini:
Fuzzy adaptive control of a certain class of SISO discrete-time processes. Fuzzy Sets Syst. 85(1): 49-61 (1997) - 1996
- [c10]Marco Saerens:
Non Mean Square Error Criteria for the Training of Learning Machines. ICML 1996: 427-434 - 1995
- [j4]Marco Saerens:
Design of a perceptron-like algorithm based on system identification techniques. IEEE Trans. Neural Networks 6(2): 504-506 (1995) - [c9]Marco Saerens:
Viterbi algorithm for acoustic vectors generated by a linear stochastic differential equation on each state. ICASSP 1995: 233-236 - 1994
- [j3]Luis Gonzalez Sotelino, Marco Saerens, Hugues Bersini:
Classification of temporal trajectories by continuous-time recurrent nets. Neural Networks 7(5): 767-776 (1994) - [j2]Hugues Bersini, Marco Saerens, Luis Gonzalez Sotelino:
Hopfield net generation, encoding and classification of temporal trajectories. IEEE Trans. Neural Networks 5(6): 945-953 (1994) - [c8]Alain Soquet, Marco Saerens:
A comparison of different acoustic and articulatory representations for the determination of place of articulation of plosives. ICSLP 1994: 1643-1646 - 1993
- [j1]Marco Saerens:
A continuous-time dynamic formulation of Viterbi algorithm for one-Gaussian-per-state hidden Markov models. Speech Commun. 12(4): 321-333 (1993) - [c7]Jean-Michel Renders, Hugues Bersini, Marco Saerens:
Adaptive NeuroControl: How Black Box and Simple can it be. ICML 1993: 260-267 - [c6]Marco Saerens:
Hidden Markov models assuming a continuous-time dynamic emission of acoustic vectors. EUROSPEECH 1993: 587-590 - [c5]Marco Saerens, Hervé Bourlard:
Linear and nonlinear prediction for speech recognition with hidden Markov models. EUROSPEECH 1993: 807-810 - [c4]Hervé Bourlard, Jean-Marc Boite, Bart D'hoore, Marco Saerens:
Performance comparison of hidden Markov models and neural networks for task dependent and independent isolated word recognition. EUROSPEECH 1993: 1925-1928 - [c3]Tony Robinson, Luís B. Almeida, Jean-Marc Boite, Hervé Bourlard, Frank Fallside, Mike Hochberg, Dan J. Kershaw, Phil Kohn, Yochai Konig, Nelson Morgan, João Paulo Neto, Steve Renals, Marco Saerens, Chuck Wooters:
A neural network based, speaker independent, large vocabulary, continuous speech recognition system: the WERNICKE project. EUROSPEECH 1993: 1941-1944 - 1990
- [c2]Marco Saerens:
Unsupervised clustering based on a competitive cost function. IJCNN 1990: 343-348 - [c1]Alain Soquet, Marco Saerens, Paul Jospa:
Acoustic-articulatory inversion based on a neural controller of a vocal tract model. SSW 1990: 71-74
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
