- marami - Listes du LIPN

[CFP : MATNet'18 - WWW'2018 Workshop]
by Rushed Kanawati 20 Dec '17

20 Dec '17

MATNet’18: International workshop on Mining Attributed Networks @ WWW’2018 (The Web Conf 2018) April 23, 2018, Lyon France http://www-lipn.univ-paris13.fr/man-www2018 <http://www-lipn.univ-paris13.fr/man-www2018> Submission deadline: Jan 10, 2018 _________________________________________________________________________ Context Attributed network models have seen an increasing success in recent years, thanks to their informative power and to their ability to model complex networked relations that characterize most real-world phenomena. Their use has been attractive to communities in different disciplines such as computer science, physics, social science, as well as in interdisciplinary research environments. The use of such models has been also supported by the increasing easiness in collecting multi-relational data from the Web, e.g., from online social media platforms, crowdsourced data, online knowledge base. Within this view, the World Wide Web is an inestimable source of information, which can be conveniently represented with feature-rich network models, e.g., enclosing temporal aspects of the data, quantitative and/or qualitative properties of nodes, different relations between a common set of entities, different existence probabilities, or modeling connection between different entity types. The aim of the MATNet workshop, that will be held in conjunction with The Web Conf 2018 in Lyon, is to get an insight in the current status of researc h in network analysis and mining, showing how modeling information coming from the World Wide Web in Attributed Network models can make it possible to focus on domains and research questions that have not been deeply investigated so far and to improve solutions to classic tasks. We will solicit contributions that aim to focus on the analysis of attributed networks, addressing important principles, methods, tools and future research directions in this emerging field, possibly being transversal to different application domains. In particular, we cover the modeling of complex networks, multiplex networks, and any unsupervised, supervised, and semi-supervised mining approach in attributed network contexts. Topics - A list of non-exhaustive relevant topics include: - Models and measures for multiplex & attributed networks. - Foundations of Learning and Mining in Attributed Networks - Centrality and Ranking in Attributed Networks - Community Detection in Attributed Networks - Link Prediction in Attributed Networks - Simplification/pruning/sampling of Attributed Networks - User Behavior Modeling in Attributed Networks - Social Influence and Information difusion in Attributed Networks - Reputation and Trust in Attributed Networks - Embedding and Deep Learning in Attributed Networks - Probabilistic and Uncertain Attributed Networks - Time-evolving Attributed Networks - Hypergraph-based modeling, analysis and learning problems - Cross-Domain problems in Attributed Networks - Visualization of Attributed Networks - Personalization and Recommendation in Attributed Networks - Mobility in Attributed Networks - Vertex similarity in multiplex and attributed networks - Multiplex and attributed networks evolution models - Multiplex network and dynamic network mining - Ensemble learning for multiplex and attributed network mining - Pattern mining in attributed networks Submission We welcome original contributions, either theoretical or empirical, describing ongoing projects or completed work. Paper length should not exceed 8 pages in IEEE double column format. To submit your paper(s), please log into the submission website : https://easychair.org/conferences/?conf=www2018satellites <https://easychair.org/conferences/?conf=www2018satellites> Key dates Paper due Jan 10, 2018 Acceptance Notification Feb 14, 2018 Final manuscript due Mar 04, 2018 _________________________________________________ R. Kanawati Chef du département R&T - IUT de Villetaneuse 99 Av. J. B. Clément 93430 Villetaneuse L217 - Tél. 0149403716

1 0

Complex Networks sur Stack Exchange
by Vincent Labatut 20 Dec '17

20 Dec '17

Bonjour à tous, pour les utilisateurs de StackOverflow, ou des autres sites hébergés sur la plateforme StackExchange, sachez qu'un groupe consacré aux réseaux complexes est actuellement en cours de création : https://area51.stackexchange.com/proposals/115025/complex-networks À soutenir et diffuser, si vous êtes intéressés et que vous voulez voir ce groupe apparaître. vincent labatut maître de conférences université d'avignon et des pays de vaucluse - lia <http://lia.univ-avignon.fr/> / ceri <http://ceri.univ-avignon.fr/> vincent.labatut(a)univ-avignon.fr institution <http://lia.univ-avignon.fr/personnel/labatut-vincent> - researchgate <https://www.researchgate.net/profile/Vincent_Labatut> - linkedin <https://www.linkedin.com/in/vincent-labatut-40a7ba8> - hal <https://cv.archives-ouvertes.fr/vlabatut> arXiv <http://arxiv.org/a/labatut_v_1> - googlescholar <https://scholar.google.fr/citations?user=I8GnHekAAAAJ&hl=en> - orcid <http://orcid.org/0000-0002-2619-2835> - publons <https://publons.com/a/478374/> +33 (0)4 90 84 35 25 - bureau ET2

