OpenRaiser/Intern-Atlas huggingface dataset:
CommDGI: Community Detection Oriented Deep Graph Infomax
Authors: Tianqi Zhang, Yun Xiong, Jiawei Zhang, Yao Zhang, Yizhu Jiao, Yangyong Zhu
Venue: CIKM
Year: 2020

Graph Neural Networks(GNNs), like GCN and GAT, have achieved great success in a number of supervised or semi-supervised tasks including node classification and link prediction. These existing graph neural networks can effectively encode neighborhood information of graph nodes through their message aggregating mechanisms. However, there are some unsupervised and structure-related tasks like community detection, which is a fundamental problem in network analysis that finds densely-connected groups of nodes and separates them from others in graphs. It is still difficult for these general-purposed GNNs to learn the needed structural information in these particular problems. To overcome the shortcomings of general-purposed graph representation learning methods, we propose the Community Deep Graph Infomax (CommDGI), a graph neural network designed to handle community detection problems. Inspired by the success of deep graph infomax in self-supervised graph learning, we design a novel mutual information mechanism to capture neighborhood as well as community information in graphs. A trainable clustering layer is employed to learn the community partition in an end-to-end manner. Disentangled representation learning is applied in our graph neural network so that the model can improve interpretability and generalization. Throughout the whole learning process, joint optimization is applied to learn the community-related node representations. The experimental results show that our algorithm outperforms state-of-the-art community detection methods.
Integrating Diagnosis Rules into Deep Neural Networks for Bladder Cancer Staging
Authors: Cheng Zhang, Xiaodong Yue, Yufei Chen, Ying Lv
Venue: CIKM
Year: 2020

Bladder cancer is a malignant disease with substantial morbidity and mortality. Bladder cancer staging is crucial to determine the effective treatments of bladder tumors in clinic. As to the superiority of feature learning, Deep Convolutional Neural Networks (DCNN) are widely used to predict the cancer stage based on medical images. However, most existing DCNN-based cancer staging methods are data-driven and neglect the domain knowledge and experiences of clinicians. Besides, the deep neural networks are short of model interpretability and may lead to risky diagnosis. To tackle the problems, we construct the diagnosis rules of bladder cancer staging based on the clinical experiences of tumor penetration into bladder wall. The diagnosis rules are extracted from Magnetic Resonance (MR) images and further integrated into DCNN for joint identification of tumor stage. The experiments validate that the integrated rules improve the model interpretability and guide DCNN to focus on the regions of tumor penetration and thereby produce precise prediction of cancer staging.
Robust Normalized Squares Maximization for Unsupervised Domain Adaptation
Authors: Wenju Zhang, Xiang Zhang, Qing Liao, Wenjing Yang, Long Lan, Zhigang Luo
Venue: CIKM
Year: 2020

Unsupervised domain adaptation (UDA) attempts to transfer specific knowledge from one domain with labeled data to another domain without labels. Recently, maximum squares loss has been proposed to tackle UDA problem but it does not consider the prediction diversity which has proven beneficial to UDA. In this paper, we propose a novel normalized squares maximization (NSM) loss in which the maximum squares is normalized by the sum of squares of class sizes. The normalization term enforces the class sizes of predictions to be balanced to explicitly increase the diversity. Theoretical analysis shows that the optimal solution to NSM is one-hot vectors with balanced class sizes, i.e., NSM encourages both discriminate and diverse predictions. We further propose a robust variant of NSM, RNSM, by replacing the square loss with L2,1-norm to reduce the influence of outliers and noises. Experiments of cross-domain image classification on two benchmark datasets illustrate the effectiveness of both NSM and RNSM. RNSM achieves promising performance compared to state-of-the-art methods. The code is available at https://github.com/wj-zhang/NSM.
EasyGML: A Fully-functional and Easy-to-use Platform for Industrial Graph Machine Learning
Authors: Zhiqiang Zhang, Jun Zhou, Chuan Shi
Venue: CIKM
Year: 2020

