Print

Print


*****  To join INSNA, visit http://www.insna.org  *****

  - Beyond Facts -
1st International Workshop on Knowledge Graphs for Online Discourse Analysis
(KnOD)


Collocated with TheWebConf (WWW) 2021


April 19 - 23, Ljubljana (Slovenia)
https://urldefense.proofpoint.com/v2/url?u=https-3A__knod2021.wordpress.com_&d=DwIFaQ&c=sJ6xIWYx-zLMB3EPkvcnVg&r=yQQsvTNAnbvDXGM4nDrXAje4pr0qHX2qIOcCQtJ5k3w&m=s5jbe7gURaU1En_pdf54gARP-SscXy2LdYe4eWL64Y0&s=Yj04pyxoxzflVeaO-uISiqhO3fnRhYdEEr02rruDDOY&e= 


Latest News

We are excited to announce that Preslav Nakov and Daniel Schwabe will be
our two keynote speakers! More information at
https://urldefense.proofpoint.com/v2/url?u=https-3A__knod2021.wordpress.com_keynotes_&d=DwIFaQ&c=sJ6xIWYx-zLMB3EPkvcnVg&r=yQQsvTNAnbvDXGM4nDrXAje4pr0qHX2qIOcCQtJ5k3w&m=s5jbe7gURaU1En_pdf54gARP-SscXy2LdYe4eWL64Y0&s=XzBOUCFOkZahSpzDK4HxImvPKCZ5YjXEuDFqpVK8l1Q&e= 



Summary

