An evolutionary GA-based approach for community detection in IoT

Sanket Mishra, Chinmay Hota, Lov Kumar, Abhaya Nayak

Research output: Contribution to journalArticleResearchpeer-review

Abstract

Identifying traffic congestion and solving them by using predictive models has been ongoing research in intelligent transportation scenarios. However, it is improper that such scenarios can be judged on the basis of mean traffic intensity and mean traffic speed. This paper works on this aspect and uses data mining approaches to derive the aggregation metrics of traffic intensity data from the city of Madrid. This work uses a novel similarity measure by utilizing the results of the Wilcoxon Signed Rank test across 2018 locations to discover similarities. We propose a Genetic Algorithm on the results of the Wilcoxon test for forming communities based on the aggregation metrics. This work also compares and evaluates the performance of the proposed algorithm against standard distance measures and other state-of-the-art approaches. Forfinding the optimal number of possible communities in the data, we have taken the help of Davies - Bouldin Test. Our experimental results show the effectiveness of the Genetic Algorithm using various parameters, such as number of dissimilar points within a cluster, minimum number of dissimilar data points between clusters and overall based on Modified Silhouette coefficient. Furthermore, we find that our method is able to distribute the data points in a more uniform manner across formed communities in comparison to other approaches considered in this work.

LanguageEnglish
Pages100512-100534
Number of pages23
JournalIEEE Access
Volume7
DOIs
Publication statusPublished - 19 Jun 2019

Fingerprint

Agglomeration
Genetic algorithms
Traffic congestion
Data mining
Internet of things

Bibliographical note

Version archived for private and non-commercial use with the permission of the author/s and according to publisher conditions. For further rights please contact the publisher.

Keywords

  • clustering
  • evolutionary clustering
  • fuzzy c-means
  • genetic algorithms
  • intelligent transportation systems
  • K-means clustering
  • traffic classification

Cite this

Mishra, Sanket ; Hota, Chinmay ; Kumar, Lov ; Nayak, Abhaya. / An evolutionary GA-based approach for community detection in IoT. In: IEEE Access. 2019 ; Vol. 7. pp. 100512-100534.
@article{9528e1dedfe3466c9e49ffc6b22ac94f,
title = "An evolutionary GA-based approach for community detection in IoT",
abstract = "Identifying traffic congestion and solving them by using predictive models has been ongoing research in intelligent transportation scenarios. However, it is improper that such scenarios can be judged on the basis of mean traffic intensity and mean traffic speed. This paper works on this aspect and uses data mining approaches to derive the aggregation metrics of traffic intensity data from the city of Madrid. This work uses a novel similarity measure by utilizing the results of the Wilcoxon Signed Rank test across 2018 locations to discover similarities. We propose a Genetic Algorithm on the results of the Wilcoxon test for forming communities based on the aggregation metrics. This work also compares and evaluates the performance of the proposed algorithm against standard distance measures and other state-of-the-art approaches. Forfinding the optimal number of possible communities in the data, we have taken the help of Davies - Bouldin Test. Our experimental results show the effectiveness of the Genetic Algorithm using various parameters, such as number of dissimilar points within a cluster, minimum number of dissimilar data points between clusters and overall based on Modified Silhouette coefficient. Furthermore, we find that our method is able to distribute the data points in a more uniform manner across formed communities in comparison to other approaches considered in this work.",
keywords = "clustering, evolutionary clustering, fuzzy c-means, genetic algorithms, intelligent transportation systems, K-means clustering, traffic classification",
author = "Sanket Mishra and Chinmay Hota and Lov Kumar and Abhaya Nayak",
note = "Version archived for private and non-commercial use with the permission of the author/s and according to publisher conditions. For further rights please contact the publisher.",
year = "2019",
month = "6",
day = "19",
doi = "10.1109/ACCESS.2019.2923965",
language = "English",
volume = "7",
pages = "100512--100534",
journal = "IEEE Access",
issn = "2169-3536",
publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

}

An evolutionary GA-based approach for community detection in IoT. / Mishra, Sanket; Hota, Chinmay; Kumar, Lov; Nayak, Abhaya.

In: IEEE Access, Vol. 7, 19.06.2019, p. 100512-100534.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - An evolutionary GA-based approach for community detection in IoT

AU - Mishra, Sanket

AU - Hota, Chinmay

AU - Kumar, Lov

AU - Nayak, Abhaya

N1 - Version archived for private and non-commercial use with the permission of the author/s and according to publisher conditions. For further rights please contact the publisher.

PY - 2019/6/19

Y1 - 2019/6/19

N2 - Identifying traffic congestion and solving them by using predictive models has been ongoing research in intelligent transportation scenarios. However, it is improper that such scenarios can be judged on the basis of mean traffic intensity and mean traffic speed. This paper works on this aspect and uses data mining approaches to derive the aggregation metrics of traffic intensity data from the city of Madrid. This work uses a novel similarity measure by utilizing the results of the Wilcoxon Signed Rank test across 2018 locations to discover similarities. We propose a Genetic Algorithm on the results of the Wilcoxon test for forming communities based on the aggregation metrics. This work also compares and evaluates the performance of the proposed algorithm against standard distance measures and other state-of-the-art approaches. Forfinding the optimal number of possible communities in the data, we have taken the help of Davies - Bouldin Test. Our experimental results show the effectiveness of the Genetic Algorithm using various parameters, such as number of dissimilar points within a cluster, minimum number of dissimilar data points between clusters and overall based on Modified Silhouette coefficient. Furthermore, we find that our method is able to distribute the data points in a more uniform manner across formed communities in comparison to other approaches considered in this work.

AB - Identifying traffic congestion and solving them by using predictive models has been ongoing research in intelligent transportation scenarios. However, it is improper that such scenarios can be judged on the basis of mean traffic intensity and mean traffic speed. This paper works on this aspect and uses data mining approaches to derive the aggregation metrics of traffic intensity data from the city of Madrid. This work uses a novel similarity measure by utilizing the results of the Wilcoxon Signed Rank test across 2018 locations to discover similarities. We propose a Genetic Algorithm on the results of the Wilcoxon test for forming communities based on the aggregation metrics. This work also compares and evaluates the performance of the proposed algorithm against standard distance measures and other state-of-the-art approaches. Forfinding the optimal number of possible communities in the data, we have taken the help of Davies - Bouldin Test. Our experimental results show the effectiveness of the Genetic Algorithm using various parameters, such as number of dissimilar points within a cluster, minimum number of dissimilar data points between clusters and overall based on Modified Silhouette coefficient. Furthermore, we find that our method is able to distribute the data points in a more uniform manner across formed communities in comparison to other approaches considered in this work.

KW - clustering

KW - evolutionary clustering

KW - fuzzy c-means

KW - genetic algorithms

KW - intelligent transportation systems

KW - K-means clustering

KW - traffic classification

U2 - 10.1109/ACCESS.2019.2923965

DO - 10.1109/ACCESS.2019.2923965

M3 - Article

VL - 7

SP - 100512

EP - 100534

JO - IEEE Access

T2 - IEEE Access

JF - IEEE Access

SN - 2169-3536

ER -