Jeffrey Xu Yu

Jeffrey Xu Yu

Auto-generated profile, based on publicly available information

Jeffrey Xu Yu

The Chinese University of Hong Kong, Hong Kong, China

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 October 2017 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
SHSen Hu
Sen Hu
LZLei Zou
Lei Zou
JYJeffrey Xu Yu
Jeffrey Xu Yu
HWHaixun Wang
Haixun Wang
DZDongyan Zhao
Dongyan Zhao
RDF question/answering (Q/A) allows users to ask questions in natural languages over a knowledge base represented by RDF. To answer a national language question, the existing work takes a two-stage approach: question understanding and query evaluation. Their focus is on question understanding to deal with the disambiguation of the natural language phrases. The most common technique is the joint disambiguation, which has the exponential search space. In this paper, we propose a systematic framework to answer natural language questions over RDF repository (RDF Q/A) from a graph data-driven perspective. We propose a semantic query graph to model the query intention in the natural language question in a structural way, based on which, RDF Q/A is reduced to subgraph matching problem. More importantly, we resolve the ambiguity of natural language questions at the time when matches of query are found. The cost of disambiguation is saved if there are no matching found. More specifically, we propose two different frameworks to build the semantic query graph, one is relation (edge)-first and the other one is node-first. We compare our method with some state-of-the-art RDF Q/A systems in the benchmark dataset. Extensive experiments confirm that our method not only improves the precision but also speeds up query performance greatly.

1 April 2007
Verified
Conference Paper
Closed access
BDBolin Ding
Bolin Ding
JYJeffrey Xu Yu
Jeffrey Xu Yu
SWShan Wang
Shan Wang
LQLu Qin
Lu Qin
XZXiao Zhang
Xiao Zhang
XLXuemin Lin
Xuemin Lin
It is widely realized that the integration of database and information retrieval techniques will provide users with a wide range of high quality services. In this paper, we study processing an l-keyword query, p 1 , p 1 , ..., p l , against a relational database which can be modeled as a weighted graph, G(V, E). Here V is a set of nodes (tuples) and E is a set of edges representing foreign key references between tuples. Let V i ⊆ V be a set of nodes that contain the keyword p i . We study finding top-k minimum cost connected trees that contain at least one node in every subset V i , and denote our problem as GST-k When k = 1, it is known as a minimum cost group Steiner tree problem which is NP-complete. We observe that the number of keywords, l, is small, and propose a novel parameterized solution, with l as a parameter, to find the optimal GST-1, in time complexity O(3 l n + 2 l ((l + logn)n + m)), where n and m are the numbers of nodes and edges in graph G. Our solution can handle graphs with a large number of nodes. Our GST-1 solution can be easily extended to support GST-k, which outperforms the existing GST-k solutions over both weighted undirected/directed graphs. We conducted extensive experimental studies, and report our finding.

17 June 2020 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
TCTaotao Cai
Taotao Cai
Jianxin LiJianxin Li
Jianxin Li
AMAjmal Mian
Ajmal Mian
RLRonghua Li
Ronghua Li
TSTimos Sellis
Timos Sellis
JYJeffrey Xu Yu
Jeffrey Xu Yu
Influence maximization has recently received significant attention for scheduling online campaigns or advertisements on social network platforms. However, most studies only focus on user influence via cyber interactions while ignoring their physical interactions which are also essential to gauge influence propagation. Additionally, targeted campaigns or advertisements have not received sufficient attention. To address these issues, we first devise a novel holistic influence diffusion model that takes into account both cyber and physical user interactions in an effective and practical way. Based on the new diffusion model, we formulate a new problem of holistic influence maximization, denoted as HIM query, for targeted advertisements in a spatial social network. The HIM query problem aims to find a minimum set of users whose holistic influence can cover all target users in the network, which belongs to a set covering problem. Since the HIM query problem is NP-hard, we develop a greedy baseline algorithm and then improve on this algorithm to reduce the computational cost. To deal with large networks, we also design a spatial-social index to maintain the social, spatial and textual information of users, as well as developing an index-based efficient solution. Finally, we conduct extensive experiments to validate the efficiency and effectiveness of the proposed diffusion model and developed algorithms.

1 April 2008
Verified
Conference Paper
Closed access
JCJiefeng Cheng
Jiefeng Cheng
JYJeffrey Xu Yu
Jeffrey Xu Yu
BDBolin Ding
Bolin Ding
PYPhilip S. Yu
Philip S. Yu
HWHaixun Wang
Haixun Wang
Due to rapid growth of the Internet technology and new scientific/technological advances, the number of applications that model data as graphs increases, because graphs have high expressive power to model complicated structures. The dominance of graphs in real-world applications asks for new graph data management so that users can access graph data effectively and efficiently. In this paper, we study a graph pattern matching problem over a large data graph. The problem is to find all patterns in a large data graph that match a user-given graph pattern. We propose a new two-step R-join (reachability join) algorithm with filter step and fetch step based on a cluster- based join-index with graph codes. We consider the filter step as an R-semijoin, and propose a new optimization approach by interleaving R-joins with R-semijoins. We conducted extensive performance studies, and confirm the efficiency of our proposed new approaches.

6 March 2012 in Algorithmica
Verified
Journal Article
Closed access
PDF file
LCLijun Chang
Lijun Chang
JYJeffrey Xu Yu
Jeffrey Xu Yu
LQLu Qin
Lu Qin

26 April 2012 in The VLDB Journal
Verified
Journal Article
Closed access
PDF file
LCLijun Chang
Lijun Chang
JYJeffrey Xu Yu
Jeffrey Xu Yu
LQLu Qin
Lu Qin
HCHong Cheng
Hong Cheng
MQMiao Qiao
Miao Qiao