DOI QR코드

DOI QR Code

Detection of Maximal Balance Clique Using Three-way Concept Lattice

  • Yixuan Yang (Dept. of Software Convergence, Soonchunhyang University) ;
  • Doo-Soon Park (Dept. of Software Convergence, Soonchunhyang University) ;
  • Fei Hao (School of Computer Science, Shaanxi Normal University) ;
  • Sony Peng (Dept. of Software Convergence, Soonchunhyang University) ;
  • Hyejung Lee (Dept. of Innovation and Convergence, Hoseo University) ;
  • Min-Pyo Hong (Dept. of Computer Sciences and Engineering, Soonchunhyang University)
  • Received : 2021.11.22
  • Accepted : 2022.10.01
  • Published : 2023.04.30

Abstract

In the era marked by information inundation, social network analysis is the most important part of big data analysis, with clique detection being a key technology in social network mining. Also, detecting maximal balance clique in signed networks with positive and negative relationships is essential. In this paper, we present two algorithms. The first one is an algorithm, MCDA1, that detects the maximal balance clique using the improved three-way concept lattice algorithm and object-induced three-way concept lattice (OE-concept). The second one is an improved formal concept analysis algorithm, MCDA2, that improves the efficiency of memory. Additionally, we tested the execution time of our proposed method with four real-world datasets.

Keywords

Acknowledgement

This research was supported by the National Research Foundation of Korea (No. NRF-2020RIA2B5B01002134) and the BK21 Fostering Outstanding Universities for Research (No. 5199990914048), European Union's Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No. 840922, the National Natural Science Foundation of China (No. 61702317), and the Fundamental Research Funds for the Central Universities (No. GK202103080).

References

  1. P. Vilakone, X. Xinchang, and D. S. Park, "Movie recommendation system based on users' personal information and movies rated using the method of k-clique and normalized discounted cumulative gain," Journal of Information Processing Systems, vol. 16, no. 2, pp. 494-507, 2020. https://doi.org/10.3745/JIPS.04.0169
  2. P. Vilakone, K. Xinchang, and D. S. Park, "Personalized movie recommendation system combining data mining with the k-clique method," Journal of Information Processing Systems, vol. 15, no. 5, pp. 1141-1155, 2019. https://doi.org/10.3745/JIPS.04.0138
  3. L. Yuan, L. Qin, X. Lin, L. Chang, and W. Zhang, "Diversified top-k clique search," The VLDB Journal, vol. 25, pp. 171-196, 2016. https://doi.org/10.1007/s00778-015-0408-z
  4. F. Hao, G. Min, Z. Pei, D. S. Park, and L. T. Yang, "K-clique community detection in social networks based on formal concept analysis," IEEE Systems Journal, vol. 11, no. 1, pp. 250-259, 2017. https://doi.org/10.1109/JSYST.2015.2433294
  5. S. Kumar, F. Spezzano, V. S. Subrahmanian, and C. Faloutsos, "Edge weight prediction in weighted signed networks," in Proceedings of 2016 IEEE 16th International Conference on Data Mining (ICDM), Barcelona, Spain, 2016, pp. 221-230.
  6. J. Kunegis, A. Lommatzsch, and C. Bauckhage, "The Slashdot Zoo: mining a social network with negative edges," in Proceedings of the 18th International Conference on World Wide Web, Madrid, Spain, 2009, pp. 741-750.
  7. Z. Chen, L. Yuan, X. Lin, L. Qin, and J. Yang, "Efficient maximal balanced clique enumeration in signed networks," in Proceedings of the Web Conference 2020, Taipei, Taiwan, 2020, pp. 339-349.
  8. J. Salminen, M. Hopf, S. A. Chowdhury, S. G. Jung, H. Almerekhi, and B. J. Jansen, "Developing an online hate classifier for multiple social media platforms," Human-centric Computing and Information Sciences, vol. 10, article no. 1, 2020. https://doi.org/10.1186/s13673-019-0205-6
  9. S. Ahmad, M. Z. Asghar, F. M. Alotaibi, and I. Awan, "Detection and classification of social media-based extremist affiliations using sentiment analysis techniques," Human-centric Computing and Information Sciences, vol. 9, article no. 24, 2019. https://doi.org/10.1186/s13673-019-0185-6
  10. Y. Yang, F. Hao, B. Pang, K. Qin, Z. Pei, and B. Li, "A quick algorithm on generating concept lattice for attribute-incremental streaming data," in Proceedings of 2019 IEEE 21st International Conference on High Performance Computing and Communications; IEEE 17th International Conference on Smart City; and IEEE 5th International Conference on Data Science and Systems (HPCC/SmartCity/DSS), Zhangjiajie, China, 2019, pp. 2811-2816.
  11. S. Yang, Y. Lu, X. Jia, and W. Li, "Constructing three-way concept lattice based on the composite of classical lattices," International Journal of Approximate Reasoning, vol. 121, pp. 174-186, 2020. https://doi.org/10.1016/j.ijar.2020.03.007
  12. F. Hao, Y. Yang, G. Min, and V. Loia, "Incremental construction of three-way concept lattice for knowledge discovery in social networks," Information Sciences, vol. 578, pp. 257-280, 2021. https://doi.org/10.1016/j.ins.2021.07.031
  13. G. A. Miller, WordNet: An Electronic Lexical Database. Cambridge, MA: MIT Press, 1998.
  14. R. L. Cross and A. Parker, The Hidden Power of Social Networks: Understanding How Work Really Gets Done in Organizations. Boston, MA: Harvard Business School Publishing, 2004.
  15. S. C. Freeman and L. C. Freeman, "The networkers network: a study of the impact of a new communications medium on sociometric structure," School of Social Sciences, University of California, CA, 1979.
  16. J. Leskovec, D. Huttenlocher, and J. Kleinberg, "Signed networks in social media," in Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, Atlanta, GA, 2010, pp. 1361-1370.
  17. F. Hao, S. S. Yau, G. Min, and L. T. Yang, "Detecting k-balanced trusted cliques in signed social networks," IEEE Internet Computing, vol. 18, no. 2, pp. 24-31, 2014. https://doi.org/10.1109/MIC.2014.25