1 0

Stage réseaux complexes pour le TAL
by Nicolas Dugué 20 Nov '17

20 Nov '17

Bonjour à tous, Le Laboratoire d'Informatique de l'Université du Mans (LIUM) recherche un stagiaire de Master (6 mois) pour un projet en lien avec les réseaux complexes (graphes) et le traitement de la langue. *Sujet *: Une approche graphe/réseaux complexes pour modéliser la nouveauté dans des corpus textuels *Contexte du stage* : Au Mans, laboratoire LIUM, équipe LST, projet #neo pour la détection automatique de néologismes, en collaboration avec l'Université de Lyon2 *Mots-clés :* Graphes, réseaux complexes, Corpus textuels, Programmation Python. Veuillez trouver le sujet détaillé ici : http://www-lium.univ-lemans.fr/~dugue/stages/stage-une-approche.pdf Cordialement -- Nicolas Dugué McF LIUM, équipes IEIAH et LST Enseignant à l'IUT de l'Université du Maine http://www-lium.univ-lemans.fr/~dugue/ <http://www-lium.univ-lemans.fr/%7Edugue/>

1 0

JIMIS - Special Issue on Graphs & Social Systems
by Vincent Labatut 22 Jul '17

22 Jul '17

Bonjour à tous, le numéro spécial du Journal of Interdisciplinary Methodologies and Issues in Science (JIMIS) portant sur l'utilisation de graphes pour la modélisation de systèmes sociaux vient d'être publié. Il est disponible librement en ligne sur le site du journal : https://jimis.episciences.org/volume/view/id/244 N'hésitez pas à le consulter, et à diffuser l'information auprès de vos collègues. Cordialement, Vincent Labatut & Rosa Figueiredo

1 0

Fwd: [RO] Séminaire à Avignon le 29 mai : Patrick Doreian, "The signed US Supreme Court citation networks"
by Vincent Labatut 12 May '17

12 May '17

---------- Forwarded message ---------- From: Rosa FIGUEIREDO <rosa.figueiredo(a)univ-avignon.fr> Date: 12 May 2017 at 11:16 Subject: [RO] Séminaire à Avignon le 29 mai : Patrick Doreian, "The signed US Supreme Court citation networks" To: gdrro <gdrro(a)services.cnrs.fr> Bonjour à tous, Vous êtes cordialement invités à participer au séminaire "*The signed US Supreme Court citation networks*", présenté par Patrick DOREIAN, Department of Sociology - University of Pittsburgh http://www. sociology.pitt.edu/person/patrick- <http://www.sociology.pitt.edu/person/patrick-doreian>doreian <http://www.sociology.pitt.edu/person/patrick-doreian> *- Date :* lundi 29 mai 2017 de 10h30 à 12h30 (présentation de 45 minutes suivie d'échanges avec le public) *- Lieu : *salle 0E31, campus Hannah Arendt, Université d'Avignon *- Langue : *anglais Patrick DOREIAN est professeur de sociologie et de statistiques à l’Université de Pittsburgh, où il occupe la chaire du département de sociologie. Il est l’éditeur du Journal of Mathematical Sociology depuis 1982, et il est membre du comité éditorial du journal Social Networks depuis 2003. Il a été professeur centennial à la London School of Economics en 2002, et professeur invité à l’Université de California-Irvine ainsi qu’à l’université de Ljubljana. Son activité de recherche porte sur les réseaux sociaux, la sociologie mathématique, les réseaux inter-organisationnels, la sociologie environnementale, et les mouvements sociaux. *- Résumé : * *US Supreme Court decisions cite early decisions made by the Court. As such, it is viewed as a directed unsigned network. While this network has been useful for studying links between decisions and the historical contexts when decisions were made, it is incomplete. There is one clear way in which negative ties are created between decisions. When a decision overturns an earlier decision, the earlier decision is repudiated as having legitimacy. If the earlier decision is overturned completely it is repudiated totally. When it is overturned in part, then only parts of the prior decision are repudiated. * *Overturning of decisions is usually studied by using separate pairs of decisions. The approach taken here is to study the network of overturning and overturned decisions. This network is more complicated than a set of pairs of decisions. Decisions can be overturned multiple times. One decision can overturn multiple earlier decisions. Separate components of linked decisions have intriguing structures. Also, over turned decisions have been cited as precedent! These components are one focus of this presentation with the intent of understanding how they arise and what motivates the decision of the Court to undo earlier decisions. * *A second focus is to examine the rates at which specific Courts overturn prior courts defined in terms of their Chief Justices. This is a valued network. In particular, the rates of overturnings between pairs of Courts are studied to see if the rationales for overturnings are legal, political or driven by consistency principles.* * To study these issues, a unique data set was constructed for all pairs of overturning and overturned decisions for the period 1789 through 2005. All the consulted sources were incomplete, some seriously so.* *Inscription gratuite mais obligatoire à l'adresse suivante *: http://the-signed-us-supreme-court-citation-networks.evenium.net Merci de bien vouloir faire suivre cette invitation aux personnes qui pourraient être intéressées. *(affiche en pj)* Bien cordialement, ==================================== Rosa Figueiredo, Ph. D. Assistant professor in computer science. http://lia.univ-avignon.fr/personnel/figueiredo-rosa LIA - CERI Université d'Avignon, FRANCE Téléphone: +33 4 90 84 3573 <04%2090%2084%2035%2073> ==================================== ---- Ce mail a été diffusé par l'intermédiaire de la Liste RO du GDR RO http://gdrro.lip6.fr

