Marco Saerens

According to our database1, Marco Saerens authored at least 79 papers between 1990 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Relative entropy-regularized optimal transport on a graph: a new algorithm and an experimental comparison.
Int. J. Mach. Learn. Cybern., April, 2023

2021
Randomized shortest paths with net flows and capacity constraints.
Inf. Sci., 2021

Sparse randomized shortest paths routing with Tsallis divergence regularization.
Data Min. Knowl. Discov., 2021

Covariance and correlation measures on a graph in a generalized bag-of-paths formalism.
J. Complex Networks, 2021

A Simple Extension of the Bag-of-Paths Model Weighting Path Lengths by a Poisson Distribution.
Proceedings of the Complex Networks & Their Applications X - Volume 1, Proceedings of the Tenth International Conference on Complex Networks and Their Applications COMPLEX NETWORKS 2021, Madrid, Spain, November 30, 2021

2020
An experimental study of graph-based semi-supervised classification with additional node information.
Knowl. Inf. Syst., 2020

Maximum likelihood estimation for randomized shortest paths with trajectory data.
J. Complex Networks, 2020

2019
Randomized optimal transport on a graph: framework and new distance measures.
Netw. Sci., 2019

Covariance and Correlation Kernels on a Graph in the Generalized Bag-of-Paths Formalism.
CoRR, 2019

Graph-Based Fraud Detection with the Free Energy Distance.
Proceedings of the Complex Networks and Their Applications VIII, 2019

2018
A bag-of-paths node criticality measure.
Neurocomputing, 2018

A Constrained Randomized Shortest-Paths Framework for Optimal Exploration.
CoRR, 2018

2017
A bag-of-paths framework for network data analysis.
Neural Networks, 2017

Modularity-Driven Kernel k-means for Community Detection.
Proceedings of the Artificial Neural Networks and Machine Learning - ICANN 2017, 2017

2016
Combining Manual and Automatic Prosodic Annotation for Expressive Speech Synthesis.
Proceedings of the Tenth International Conference on Language Resources and Evaluation LREC 2016, 2016

Comparison of Graph Node Distances on Clustering Tasks.
Proceedings of the Artificial Neural Networks and Machine Learning - ICANN 2016, 2016

A graph-based, semi-supervised, credit card fraud detection system.
Proceedings of the Complex Networks & Their Applications V - Proceedings of the 5th International Workshop on Complex Networks and their Applications (COMPLEX NETWORKS 2016), Milan, Italy, November 30, 2016

2015
Two betweenness centrality measures based on Randomized Shortest Paths.
CoRR, 2015

2014
Semisupervised Classification Through the Bag-of-Paths Group Betweenness.
IEEE Trans. Neural Networks Learn. Syst., 2014

The Sum-over-Forests Density Index: Identifying Dense Regions in a Graph.
IEEE Trans. Pattern Anal. Mach. Intell., 2014

A time-based collective factorization for topic discovery and monitoring in news.
Proceedings of the 23rd International World Wide Web Conference, 2014

Random walks based modularity: application to semi-supervised learning.
Proceedings of the 23rd International World Wide Web Conference, 2014

The Sum-over-Forests clustering.
Proceedings of the 22th European Symposium on Artificial Neural Networks, 2014

2013
<i>R</i>minimax: An Optimally Randomized MINIMAX Algorithm.
IEEE Trans. Cybern., 2013

A link-analysis-based discriminant analysis for exploring partially labeled graphs.
Pattern Recognit. Lett., 2013

A Graph-Based Approach to Skill Extraction from Text.
Proceedings of TextGraphs@EMNLP 2013: the 8th Workshop on Graph-based Methods for Natural Language Processing, 2013

Centering Similarity Measures to Reduce Hubs.
Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing, 2013

2012
An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification.
Neural Networks, 2012

Semi-Supervised Classification Through the Bag-of-Paths Group Betweenness
CoRR, 2012

Investigating the Effectiveness of Laplacian-Based Kernels in Hub Reduction.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
A Link Analysis Extension of Correspondence Analysis for Mining Relational Databases.
IEEE Trans. Knowl. Data Eng., 2011

Semi-supervised classification and betweenness computation on large, sparse, directed graphs.
Pattern Recognit., 2011

A sum-over-paths extension of edit distances accounting for all sequence alignments.
Pattern Recognit., 2011

A simple-cycles weighted kernel based on harmony structure for similarity retrieval.
Proceedings of the 12th International Society for Music Information Retrieval Conference, 2011

A continuous-state version of discrete randomized shortest-paths, with application to path planning.
Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference, 2011

2010
The Sum-over-Paths Covariance Kernel: A Novel Covariance Measure between Nodes of a Directed Graph.
IEEE Trans. Pattern Anal. Mach. Intell., 2010

A probabilistic reputation model based on transaction ratings.
Inf. Sci., 2010

Normalized Sum-over-Paths Edit Distances.
Proceedings of the 20th International Conference on Pattern Recognition, 2010

2009
Randomized Shortest-Path Problems: Two Related Models.
Neural Comput., 2009

