MM-INTEREST Archives

ACM SIGMM Interest List

MM-INTEREST@LISTSERV.ACM.ORG

Options: Use Forum View

Use Monospaced Font
Show HTML Part by Default
Condense Mail Headers

Message: [<< First] [< Prev] [Next >] [Last >>]
Topic: [<< First] [< Prev] [Next >] [Last >>]
Author: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
Sender:
ACM SIGMM Interest List <[log in to unmask]>
X-To:
Date:
Sun, 26 Sep 2021 16:21:47 +1000
Reply-To:
Feng XIA <[log in to unmask]>
Subject:
MIME-Version:
1.0
Message-ID:
Content-Type:
multipart/alternative; boundary="0000000000006adf3a05ccdfff95"
From:
Feng XIA <[log in to unmask]>
Parts/Attachments:
text/plain (4052 bytes) , text/html (4 kB)
[Please accept our apologies if you received multiple copies of this call]

CALL FOR PAPERS

ACM SAC 2022 Track on Knowledge Graphs
The 37th ACM/SIGAPP Symposium on Applied Computing
April 25 - April 29, 2022, Brno, Czech Republic
https://sites.google.com/view/sac2022kg

Knowledge graph is essentially the knowledge base of semantic web, which is
composed of entities (nodes) and relations (edges). As the representation
of semantics, knowledge graphs can readily-easily formulate real-world
entities, concepts, attributes, as well as their relations. All the
specific features of knowledge graphs make it born with strong expressive
ability and flexible modelling ability. At the same time, as a special kind
of graph data, knowledge graphs are both human-readable and
machine-friendly. With effective knowledge representation approaches, a
variety of tasks can be resolved, including knowledge extraction, knowledge
integration, knowledge management, and knowledge applications. Therefore,
knowledge graphs have been applied in various domains such as information
retrieval, natural language understanding, question answering systems,
recommender systems, financial risk control, etc. However, new challenges
have emerged in the context of knowledge graphs from many perspectives
including scalability, explainability, robustness, etc.

The track will bring together researchers and practitioners to discuss the
fundamentals, methodologies, techniques, and applications of knowledge
graphs. In this track, our goal is to contribute to the next generation of
knowledge graphs and exploring them using artificial intelligence, data
science, machine learning, network science, and other appropriate
technologies.

Topics of interest include but not limited to:
-Foundations and understanding of knowledge graphs
-Models and algorithms for knowledge graph construction and representation
-Large-scale graph algorithms and theories
-AI for/over knowledge graphs
-Misinformation or disinformation
-Privacy and security
-Fairness, transparency, explainability, and robustness
-Datasets and benchmarking
-Knowledge graphs in various domains
-Innovative applications of knowledge graphs

IMPORTANT DATES
Submission deadline: October 15, 2021
Notification to authors: December 10, 2021
Camera-ready copies of accepted papers: December 21, 2021
Author registration due date: December 21, 2021

SUBMISSION INSTRUCTIONS
Authors are invited to submit original and unpublished papers of research
and applications for this track. The author(s) name(s) and address(es) must
not appear in the body of the paper, and self-reference should be in the
third person. This is to facilitate double-blind review.

SAC 2022 accepts 1) Regular (Full) Papers, 2) Posters, and 3) Student
Research Competition (SRC) Abstracts. Full papers are limited to 8 pages
with the option for up to 2 additional pages. Posters are limited to 3
pages with the option for up to 1 additional page. Student Research
Abstracts are limited to 4 pages, with no additional pages.

Submissions must be formatted according to the ACM SAC template. For
detailed instructions for authors, see the Author Kit on the ACM SAC 2022
website (https://www.sigapp.org/sac/sac2022/). Please submit your papers
via the SAC 2022 submission system. When submitting, select Track on
Knowledge Graphs.

Track Chairs:
Feng Xia, Federation University Australia
Shuo Yu, Dalian University of Technology
Francesco Osborne, The Open University

Contact Info:
Email: [log in to unmask]

############################

Unsubscribe:

[log in to unmask]

If you don't already have a password for the LISTSERV.ACM.ORG server, we recommend
that you create one now. A LISTSERV password is linked to your email
address and can be used to access the web interface and all the lists to
which you are subscribed on the LISTSERV.ACM.ORG server.

To create a password, visit:

https://LISTSERV.ACM.ORG/SCRIPTS/WA-ACMLPX.CGI?GETPW1

Once you have created a password, you can log in and view or change your
subscription settings at:

https://LISTSERV.ACM.ORG/SCRIPTS/WA-ACMLPX.CGI?SUBED1=MM-INTEREST


ATOM RSS1 RSS2