Framework for Computing Potential Node with Higher Influence in Complex Social Network

Abstract

The increasing data complexity in social network imposes challenges towards carrying out investigation towards analytics. Similar scenario has started evolving in social network most recently owing to the usage of ubiquitous devices which gives rise to accumulation of complex set of data that offers potential challenge to understand the potential node. Identification of potential node is an essential demand to understand the role player in social network. Therefore, this paper presents a novel analytical methodology to construct a discrete community with higher precision along with a novel progressive algorithm for identifying the potential node that offers a higher degree of influence in social network. Dynamic optimization, as well as probability theory, has been used in order to perform modeling of the proposed system. Along with an effective computational performance, the comparative analysis shows that proposed system offers better performance in contrast to existing techniques with respect to influence degree and information processing time. The inferencing of the quantified outcome status shows that the formulated approach attains ~70% performance improvement in the case of minimizing the processing time as compared to the Chen approach. The identification of potential node in four different types of networks have also significantly improved with negligible computational effort.