会议交流 | IJCKG 2021:Keynotes released!欢迎注册参会

IJCKG 2021: The 10th International Joint Conference on Knowledge Graphs

December 6-8, 2021 Online

国际知识图谱联合会议之前是国际语义技术联合会议(the Joint International Semantic Technology Conference (JIST)),JIST 会议的历史要追溯到 2006 年在北京召开的第 1 届亚洲语义网会议 ASWC,第 5 届 ASWC2011 在杭州召开时更名为第 1 届国际语义技术联合会议JIST 2011。JIST 会议是语义网、知识图谱、关联数据和人工智能主题方面在亚洲召开的高端论坛会议。今年 JIST 会议和 ACM/SIOGAI 联合举办,更名为 IJCKG,将扩大会议的国际影响力。

Keynotes

1dca05da1232cbe23ba90d9360bf3614.png

Professor Ian Horrocks FRS

Department of Computer Science, Oxford University

Knowledge Graphs: Theory, Applications and Challenges

Abstract:

Knowledge Graphs have rapidly become a mainstream technology that combines features of databases and AI. In this talk I will present my personal view of what a knowledge graph is, discuss the theory behind them, and illustrate their use in a range of applications. I will then consider the challenges inherent in both the implementation and application of Knowledge Graphs and present some of our recent research that addresses both aspects.

Biography:

Ian Horrocks is a full professor in the Oxford University Department of Computer Science, a visiting professor in the Department of Informatics at the University of Oslo and a co-founder of Oxford Semantic Technologies. He is also a Fellow of the Royal Society, a member of Academia Europaea, a fellow of the European Association for Artificial Intelligence (EurAI), a Fellow of the Alan Turing Institute and a British Computer Society Lovelace Medalist. His research concerns the representation of knowledge, and the efficient manipulation of such knowledge by computers. He played a leading role in establishing the Semantic Web as a significant research field, pioneering many of the underlying logics, algorithms, optimisation techniques, and reasoning systems. He has contributed to the development of several widely used reasoning systems including FaCT++, HermiT, Elk and RDFox. He has published more than 300 papers in major international conferences and journals, winning best paper prizes at KR-98, AAAI-2010, and IJCAI-2017, and test of time awards at ISWC-2013, KR-2020 and CADE-2021. He is one of the UK’s most highly cited computer scientists, with more than 68,000 citations, and an h-index of 99.

898e1eeb7a33e506d8db5908d5aa17c4.png

Professor Juanzi Li

Department of Computer Science and Technology and the director of Knowledge Intelligence Research Center in Institute for Artificial Intelligence, Tsinghua University

Knowledge-oriented Explainable Cognitive Reasoning

Abstract:

The research paradigm of Artificial Intelligence is gradually changing from perception to cognition, and integrating symbolic and nummeric representation for knowledge reasoning is an important but challenging way to achieve cognitive intelligence. This talk introduces our attempts and experience on explainable cognitive reasoning based on complex question answering, including graph-based cognitive reasoning framework, knowledge-oriented interpretable reasoning programming and the construction of a large-scale benchmark on complex question answering over knowledge graph.

Biography:

Juanzi Li is the tenure professor in Department of Computer Science and Technology and the director of Knowledge Intelligence Research Center in Institute for Artificial Intelligence, Tsinghua University. She also serves as the director of Language and Knowledge Computing Committee at the Chinese Information Processing Society in China. Her research interests include knowledge engineering, news and social network mining. She has published over 100 papers in top-tier international conferences/academic journals and two books, i.e., “Mining User Generated Content” and “Semantic Mining in Social Networks”, which attracted over 10,000 citations. She won the second prize of State Science and Technology Progress Award in 2020, the first prize of the Beijing Science and Technology Award in 2017 and the first prize of China Association of Artificial Intelligence Science and Technology Award in 2013.

2e9cb83bdafffe9052886b05d76481e4.png

Dr. Yu Xu

Founder and CEO, TigerGraph

Knowledge Graph and Machine Learning: Three Key Business Needs

Abstract:

Digital transformation is accelerating the pace of innovation across all industries. Organizations are looking for ways to accelerate their analytics, AI, and machine learning projects to increase revenue, manage risks, and improve customer experience, especially for online channels. Knowledge Graphs combined with machine learning are driving three key data science capabilities to deliver the business outcomes organizations need:

