Modification of MSDR algorithm and ITS implementation on graph clustering

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

Abstract

Maximum Standard Deviation Reduction (MSDR) is a graph clustering algorithm to minimize the distance variation within a cluster. In this paper we propose a modified MSDR by replacing one technical step in MSDR which uses polynomial regression, with a new and simpler step. This leads to our new algorithm called Modified MSDR (MMSDR). We implement the new algorithm to separate a domestic flight network of an Indonesian airline into two large clusters. Further analysis allows us to discover a weak link in the network, which should be improved by adding more flights.

Original languageEnglish
Title of host publicationInternational Symposium on Current Progress in Mathematics and Sciences 2016, ISCPMS 2016
Subtitle of host publicationProceedings of the 2nd International Symposium on Current Progress in Mathematics and Sciences 2016
EditorsKiki Ariyanti Sugeng, Djoko Triyono, Terry Mart
PublisherAmerican Institute of Physics Inc.
ISBN (Electronic)9780735415362
DOIs
Publication statusPublished - 10 Jul 2017
Event2nd International Symposium on Current Progress in Mathematics and Sciences 2016, ISCPMS 2016 - Depok, Jawa Barat, Indonesia
Duration: 1 Nov 20162 Nov 2016

Publication series

NameAIP Conference Proceedings
Volume1862
ISSN (Print)0094-243X
ISSN (Electronic)1551-7616

Conference

Conference2nd International Symposium on Current Progress in Mathematics and Sciences 2016, ISCPMS 2016
Country/TerritoryIndonesia
CityDepok, Jawa Barat
Period1/11/162/11/16

Fingerprint

Dive into the research topics of 'Modification of MSDR algorithm and ITS implementation on graph clustering'. Together they form a unique fingerprint.

Cite this