5 citations · 11 across the 5 of their papers we have counts for
5 papers · 1 filter
Efficiently Finding a Maximal Clique Summary via Effective Sampling
Xiaofan Li, Rui Zhou, Lu Chen +3
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and is used in many applications, such as social network analysis, bioinformatics, intelligent agent syste…
Index-based Solutions for Efficient Density Peak Clustering
Zafaryab Rasool, Rui Zhou, Lu Chen +2
Density Peak Clustering (DPC), a popular density-based clustering approach, has received considerable attention from the research community primarily due to its simplicity and fewe…
Finding Effective Geo-Social Group for Impromptu Activity with Multiple Demands
Lu Chen, Chengfei Liu, Rui Zhou +2
Geo-social group search aims to find a group of people proximate to a location while socially related. One of the driven applications for geo-social group search is organizing an i…
Query-driven Frequent Co-occurring Term Extraction over Relational Data using MapReduce
Jianxin Li, Chengfei Liu, Liang Yao +2
In this paper we study how to efficiently compute \textit{frequent co-occurring terms} (FCT) in the results of a keyword query in parallel using the popular MapReduce framework. Ta…
Quasi-SLCA based Keyword Query Processing over Probabilistic XML Data
Jianxin Li, Chengfei Liu, Rui Zhou +1
The probabilistic threshold query is one of the most common queries in uncertain databases, where a result satisfying the query must be also with probability meeting the threshold…