•Connect internal and external datasets and pipelines with a distributed Graph Database – UnitedHealth Group is connecting 200+ sources to deliver a real-time customer 360 to improve quality of care for 50 million members and deliver call center efficiencies. Xandr (part of AT&T) is connecting multiple data pipelines to build an identity graph for entity resolution to power the next-generation AdTech platform.•Analyze connected data for never-before insights with Advanced Analytics – Jaguar Land Rover has accelerated supply chain planning from three weeks to 45 minutes, reduced supplier risk by 35%, and is driving three times the business value from the data.•Learn from the connected data with In-Database Machine Learning – Intuit has built an AI-based customer 360 knowledge graph with in-database machine learning for entity resolution, personalized recommendations, and fraud detection. Knowledge graph combined with machine learning is central to Intuit’s transformation into an AI-driven expert platform.

The session covers design considerations and deployment best practices from these case studies for combining knowledge graphs with machine learning.

Biography:

Dr. Yu Xu is the founder and CEO of TigerGraph, the world’s first native parallel graph database. Dr. Xu received his Ph.D in Computer Science and Engineering from the University of California San Diego. He is an expert in big data and parallel database systems and has 26 patents in parallel data management and optimization. Prior to founding TigerGraph, Dr. Xu worked on Twitter’s data infrastructure for massive data analytics. Before that, he worked as Teradata’s Hadoop architect where he led the company’s big data initiatives.

638e6f76746e8e28fb6f667e88ce3833.png

Associate Professor Juan Lorenzo Reutter

Department of Computer Science and the Institute of Engineering Mathematics & Computer Engineering, Pontificia Universidad Católica de Chile

Distinguishing Graph Neural Networks in terms of their power, and how to choose the right architecture

Abstract:

The distinguishing power of graph neural networks (GNNs) is commonly characterized in terms of the Weisfeiler-Lehman (WL) test for checking graph isomorphism. With more and more architectures being proposed, and then characterized, a concrete map of the distinguishing power of GNNs starts to unveil: the simpler architectures tend to be bounded by the simplest, one-dimensional version of WL, and more powerful GNN architectures are instead bounded by higher-order versions of WL. However, going for the most powerful architecture usually has computational drawbacks, as these higher-order GNN architectures often have memory requirements that grow in powers of the size of the original graph. In this talk I will talk about the distinguishing power of GNN architectures. We will go deep into the power/memory requirement tradeoff of current GNN architectures, and review recent results that use logic in order to produce a general map that allows one to characterize any arbitrary GNN. Further, I will discuss what I think is a sweet spot regarding the power/memory requirement tradeoff of GNNs, and has to do with using very simple architectures over a graph that has been enhanced with local structural information. This model, in turn, opens up several interesting questions that deserve further study: what structural information provides the best gains in distinguishing power, and how to choose the best set of structural features for a learning task.

Biography:

Juan Lorenzo Reutter works as an associate professor in the Department of Computer Science and the Institute of Engineering Mathematics & Computer Engineering of Pontificia Universidad Católica de Chile, and as an associate researcher in the Millennium Institute for Foundational Research on Data. He received his PhD in the University of Edinburgh in 2013. His research interest has to do with mathematical foundations of data management, web data and data science. He received the Cor Baayen Young Researcher Award from the European Research Consortium for Informatics and Mathematics and a BCS distinguished dissertation award for his PhD thesis. His research has also been highlighted with two Best Paper Awards, at PODS and at ISWC.

IJCKG

The 10th International Joint Conference on Knowledge Graphs (IJCKG 2021, in cooperation with ACM/SIGAI) is a premium academic forum on Knowledge Graphs. The mission of IJCKG 2021 is to bring together international researchers in the Knowledge Graph community and other related areas to present their innovative research results or novel applications of Knowledge Graphs. IJCKG has evolved from the Joint International Semantic Technology Conference (JIST): a joint event for disseminating research results regarding the Semantic Web, Knowledge Graphs, Linked Data and AI on the Web.

Accepted papers will be published in the ACM Digital Library within its International Conference Proceedings Series (ICPS). Extended versions of the best papers will be invited for Special Issues of the Knowledge-Based Systems and Data Intelligence Journals.

会议注册

注册链接:

https://iisi.siit.tu.ac.th/IJCKG2021/regform.php

点击阅读原文,进入注册页面。


OpenKG