1 0

Nouvelle revue Episciences
by Vincent Labatut 17 Mar '17

17 Mar '17

ARCS - Analyse de réseaux pour les sciences sociales / Network analysis for social sciences http://arcs.episciences.org/

1 0

Fwd: [liste-egc] [stage] visualisation de graphes multicouches
by Vincent Labatut 14 Mar '17

14 Mar '17

---------- Forwarded message ---------- From: Mohammad Ghoniem <mohammad.ghoniem(a)list.lu> Date: 2017-03-14 8:43 GMT+01:00 Subject: [liste-egc] [stage] visualisation de graphes multicouches To: liste-egc(a)polytech.univ-nantes.fr Bonjour, Le Luxembourg Institute of Science and Technology (LIST) offre une opportunité de stage de fin d'études / M2 dans le domaine de la visualisation de graphes multicouches : https://www.list.lu/en/jobs/internships/internship-offer/ erin-internship-2017-007/ Cette opportunité s'inscrit dans le cadre du projet ANR/FNR INTER BLIZAAR. Merci de diffuser auprès de vos étudiants susceptibles d'être intéressés. Bien cordialement, Mohammad ============================================== Mohammad GHONIEM, Ph.D. Luxembourg Institute of Science and Technology (LIST) Environmental Research and Innovation Department 41, rue du Brill, L-4422 Belvaux, Luxembourg Tel: +352-275.888-623 <=== <=== <=== <=== NEW PHONE Fax: +352-275.885 mohammad.ghoniem(a)list.lu - http://www.list.lu =============================================== Association Extraction et Gestion des Connaissances Site Web : egc.asso.fr Suivez-nous aussi sur Twitter : @associationEGC, et Facebook : facebook.com/AssociationEGC Gérer votre abonnement : egc.asso.fr/13-FR-Liste_de_diffusion Informations sur la liste : sympa.univ-nantes.fr/sympa/ info/polytech_liste-egc Le Modérateur, Pierrick Bruneau, p_bruneau(a)hotmail.com

1 0

Poste d'enseignant-chercheur à l'ENSTA - OC/DS
by Rushed Kanawati 12 Mar '17

12 Mar '17

Bonjour à tous, Ci joint l'annonce d'un poste d'enseignant chercheur à l'ENSTA dans le domaine de la recherche opérationnelle en lien avec la science des données et la théorie des graphes. La date limite de dépôt des candidatures qui est toute proche : *15 mars* Cordialement Rushed

1 0

CFP Workshop on Graph Models and Optimization in GI Science
by Vincent Labatut 06 Feb '17

06 Feb '17

