33 citations · 33 across the 5 of their papers we have counts for
5 papers
Parallel Higher-order Truss Decomposition
Chen Chen, Jingya Qian, Hui Luo +2
The k-truss model is one of the most important models in cohesive subgraph analysis. The k-truss decomposition problem is to compute the trussness of each edge in a given graph, an…
Efficient Processing of k-regret Minimization Queries with Theoretical Guarantees
Jiping Zheng, Qi Dong, Xiaoyang Wang +3
Assisting end users to identify desired results from a large dataset is an important problem for multi-criteria decision making. To address this problem, top-k and skyline queries…
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…
Efficient Top-k Vulnerable Nodes Detection in Uncertain Graphs
Dawei Cheng, Chen Chen, Xiaoyang Wang +1
Uncertain graphs have been widely used to model complex linked data in many real-world applications, such as guaranteed-loan networks and power grids, where a node or edge may be a…
Critical Edge Identification: A K-Truss Based Model
Wenjie Zhu, Mengqi Zhang, Chen Chen +3
In a social network, the strength of relationships between users can significantly affect the stability of the network. In this paper, we use the k-truss model to measure the stabi…