31 citations · 62 across the 14 of their papers we have counts for
14 papers
CHIEF: Clustering with Higher-order Motifs in Big Networks
Feng Xia, Shuo Yu, Chengfei Liu +1
Clustering a group of vertices in networks facilitates applications across different domains, such as social computing and Internet of Things. However, challenges arises for cluste…
Reliable Community Search in Dynamic Networks
Yifu Tang, Jianxin Li, Nur Al Hasan Haldar +3
Searching for local communities is an important research problem that supports advanced data analysis in various complex networks, such as social networks, collaboration networks,…
Searching Personalized -wing in Large and Dynamic Bipartite Graphs
Aman Abidi, Lu Chen, Rui Zhou +1
There are extensive studies focusing on the application scenario that all the bipartite cohesive subgraphs need to be discovered in a bipartite graph. However, we observe that, for…
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…
Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs
Lu Chen, Chengfei Liu, Rui Zhou +2
Given a bipartite graph, the maximum balanced biclique (\textsf{MBB}) problem, discovering a mutually connected while equal-sized disjoint sets with the maximum cardinality, plays…
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…