OpenRaiser/Intern-Atlas huggingface dataset:
TGCN: Tag Graph Convolutional Network for Tag-Aware Recommendation
Authors: Bo Chen, Wei Guo, Ruiming Tang, Xin Xin, Yue Ding, Xiuqiang He, Dong Wang
Venue: CIKM
Year: 2020

Tag-aware recommender systems (TRS) utilize rich tagging records to better depict user portraits and item features. Recently, many efforts have been done to improve TRS with neural networks. However, these solutions rustically rely on the tag-based features for recommendation, which is insufficient to ease the sparsity, ambiguity and redundancy issues introduced by tags, thus hindering the recommendation performance. In this paper, we propose a novel tag-aware recommendation model named Tag Graph Convolutional Network (TGCN), which leverages the contextual semantics of multi-hop neighbors in the user-tag-item graph to alleviate the above issues. Specifically, TGCN first employs type-aware neighbor sampling and aggregation operation to learn the type-specific neighborhood representations. Then we leverage attention mechanism to discriminate the importance of different node types and creatively employ Convolutional Neural Network (CNN) as type-level aggregator to perform vertical and horizontal convolutions for modeling multi-granular feature interactions. Besides, a TransTag regularization function is proposed to accurately identify user's substantive preference. Extensive experiments on three public datasets and a real industrial dataset show that TGCN significantly outperforms state-of-the-art baselines for tag-aware top-N recommendation.
NumClaim: Investor's Fine-grained Claim Detection
Authors: Chung-Chi Chen, Hen-Hsen Huang, Hsin-Hsi Chen
Venue: CIKM
Year: 2020

The goal of claim detection in argument mining is to sort out the key points from a long narrative. In this paper, we design a novel task for argument mining in the financial domain, and provide an expert-annotated dataset, NumClaim, for the proposed task. Based on the statistics, we discuss the differences between the claims in other datasets and the claims of the investors in NumClaim. With the ablation analysis, we show that encoding numeral and co-training with the auxiliary task of the numeral understanding, i.e., the category classification task, can improve the performance of the proposed task under different neural network architectures. The annotations in the NumClaim is published for academic usage under the CC BY-NC-SA 4.0 license.
CONE-Align: Consistent Network Alignment with Proximity-Preserving Node Embedding
Authors: Xiyuan Chen, Mark Heimann, Fatemeh Vahedian, Danai Koutra
Venue: CIKM
Year: 2020

Network alignment, the process of finding correspondences between nodes in different graphs, has many scientific and industrial applications. Existing unsupervised network alignment methods find suboptimal alignments that break up node neighborhoods, i.e. do not preserve matched neighborhood consistency. To improve this, we propose CONE-Align, which models intra-network proximity with node embeddings and uses them to match nodes across networks after aligning the embedding subspaces. Experiments on diverse, challenging datasets show that CONE-Align is robust and obtains 19.25% greater accuracy on average than the best-performing state-of-the-art graph alignment algorithm in highly noisy settings.
Graph Unfolding Networks
Authors: Hao Chen, Wenbing Huang, Yue Xu, Fuchun Sun, Zhoujun Li
Venue: CIKM
Year: 2020

The technique of recursive neighborhood aggregation has dominated the implementation of existing successful Graph Neural Networks (GNNs). However, the recursive information propagation across layers inevitably brings in extra calculations, potentially large variance, and difficulty of parallel computation. In this paper, we propose Graph Unfolding Networks (GUNets) as an alternative mechanism of recursive neighborhood aggregation for graph representation learning. Comparing to generic GNNs, our proposed GUNets are efficient, robust and practically effective. At their core, GUNets unfold the local structure of every node, i.e. the rooted tree, to a set of trajectories, and then adopt set function to capture the topology of the rooted subtree, which is more convenient for parallel computation than the recursive neighborhood aggregation process. More importantly, through a specific design of the set function, our architecture enables efficient and robust learning on large-scale graphs without resorting to any pruning of the rooted subtree that is usually necessary in generic GNNs. Extensive experiments on five large datasets (the number of nodes ranges from 104 to 106) show that our GUNets achieve comparable or even better results than current successful GNNs while gaining significantly more efficiency and lower accuracy variance. Codes can be found at github.com/GUNets/GUNets.
An Adaptive Embedding Framework for Heterogeneous Information Networks
Authors: Daoyuan Chen, Yaliang Li, Bolin Ding, Ying Shen
Venue: CIKM
Year: 2020

