Efficient Algorithm for Maximal Clique Size Evaluation

Abstract

A large dataset network is considered for computation of maximal clique size (MC). Additionally, its link with popular centrality metrics to decrease uncertainty and complexity and for finding influential points of any network has also been investigated. Previous studies focus on centrality metrics like degree centrality (DC), closeness centrality (CC), betweenness centrality (BC) and Eigenvector centrality (EVC) and compare them with maximal clique size however, in this study Katz centrality measure is also considered and shows a pretty robust relation with maximal clique size (MC). Secondly, maximal clique size (MC) algorithm is also revised for network analysis to avoid complexity in computation. Association between MC and five centrality metrics has been evaluated through recognized methods that are Pearson’s correlation coefficient (PCC), Spearman’s correlation coefficient (SCC) and Kendall’s correlation coefficient (KCC). The strong strength of association between them is seen through all three correlation coefficients measure.

Authors and Affiliations

Ubaida Fatima, Saman Hina

Keywords

Related Articles

Novel Conception of a Tunable RF MEMS Resonator

This paper presents a new monolithic microwave integrated circuit (MMIC) based on coplanar waveguide (CPW) design for a tunable resonator based on RF MEMS. This RF structure, which can be used for system on chip (SOC), i...

BioPay: Your Fingerprint is Your Credit Card

In recent years, credit and debit cards have become a very convenient method of payment. The growing use of card payments, hereafter referred to as credit cards, is evident in the daily use with many applications, such a...

Estimating Evapotranspiration using Machine Learning Techniques

The measurement of evapotranspiration is the most important factor in irrigation scheduling. Evapotranspiration means loss of water from the surface of plant and soil. Evaporation parameters are being used in studying wa...

Comparison Study of Commit Protocols for Mobile Environment

This paper presents a study of protocols to commit the transactions distributed over several mobile and fixed units and provides the method to handle mobility at the application layer. It describes the solutions to defea...

Novel Causality in Consumer’s Online Behavior: Ecommerce Success Model

Online shopping (e-Shopping) has grown at a rapid pace with the advancement in modern web technologies, there are then socio and technical aspects (factors) in the mentioned e-shopping. The following research paper highl...

Download PDF file
  • EP ID EP611426
  • DOI 10.14569/IJACSA.2019.0100761
  • Views 106
  • Downloads 0

How To Cite

Ubaida Fatima, Saman Hina (2019). Efficient Algorithm for Maximal Clique Size Evaluation. International Journal of Advanced Computer Science & Applications, 10(7), 444-452. https://europub.co.uk/articles/-A-611426