Despite the great success of Graph Machine Learning (GML) in a variety of applications, the industry is still seeking a platform which makes performing industrial-purpose GML convenient. In this demo, we present EasyGML, a fully-functional and easy-to-use platform for general AI practitioners to apply out-of-the-box GML models in industrial scenarios. Leveraging the distributed data warehouse as its data infrastructure, EasyGML adopts AGL, an integrated system for industrial-purpose graph learning, as its core GML engine, and develops a model zoo containing various GML models, supporting both node property prediction and link property prediction. It packs different steps of GML workflow into different components, and provides a user-friendly web-based GUI for users to build their GML workflows simply by connecting several components together, without any coding.
An Event-Oriented Neural Ranking Model for News Retrieval
Authors: Lin Zhao, Wanhui Qian, Liangjun Zang, Fuqing Zhu, Yijun Lu, Ruixuan Li, Jizhong Han, Songlin Hu
Venue: CIKM
Year: 2020

Event-oriented news retrieval (ENR) is the task of retrieving news articles related to the specific event in response to the event-oriented query. Previous approaches usually focus on optimizing traditional retrieval models through hand-crafted features from the perspective of new articles. However, these approaches often fail to work well in reality, as they do not consider the essential natures of the event, i.e., dynamics, coupling. In this paper, we propose a novel and effective event-oriented neural ranking model for news retrieval (ENRMNR). Our model exploits a deep attention mechanism to tackle the dynamics and coupling derived from event evolution. Specifically, the word-level bidirectional attention allows the model to identify which query words about the subevent are related to the news article words, and vice-versa, in order to tackle the dynamics. Moreover, the hierarchical attention at passage-level and document-level allows it to capture fine-grained event representations for the coupling between different events within a news article. Experimental results on real-world datasets demonstrate that ENRMNR model significantly outperforms competitive models.
Semi-Supervised Graph-to-Graph Translation
Authors: Tianxiang Zhao, Xianfeng Tang, Xiang Zhang, Suhang Wang
Venue: CIKM
Year: 2020

Graph translation is very promising research direction and has awide range of potential real-world applications. Graph is a natural structure for representing relationship and interactions, and its translation can encode the intrinsic semantic changes of relation-ships in different scenarios. However, despite its seemingly wide possibilities, usage of graph translation so far is still quite limited.One important reason is the lack of high-quality paired dataset. For example, we can easily build graphs representing peoples? shared music tastes and those representing co-purchase behavior, but a well paired dataset is much more expensive to obtain. Therefore,in this work, we seek to provide a graph translation model in the semi-supervised scenario. This task is non-trivial, because graph translation involves changing the semantics in the form of link topology and node attributes, which is difficult to capture due to the combinatory nature and inter-dependencies. Furthermore, due to the high order of freedom in graph's composition, it is difficult to assure the generalization ability of trained models. These difficulties impose a tighter requirement for the exploitation of unpaired samples. Addressing them, we propose to construct a dual representation space, where transformation is performed explicitly to model the semantic transitions. Special encoder/decoder structures are designed, and auxiliary mutual information loss is also adopted to enforce the alignment of unpaired/paired examples. We evaluate the proposed method in three different datasets.
On-demand Influencer Discovery on Social Media
Authors: Cheng Zheng, Qin Zhang, Sean D. Young, Wei Wang
Venue: CIKM
Year: 2020

Identifying influencers on social media, such as Twitter, has played a central role in many applications, including online marketing and political campaigns. Compared with social media celebrities, domain-specific influencers are less expensive to hire and more engaged in spreading messages such as new treatment or timely prevention for HIV. However, most of the existing topic modeling based approaches fail to identify influencers who are dedicated to the rare yet important topics such as HIV and suicide. To alleviate this limitation, we investigate an on-Demand Influencer Discovery (DID) framework that is able to identify influencers on any subject depicted by a few user-specified keywords, regardless of its popularity on social media. The DID model employs an iterative learning process that integrates the language attention network as a subject filter and the influence convolution network built on user interactions. Comprehensive evaluations on Twitter datasets show that the DID model can reliably identify influencers even on rare subjects such as HIV and suicide, outperforming existing topic-specific influencer detection models.
Diversifying Multi-aspect Search Results Using Simpson's Diversity Index
Authors: Jianghong Zhou, Eugene Agichtein, Surya Kallumadi
Venue: CIKM
Year: 2020

