{'fraction_non_alphanumeric': 0.021432305279665446, 'fraction_numerical': 0.0, 'mean_word_length': 5.234527687296417, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Model For Predicting Influential Users In Social

In the recent past and in the envisaged future of global business scenario, social networking platform such as : Face book, Twitter, Google plus +, LinkedIn, Orkut etc are visioned to get information, opinions, likes and dislikes, profile matching etc. These inputs are very essential parameters in order to design, devise and deliver many of the marketing and CRM strategies for corporates and organizations. In computational theory a social network can be represented in terms of defined structure either by tree or a graph. The network of nodes could be either static in nature or dynamic in nature as it evolves over period of time by adding or deleting nodes and edges. The study of influential members in a social network is an important research question in social network analysis. In order to find the most influential person, the most central node has to be identified. Centrality is the measure of most influential node, which is measured in terms of centrality metrics. There have been various definitions given by different researchers for centrality metric or variants of centrality metric, such as : degree centrality, closeness centrality, graph centrality, between-ness centrality, dynamic centrality, α-centrality, Eigen vector centrality, page rank, Katz Status score etc. It has been observed that most of the existing methods for measuring centrality metrics are suitable for static networks and the existing methods of computation of centrality either underestimate or overestimate centrality of some nodes. In this work concentration is laid on dynamic network in terms of dynamic centrality scores considering different values of tunable parameter. Then based on dynamic centrality score the most influential individual in a social network can be declared. Keywords— Centrality, Dynamic Centrality, Graph Theory, Social Network Analysis.