본문 바로가기
KERD
논문KCI 등재

An Empirical Study of Absolute-Fairness Maximal Balanced Cliques Detection Based on Signed Attribute Social Networks: Considering Fairness and Balance

1

조회

0

다운로드

0

인용

0

참고문헌

키워드

초록

Amid the flood of data, social network analysis is beneficial in searching for its hidden context and verifyingseveral pieces of information. This can be used for detecting the spread model of infectious diseases, methodsof preventing infectious diseases, mining of small groups and so forth. In addition, community detection is themost studied topic in social network analysis using graph analysis methods. The objective of this study is toexamine signed attributed social networks and identify the maximal balanced cliques that are both absoluteand fair. In the same vein, the purpose is to ensure fairness in complex networks, overcome the “informationcocoon” bottleneck, and reduce the occurrence of “group polarization” in social networks. Meanwhile, anempirical study is presented in the experimental section, which uses the personal information of 77 employeesof a research company and the trust relationships at the professional level between employees to mine somesmall groups with the possibility of "group polarization." Finally, the study provides suggestions for managersof the company to align and group new work teams in an organization.

Abstract

Amid the flood of data, social network analysis is beneficial in searching for its hidden context and verifyingseveral pieces of information. This can be used for detecting the spread model of infectious diseases, methodsof preventing infectious diseases, mining of small groups and so forth. In addition, community detection is themost studied topic in social network analysis using graph analysis methods. The objective of this study is toexamine signed attributed social networks and identify the maximal balanced cliques that are both absoluteand fair. In the same vein, the purpose is to ensure fairness in complex networks, overcome the “informationcocoon” bottleneck, and reduce the occurrence of “group polarization” in social networks. Meanwhile, anempirical study is presented in the experimental section, which uses the personal information of 77 employeesof a research company and the trust relationships at the professional level between employees to mine somesmall groups with the possibility of "group polarization." Finally, the study provides suggestions for managersof the company to align and group new work teams in an organization.

참고문헌 (25)

  1. Y. Yang, "Modelling prevention and control strategies for COVID-19 propagation with patient contact networks", Human-centric Computing and Information Sciences, 11 (2021)[DOI]
  2. Y. Yang, "Dynamic maximal cliques detection and evolution management in social internet of things : a formal concept analysis approach", IEEE Transactions on Network Science and Engineering, 9(3), pp.1020~1032 (2022)[DOI]
  3. A. Das, "Shared-memory parallel maximal clique enumeration", Proceedings of 2018 IEEE 25th International Conference on High Performance Computing (HiPC), pp.62~71 (2018)
  4. J. Cheng, "Fast algorithms for maximal clique enumeration with limited memory", Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.1240~1248 (2012)
  5. Y. Yang, "A novel community detection method of social networks for the well-being of urban public spaces", Land, 11(5) (2022)[DOI]
  6. I. Falih, "Community detection in attributed network", Companion Proceedings of the Web Conference, pp.1299~1306 (2018)
  7. P. Chunaev, "Community detection in node-attributed social networks : a survey", Computer Science Review, 37 (2020)[DOI]
  8. N. Mehrabi, "A survey on bias and fairness in machine learning", ACM Computing Surveys (CSUR), 54(6) (2021)[DOI]
  9. Trustworthy artificial intelligence (AI) in education: promises and challenges, "S. Vincent-Lancrin", OECD, ~, pp.OECD Education Working Papers No. 218 (2020)
  10. F Hao, "Absolute fair maximal cliques detection in attributed social networks", Proceedings of the 16th International Conference on Multimedia & Ubiquitous Engineering (MUE) (2022)
  11. M. Pan, "Fairness-aware maximal clique enumeration", Proceedings of 2022 IEEE 38th International Conference on Data Engineering (ICDE), pp.259~271 (2022)
  12. L. Ji, "How to crack the information cocoon room under the background of intelligent media", International Journal of Social Science and Education Research, 3(3), pp.169~173 (2020)[DOI]
  13. Y. Fang, "Effective community search for large attributed graphs", Proceedings of the VLDB Endowment, 9(12), pp.1233~1244 (2016)[DOI]
  14. A. Khan, "Compact group discovery in attributed graphs and social networks", Information Processing & Management, 57(2) (2020)[DOI]
  15. Y. Li, "Community detection in attributed graphs : an embedding approach", Proceedings of the AAAI Conference on Artificial Intelligence, 32(1), pp.338~345 (2018)[DOI]
  16. C. Pizzuti, "Applications of Evolutionary Computation", pp.159~170 (2018), Springer
  17. Z. Chen, "maximal balanced clique enumeration in signed networks", Proceedings of the Web Conference, pp.339~349 (2020)
  18. J. Salminen, "Developing an online hate classifier for multiple social media platforms", Human-centric Computing and Information Sciences, 10 (2020)[DOI]
  19. Y. Yang, "Detection of maximal balance clique using three-way concept lattice", Journal of Information Processing Systems, 19(2), pp.189~202 (2023)[DOI]
  20. A. Beutel, "Fairness in recommendation ranking through pairwise comparisons", Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp.2212~2220
  21. F. Hao, "K-clique community detection in social networks based on formal concept analysis", IEEE Systems Journal, 11(1), pp.250~259 (2017)[DOI]
  22. Y. Yang, "Absolute-fair maximal balanced cliques detection in signed attributed social network", Proceedings of the Annual Spring Conference of KIPS, 29(1), pp.9~11 (2022)
  23. R. L. Cross, "The Hidden Power of Social Networks: Understanding How Work Really Gets Done in Organizations" (2004), Harvard Business Press
  24. law of group polarization, "C. R. Sunstein", University of Chicago Law School, ~, pp.John M. Olin Law &Economics Working Paper No.91 (1999)
  25. F. Chen, "Comments and links : group political polarization in social networking sites : an explanation based on micro behaviors", Chinese Journal of Sociology, 37(4), pp.217~240 (2017)

이 간행물의 다른 논문 (10건)