OpenKG(中文开放知识图谱)旨在推动以中文为核心的知识图谱数据的开放、互联及众包,并促进知识图谱算法、工具及平台的开源开放。

1e76fe5e5c1b6cfaa3737aca3574a305.png

本文来自互联网用户投稿,该文观点仅代表作者本人,不代表本站立场。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如若转载,请注明出处:http://www.mzph.cn/news/477950.shtml

如若内容造成侵权/违法违规/事实不符,请联系多彩编程网进行投诉反馈email:809451989@qq.com,一经查实,立即删除!

相关文章

LeetCode 1010. 总持续时间可被 60 整除的歌曲(哈希)

1. 题目 在歌曲列表中&#xff0c;第 i 首歌曲的持续时间为 time[i] 秒。 返回其总持续时间&#xff08;以秒为单位&#xff09;可被 60 整除的歌曲对的数量。形式上&#xff0c;我们希望索引的数字 i < j 且有 (time[i] time[j]) % 60 0。 示例 1&#xff1a; 输入&am…

pip加速+百度镜像|清华镜像

针对pip install 安装包下载慢的问题&#xff0c;主要pip install直接安装是从国外拉取安装包。 解决办法&#xff0c;加国内镜像&#xff0c;比如百度 https://mirror.baidu.com/pypi/simple pip install lac -i https://mirror.baidu.com/pypi/simple比如清华镜像&#xf…

深入理解Objective-C:Category

摘要 无论一个类设计的多么完美&#xff0c;在未来的需求演进中&#xff0c;都有可能会碰到一些无法预测的情况。那怎么扩展已有的类呢&#xff1f;一般而言&#xff0c;继承和组合是不错的选择。但是在Objective-C 2.0中&#xff0c;又提供了category这个语言特性&#xff0c;…

工作6年,谈谈我对“算法岗”的理解

文 | Severus编 | 小轶写在前面&#xff1a;本文完全基于我个人的工作经验&#xff0c;没有经过任何形式的行业调研&#xff0c;所以我的理解也有相当浓厚的个人印记&#xff0c;可以认作一家之言。如果能对读者朋友们起到任何帮助&#xff0c;都是我的荣幸。如果不赞同我的看法…

会议交流 | IJCKG 2021 日程表(北京时间)

IJCKG 2021 Program(All times Beijing Time)December 6thOpening (19:00–19:15)Chair: Oscar CorchoKeynote I (19:15–20:15)Chair: Oscar CorchoKnowledge Graphs: Theory, Applications and ChallengesIan Horrocks, Professor, University of OxfordBreak (20:15–20:30)…

PaddlePaddle预训练模型大合集

PaddlePaddle预训练模型大合集&#xff0c;还有官方使用说明书添加链接描述https://blog.csdn.net/paddlepaddle/article/details/93858863

LeetCode 1128. 等价多米诺骨牌对的数量(哈希)

1. 题目 给你一个由一些多米诺骨牌组成的列表 dominoes。 如果其中某一张多米诺骨牌可以通过旋转 0 度或 180 度得到另一张多米诺骨牌&#xff0c;我们就认为这两张牌是等价的。 形式上&#xff0c;dominoes[i] [a, b] 和 dominoes[j] [c, d] 等价的前提是 ac 且 bd&#…

纵观对话预训练技术演变史:化繁为简的背后,什么在消亡?

文 &#xff5c; 橙橙子最近&#xff0c;百度发布了对话生成预训练模型PLATO-XL&#xff0c;110亿的参数规模&#xff0c;也让它成为了对话领域目前最大的预训练模型。不到两年的时间&#xff0c;PLATO系列已走过三代。作为国内对话预训练技术的头部玩家&#xff0c;它的每一次…

app = Flask(__name__)相关说明

#!/usr/local/bin/python # codingutf-8from flask import Flask app Flask(__name__)app.route(/) def hello_world():return Hello World!if __name__ __main__:app.run(host0.0.0.0,port9000)第4行&#xff0c;引入Flask类&#xff0c;Flask类实现了一个WSGI应用 第5行&am…

会议交流 | CNCC2021中国计算机大会 —— 知识图谱赋能数字化转型论坛

OpenKGOpenKG&#xff08;中文开放知识图谱&#xff09;旨在推动以中文为核心的知识图谱数据的开放、互联及众包&#xff0c;并促进知识图谱算法、工具及平台的开源开放。点击阅读原文&#xff0c;进入 OpenKG 网站。

