23 citations · 25 across the 3 of their papers we have counts for
6 papers
Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks
Ye Wang, Qing Wang, Henning Koehler +1
Computing shortest paths is a fundamental operation in processing graph data. In many real-world applications, discovering shortest paths between two vertices empowers us to make f…
Efficient Maintenance of Distance Labelling for Incremental Updates in Large Dynamic Graphs
Muhammad Farhan, Qing Wang
Finding the shortest path distance between an arbitrary pair of vertices is a fundamental problem in graph theory. A tremendous amount of research has been successfully attempted o…
ErGAN: Generative Adversarial Networks for Entity Resolution
Jingyu Shao, Qing Wang, Asiri Wijesinghe +1
Entity resolution targets at identifying records that represent the same real-world entity from one or more datasets. A major challenge in learning-based entity resolution is how t…
A Highly Scalable Labelling Approach for Exact Distance Queries in Complex Networks
Muhammad Farhan, Qing Wang, Yu Lin +1
Answering exact shortest path distance queries is a fundamental task in graph theory. Despite a tremendous amount of research on the subject, there is still no satisfactory solutio…
Developing a Temporal Bibliographic Data Set for Entity Resolution
Yichen Hu, Qing Wang, Peter Christen
Entity resolution is the process of identifying groups of records within or across data sets where each group represents a real-world entity. Novel techniques that consider tempora…
Skyblocking for Entity Resolution
Jingyu Shao, Qing Wang, Yu Lin
In this paper, for the first time, we introduce the concept of skyblocking, which aims to efficiently identify the "most preferred" blocking scheme in terms of a given set of selec…