Bilgilendirme: Kurulum ve veri kapsamındaki çalışmalar devam etmektedir. Göstereceğiniz anlayış için teşekkür ederiz.
 

Onuş, Melih

Profile Picture
Profile URL
https://hdl.handle.net/20.500.12416/9333
Name Variants
Onus, Melih
Job Title
Yrd. Doç. Dr.
Email Address
Main Affiliation
06.01. Bilgisayar Mühendisliği
Bilgisayar Mühendisliği
06. Mühendislik Fakültesi
01. Çankaya Üniversitesi
Status
Former Staff
Website
ORCID ID
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID

Sustainable Development Goals

SDG data is not available
This researcher does not have a Scopus ID.
This researcher does not have a WoS ID.
Scholarly Output

1

Articles

1

Views / Downloads

3/0

Supervised MSc Theses

0

Supervised PhD Theses

0

WoS Citation Count

18

Scopus Citation Count

26

WoS h-index

1

Scopus h-index

1

Patents

0

Projects

0

WoS Citations per Publication

18.00

Scopus Citations per Publication

26.00

Open Access Source

0

Supervised Theses

0

Google Analytics Visitor Traffic

JournalCount
IEEE Transactions on Parallel and Distributed Systems1
Current Page: 1 / 1

Scopus Quartile Distribution

Competency Cloud

GCRIS Competency Cloud

Filters

20131
Reset filters

Settings

Scholarly Output Search Results

Now showing 1 - 1 of 1
  • Thumbnail Image
    Article
    Citation - WoS: 18
    Citation - Scopus: 26
    Scalable and Accurate Graph Clustering and Community Structure Detection
    (Ieee Computer Soc, 2013) Onus, Melih; Djidjev, Hristo N.
    One of the most useful measures of cluster quality is the modularity of the partition, which measures the difference between the number of the edges joining vertices from the same cluster and the expected number of such edges in a random graph. In this paper, we show that the problem of finding a partition maximizing the modularity of a given graph G can be reduced to a minimum weighted cut (MWC) problem on a complete graph with the same vertices as G. We then show that the resulting minimum cut problem can be efficiently solved by adapting existing graph partitioning techniques. Our algorithm finds clusterings of a comparable quality and is much faster than the existing clustering algorithms.