Heterogeneous information networks (HINs) have been ubiquitous in the real-world. HIN embeddings, which encode various information of the networks into low-dimensional vectors, can facilitate a wide range of applications on graph-structured data. Existing HIN embedding methods include random walk based methods that may not fully utilize the edge semantics and knowledge graph embedding methods that restrict the expression ability of topological information. In this paper, we propose a novel adaptive embedding framework, which integrates these two kinds of methods to preserve both topological information and relational information. By incorporating an assistant knowledge graph embedding model, the proposed framework performs efficient biased random walk under the guidance of edge semantics.
Generative Adversarial Attributed Network Anomaly Detection
Authors: Zhenxing Chen, Bo Liu, Meiqing Wang, Peng Dai, Jun Lv, Liefeng Bo
Venue: CIKM
Year: 2020

Anomaly detection is a useful technique in many applications such as network security and fraud detection. Due to the insufficiency of anomaly samples as training data, it is usually formulated as an unsupervised model learning problem. In recent years there is a surge of adopting graph data structure in numerous applications. Detecting anomaly in an attributed network is more challenging than the sample based task because of the sample information representations in the form of graph nodes and edges. In this paper, we propose a generative adversarial attributed network (GAAN) anomaly detection framework. The fake graph nodes are generated by a generator module with Gaussian noise as input. An encoder module is employed to map both real and fake graph nodes into a latent space. To encode the graph structure information into the node latent representation, we compute the sample covariance matrix for real nodes and fake nodes respectively. A discriminator is trained to recognize whether two connected nodes are from the real or fake graph. With the learned encoder module output, an anomaly evaluation measurement considering the sample reconstruction error and real-sample identification confidence is employed to make prediction. We conduct extensive experiments on benchmark datasets and compare with state-of-the-art attributed graph anomaly detection methods. The superior AUC score demonstrates the effectiveness of the proposed method.
Nebula: A Scalable Privacy-Preserving Machine Learning System in Ant Financial
Authors: Cen Chen, Bingzhe Wu, Li Wang, Chaochao Chen, Jin Tan, Lei Wang, Jun Zhou, Benyu Zhang
Venue: CIKM
Year: 2020

With the rapid growth of data volume, data-driven machine learning models have become a necessary part of many industrial applications. Intuitively, the more high-quality data used for training leads to better model performance. However, in reality, data are usually scattered and isolated in different organizations or companies. Such a "data isolation" problem stimulates both academia and industry to explore the collaborative learning paradigm to build better models jointly with multiple data sources. Despite the potential performance gains, this learning paradigm inevitably faces privacy issues, especially for the Fintech domain where data are sensitive by nature. In this paper, we present a privacy-preserving collaborative learning system in Ant Financial, named Nebula. Our system aims to facilitate privacy-preserving collaborative model training for industrial-scale applications. Our system is built upon a ring-allreduce MPI based distributed framework. On top of that, with some optimization strategies and novel sharing scheme, our system is able to scale up to tens of millions of data samples with hundreds of thousands of features and achieve more than 100x speedup compared with the existing state-of-the-art implementations.
Label-Aware Graph Convolutional Networks
Authors: Hao Chen, Yue Xu, Feiran Huang, Zengde Deng, Wenbing Huang, Senzhang Wang, Peng He, Zhoujun Li
Venue: CIKM
Year: 2020

