Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Marc Le Goc

dblp:72/5293 · DBLP profile ↗
← Back
13ranked-venue papers
2as first author
0since 2021 · last 2017
0000-0002-0255-4328ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 7 · 1 first-authorSoftware engineering, systems software and programming languages · 5Databases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1Human-computer interaction and ubiquitous computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%
Software engineering, system software, and programming languages
1 paper
Requirements engineering and software design · 100%

Topics — the 1 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Requirements engineering and software design
conceptual modeling
0.012002
Verification and validation of the SACHEM conceptual model · Int. J. Hum. Comput. Stud. 2002

Methods — techniques the papers use, named apart from their topics

verification and validation · 0.1
YearPublicationVenuePosition
2017 Operationalization of the Blending and the Levels of Abstraction Theories with the Timed Observations Theory
Marc Le Goc, Fabien Vilar
ICAART (2)1
2016 Discovering Potential Internal Fraud Models in a Stream of Banking Transactions
Fabien Vilar, Marc Le Goc, Philippe Bouché, Pierre-Yves Rolland
ICAART (2)2
2014 Reducing the gap between experts' knowledge and data: The TOM4D methodology
Laura Pomponio, Marc Le Goc
Data Knowl. Eng.2
2012 Modeling and Diagnosis Characterization using Timed Observation Theory
Ismail Fakhfakh, Marc Le Goc, Corinne Curt
ICSOFT2
2010 Discovering N-ary Timed Relations from Sequences
Nabil Benayadi, Marc Le Goc
ICAART (1)2
2010 Learning Dynamic Bayesian Networks with the TOM4L Process
Ahmad Ahdab, Marc Le Goc
ICSOFT (2)2
2010 Mining Timed Sequences to Find Signatures
Nabil Benayadi, Marc Le Goc
ICSOFT (2)2
2010 Timed Observations Modelling for Diagnosis Methodology - A Case Study
Laura Pomponio, Marc Le Goc
ICSOFT (2)2
2010 Discovering Large Scale Manufacturing Process Models from Timed Data - Application to STMicroelectronics' Production Processes
Pamela Viale, Nabil Benayadi, Marc Le Goc, Jacques Pinaton
ICSOFT (1)3
2008 Discovering Temporal Knowledge from a Crisscross of Timed Observations
abstract
This paper is concerned with the discovering of temporal knowledge from a sequence of timed observations provided by a system monitoring of dynamic process. The discovering process is based on the Stochastic Approach framework where a series of timed observations is represented with a Markov chain. From this representation, a set of timed sequential binary relations between discrete event classes is discovered with an abductive reasoning and represented as abstract chronicle models. To reduce the search space as close as possible to the potential relations between the process variables, we propose to characterize a set of series of timed observations with a unique measure of the homogeneity of the crisscross of class occurrences and to use this measure to prune abstract chronicle models.
Nabil Benayadi, Marc Le Goc
ECAI2
2004 Discovering Operational Signatures with Time Constraints from a Discrete Event Sequence
abstract
This paper aims at showing a method to discover signatures (or models of chronicles) from a discrete event sequence (alarms) generated by a monitoring cognitive agent (MCA). When the counting process of the events generated by a couple (process, MCA) behaves like a Poisson process, this couple can be considered as stochastic discrete event generator SDEG/sub (pr, MCA)/ and modeled as a superposition of Poisson and an homogeneous discrete time Markov chain. The 'BJT' algorithm uses these two representations in order to help in the discovering of signatures. The results obtained on an industrial process monitored with a Sachem system have been validated by experts, confirming so the relevance of the approach within an industrial frame.
Philippe Bouché, Marc Le Goc
HIS2
2002 Towards a Unique Framework to Describe and Compare Diagnosis Approaches
Cecilia Zanni-Merk, Marc Le Goc, Claudia S. Frydman
HIS2
2002 Verification and validation of the SACHEM conceptual model
Marc Le Goc, Claudia S. Frydman
Int. J. Hum. Comput. Stud.1