Pierre-François Marteau
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Pierre-François Marteau has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Gildas G. Ménier
VALORIA Université de Bretagne Sud BP573 56017 Vannes France
4 shared publications Gildas Menier
VALORIA, Université de Bretagne Sud, Université Européenne de Bretagne, France
2 shared publicationsMuhammad Marwan Muhammad Fuad
VALORIA Université de Bretagne Sud Université Européenne de Bretagne BP. 573 56017 Vannes France
2 shared publications- Muhammad Marwan Muhammad Fuad2 shared publications
- Aghilas Sini
Univ Le Mans, LIUM, Le Mans, France
1 shared publication - Arnaud Delhay
Univ Rennes, IRISA, CNRS, Lannion, France
1 shared publication
Latest Publications
- 1 May 2026
- Published by Springer Nature
- p. 47-63
Ensemble Neuro-Symbolic AI and Logic Tensor Networks for Detecting Fraud on the Ethereum Blockchain
- 1 May 2026
- Published by Springer Nature
- p. 47-63
Ensemble Neuro-Symbolic AI and Logic Tensor Networks for Detecting Fraud on the Ethereum Blockchain
- Open Access
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 11766-11775
Multi-level SSL Feature Gating for Audio Deepfake Detection
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 11766-11775
Open AccessMulti-level SSL Feature Gating for Audio Deepfake Detection
- Open Access
- 16 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Translating Sentences from Written French into LSF Annotation
- 16 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Open AccessTranslating Sentences from Written French into LSF Annotation
- Open Access
WikiNER-fr-gold: A Gold-Standard NER Corpus
We address in this article the the quality of the WikiNER corpus, a multilingual Named Entity Recognition corpus, and provide a consolidated version of it. The annotation of WikiNER was produced in a semi-supervised manner i.e. no manual verification has been carried out a posteriori. Such corpus is called silver-standard. In this paper we propose WikiNER-fr-gold which is a revised version of the French proportion of WikiNER. Our corpus consists of randomly sampled 20% of the original French sub-corpus (26,818 sentences with 700k tokens). We start by summarizing the entity types included in each category in order to define an annotation guideline, and then we proceed to revise the corpus. Finally we present an analysis of errors and inconsistency observed in the WikiNER-fr corpus, and we discuss potential future work directions.
Open AccessWikiNER-fr-gold: A Gold-Standard NER Corpus
We address in this article the the quality of the WikiNER corpus, a multilingual Named Entity Recognition corpus, and provide a consolidated version of it. The annotation of WikiNER was produced in a semi-supervised manner i.e. no manual verification has been carried out a posteriori. Such corpus is called silver-standard. In this paper we propose WikiNER-fr-gold which is a revised version of the French proportion of WikiNER. Our corpus consists of randomly sampled 20% of the original French sub-corpus (26,818 sentences with 700k tokens). We start by summarizing the entity types included in each category in order to define an annotation guideline, and then we proceed to revise the corpus. Finally we present an analysis of errors and inconsistency observed in the WikiNER-fr corpus, and we discuss potential future work directions.
- Retracted
- 18 October 2022
- Published by Elsevier in Data & Knowledge Engineering
- Vol. 142
RETRACTED:Pollen risk levels prediction from multi-source historical data
- 18 October 2022
- Published by Elsevier in Data & Knowledge Engineering
- Vol. 142
RetractedRETRACTED:Pollen risk levels prediction from multi-source historical data
- 11 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 16 (15566013) , 2157-2172
Random Partitioning Forest for Point-Wise and Collective Anomaly Detection—Application to Network Intrusion Detection
In this paper, we propose DiFF-RF, an ensemble approach composed of random partitioning binary trees to detect point-wise and collective (as well as contextual) anomalies. Thanks to a distance-based paradigm used at the leaves of the trees, this semi-supervised approach solves a drawback that has been identified in the isolation forest (IF) algorithm. Moreover, taking into account the frequencies of visits in the leaves of the random trees allows to significantly improve the performance of DiFF-RF when considering the presence of collective anomalies. DiFF-RF is fairly easy to train, and good performance can be obtained by using a simple semi-supervised procedure to setup the extra hyper-parameter that is introduced. We first evaluate DiFF-RF on a synthetic data set to i) verify that the limitation of the IF algorithm is overcome, ii) demonstrate how collective anomalies are actually detected and iii) to analyze the effect of the meta-parameters it involves. We assess the DiFF-RF algorithm on a large set of datasets from the UCI repository, as well as four benchmarks related to network intrusion detection applications. Our experiments show that DiFF-RF almost systematically outperforms the IF algorithm and one of its extended variant, but also challenges the one-class SVM baseline, deep learning variational auto-encoder and ensemble of auto-encoder architectures. Finally, DiFF-RF is computationally efficient and can be easily parallelized on multi-core architectures.
- 11 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 16 (15566013) , 2157-2172
Random Partitioning Forest for Point-Wise and Collective Anomaly Detection—Application to Network Intrusion Detection
In this paper, we propose DiFF-RF, an ensemble approach composed of random partitioning binary trees to detect point-wise and collective (as well as contextual) anomalies. Thanks to a distance-based paradigm used at the leaves of the trees, this semi-supervised approach solves a drawback that has been identified in the isolation forest (IF) algorithm. Moreover, taking into account the frequencies of visits in the leaves of the random trees allows to significantly improve the performance of DiFF-RF when considering the presence of collective anomalies. DiFF-RF is fairly easy to train, and good performance can be obtained by using a simple semi-supervised procedure to setup the extra hyper-parameter that is introduced. We first evaluate DiFF-RF on a synthetic data set to i) verify that the limitation of the IF algorithm is overcome, ii) demonstrate how collective anomalies are actually detected and iii) to analyze the effect of the meta-parameters it involves. We assess the DiFF-RF algorithm on a large set of datasets from the UCI repository, as well as four benchmarks related to network intrusion detection applications. Our experiments show that DiFF-RF almost systematically outperforms the IF algorithm and one of its extended variant, but also challenges the one-class SVM baseline, deep learning variational auto-encoder and ensemble of auto-encoder architectures. Finally, DiFF-RF is computationally efficient and can be easily parallelized on multi-core architectures.
- Open Access
- 6 July 2019
- Published by MDPI AG in Applied Sciences
- Vol. 9 (13) , 2736
Estimating Road Segments Using Kernelized Averaging of GPS Trajectories
A method called iTEKA, which stands for iterative time elastic kernel averaging, was successfully used for averaging time series. In this paper, we adapt it to GPS trajectories. The key contribution is a denoising procedure that includes an over-sampling scheme, the detection and removal of outlier trajectories, a kernelized time elastic averaging method, and a down-sampling as post-processing. The experiment carried out on benchmark datasets showed that the proposed procedure is effective and outperforms straightforward methods based on medoid or Euclidean averaging approaches.
- 6 July 2019
- Published by MDPI AG in Applied Sciences
- Vol. 9 (13) , 2736
Open AccessEstimating Road Segments Using Kernelized Averaging of GPS Trajectories
A method called iTEKA, which stands for iterative time elastic kernel averaging, was successfully used for averaging time series. In this paper, we adapt it to GPS trajectories. The key contribution is a denoising procedure that includes an over-sampling scheme, the detection and removal of outlier trajectories, a kernelized time elastic averaging method, and a down-sampling as post-processing. The experiment carried out on benchmark datasets showed that the proposed procedure is effective and outperforms straightforward methods based on medoid or Euclidean averaging approaches.
- Open Access
- 1 June 2019
- Published by University of Zielona Góra, Poland in International Journal of Applied Mathematics and Computer Science
- Vol. 29 (2) , 375-392
Times Series Averaging and Denoising from a Probabilistic Perspective on Time–Elastic Kernels
In the light of regularized dynamic time warping kernels, this paper re-considers the concept of a time elastic centroid for a set of time series. We derive a new algorithm based on a probabilistic interpretation of kernel alignment matrices. This algorithm expresses the averaging process in terms of stochastic alignment automata. It uses an iterative agglomerative heuristic method for averaging the aligned samples, while also averaging the times of their occurrence. By comparing classification accuracies for 45 heterogeneous time series data sets obtained by first nearest centroid/medoid classifiers, we show that (i) centroid-based approaches significantly outperform medoid-based ones, (ii) for the data sets considered, our algorithm, which combines averaging in the sample space and along the time axes, emerges as the most significantly robust model for time-elastic averaging with a promising noise reduction capability. We also demonstrate its benefit in an isolated gesture recognition experiment and its ability to significantly reduce the size of training instance sets. Finally, we highlight its denoising capability using demonstrative synthetic data. Specifically, we show that it is possible to retrieve, from few noisy instances, a signal whose components are scattered in a wide spectral band.
- 1 June 2019
- Published by University of Zielona Góra, Poland in International Journal of Applied Mathematics and Computer Science
- Vol. 29 (2) , 375-392
Open AccessTimes Series Averaging and Denoising from a Probabilistic Perspective on Time–Elastic Kernels
In the light of regularized dynamic time warping kernels, this paper re-considers the concept of a time elastic centroid for a set of time series. We derive a new algorithm based on a probabilistic interpretation of kernel alignment matrices. This algorithm expresses the averaging process in terms of stochastic alignment automata. It uses an iterative agglomerative heuristic method for averaging the aligned samples, while also averaging the times of their occurrence. By comparing classification accuracies for 45 heterogeneous time series data sets obtained by first nearest centroid/medoid classifiers, we show that (i) centroid-based approaches significantly outperform medoid-based ones, (ii) for the data sets considered, our algorithm, which combines averaging in the sample space and along the time axes, emerges as the most significantly robust model for time-elastic averaging with a promising noise reduction capability. We also demonstrate its benefit in an isolated gesture recognition experiment and its ability to significantly reduce the size of training instance sets. Finally, we highlight its denoising capability using demonstrative synthetic data. Specifically, we show that it is possible to retrieve, from few noisy instances, a signal whose components are scattered in a wide spectral band.
- 1 May 2019
- Published by Elsevier in Applied Soft Computing
- Vol. 78, 630-640
Sparsification of the alignment path search space in dynamic time warping
- 1 May 2019
- Published by Elsevier in Applied Soft Computing
- Vol. 78, 630-640
Sparsification of the alignment path search space in dynamic time warping
- 4 September 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 14 (4) , 994-1006
Sequence Covering for Efficient Host-Based Intrusion Detection
This paper introduces a new similarity measure, the covering similarity, which we formally define for evaluating the similarity between a symbolic sequence and a set of symbolic sequences. A pairwise similarity can also be directly derived from the covering similarity to compare two symbolic sequences. An efficient implementation to compute the covering similarity is proposed which uses a suffix-tree data structure, but other implementations, based on suffix array for instance, are possible and are possibly necessary for handling very large-scale problems. We have used this similarity to isolate attack sequences from normal sequences in the scope of host-based intrusion detection. We have assessed the covering similarity on two well-known benchmarks in the field. In view of the results reported on these two datasets for the state-of-the-art methods, according to the comparative study, we have carried out based on three challenging similarity measures commonly used for string processing, or in bioinformatics, we show that the covering similarity is particularly relevant to address the detection of anomalies in sequences of system calls.
- 4 September 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 14 (4) , 994-1006
Sequence Covering for Efficient Host-Based Intrusion Detection
This paper introduces a new similarity measure, the covering similarity, which we formally define for evaluating the similarity between a symbolic sequence and a set of symbolic sequences. A pairwise similarity can also be directly derived from the covering similarity to compare two symbolic sequences. An efficient implementation to compute the covering similarity is proposed which uses a suffix-tree data structure, but other implementations, based on suffix array for instance, are possible and are possibly necessary for handling very large-scale problems. We have used this similarity to isolate attack sequences from normal sequences in the scope of host-based intrusion detection. We have assessed the covering similarity on two well-known benchmarks in the field. In view of the results reported on these two datasets for the state-of-the-art methods, according to the comparative study, we have carried out based on three challenging similarity measures commonly used for string processing, or in bioinformatics, we show that the covering similarity is particularly relevant to address the detection of anomalies in sequences of system calls.