Expressing opinions and interacting with others on the Web has led to the
availability of an abundance of online discourse data, such as claims and
viewpoints on controversial topics, their sources and contexts (related
events or entities). Discourse data constitutes a valuable source of
insights for studies into misinformation spread, bias reinforcement, echo
chambers or political agenda setting and is crucial as training/testing
data for various NLP tasks. While knowledge graphs (KGs) promise to provide
the key to a Web of structured information, they are mainly focused on
facts without keeping track of the diversity, connection or temporal
evolution of online discourse data. As opposed to facts, claims are
inherently more complex. Their interpretation strongly depends on the
context and a variety of intentional or unintended meanings, where
terminology and conceptual understandings strongly diverge across
communities from computational social science, to argumentation mining,
fact-checking, or viewpoint/stance detection.
This workshop aims at providing a forum for shared works on the modeling,
extraction and analysis of discourse on the Web,  strengthening the
relations between the fields of natural language processing (NLP,,
computational linguistics, semantic web, knowledge graphs, argument mining
and modeling, social sciences/communication studies, web science and
computational social sciences. It will address the need for a shared
understanding and structured knowledge about discourse data in order to
enable machine-interpretation, discoverability and reuse, in support of
scientific or journalistic studies into the analysis of societal debates on
the Web.


Topics of interest

* Knowledge graphs and knowledge extraction techniques in the context of
online discourse
* Computational fact-checking / truth discovery
* Bias and controversy detection and analysis
* Stance and viewpoint discovery
* Rumour, propaganda and hate-speech detection
* Intent discovery for claims
* Interpretability and explainability of online discourse analysis methods
* Ontologies and data models for online discourse data
* Reuse and extension of existing models such as schema.org and Wikidata
* Integration, aggregation, linking and enrichment of discourse data
* Semantic and exploratory search of online discourse data
* Argumentation and reasoning over online discourse
* Recommender systems for discourse data
* Quality, uncertainty, provenance, and trust of discourse data
* Benchmarks and training data for extraction, verification or linking of
discourse data
* Use-cases, applications and cross-community interfaces


Keynote speakers

* Preslav Nakov (Qatar Computing Research Institute, Qatar): Detecting the
"Fake News" Before It Was Even Written, Media Literacy, and Flattening the
Curve of the COVID-19 Infodemic
* Daniel Schwabe (PUC-Rio, Brasil): Trust and Mis/Disinformation - a
Dispute of Narratives


Submission

* Full papers (up to 8 pages, plus references and appendix) may contain
original research of relevance to the workshop topics.
* Short papers (up to 4 pages, plus references and appendix) may contain
original research in progress of relevance to the workshop topics.
* Demo and system papers (up to 4 pages, plus references and appendix) may
contain descriptions of prototypes, demos or software systems related to
the workshop topics.
* Resource papers (up to 4 pages, plus references and appendix) may contain
descriptions of resources related to the workshop topics, such as
ontologies, knowledge graphs, ground truth datasets, etc.
* Position papers (up to 4 pages, plus references and appendix) may discuss
vision statements or arguable opinions related to the workshop topics.
* Posters (up to 2 pages) may contain preliminary work in progress related
to the workshop topics.

All submissions must be written in English and adhere to the ACM template
and format (https://urldefense.proofpoint.com/v2/url?u=https-3A__knod2021.wordpress.com_dates-2Dand-2Dsubmission_&d=DwIFaQ&c=sJ6xIWYx-zLMB3EPkvcnVg&r=yQQsvTNAnbvDXGM4nDrXAje4pr0qHX2qIOcCQtJ5k3w&m=s5jbe7gURaU1En_pdf54gARP-SscXy2LdYe4eWL64Y0&s=ePT13Pdhj9PesDqpGH0XItJY48rtSMD5S-UueRUIB5Q&e= ).
Papers have to be submitted electronically via the EasyChair conference
submission system:  https://urldefense.proofpoint.com/v2/url?u=https-3A__easychair.org_conferences_-3Fconf-3Dknod2021&d=DwIFaQ&c=sJ6xIWYx-zLMB3EPkvcnVg&r=yQQsvTNAnbvDXGM4nDrXAje4pr0qHX2qIOcCQtJ5k3w&m=s5jbe7gURaU1En_pdf54gARP-SscXy2LdYe4eWL64Y0&s=CqvX1IA-o8I2T0rfH-rnyMIZLM9EMTkJQE-sPbJZBsY&e= 


Important Dates

* Papers due: February 15, 2021
* Paper notifications: February 28, 2021
* Paper camera-ready versions due: March 7, 2021
* Workshop: April 19 or April 20, 2021


Award

* All contributions are eligible for the “Best KnOD Paper” award


Organizing Committee

* Konstantin Todorov (University of Montpellier & LIRMM, France)
* Stefan Dietze (Heinrich-Heine-University Düsseldorf & GESIS, Germany)
* Pavlos Fafalios  (ICS-FORTH, Greece)


Program Committee

* Harith Alani, KMI, The Open University, UK
* Katarina Boland, GESIS, Germany
* Sandra Bringay, Paul Valéry University of Montpellier, France
* Gianluca Demartini, University of Queensland, Australia
* Ronald Denaux, Expert.AI, Spain
* Vasilis Efthymiou, FORTH, Greece
* Michael Färber, Karlsruhe Institute of Technology, Germany
* Jose Manuel Gomez-Perez, Expert.AI, Spain
* Daniel Hardt, Copenhagen Business School, Denmark
* Ioana Manolescu, INRIA Saclay and LIX/Ecole Polytechnique, France
* Preslav Nakov, Qatar Computing Research Institute, Qatar
* Panagiotis Papadakos, FORTH, Greece
* Daniel Schwabe, Pontifícia Universidade Católica do Rio de Janeiro, Brazil
* Kostas Stefanidis, Tampere University, Finland
* Pedro Szekely, University of Southern California, USA
* Andon Tchechmedjiev, Ecoles des Mines d’Alès, France
* Yannis Tzitzikas, FORTH, Greece
* Xiaofei Zhu, Chongqing University of Technology, China


-- 
Dr. Pavlos Fafalios
Postdoctoral research fellow
ReKnow project <https://urldefense.proofpoint.com/v2/url?u=https-3A__reknow.ics.forth.gr_&d=DwIFaQ&c=sJ6xIWYx-zLMB3EPkvcnVg&r=yQQsvTNAnbvDXGM4nDrXAje4pr0qHX2qIOcCQtJ5k3w&m=s5jbe7gURaU1En_pdf54gARP-SscXy2LdYe4eWL64Y0&s=8gETGPZu6hnh5SX0aYcMQr2mJQC4TQqcGnty7YEbblk&e= > (MSCA Individual Fellowship)

Centre for Cultural Informatics (CCI) / Information Systems Laboratory
(ISL)
Institute of Computer Science (ICS)
Foundation for Research and Technology (FORTH)
   and
Visiting Lecturer
Department of Management Science & Technology (MST),
Hellenic Mediterranean University (HMU)

Address: N. Plastira 100, Vassilika Vouton, 70013 Heraklion, Greece
Email: [log in to unmask]
Tel: +30-2810-391619
Web: https://urldefense.proofpoint.com/v2/url?u=http-3A__users.ics.forth.gr_-7Efafalios_&d=DwIFaQ&c=sJ6xIWYx-zLMB3EPkvcnVg&r=yQQsvTNAnbvDXGM4nDrXAje4pr0qHX2qIOcCQtJ5k3w&m=s5jbe7gURaU1En_pdf54gARP-SscXy2LdYe4eWL64Y0&s=yuXV6KPocPXelf61r-R31HLa0rlxgk29WykQZkPSPbQ&e= 

_____________________________________________________________________
SOCNET is a service of INSNA, the professional association for social
network researchers (http://www.insna.org). To unsubscribe, send
an email message to [log in to unmask] containing the line
UNSUBSCRIBE SOCNET in the body of the message.