11 citations · 33 across the 9 of their papers we have counts for
5 papers · 1 filter
Experimental Analysis and Evaluation of Cohesive Subgraph Discovery
Dahee Kim, Song Kim, Jeongseon Kim +4
Retrieving cohesive subgraphs in networks is a fundamental problem in social network analysis and graph data management. These subgraphs can be used for marketing strategies or rec…
Exploring Cohesive Subgraphs in Hypergraphs: The (k,g)-core Approach
Dahee Kim, Junghoon Kim, Sungsu Lim +1
Identifying cohesive subgraphs in hypergraphs is a fundamental problem that has received recent attention in data mining and engineering fields. Existing approaches mainly focus on…
LUEM : Local User Engagement Maximization in Networks
Junghoon Kim, Jungeun Kim, Hyun Ji Jeong +1
Understanding a social network is a fundamental problem in social network analysis because of its numerous applications. Recently, user engagement in networks has received extensiv…
Effective and Efficient Core Computation in Signed Networks
Junghoon Kim, Sungsu Lim, Jungeun Kim
With the proliferation of mobile technology and IT development, people can use social network services at any place and anytime. Among many social network mining problems, identify…
OCSM : Finding Overlapping Cohesive Subgraphs with Minimum Degree
Junghoon Kim, Sungsu Lim, Jungeun Kim
Cohesive subgraph discovery in a network is one of the fundamental problems and investigated for several decades. In this paper, we propose the Overlapping Cohesive Subgraphs with…