Self-organized Population Segmentation for Geosocial Network Neighborhood

Geosocial network neighborhood application allows user to share information and communicate with other people within a virtual neighborhood or community. A large and crowded neighbourhood will degrade social quality within the community. Therefore, optimal population segmentation is an essential part in a geosocial network neighborhood, to specify access rights and privileges to resources, and increase social connectivity. In this paper, we propose an extension of the density-based clustering method to allow self-organized segmentation for neighbourhood boundaries in a geosocial network. The objective of this paper is two-fold: First, to improve the distance calculation in population segmentation in a geosocial network neighbourhood. Second, to implement self-organized population segmentation algorithms using threshold value and Dunbar number. The effectiveness of the proposed algorithms is evaluated via experimental scenarios using GPS data. The proposed algorithms show improvement in segmenting large group size of cluster into smaller group size of cluster to maintain the stability of social relationship in the neighbourhood.

@article{Loong2018,
  title     = {Self-organized Population Segmentation for Geosocial Network Neighborhood},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {9},
  number    = {9},
  year      = {2018},
  publisher = {The Science and Information Organization},
  author    = {Low Shen Loong and Syarulnaziah Anawar and Zakiah Ayop and Mohd Rizuan Baharon and Erman Hamid},
  doi       = {10.14569/IJACSA.2018.090931},
  url       = {https://doi.org/10.14569/IJACSA.2018.090931}
}