LeetCode 687. 最长同值路径(二叉树,递归)

1. 题目 给定一个二叉树&#xff0c;找到最长的路径&#xff0c;这个路径中的每个节点具有相同值。 这条路径可以经过也可以不经过根节点。 注意&#xff1a;两个节点之间的路径长度由它们之间的边数表示。 示例 1: 输入:5/ \4 5/ \ \1 1 5 输出: 2示例 2: 输入:1/ …

机器学习中的数据清洗与特征处理综述

随着美团交易规模的逐步增大&#xff0c;积累下来的业务数据和交易数据越来越多&#xff0c;这些数据是美团做为一个团购平台最宝贵的财富。通过对这些数据的分析和挖掘&#xff0c;不仅能给美团业务发展方向提供决策支持&#xff0c;也为业务的迭代指明了方向。目前在美团的团…

论文浅尝 | 面向视觉常识推理的层次语义增强方向图网络

论文笔记整理&#xff1a;刘克欣&#xff0c;天津大学硕士链接&#xff1a;https://dl.acm.org/doi/abs/10.1145/3475731.3484957动机视觉常识推理(VCR)任务旨在促进认知水平相关推理的研究。现有的方法仅考虑了区域-词的相似性来实现视觉和语言域之间的语义对齐&#xff0c;忽…

分类问题后处理技巧CAN,近乎零成本获取效果提升

文 | 苏剑林编 | 智商掉了一地单位 | 追一科技思想朴素却不平凡的分类问题后处理技巧&#xff0c;浅显易懂的讲解&#xff0c;拿来吧你&#xff01;顾名思义&#xff0c;本文将会介绍一种用于分类问题的后处理技巧——CAN&#xff08;Classification with Alternating Normaliz…

LeetCode 840. 矩阵中的幻方(数学)

1. 题目 3 x 3 的幻方是一个填充有从 1 到 9 的不同数字的 3 x 3 矩阵&#xff0c;其中每行&#xff0c;每列以及两条对角线上的各数之和都相等。 给定一个由整数组成的 grid&#xff0c;其中有多少个 3 3 的 “幻方” 子矩阵&#xff1f;&#xff08;每个子矩阵都是连续的&…

Docker系列之一:入门介绍

Docker简介 Docker是DotCloud开源的、可以将任何应用包装在Linux container中运行的工具。2013年3月发布首个版本&#xff0c;当前最新版本为1.3。Docker基于Go语言开发&#xff0c;代码托管在Github上&#xff0c;目前超过10000次commit。基于Docker的沙箱环境可以实现轻型隔离…

论文浅尝 | 动态知识图谱对齐

论文笔记整理&#xff1a;谭亦鸣&#xff0c;东南大学博士生来源&#xff1a;AAAI‘21链接&#xff1a;https://ojs.aaai.org/index.php/AAAI/article/view/16585概述本文提出了一种动态图谱(KG)对齐方法&#xff0c;在“动态”&#xff08;即图谱可能随时间更新&#xff09;的…

你的 GNN,可能 99% 的参数都是冗余的

文 | iven自从图卷积神经网络&#xff08;GCN&#xff09;面世以来&#xff0c;图神经网络&#xff08;GNN&#xff09;的热潮一瞬间席卷 NLP。似乎在一切 NLP 任务上&#xff0c;引入一个图结构&#xff0c;引入一个 GNN&#xff0c;就能让模型拥有推理能力。更重要的是&#…

LeetCode 874. 模拟行走机器人(set)

1. 题目 机器人在一个无限大小的网格上行走&#xff0c;从点 (0, 0) 处开始出发&#xff0c;面向北方。该机器人可以接收以下三种类型的命令&#xff1a; -2&#xff1a;向左转 90 度-1&#xff1a;向右转 90 度1 < x < 9&#xff1a;向前移动 x 个单位长度 在网格上有…

高级语言的编译:链接及装载过程介绍

引言 随着越来越多功能强大的高级语言的出现&#xff0c;在服务器计算能力不是瓶颈的条件下&#xff0c;很多同学会选择开发效率高&#xff0c;功能强大的虚拟机支持的高级语言&#xff08;Java&#xff09;&#xff0c;或者脚本语言&#xff08;Python&#xff0c;Php&#xf…