Recent advances in Graph Convolutional Networks (GCNs) have led to state-of-the-art performance on various graph-related tasks. However, most existing GCN models do not explicitly identify whether all the aggregated neighbors are valuable to the learning tasks, which may harm the learning performance. In this paper, we consider the problem of node classification and propose the Label-Aware Graph Convolutional Network (LAGCN) framework which can directly identify valuable neighbors to enhance the performance of existing GCN models. Our contribution is three-fold. First, we propose a label-aware edge classifier that can filter distracting neighbors and add valuable neighbors for each node to refine the original graph into a label-aware (LA) graph. Existing GCN models can directly learn from the LA graph to improve the performance without changing their model architectures. Second, we introduce the concept of positive ratio to evaluate the density of valuable neighbors in the LA graph. Theoretical analysis reveals that using the edge classifier to increase the positive ratio can improve the learning performance of existing GCN models. Third, we conduct extensive node classification experiments on benchmark datasets. The results verify that LAGCN can improve the performance of existing GCN models considerably, in terms of node classification.
IDEAL: IDEntifying the User's IdeAL Tuple via Sorting in the Database
Authors: Chen Chen, Jiping Zheng, Weijun Yan, Meijing Wang
Venue: CIKM
Year: 2020

Beyond top-k and skyline queries, in the last decade regret minimization queries have played an important role in the database community to solve multi-criteria decision making problems. To reduce the user's regret, interaction is proved to be an efficient way to turn the user's regret ratio to 0, i.e. identifying the user's ideal point from the large dataset. However, existing interactive regret minimization framework needs more rounds of user's interaction to identify her/his ideal point. To reduce the number of interaction rounds, we propose a system, called IDEAL, IDE ntifying the user's ideAL tuple via sorting in the database. In our system, we use the National Basketball Association (NBA) dataset to show our interactive framework via sorting mechanism, which can make the regret minimization query quickly converge to the user's ideal data point from initial displayed several points with few rounds of the user's interaction.
Neural Bayesian Information Processing
Authors: Jen-Tzung Chien
Venue: CIKM
Year: 2020

Deep learning is developed as a learning process from source inputs to target outputs where the inference or optimization is performed over an assumed deterministic model with deep structure. A wide range of temporal and spatial data in language and vision are treated as the inputs or outputs to build such a complicated mapping in different information systems. A systematic and elaborate transfer is required to meet the mapping between source and target domains. Also, the semantic structure in natural language and computer vision may not be well represented or trained in mathematical logic or computer programs. The distribution function in discrete or continuous latent variable model for words, sentences, images or videos may not be properly decomposed or estimated. The system robustness to heterogeneous environments may not be assured. This tutorial addresses the fundamentals and advances in statistical models and neural networks, and presents a series of deep Bayesian solutions including variational Bayes, sampling method, Bayesian neural network, variational auto-encoder (VAE), stochastic recurrent neural network, sequence-to-sequence model, attention mechanism, end-to-end network, stochastic temporal convolutional network, temporal difference VAE, normalizing flow and neural ordinary differential equation. Enhancing the prior/posterior representation is addressed in different latent variable models. We illustrate how these models are connected and why they work for a variety of applications on complex patterns in language and vision. The word, sentence and image embeddings are merged with semantic constraint or structural information. Bayesian learning is formulated in the optimization procedure where the posterior collapse is tackled. An informative latent space is trained to incorporate deep Bayesian learning in various information systems.
Product Quality Prediction with Convolutional Encoder-Decoder Architecture and Transfer Learning
Authors: Hao-Yi Chih, Yao-Chung Fan, Wen-Chih Peng, Hai-Yuan Kuo
Venue: CIKM
Year: 2020

