Skip to main navigation
Skip to search
Skip to main content
Korea University Pure Home
Home
Profiles
Research units
Research output
Press/Media
Search by expertise, name or affiliation
A density-based noisy graph partitioning algorithm
Jaehong Yu,
Seoung Bum Kim
Research output
:
Contribution to journal
›
Article
›
peer-review
4
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'A density-based noisy graph partitioning algorithm'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Graph Structure
100%
Density-based
100%
Cluster Structure
100%
Graph Clustering Algorithms
100%
Sparse Node
100%
Noisy Graphs
100%
Graph Partitioning Algorithm
100%
Benchmark Dataset
50%
Density Coefficient
50%
Realistic Scenario
50%
Modularity
50%
Clustering Algorithm
50%
Classification Information
50%
Clustering Analysis
50%
Natural Grouping
50%
Spectral Clustering
50%
Simulation Benchmark
50%
Simulation Datasets
50%
Computer Science
Clustering Algorithm
100%
Graph Partition
100%
Experimental Result
33%
Clustering Analysis
33%
Cluster Structure
33%
Spectral Clustering
33%
Engineering
Nodes
100%
Clustering Algorithm
75%
Experimental Result
25%
Real Situation
25%