15 citations · 30 across the 6 of their papers we have counts for
6 papers
EntropyStop: Unsupervised Deep Outlier Detection with Loss Entropy
Yihong Huang, Yuang Zhang, Liping Wang +2
Unsupervised Outlier Detection (UOD) is an important data mining task. With the advance of deep learning, deep Outlier Detection (OD) has received broad interest. Most deep UOD mod…
GPUSCAN:Efficient Structural Graph Clustering on GPUs
Long Yuan, Zeyu Zhou, Xuemin Lin +3
Structural clustering is one of the most popular graph clustering methods, which has achieved great performance improvement by utilizing GPUs. Even though, the state-of-the-art GPU…
Minimizing the Influence of Misinformation via Vertex Blocking
Jiadong Xie, Fan Zhang, Kai Wang +2
Information cascade in online social networks can be rather negative, e.g., the spread of rumors may trigger panic. To limit the influence of misinformation in an effective and eff…
Unsupervised Graph Outlier Detection: Problem Revisit, New Insight, and Superior Method
Yihong Huang, Liping Wang, Fan Zhang +1
A large number of studies on Graph Outlier Detection (GOD) have emerged in recent years due to its wide applications, in which Unsupervised Node Outlier Detection (UNOD) on attribu…
Towards User Engagement Dynamics in Social Networks
Qingyuan Linghu, Fan Zhang, Xuemin Lin +2
The engagement of each user in a social network is an essential indicator for maintaining a sustainable service. Existing studies use the of a user to well estimate its…
When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks
Fan Zhang, Ying Zhang, Lu Qin +2
In this paper, we investigate the problem of (k,r)-core which intends to find cohesive subgraphs on social networks considering both user engagement and similarity perspectives. In…