Open Access. Powered by Scholars. Published by Universities.®

Databases and Information Systems Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 10 of 10

Full-Text Articles in Databases and Information Systems

Representation Learning On Multi-Layered Heterogeneous Network, Delvin Ce Zhang, Hady W. Lauw Nov 2021

Representation Learning On Multi-Layered Heterogeneous Network, Delvin Ce Zhang, Hady W. Lauw

Research Collection School Of Computing and Information Systems

Network data can often be represented in a multi-layered structure with rich semantics. One example is e-commerce data, containing user-user social network layer and item-item context layer, with cross-layer user-item interactions. Given the dual characters of homogeneity within each layer and heterogeneity across layers, we seek to learn node representations from such a multi-layered heterogeneous network while jointly preserving structural information and network semantics. In contrast, previous works on network embedding mainly focus on single-layered or homogeneous networks with one type of nodes and links. In this paper we propose intra- and cross-layer proximity concepts. Intra-layer proximity simulates propagation along …


Holistic Prediction For Public Transport Crowd Flows: A Spatio Dynamic Graph Network Approach, Bingjie He, Shukai Li, Chen Zhang, Baihua Zheng, Fugee Tsung Sep 2021

Holistic Prediction For Public Transport Crowd Flows: A Spatio Dynamic Graph Network Approach, Bingjie He, Shukai Li, Chen Zhang, Baihua Zheng, Fugee Tsung

Research Collection School Of Computing and Information Systems

This paper targets at predicting public transport in-out crowd flows of different regions together with transit flows between them in a city. The main challenge is the complex dynamic spatial correlation of crowd flows of different regions and origin-destination (OD) paths. Different from road traffic flows whose spatial correlations mainly depend on geographical distance, public transport crowd flows significantly relate to the region’s functionality and connectivity in the public transport network. Furthermore, influenced by commuters’ time-varying travel patterns, the spatial correlations change over time. Though there exist many works focusing on either predicting in-out flows or OD transit flows of …


The 4th Workshop On Heterogeneous Information Network Analysis And Applications (Hena 2021), Chuan Shi, Yuan Fang, Yanfang Ye, Jiawei Zhang Aug 2021

The 4th Workshop On Heterogeneous Information Network Analysis And Applications (Hena 2021), Chuan Shi, Yuan Fang, Yanfang Ye, Jiawei Zhang

Research Collection School Of Computing and Information Systems

The 4th Workshop on Heterogeneous Information Network Analysis and Applications (HENA 2021) is co-located with the 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. The goal of this workshop is to bring together researchers and practitioners in the field and provide a forum for sharing new techniques and applications in heterogeneous information network analysis. This workshop has an exciting program that spans a number of subtopics, such as heterogeneous network embedding and graph neural networks, data mining techniques on heterogeneous information networks, and applications of heterogeneous information network analysis. The workshop program includes several invited speakers, lively discussion …


Forecasting Interaction Order On Temporal Graphs, Wenwen Xia, Yuchen Li, Jianwei Tian, Shenghong Li Aug 2021

Forecasting Interaction Order On Temporal Graphs, Wenwen Xia, Yuchen Li, Jianwei Tian, Shenghong Li

Research Collection School Of Computing and Information Systems

Link prediction is a fundamental task for graph analysis and the topic has been studied extensively for static or dynamic graphs. Essentially, the link prediction is formulated as a binary classification problem about two nodes. However, for temporal graphs, links (or interactions) among node sets appear in sequential orders. And the orders may lead to interesting applications. While a binary link prediction formulation fails to handle such an order-sensitive case. In this paper, we focus on such an interaction order prediction (IOP) problem among a given node set on temporal graphs. For the technical aspect, we develop a graph neural …


Multi-View Collaborative Network Embedding, Sezin Kircali Ata, Yuan Fang, Min Wu, Jiaqi Shi, Chee Keong Kwoh, Xiaoli Li Jun 2021

Multi-View Collaborative Network Embedding, Sezin Kircali Ata, Yuan Fang, Min Wu, Jiaqi Shi, Chee Keong Kwoh, Xiaoli Li

Research Collection School Of Computing and Information Systems

Real-world networks often exist with multiple views, where each view describes one type of interaction among a common set of nodes. For example, on a video-sharing network, while two user nodes are linked, if they have common favorite videos in one view, then they can also be linked in another view if they share common subscribers. Unlike traditional single-view networks, multiple views maintain different semantics to complement each other. In this article, we propose Multi-view collAborative Network Embedding (MANE), a multi-view network embedding approach to learn low-dimensional representations. Similar to existing studies, MANE hinges on diversity and collaboration—while diversity enables …


