97 citations · 217 across the 21 of their papers we have counts for
21 papers
Efficient Approximate Nearest Neighbor Search under Multi-Attribute Range Filter
Yuanhang Yu, Dawei Cheng, Ying Zhang +3
Nearest neighbor search on high-dimensional vectors is fundamental in modern AI and database systems. In many real-world applications, queries involve constraints on multiple numer…
Query2GMM: Learning Representation with Gaussian Mixture Model for Reasoning over Knowledge Graphs
Yuhan Wu, Yuanyuan Xu, Wenjie Zhang +2
Logical query answering over Knowledge Graphs (KGs) is a fundamental yet complex task. A promising approach to achieve this is to embed queries and entities jointly into the same e…
Reinforcement Learning Based Query Vertex Ordering Model for Subgraph Matching
Hanchen Wang, Ying Zhang, Lu Qin +3
Subgraph matching is a fundamental problem in various fields that use graph structured data. Subgraph matching algorithms enumerate all isomorphic embeddings of a query graph q in…
Towards User Engagement Dynamics in Social Networks
Qingyuan Linghu, Fan Zhang, Xuemin Lin +2
The engagement of each user in a social network is an essential indicator for maintaining a sustainable service. Existing studies use the of a user to well estimate its…
Efficient and Effective Community Search on Large-scale Bipartite Graphs
Kai Wang, Wenjie Zhang, Xuemin Lin +3
Bipartite graphs are widely used to model relationships between two types of entities. Community search retrieves densely connected subgraphs containing a query vertex, which has b…
Exploring Cohesive Subgraphs with Vertex Engagement and Tie Strength in Bipartite Graphs
Yizhang He, Kai Wang, Wenjie Zhang +2
We propose a novel cohesive subgraph model called -strengthened -core (denoted as -core), which is the first to consider both tie strength and vertex engagement…
AOT: Pushing the Efficiency Boundary of Main-memory Triangle Listing
Michael Yu, Lu Qin, Ying Zhang +2
Triangle listing is an important topic significant in many practical applications. Efficient algorithms exist for the task of triangle listing. Recent algorithms leverage an orient…
Efficient Matrix Factorization on Heterogeneous CPU-GPU Systems
Yuanhang Yu, Dong Wen, Ying Zhang +3
Matrix Factorization (MF) has been widely applied in machine learning and data mining. A large number of algorithms have been studied to factorize matrices. Among them, stochastic…
GoGNN: Graph of Graphs Neural Network for Predicting Structured Entity Interactions
Hanchen Wang, Defu Lian, Ying Zhang +2
Entity interaction prediction is essential in many important applications such as chemistry, biology, material science, and medical science. The problem becomes quite challenging w…
Binarized Graph Neural Network
Hanchen Wang, Defu Lian, Ying Zhang +4
Recently, there have been some breakthroughs in graph analysis by applying the graph neural networks (GNNs) following a neighborhood aggregation scheme, which demonstrate outstandi…
Graph3S: A Simple, Speedy and Scalable Distributed Graph Processing System
Xubo Wang, Lu Qin, Lijun Chang +3
Graph is a ubiquitous structure in many domains. The rapidly increasing data volume calls for efficient and scalable graph data processing. In recent years, designing distributed g…
Efficient Bitruss Decomposition for Large-scale Bipartite Graphs
Kai Wang, Xuemin Lin, Lu Qin +2
Cohesive subgraph mining in bipartite graphs becomes a popular research topic recently. An important structure k-bitruss is the maximal cohesive subgraph where each edge is contain…
A Survey and Experimental Analysis of Distributed Subgraph Matching
Longbin Lai, Zhu Qing, Zhengyi Yang +10
Recently there emerge many distributed algorithms that aim at solving subgraph matching at scale. Existing algorithm-level comparisons failed to provide a systematic view to the pr…
Efficient Butterfly Counting for Large Bipartite Networks
Kai Wang, Xuemin Lin, Lu Qin +2
Bipartite networks are of great importance in many real-world applications. In bipartite networks, butterfly (i.e., a complete 2 x 2 biclique) is the smallest non-trivial cohesive…
Efficient and High-Quality Seeded Graph Matching: Employing High Order Structural Information
Haida Zhang, Zengfeng Huang, Xuemin Lin +3
Driven by many real applications, we study the problem of seeded graph matching. Given two graphs and , and a small set of pre-matched node…
Online Product Quantization
Donna Xu, Ivor W. Tsang, Ying Zhang
Approximate nearest neighbor (ANN) search has achieved great success in many tasks. However, existing popular methods for ANN search, such as hashing and quantization methods, are…
Enumerating k-Vertex Connected Components in Large Graphs
Dong Wen, Lu Qin, Xuemin Lin +2
Cohesive subgraph detection is an important graph problem that is widely applied in many application domains, such as social community detection, network visualization, and network…
When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks
Fan Zhang, Ying Zhang, Lu Qin +2
In this paper, we investigate the problem of (k,r)-core which intends to find cohesive subgraphs on social networks considering both user engagement and similarity perspectives. In…
Top-k Spatial-keyword Publish/Subscribe Over Sliding Window
Xiang Wang, Ying Zhang, Wenjie Zhang +2
With the prevalence of social media and GPS-enabled devices, a massive amount of geo-textual data has been generated in a stream fashion, leading to a variety of applications such…
Approximate Nearest Neighbor Search on High Dimensional Data --- Experiments, Analyses, and Improvement (v1.0)
Wen Li, Ying Zhang, Yifang Sun +3
Approximate Nearest neighbor search (ANNS) is fundamental and essential operation in applications from many domains, such as databases, machine learning, multimedia, and computer v…
I/O Efficient Core Graph Decomposition at Web Scale
Dong Wen, Lu Qin, Ying Zhang +2
Core decomposition is a fundamental graph problem with a large number of applications. Most existing approaches for core decomposition assume that the graph is kept in memory of a…