Modified Graph-theoretic Clustering Algorithm for Mining International Linkages of Philippine Higher Education Institutions
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2019, Vol 10, Issue 6
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
- EP ID EP594254
- DOI 10.14569/IJACSA.2019.0100613
- Views 65
- Downloads 0
Inter Prediction Complexity Reduction for HEVC based on Residuals Characteristics
High Efficiency Video Coding (HEVC) or H.265 is currently the latest standard in video coding. While this new standard promises improved performance over the previous H.264/AVC standard, the complexity has drastically in...
Secure and Privacy Preserving Mail Servers using Modified Homomorphic Encryption (MHE) Scheme
Electronic mail (Email) or the paperless mail is becoming the most acceptable, faster and cheapest way of formal and informal information sharing between users. Around 500 billion mails are sent each day and the count is...
An Automated Approach for Identification of Non-Functional Requirements using Word2Vec Model
Non-Functional Requirements (NFR) are embedded in functional requirements in requirements specification docu-ment. Identification of NFR from the requirement document is a challenging task. Ignorance of NFR identificatio...
VoIP Forensic Analyzer
People have been utilizing Voice over Internet Protocol (VoIP) in most of the conventional communication facilities which has been of assistance in the enormous attenuation of operating costs, as well as the promotion of...
Skip List Data Structure Based New Searching Algorithm and Its Applications: Priority Search
Our new algorithm, priority search, was created with the help of skip list data structure and algorithms. Skip list data structure consists of linked lists formed in layers, which were linked in a pyramidal way. The time...