The Data Mining Forum                             open-source data mining software open-source data mining software data science journal data mining conferences
This forum is about data mining, data science and big data: algorithms, source code, datasets, implementations, optimizations, etc. You are welcome to post call for papers, data mining job ads, link to source code of data mining algorithms or anything else related to data mining. The forum is hosted by P. Fournier-Viger. No registration is required to use this forum!.  
CFP: LEG@PKDD 2020- Workshop on Advances in Managing and Mining Large Evolving Graphs (LEG)
Date: June 04, 2020 05:10PM

De: "Sabeur Aridhi" <>
À: "liste-egc" <>, "liste-proml" <>, "madics-all" <>
Envoyé: Samedi 9 Mai 2020 01:46:21
Objet: [liste-egc] [LEG@ECML-PKDD 2020] CFP: Workshop on Advances in Managing and Mining Large Evolving Graphs (LEG)

Please consider to contribute to and/or forward to the appropriate groups the following opportunity to submit and publish original scientific results to:

LEG@ECML-PKDD 2020, Fourth International Workshop on Advances in Managing and Mining Large Evolving Graphs in conjunction with ECML-PKDD 2020

The paper submission deadline is June 11, 2020.

Call for Paper

ECML-PKDD 2020 workshop on Advances in Managing and Mining Large Evolving Graphs (LEG)
September 14 or 18, 2020,
Ghent, Belgium

The aim of this fourth edition of the International Workshop on Advances on Managing and Mining Large Evolving Graphs (LEG) is to bring together active scholars and practitioners of dynamic graphs. Graph models and algorithms are ubiquitous of a large number of application domains, ranging from transportation to social networks, semantic web, or data mining. However, many applications require graph models that are time dependent and continuously evolving. For example, applications related to urban mobility analysis employ a graph structure of the underlying road network, where the travel time is highly dynamic.

In this workshop, we aim to discuss the problem of mining large evolving graphs, since there are many real world applications dealing with the volume and the velocity of the graph structure and/or labels. Managing and analyzing large evolving graphs is very challenging since this requires sophisticated methods and techniques for creating, storing, accessing and processing such graphs in a distributed environment, because centralized approaches do not scale in a Big Data scenario.

Contributions will clearly point out answers to one of these challenges focusing on large-scale evolving graphs.

Aims and Scope:

Many research questions related to mining large evolving graphs, will be at the heart of this workshop such as:

1. How to build a LEG using spatio-temporal data or temporal traces in general, such as to favor the mining process ?
2. How to inter-link and enrich LEG with semantic resources during the mining process ?
3. How to allow scalable mining tasks over a LEG ?
4. How to organize and maintain a LEG in distributed architecture, such as to scale the mining process ?

This workshop aims at bringing together scholars and practitioners active in dynamic graphs, to present and discuss their research, share their knowledge and experiences, and discuss the current state of the art and the future improvements.

Workshop topics:

We encourage papers with important new insights and experiences on knowledge discovery aspects with dynamic and evolving graphs. Those contributions should shed light on one of the questions mentioned above, related to the knowledge discovery process. Topics of interest include, but are not limited to, the following inter-linked topics, with regards to mining process:

- Large scale graph analysis
- Theoretical foundation of time-dependent and large scale graphs (LEG)
- Construction and maintenance of LEG
- Algorithms on LEG
- Theoretical foundation of LEG
- Construction and maintenance of LEG
- Data quality in LEG
- Data integration in LEG
- Indexing techniques for LEG
- Distributed algorithms & navigational query processing
- LEG data mining: frequent pattern mining, similarity, cluster analysis, predictive learning
- Trajectory mining in LEG
- Probabilistic LEG
- Applications related to LEG


The workshop accepts two types of submissions:
- Long papers (full research papers / ECML-PKDD format)
- Short papers of 2-4 pages (for work in progress)
Papers must be formatted and submitted according to the ECML-PKDD guidelines available on:
Submissions should be made through Easychair at:
We also invite the submission of 2-4 pages extended abstracts as highlight papers or late breaking research papers. Highlight papers should summarize full papers that have been published, or accepted for publication, between June 11, 2019 and the submission deadline.

Review Process:

Papers will be subject to three (3) blind peer reviews. Selection criteria include originality of ideas, correctness, clarity and significance of results and quality of presentation.
Papers will be accepted for either oral or poster presentation. However, no distinction will be made between accepted papers in the workshop proceedings. At least one author of each accepted paper is required to attend the conference, as well as the workshop to present the work. Authors will be required to agree to this requirement at the time of final submission.

Workshop Proceedings:

Workshop proceedings will be published in the CEUR-WS workshop proceedings.

Important dates:
- Paper Submission Deadline: June 11, 2020
- Author Notification: July 9, 2020
- Camera Ready Deadline: TBA

Workshop registration:

If a paper is accepted, at least one author must register for the workshop, and present the paper at the workshop.

- Sabeur Aridhi, LORIA, University of Lorraine, Nancy (France)
- Engelbert Mephu Nguifo, LIMOS, University Clermont Auvergne (France)
- Jose Macedo, Universidade Federal do Ceará, Fortaleza (Brazil)
- Karine Zeitouni, DAVID, Université de Versailles Saint-Quentin (France)
- Wissem Inoubli, LORIA, University of Lorraine, Nancy (France)

Options: ReplyQuote

This forum is powered by Phorum and provided by P. Fournier-Viger (© 2012).
Terms of use.