Diversified top-k maximal clique detection in Social Internet of Things

Abstract Social Internet of Things (SIoT), an IoT where things are autonomously capable of establishing relationships with other smart objects related to humans, allows them to interact within a social structure based on relationships. Importantly, exploiting the social structures of smart objects in SIoT is important for supervision and management of various services. Diversified top- k maximal clique, as a novel social structure, can be used for anomaly detection, and smart community detection from SIoT. However, the scalability of the existing approaches for detecting diversified top- k maximal cliques is becoming a significant challenge faced in the big graph. To this end, this paper proposes a novel diversified top- k maximal clique detection approach based on formal concept analysis. Specifically, we firstly prove the existence of equivalence relation between maximal cliques and equiconcepts which are a class of special concepts where the extent and intent are the same. Based on this equivalence relation, an efficient and innovative approach based on formal concept analysis for identifying diversified top- k maximal cliques is then further presented. Finally, three real-world social network datasets are adopted in experiments for the validation of effectiveness of our approach in SIoT.

[1]  Zhuo Zhang,et al.  Constructing L-fuzzy concept lattices without fuzzy Galois closure operation , 2018, Fuzzy Sets Syst..

[2]  Laurence T. Yang,et al.  $K$-Clique Community Detection in Social Networks Based on Formal Concept Analysis , 2017, IEEE Systems Journal.

[3]  Pablo San Segundo,et al.  Efficiently Enumerating all Maximal Cliques with Bit-Parallelism , 2017, Comput. Oper. Res..

[4]  Laurence T. Yang,et al.  Multicloud-Based Evacuation Services for Emergency Management , 2014, IEEE Cloud Computing.

[5]  Antonio Iera,et al.  From "smart objects" to "social objects": The next evolutionary step of the internet of things , 2014, IEEE Communications Magazine.

[6]  Egon Balas,et al.  On the Set-Covering Problem , 1972, Oper. Res..

[7]  Bernhard Ganter,et al.  Formal Concept Analysis: Mathematical Foundations , 1998 .

[8]  Antonio Iera,et al.  The Social Internet of Things (SIoT) - When social networks meet the Internet of Things: Concept, architecture and network characterization , 2012, Comput. Networks.

[9]  Fei Hao,et al.  k-Cliques mining in dynamic social networks based on triadic formal concept analysis , 2016, Neurocomputing.

[10]  Ke Gu,et al.  Social community detection and message propagation scheme based on personal willingness in social network , 2018, Soft Computing.

[11]  Daqiang Zhang,et al.  NextCell: Predicting Location Using Social Interplay from Cell Phone Traces , 2015, IEEE Transactions on Computers.

[12]  T. Vicsek,et al.  Clique percolation in random networks. , 2005, Physical review letters.

[13]  B. Schwikowski,et al.  A network of protein–protein interactions in yeast , 2000, Nature Biotechnology.

[14]  Xiaoqi Zheng,et al.  Large cliques in Arabidopsis gene coexpression network and motif discovery. , 2011, Journal of plant physiology.

[15]  Jinhai Li,et al.  Concepts reduction in formal concept analysis with fuzzy setting using Shannon entropy , 2017, Int. J. Mach. Learn. Cybern..

[16]  Enrico Gregori,et al.  Parallel $(k)$-Clique Community Detection on Large-Scale Networks , 2013, IEEE Transactions on Parallel and Distributed Systems.