Titlebook: Databases Theory and Applications; 31st Australasian Da Renata Borovica-Gajic,Jianzhong Qi,Weiqing Wang Conference proceedings 2020 Springe

親密

Luis Enjuanes,Stuart G. Siddell,Willy Spaannetwork structure and the additional attributes information for nodes. DEFINE transforms them into low-dimensional vector spaces while preserving the inherent properties of the friendship network. Experimental results on real-world friendship network datasets illustrate that DEFINE outperforms other

crucial

誘騙

Research and Practice in Applied Linguisticsinally, we construct an index to search communities efficiently for queries. Extensive experiments demonstrate the efficiency and effectiveness of our proposed solution in directed graphs, based on heterogeneous social networks.

iodides

Jun Pan,Billy Tak Ming Wong,Honghua Wangthe Web service networks constructed in our previous works. We evaluate the models with respect to the precision with which they unpack specific topological properties of the networks. We investigate the influence of each topological property on the accuracy of the prediction task. We conduct our ex

BABY

Efficient ,NN Search with Occupation in Large-Scale On-demand Ride-Hailingpied and non-occupied moving objects. Accordingly, we propose an efficient grid-based expand-and-bound algorithm for the approachable .NN search and conduct extensive experiments on real-world data. The results demonstrate the effectiveness and efficiency of our proposed solutions.

種子

Approximate Fault Tolerance for Sensor Stream Processinging a multivariate gaussian distribution, and reduces backup data if we can recover such data from the partial backup data and the probabilistic model. In this paper, we focus on average, sum, max, and min queries and propose a greedy-based backup selection algorithm. We evaluate the validity and ef

infelicitous

DEFINE: Friendship Detection Based on Node Enhancementnetwork structure and the additional attributes information for nodes. DEFINE transforms them into low-dimensional vector spaces while preserving the inherent properties of the friendship network. Experimental results on real-world friendship network datasets illustrate that DEFINE outperforms other

美食家

Semi-supervised Cross-Modal Hashing with Graph Convolutional Networks asymmetric graph convolutional layers, which employ randomly sampled anchors to tackle the scalability and out-of-sample issue in graph learning, and reduce the complexity of cross-modal similarity calculation. Extensive experiments conducted on benchmark datasets demonstrate that our method can ac

新娘

Effective and Efficient Community Search in Directed Graphs Across Heterogeneous Social Networksinally, we construct an index to search communities efficiently for queries. Extensive experiments demonstrate the efficiency and effectiveness of our proposed solution in directed graphs, based on heterogeneous social networks.

臥虎藏龍

Evaluating Random Walk-Based Network Embeddings for Web Service Applicationsthe Web service networks constructed in our previous works. We evaluate the models with respect to the precision with which they unpack specific topological properties of the networks. We investigate the influence of each topological property on the accuracy of the prediction task. We conduct our ex