In search and recommendation, diversifying the multi-aspect search results could help with reducing redundancy, and promoting results that might not be shown otherwise. Many previous methods have been proposed for this task. However, previous methods do not explicitly consider the uniformity of the number of the items' classes, or evenness, which could degrade the search and recommendation quality. To address this problem, we introduce a novel method by adapting the Simpson's Diversity Index from biology, which enables a more effective and efficient quadratic search result diversification algorithm. We also extend the method to balance the diversity between multiple aspects through weighted factors and further improve computational complexity by developing a fast approximation algorithm. We demonstrate the feasibility of the proposed method using the openly available Kaggle shoes competition dataset. Our experimental results show that our approach outperforms previous state of the art diversification methods, while reducing computational complexity.
Predicting Quality of Automated Welding with Machine Learning and Semantics: A Bosch Case Study
Authors: Baifan Zhou, Yulia Svetashova, Seongsu Byeon, Tim Pychynski, Ralf Mikut, Evgeny Kharlamov
Venue: CIKM
Year: 2020

Manufacturing of car bodies heavily relies on demanding welding processes of joining body parts together that introduce thousands of joining welding spots in each car. Quality monitoring for these spots impacts production efficiency and cost. In this paper we develop an ML pipeline to predict the spot quality before the actual welding happens. This pipeline is based on a Feature Engineering~(FE) approach to manually design features using domain knowledge. We evaluated the pipeline with two datasets from industrial plants, achieving very promising results with prediction errors around 2%. Then, we develop an approach to semantically enhance FE pipelines in order to automate the ML process without compromising the prediction accuracy and to facilitate generalisation and transfer of FE-based models to other datasets and processes. Our ML pipeline has been deployed offline on various Bosch manufacturing datasets in a controlled environment since early 2019 and evaluated.
The Enslaved Dataset: A Real-world Complex Ontology Alignment Benchmark using Wikibase
Authors: Lu Zhou, Cogan Shimizu, Pascal Hitzler, Alicia M. Sheill, Seila Gonzalez Estrecha, Catherine Foley, Duncan Tarr, Dean Rehberger
Venue: CIKM
Year: 2020

Ontology alignment has taken a critical place for helping heterogeneous resources to interoperate. It has been studied for over a decade, and over that time many alignment systems and methods have been developed by researchers to find simple 1:1 equivalence matches between two ontologies. However, very few alignment systems focus on finding complex correspondences. Even if the complex alignment systems are developed, the performance of finding complex relations still has a lot of room for improvement. One reason for this limitation may be that there are still few applicable alignment benchmarks that contain such complex relationships that can raise researchers' interests. In this paper, we propose a real-world dataset from the Enslaved project as a potential complex alignment benchmark. The benchmark consists of two resources, the Enslaved Ontology along with a Wikibase repository holding a large number of instance data from the Enslaved project, as well as a manually created reference alignment between them. The alignment was developed in consultation with domain experts in the digital humanities. The alignment not only includes simple 1:1 equivalence correspondences, but also more complex m:n equivalence and subsumption correspondences and are provided in both Expressive and Declarative Ontology Alignment Language (EDOAL) format and rule syntax. The Enslaved benchmark has been incorporated into the Ontology Alignment Evaluation Initiative (OAEI) 2020 and is completely free for public use to assist the researchers in developing and evaluating their complex alignment algorithms.
SemFE: Facilitating ML Pipeline Development with Semantics
Authors: Baifan Zhou, Yulia Svetashova, Tim Pychynski, Ildar Baimuratov, Ahmet Soylu, Evgeny Kharlamov
Venue: CIKM
Year: 2020