Mining data collected from industrial manufacturing process plays an important role for intelligent manufacturing in Industry 4.0. In this paper, we propose a deep convolutional model for predicting wafer fabrication quality in an intelligent integrated-circuit manufacturing application. The wafer fabrication quality prediction is motivated by the need for improving product line efficiency and reducing manufacturing cost by detecting potential defective work-in-process (WIP) wafers. This work considers the following two crucial data characteristics for wafer fabrication. First, our model is designed to learn spatial correlation between quality measurements on WIP wafers and fabrication results through an encoder-decoder neural network. Second, we leverage the fact that different products share the same raw manufacturing process to enable the knowledge transferring between prediction models of different products. Performance evaluation on real data sets is conducted to validate the strengths of our model on quality prediction, model interpretability, and feasibility of transferring knowledge.
Joint Estimation of User And Publisher Credibility for Fake News Detection
Authors: Rajdipa Chowdhury, Sriram Srinivasan, Lise Getoor
Venue: CIKM
Year: 2020

Fast propagation, ease-of-access, and low cost have made social media an increasingly popular means for news consumption. However, this has also led to an increase in the preponderance of fake news. Widespread propagation of fake news can be detrimental to society, and this has created enormous interest in fake news detection on social media. Many approaches to fake news detection use the news content, social context, or both. In this work, we look at fake news detection as a problem of estimating the credibility of both the news publishers and users that propagate news articles. We introduce a new approach called the credibility score-based model that can jointly infer fake news and credibility scores for publishers and users. We use a state-of-the-art statistical relational learning framework called probabilistic soft logic to perform this joint inference effectively. We show that our approach is accurate at both fake news detection and inferring credibility scores. Further, our model can easily integrate any auxiliary information that can aid in fake news detection. Using the FakeNewsNet dataset, we show that our approach significantly outperforms previous approaches at fake news detection by up to 10% in recall and 4% in accuracy. Furthermore, the credibility scores learned for both publishers and users are representative of their true behavior.
Offline Evaluation by Maximum Similarity to an Ideal Ranking
Authors: Charles L. A. Clarke, Mark D. Smucker, Alexandra Vtyurina
Venue: CIKM
Year: 2020

NDCG and similar measures remain standard for the offline evaluation of search, recommendation, question answering and similar systems. These measures require definitions for two or more relevance levels, which human assessors then apply to judge individual documents. Due to this dependence on a definition of relevance, it can be difficult to extend these measures to account for factors beyond relevance. Rather than propose extensions to these measures, we instead propose a radical simplification to replace them. For each query, we define a set of ideal rankings and compute the maximum rank similarity between members of this set and an actual ranking generated by a system. This maximum similarity to an ideal ranking becomes our effectiveness measure, replacing NDCG and similar measures. We propose rank biased overlap (RBO) to compute this rank similarity, since it was specifically created to address the requirements of rank similarity between search results. As examples, we explore ideal rankings that account for document length, diversity, and correctness.
Event-QA: A Dataset for Event-Centric Question Answering over Knowledge Graphs
Authors: Tarcísio Souza Costa, Simon Gottschalk, Elena Demidova
Venue: CIKM
Year: 2020

Semantic Question Answering (QA) is a crucial technology to facilitate intuitive user access to semantic information stored in knowledge graphs. Whereas most of the existing QA systems and datasets focus on entity-centric questions, very little is known about these systems' performance in the context of events. As new event-centric knowledge graphs emerge, datasets for such questions gain importance. In this paper, we present the Event-QA dataset for answering event-centric questions over knowledge graphs. Event-QA contains 1000 semantic queries and the corresponding English, German and Portuguese verbalizations for EventKG - an event-centric knowledge graph with more than 970 thousand events.
U-rank: Utility-oriented Learning to Rank with Implicit Feedback
Authors: Xinyi Dai, Jiawei Hou, Qing Liu, Yunjia Xi, Ruiming Tang, Weinan Zhang, Xiuqiang He, Jun Wang, Yong Yu
Venue: CIKM
Year: 2020

