{'fraction_non_alphanumeric': 0.029850746268656716, 'fraction_numerical': 0.0, 'mean_word_length': 5.145833333333333, '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}}
Strong Social Graph Based Trust-Oriented Graph Pattern Matching With Multiple Constraints

Online social network is popular and graph pattern matching (GPM) has been significant in many social network based applications, such as experts finding and social position detection. However, the existing GPM methods do not consider the multiple constraints of the social contexts in GPM, which are commonly found in various applications, or they do not consider the changes of graph structure in the index maintenance of GPM, leading to low efficiency. In this paper, we first propose a multi-constrained simulation based on the bounded graph simulation, and propose a multi-constrained graph pattern matching (MC-GPM) problem. To improve the efficiency of MC-GPM in large social graphs, we propose a new concept, strong social graph (SSG), that contains the users who have strong social connections. Then, we propose an SSG-index method to index the reachability, the graph patterns, and the social contexts of social graphs. Finally, we propose an incremental algorithm to maintain the SSG-index, which can greatly save the execution time when faced with the change of the structures of SSGs. Moreover, by combining SSG-index, we develop a heuristic algorithm, called SSG-MGPM, to identify MC-GPM results effectively and efficiently. An empirical study over five real-world social graphs has demonstrated the superiority of our approach in terms of efficiency and effectiveness.