Machine learning (ML) based data analysis has attracted an increasing attention in the manufacturing industry, however, many challenges hamper their wide spread adoption. The main challenges are the high costs of labour-intensive data preparation from diverse sources and processes, the asymmetrical backgrounds of the experts involved in manufacturing analyses that impede efficient communication between them, and the lack of generalisability of ML models tailored to specific applications. Our semantically enhanced ML pipeline, SemFE, with feature engineering addresses these challenges, serving as a bridge to bring the endeavours of experts together, and making data science accessible to non-ML-experts. SemFE relies on ontologies for discrete manufacturing monitoring that encapsulate domain and ML knowledge; it has five novel semantic modules for automation of ML-pipeline development and user-friendly GUIs. The demo attendees will be able to use our system to build manufacturing monitoring ML pipelines, and to design their own pipelines with minimal prior knowledge of machine learning.
Data Augmentation for Graph Classification
Authors: Jiajun Zhou, Jie Shen, Qi Xuan
Venue: CIKM
Year: 2020

Graph classification, which aims to identify the category labels of graphs, plays a significant role in drug classification, toxicity detection, protein analysis etc. However, the limitation of scale of benchmark datasets makes it easy for graph classification models to fall into over-fitting and undergeneralization. Towards this, we introduce data augmentation on graphs and present two heuristic algorithms: \emrandom mapping and \emmotif-similarity mapping, to generate more weakly labeled data for small-scale benchmark datasets via heuristic modification of graph structures. Furthermore, we propose a generic model evolution framework, named \emM-Evolve, which combines graph augmentation, data filtration and model retraining to optimize pre-trained graph classifiers. Experiments conducted on six benchmark datasets demonstrate that \emM-Evolve helps existing graph classification models alleviate over-fitting when training on small-scale benchmark datasets and %achieve significant improvement of classification performance. yields an average improvement of 3-12% accuracy on graph classification tasks.
S3-Rec: Self-Supervised Learning for Sequential Recommendation with Mutual Information Maximization
Authors: Kun Zhou, Hui Wang, Wayne Xin Zhao, Yutao Zhu, Sirui Wang, Fuzheng Zhang, Zhongyuan Wang, Ji-Rong Wen
Venue: CIKM
Year: 2020

Recently, significant progress has been made in sequential recommendation with deep learning. Existing neural sequential recommendation models usually rely on the item prediction loss to learn model parameters or data representations. However, the model trained with this loss is prone to suffer from data sparsity problem. Since it overemphasizes the final performance, the association or fusion between context data and sequence data has not been well captured and utilized for sequential recommendation. To tackle this problem, we propose the model S3-Rec, which stands for Self-Supervised learning for Sequential Recommendation, based on the self-attentive neural architecture. The main idea of our approach is to utilize the intrinsic data correlation to derive self-supervision signals and enhance the data representations via pre-training methods for improving sequential recommendation. For our task, we devise four auxiliary self-supervised objectives to learn the correlations among attribute, item, subsequence, and sequence by utilizing the mutual information maximization (MIM) principle. MIM provides a unified way to characterize the correlation between different types of data, which is particularly suitable in our scenario. Extensive experiments conducted on six real-world datasets demonstrate the superiority of our proposed method over existing state-of-the-art methods, especially when only limited training data is available. Besides, we extend our self-supervised learning method to other recommendation models, which also improve their performance.
Leveraging Historical Interaction Data for Improving Conversational Recommender System
Authors: Kun Zhou, Wayne Xin Zhao, Hui Wang, Sirui Wang, Fuzheng Zhang, Zhongyuan Wang, Ji-Rong Wen
Venue: CIKM
Year: 2020

Recently, conversational recommender system (CRS) has become an emerging and practical research topic. Most of the existing CRS methods focus on learning effective preference representations for users from conversation data alone. While, we take a new perspective to leverage historical interaction data for improving CRS. For this purpose, we propose a novel pre-training approach to integrating both item-based preference sequence (from historical interaction data) and attribute-based preference sequence (from conversation data) via pre-training methods. We carefully design two pre-training tasks to enhance information fusion between item- and attribute-based preference. To improve the learning performance, we further develop an effective negative sample generator which can produce high-quality negative samples. Experiment results on two real-world datasets have demonstrated the effectiveness of our approach for improving CRS.
Active Search using Meta-Bandits
Authors: Shengli Zhu, Jakob Coles, Sihong Xie
Venue: CIKM
Year: 2020