Learning to rank with implicit feedback is one of the most important tasks in many real-world information systems where the objective is some specific utility, e.g., clicks and revenue. However, we point out that existing methods based on probabilistic ranking principle do not necessarily achieve the highest utility. To this end, we propose a novel ranking framework called U-rank that directly optimizes the expected utility of the ranking list. With a position-aware deep click-through rate prediction model, we address the attention bias considering both query-level and item-level features. Due to the item-specific attention bias modeling, the optimization for expected utility corresponds to a maximum weight matching on the item-position bipartite graph. We base the optimization of this objective in an efficient Lambdaloss framework, which is supported by both theoretical and empirical analysis. We conduct extensive experiments for both web search and recommender systems over three benchmark datasets and two proprietary datasets, where the performance gain of U-rank over state-of-the-arts is demonstrated. Moreover, our proposed U-rank has been deployed on a large-scale commercial recommender and a large improvement over the production baseline has been observed in an online A/B testing.
EPNet: Learning to Exit with Flexible Multi-Branch Network
Authors: Xin Dai, Xiangnan Kong, Tian Guo
Venue: CIKM
Year: 2020

Dynamic inference is an emerging technique that reduces the computational cost of deep neural network under resource-constrained scenarios, such as inference on mobile devices. One way to achieve dynamic inference is to leverage multi-branch neural networks that apply different computation on input data by following different branches. Conventional research on multi-branch neural networks mainly targeted at improving the accuracy of each branch, and use manually designed rules to decide which input follows which branch of the network. Furthermore, these networks often provide a small number of exits, limiting their ability to adapt to external changes. In this paper, we investigate the problem of designing a flexible multi-branch network and early-exiting policies that can adapt to the resource consumption to individual inference request without impacting the inference accuracy. We propose a lightweight branch structure that also provides fine-grained flexibility for early-exiting and leverage Markov decision process (MDP) to automatically learn the early-exiting policies. Our proposed model, EPNet, was effective in reducing inference cost without impacting accuracy by choosing the most suitable branch exit. We also observe that EPNet achieved 3% higher accuracy with an inference budget, compared to state-of-the-art approaches.
Improving Anchor-based Explanations
Authors: Julien Delaunay, Luis Galárraga, Christine Largouët
Venue: CIKM
Year: 2020

Rule-based explanations are a popular method to understand the rationale behind the answers of complex machine learning (ML) classifiers. Recent approaches, such as Anchors, focus on local explanations based on if-then rules that are applicable in the vicinity of a target instance. This has proved effective at producing faithful explanations, yet anchor-based explanations are not free of limitations. These include long overly specific rules as well as explanations of low fidelity. This work presents two simple methods that can mitigate such issues on tabular and textual data. The first approach proposes a careful selection of the discretization method for numerical attributes in tabular datasets. The second one applies the notion of pertinent negatives to explanations on textual data. Our experimental evaluation shows the positive impact of such methods on the quality of anchor-based explanations.
Cola-GNN: Cross-location Attention based Graph Neural Networks for Long-term ILI Prediction
Authors: Songgaojun Deng, Shusen Wang, Huzefa Rangwala, Lijing Wang, Yue Ning
Venue: CIKM
Year: 2020

Forecasting influenza-like illness (ILI) is of prime importance to epidemiologists and health-care providers. Early prediction of epidemic outbreaks plays a pivotal role in disease intervention and control. Most existing work has either limited long-term prediction performance or fails to capture spatio-temporal dependencies in data. In this paper, we design a cross-location attention based graph neural network (Cola-GNN) for learning time series embeddings in long-term ILI predictions. We propose a graph message passing framework to combine graph structures (e.g., geolocations) and time-series features (e.g., temporal sequences) in a dynamic propagation process. We compare the proposed method with state-of-the-art statistical approaches and deep learning models. We conducted a set of extensive experiments on real-world epidemic-related datasets from the United States and Japan. The proposed method demonstrated strong predictive performance and leads to interpretable results for long-term epidemic predictions.