Modified Graph-theoretic Clustering Algorithm for Mining International Linkages of Philippine Higher Education Institutions

Abstract

Graph-theoretic clustering either uses limited neighborhood or construction of a minimum spanning tree to aid the clustering process. The latter is challenged by the need to identify and consequently eliminate inconsistent edges to achieve final clusters, detect outliers and partition substantially. This work focused on mining the data of the International Linkages of Philippine Higher Education Institutions by employing a modified graph-theoretic clustering algorithm with which the Prim’s Minimum Spanning Tree algorithm was used to construct a minimum spanning tree for the internationalization dataset infusing the properties of a small world network. Such properties are invoked by the computation of local clustering coefficient for the data elements in the limited neighborhood of data points established using the von Neumann Neighborhood. The overall result of the cluster validation using the Silhouette Index with a score of .69 indicates that there is an acceptable structure found in the clustering result – hence, a potential of the modified MST-based clustering algorithm. The Silhouette per cluster with .75 being the least score means that each cluster derived for r=5 by the von Neumann Neighborhood has a strong clustering structure.

Authors and Affiliations

Sheila R. Lingaya, Bobby D. Gerardo, Ruji P. Medina

Keywords

Related Articles

A Novel Energy Efficient Mobility Aware MAC Protocol for Wireless Sensor Networks

Dealing with mobility at the link layer in an efficient and effective way is a formidable challenge in Wireless Sensor Networks due to recent boom in mobile applications and complex network scenarios. Most of the current...

Understanding Customer Voice of Project Portfolio Management Software

Project Portfolio Management (PPM) has gained success in many projects due to its large number of features that covers effective scheduling, risk management, collaboration, and third-party software integrations to mentio...

A Categorical Model of Process Co-Simulation

A set of dynamic systems in which some entities undergo transformations, or receive certain services in successive phases, can be modeled by processes. The specification of a process consists of a description of the prop...

 A Congestion Avoidance Approach in Jumbo Frame-enabled IP Network

 Jumbo frame is as an approach that allows for higher utilization of larger packet sizes on a domain-wise basis, decreasing the number of packets processed by core routers while not having any adverse impact on the...

MCIP Client Application for SCADA in Iiot Environment

Modern automation systems architectures which include several subsystems for which an adequate burden sharing is required. These subsystems must work together to fulfil the tasks imposed by the common function, given by...

Download PDF file
  • EP ID EP594254
  • DOI 10.14569/IJACSA.2019.0100613
  • Views 80
  • Downloads 0

How To Cite

Sheila R. Lingaya, Bobby D. Gerardo, Ruji P. Medina (2019). Modified Graph-theoretic Clustering Algorithm for Mining International Linkages of Philippine Higher Education Institutions. International Journal of Advanced Computer Science & Applications, 10(6), 90-95. https://europub.co.uk/articles/-A-594254