*Call for Abstracts: *Workshop on Graph Models and Optimization in GI Science Graphs are mathematical models that are suitable for networks and maps. Therefore, they are of fundamental importance in geographical information (GI) science. This workshop addresses graph models in spatial planning, geographic analysis and cartographic visualization, with the aim of intensifying communication between researchers who work with a similar methodology in these different branches of spatial science. We encourage contributions presenting mathematically rigorous models as well as algorithmic solutions for those problems. Since solving a model usually means optimizing an optimization objective subject to a set of constraints, the workshop primarily addresses optimization algorithms, being they exact, approximate, or heuristic. On the one hand, optimization approaches are often based on simplified problems with strong constraints, exact solving purpose and basic linear and additive objective functions, which do not perfectly reflect the way geographical issues are tackled by information scientists. On the other hand, GI Sciences show a lack of quantitative and mathematical frames in optimization to model and investigate geographical phenomena. Therefore, we will address the following questions in the workshop: How could it be possible to soften the constraints set fixed in optimization approaches in order to find more accurate and reliable solutions? How can users and decision makers manage to balance computing efficiency and exactness of the solutions? We will discuss how problems of high computational complexity (e.g., NP-hard problems) in GI science can be tackled. Do we accept suboptimal solutions for the sake of efficiency and, if so, how far away from optimum do we allow them to be? How do we evaluate the results of heuristics? Which role do exact algorithms for NP-hard problems (e.g., mathematical programming solvers) play? *Date and Place* The workshop will be held on May 9 2017 in Wageningen, in conjunction with the 20th AGILE International Conference on Geographic Information Science (AGILE 2017). *Call for Papers* We invite prospective workshop participants to submit papers, which will be reviewed by the programme committee. All manuscripts accepted for presentation at the workshop will be (1) distributed to the workshop participants as “draft papers” and (2) conditionally accepted for a special issue of the journal “Photogrammetrie, Fernerkundung, Geoinformation: Journal for Photogrammetry, Remote Sensing and Geoinformation Science” (which from January 2017 on will be published by Springer). That is, the papers will be published in the journal if the reviewers’ comments are incorporated, which will be checked in a second review round after the workshop. Topics of interest include but are not limited to: Methods from operations research for spatial analysis and planning Spatial optimization and optimization in spatial decision support systems Route-choice models and algorithms for route planning Analysis of movement constrained to networks Concepts of centrality and connectivity in GI science Algorithms for the visualization of geographic networks Optimization methods for geometric problems in GI science Computational complexity of problems in GI science Manuscripts are to be submitted until March 3 2017 via EasyChair: https://easychair.org/conferences/?conf=optgis2017 Please use the Springer LaTeX Template for your submission. *Organizers * Jan-Henrik Haunert, University of Bonn Takeshi Shirabe, KTH, Stockholm, Sweden Didier Josselin, CNRS, Université d’Avignon et des Pays de Vaucluse, France *Programme Committee * Jan-Henrik Haunert, University of Bonn, Germany Takeshi Shirabe, KTH, Stockholm Didier Josselin, CNRS, Université d’Avignon et des Pays de Vaucluse, France Juha Oksanen, Finnish Geospatial Research Institute, Masala, Finland Martin Nöllenburg, TU Wien, Austria Lars Harrie, Lund University, Sweden

1 0

[AAP : MARAMI'2016 - 12-14 octobre]
by Rushed Kanawati 10 Oct '16

10 Oct '16

------ avec nos excuses en cas de réceptions multiples ------ _____________________________________________________________________________________________ Appel à participation : MARAMI 2016 7ème conférence sur les modèles et l’analyse des réseaux : Approches mathématiques et informatiques 12-14 Octobre, EISTI - Cergy-Pontoise ______________________________________________________________________________________________ Vous êtes cordialement invité à participer à la 7ième édition de la conférence MARAMI qui aura lieu à Cergy du 12 au 14 octobre 2016. Le programme détaillé est sur le site de la conférence : http://lipn.fr/marami2016/ <http://lipn.fr/marami2016/> Conférences invitées La visualisation de graphes au coeur de l'enquête des Panama Papers David Rapin, Linkurious Characterization of spatial networks Marc BARTHELEMY, CEA Network inference: Predicting with networks and statistical physics Roger Guimera, Universitat Rovira i Virgili. Tutoriel: Visualisation analytique avec Tulip en pratique B. Pinaud, A. Laumond et J. Vallet, LaBRI, Université de Bordeaux. Communications acceptées Antoine Laumond, Bruno Pinaud and Guy Melancon. Réseaux multiplexes à travers les sciences sociales : une adaptation et des règles dictées par les données. Henry Soldano, Guillaume Santini and Dominique Bouthinon. Efficient Pattern Mining in Attributed Graphs Maël Canu, Marie-Jeanne Lesot and Adrien Revault d'Allonnes. Détection de communautés recouvrantes orientée sommet Jean-Philippe Attal, Maria Malek and Marc Zolghadri. Détection de communautés chevauchantes utilisant la propagation de labels robuste et fonction d'appartenance Xavier Bost, Vincent Labatut, Serigne Gueye and Georges Linarès. Extraction de réseaux dynamiques conversationnels par lissage narratif Jason Vallet, Bruno Pinaud and Guy Melançon. Un modèle de génération de graphes « petit monde » imitant les réseaux sociaux Sarah Djemili, Claudia Marinica, Maria Malek and Dimitris Kotzinos. A Definitions’ Framework for Personal/Egocentric Online Social Networks

1 0