There are many applications where positive instances are rare but important to identify. For example, in NLP, positive sentences for a given relation are rare in a large corpus. Positive data are more informative for learning in these applications, but before one labels a certain amount of data, it is unknown where to find the rare positives. Since random sampling can lead to significant waste in labeling effort, previous 'active search' methods use a single bandit model to learn about the data distribution (exploration) while sampling from the regions potentially containing more positives (exploitation). Many bandit models are possible and a sub-optimal model reduces labeling efficiency, but the optimal model is unknown before any data are labeled. We propose Meta-AS (Meta Active Search) that uses a meta-bandit to evaluate a set of base bandits and aims to label positive examples efficiently, comparing to the optimal base bandit with hindsight. The meta-bandit estimates the mean and variance of the performance of the base bandits and selects a base bandit to propose what data to label next for exploration or exploitation. The feedback in the labels updates both the base bandits and the meta-bandit for the next round. Meta-AS can accommodate a diverse set of base bandits to explore assumptions about the dataset, without over-committing to a single model before labeling starts. Experiments on five datasets for relation extraction demonstrate that Meta-AS labels positives more efficiently than the base bandits and other bandit selection strategies.
LRHNE: A Latent-Relation Enhanced Embedding Method for Heterogeneous Information Networks
Authors: Zhihua Zhu, Xinxin Fan, Xiaokai Chu, Jianhui Huang, Jingping Bi
Venue: CIKM
Year: 2020

Heterogeneous information networks (HINs) have been successfully applied into several fields to accomplish complex data analytics, such as bibliography, bioinformatics, NLP, etc. In the meantime, network embedding at present has emerged as a convenient tool to mine and learn from networked data. As a result, it is of interest to develop HIN embedding methods. Despite recent breakthroughs in HIN embedding methods, little research attention has been paid to exploit the relation semantics in HINs and further integrate it to improve the embedding quality. Considering the sophisticated correlations in HINs, we in this paper propose a novel HIN embedding method LRHNE to yield latent-relation enhanced embeddings for nodes. Our work mainly involves three contributions: i) we verify that the latent relation can promote the embedding quality indeed through a real-world dataset, then a novel graph inception network is proposed to extract the latent relational features under the guidance of partial prior knowledge; ii) taking into account the existing structure information and inferred latent relation knowledge, we propose a cross-aligned variational graph autoencoder to extract and further fuse both the structure and latent relational features into the embeddings; and iii) we perform extensive experiments to validate our proposed LRHNE, and experimental results show that our LRHNE can significantly outperform state-of-the-art methods. The multi-facet inspections also exhibit our method is robust and hyper-parameter insensitive, therefore, our method can serve as a radical tool to tackle the relation-sophisticated HINs.
Top-k Graph Summarization on Hierarchical DAGs
Authors: Xuliang Zhu, Xin Huang, Byron Choi, Jianliang Xu
Venue: CIKM
Year: 2020

Directed acyclic graph (DAG) is an essentially important model to represent terminologies and their hierarchical relationships, such as Disease Ontology. Due to massive terminologies and complex structures in a large DAG, it is challenging to summarize the whole hierarchical DAG. In this paper, we study a new problem of finding k representative vertices to summarize a hierarchical DAG. To depict diverse summarization and important vertices, we design a summary score function for capturing vertices' diversity coverage and structure correlation. The studied problem is theoretically proven to be NP-hard. To efficiently tackle it, we propose a greedy algorithm with an approximation guarantee, which iteratively adds vertices with the large summary contributions into answers. To further improve answer quality, we propose a subtree extraction based method, which is proven to guarantee achieving higher-quality answers. In addition, we develop a scalable algorithm k-PCGS based on candidate pruning and DAG compression for large-scale hierarchical DAGs. Extensive experiments on large real-world datasets demonstrate both the effectiveness and efficiency of proposed algorithms.