Learning Network-Based Multi-Modal Mobile User Interface Embeddings, Gary Ang, Ee-Peng Lim Apr 2021

Learning Network-Based Multi-Modal Mobile User Interface Embeddings, Gary Ang, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Rich multi-modal information - text, code, images, categorical and numerical data - co-exist in the user interface (UI) design of mobile applications. UI designs are composed of UI entities supporting different functions which together enable the application. To support effective search and recommendation applications over mobile UIs, we need to be able to learn UI representations that integrate latent semantics. In this paper, we propose a novel unsupervised model - Multi-modal Attention-based Attributed Network Embedding (MAAN) model. MAAN is designed to capture both multi-modal and structural network information. Based on the encoder-decoder framework, MAAN aims to learn UI representations that …


Deepis: Susceptibility Estimation On Social Networks, Wenwen Xia, Yuchen Li, Jun Wu, Shenghong Li Mar 2021

Deepis: Susceptibility Estimation On Social Networks, Wenwen Xia, Yuchen Li, Jun Wu, Shenghong Li

Research Collection School Of Computing and Information Systems

Influence diffusion estimation is a crucial problem in social network analysis. Most prior works mainly focus on predicting the total influence spread, i.e., the expected number of influenced nodes given an initial set of active nodes (aka. seeds). However, accurate estimation of susceptibility, i.e., the probability of being influenced for each individual, is more appealing and valuable in real-world applications. Previous methods generally adopt Monte Carlo simulation or heuristic rules to estimate the influence, resulting in high computational cost or unsatisfactory estimation error when these methods are used to estimate susceptibility. In this work, we propose to leverage graph neural …


Learning To Pre-Train Graph Neural Networks, Yuanfu Lu, Xunqiang Jiang, Yuan Fang, Chuan Shi Feb 2021

Learning To Pre-Train Graph Neural Networks, Yuanfu Lu, Xunqiang Jiang, Yuan Fang, Chuan Shi

Research Collection School Of Computing and Information Systems

Graph neural networks (GNNs) have become the de facto standard for representation learning on graphs, which derive effective node representations by recursively aggregating information from graph neighborhoods. While GNNs can be trained from scratch, pre-training GNNs to learn transferable knowledge for downstream tasks has recently been demonstrated to improve the state of the art. However, conventional GNN pre-training methods follow a two-step paradigm: 1) pre-training on abundant unlabeled data and 2) fine-tuning on downstream labeled data, between which there exists a significant gap due to the divergence of optimization objectives in the two steps. In this paper, we conduct an …


Unsupervised Representation Learning By Predicting Random Distances, Hu Wang, Guansong Pang, Chunhua Shen, Congbo Ma Jan 2021

Unsupervised Representation Learning By Predicting Random Distances, Hu Wang, Guansong Pang, Chunhua Shen, Congbo Ma

Research Collection School Of Computing and Information Systems

Deep neural networks have gained great success in a broad range of tasks due to its remarkable capability to learn semantically rich features from high-dimensional data. However, they often require large-scale labelled data to successfully learn such features, which significantly hinders their adaption in unsupervised learning tasks, such as anomaly detection and clustering, and limits their applications to critical domains where obtaining massive labelled data is prohibitively expensive. To enable unsupervised learning on those domains, in this work we propose to learn features without using any labelled data by training neural networks to predict data distances in a randomly projected …


Technical Q8a Site Answer Recommendation Via Question Boosting, Zhipeng Gao, Xin Xia, David Lo, John Grundy Jan 2021

Technical Q8a Site Answer Recommendation Via Question Boosting, Zhipeng Gao, Xin Xia, David Lo, John Grundy

Research Collection School Of Computing and Information Systems

Software developers have heavily used online question and answer platforms to seek help to solve their technical problems. However, a major problem with these technical Q&A sites is "answer hungriness" i.e., a large number of questions remain unanswered or unresolved, and users have to wait for a long time or painstakingly go through the provided answers with various levels of quality. To alleviate this time-consuming problem, we propose a novel DeepAns neural network-based approach to identify the most relevant answer among a set of answer candidates. Our approach follows a three-stage process: question boosting, label establishment, and answer recommendation. Given …