2S<sub>2</sub>, a simple reinforcement learning scheme for two-player zero-sum Markov games.
Neurocomputing, 2009

Graph nodes clustering with the sigmoid commute-time kernel: A comparative study.
Data Knowl. Eng., 2009

2008
Tuning continual exploration in reinforcement learning: An optimality property of the Boltzmann strategy.
Neurocomputing, 2008

Evaluating Performance of Recommender Systems: An Experimental Comparison.
Proceedings of the 2008 IEEE / WIC / ACM International Conference on Web Intelligence, 2008

Semi-supervised Classification from Discriminative Random Walks.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2008

A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances.
Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2008

QL2, a simple reinforcement learning scheme for two-player zero-sum Markov games.
Proceedings of the 16th European Symposium on Artificial Neural Networks, 2008

2007
Random-Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation.
IEEE Trans. Knowl. Data Eng., 2007

Graph Nodes Clustering Based on the Commute-Time Kernel.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2007

Dynamic Web Service Composition within a Service-Oriented Architecture.
Proceedings of the 2007 IEEE International Conference on Web Services (ICWS 2007), 2007

Dynamic task allocation within an open service-oriented MAS architecture.
Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2007), 2007

2006
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., 2006

An Experimental Investigation of Graph Kernels on a Collaborative Recommendation Task.
Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 2006), 2006

Optimal Tuning of Continual Online Exploration in Reinforcement Learning.
Proceedings of the Artificial Neural Networks, 2006

2005
HITS is Principal Components Analysis.
Proceedings of the 2005 IEEE / WIC / ACM International Conference on Web Intelligence (WI 2005), 2005

A Novel Way of Computing Similarities between Nodes of a Graph, with Application to Collaborative Recommendation.
Proceedings of the 2005 IEEE / WIC / ACM International Conference on Web Intelligence (WI 2005), 2005

Web Recommendation System Based on a Markov-Chainmodel.
Proceedings of the ICEIS 2005, 2005

clustering using a random walk based distance measure.
Proceedings of the 13th European Symposium on Artificial Neural Networks, 2005

2004
Yet Another Method for Combining Classifiers Outputs: A Maximum Entropy Approach.
Proceedings of the Multiple Classifier Systems, 5th International Workshop, 2004

The Principal Components Analysis of a Graph, and Its Relationships to Spectral Clustering.
Proceedings of the Machine Learning: ECML 2004, 2004

2003
Links Between Kleinberg's Hubs and Authorities, Correspondence Analysis, and Markov Chains.
Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM 2003), 2003

2002
Any reasonable cost function can be used for a posteriori probability approximation.
IEEE Trans. Neural Networks, 2002

Adjusting the Outputs of a Classifier to New a Priori Probabilities: A Simple Procedure.
Neural Comput., 2002

2001
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.
Proceedings of the Eighteenth International Conference on Machine Learning (ICML 2001), Williams College, Williamstown, MA, USA, June 28, 2001

2000
Building cost functions minimizing to some summary statistics.
IEEE Trans. Neural Networks Learn. Syst., 2000

1997
Fuzzy adaptive control of a certain class of SISO discrete-time processes.
Fuzzy Sets Syst., 1997

1996
Non Mean Square Error Criteria for the Training of Learning Machines.
Proceedings of the Machine Learning, 1996

1995
Design of a perceptron-like algorithm based on system identification techniques.
IEEE Trans. Neural Networks, 1995

Viterbi algorithm for acoustic vectors generated by a linear stochastic differential equation on each state.
Proceedings of the 1995 International Conference on Acoustics, 1995

1994
Hopfield net generation, encoding and classification of temporal trajectories.
IEEE Trans. Neural Networks, 1994

Classification of temporal trajectories by continuous-time recurrent nets.
Neural Networks, 1994

A comparison of different acoustic and articulatory representations for the determination of place of articulation of plosives.
Proceedings of the 3rd International Conference on Spoken Language Processing, 1994

1993
A continuous-time dynamic formulation of Viterbi algorithm for one-Gaussian-per-state hidden Markov models.
Speech Commun., 1993

Hidden Markov models assuming a continuous-time dynamic emission of acoustic vectors.
Proceedings of the Third European Conference on Speech Communication and Technology, 1993

A neural network based, speaker independent, large vocabulary, continuous speech recognition system: the WERNICKE project.
Proceedings of the Third European Conference on Speech Communication and Technology, 1993

Performance comparison of hidden Markov models and neural networks for task dependent and independent isolated word recognition.
Proceedings of the Third European Conference on Speech Communication and Technology, 1993

Linear and nonlinear prediction for speech recognition with hidden Markov models.
Proceedings of the Third European Conference on Speech Communication and Technology, 1993

Adaptive NeuroControl: How Black Box and Simple can it be.
Proceedings of the Machine Learning, 1993

1990
Acoustic-articulatory inversion based on a neural controller of a vocal tract model.
Proceedings of the ESCA Workshop on Speech Synthesis, 1990

Unsupervised clustering based on a competitive cost function.
Proceedings of the IJCNN 1990, 1990


  Loading...