• Journal of Information Processing Systems
• /
• v.17 no.2
• /
• pp.213-226
• /
• 2021

Given that most of the link prediction algorithms for signed social networks can only complete sign prediction, a novel algorithm is proposed aiming to achieve both link prediction and sign prediction in signed networks. Based on the structural balance theory, the local link tightness and global link tightness are defined respectively by using the structural information of paths with the step size of 2 and 3 between the two nodes. Then the total similarity of the node pair can be obtained by combining them. Its absolute value measures the possibility of the two nodes to establish a link, and its sign is the sign prediction result of the predicted link. The effectiveness and correctness of the proposed algorithm are verified on six typical datasets. Comparison and analysis are also carried out with the classical prediction algorithms in signed networks such as CN-Predict, ICN-Predict, and PSNBS (prediction in signed networks based on balance and similarity) using the evaluation indexes like area under the curve (AUC), Precision, improved AUC', improved Accuracy', and so on. Results show that the proposed algorithm achieves good performance in both link prediction and sign prediction, and its accuracy is higher than other algorithms. Moreover, it can achieve a good balance between prediction accuracy and computational complexity.

• Journal of Information Processing Systems
• /
• v.20 no.2
• /
• pp.200-214
• /
• 2024

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

• Proceedings of the Korea Information Processing Society Conference
• /
• 2022.05a
• /
• pp.9-11
• /
• 2022

Community detection is a hot topic in social network analysis, and many existing studies use graph theory analysis methods to detect communities. This paper focuses on detecting absolute fair maximal balanced cliques in signed attributed social networks, which can satisfy ensuring the fairness of complex networks and break the bottleneck of the "information cocoon".

• Journal of Information Processing Systems
• /
• v.19 no.2
• /
• pp.189-202
• /
• 2023

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.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.9
• /
• pp.87-95
• /
• 2011

Recently, as smartphones have rapidly come into wide use and various social networking services have grown, people perform a variety of interactions through the virtual and real world based on them. Usually, such services focus on easy formation of social links among users, supporting the exchange of simple messages among users on the networks. Twitter, one of such services used worldwide, supports short message service named Tweet and has over 200 million members signed up. n this paper, we propose techniques for supporting real-time group messaging based on the social network of Twitter and describe a smartphone group messaging system developed with the techniques. The system automatically forms a group that include a Twitter user and the followers of the user, supporting real-time group messaging among the group members. The developed system is composed of an XMPP protocol-based messaging server and smartphone client applications which perform real-time messaging based on the social network of Twitter. Twitter users can easily use the system utilizing Tweet messages, exchanging real-time messages with their followers within the groups instantly established on the XMPP server.

• MISULJARYO - National Museum of Korea Art Journal
• /
• v.99
• /
• pp.30-49
• /
• 2021

Scholar Byeoksu in a Pavilion by An Jung-sik (1861-1919; sobriquet: Simjeon) was first shown to the public in the exhibition Art of the Korean Empire: The Emergence of Modern Art at the National Museum of Modern and Contemporary Art, Deoksugung. This painting bears poems and inscriptions composed by Kim Taek-yeong (1850-1927; sobriquet: Changgang) and written by Kwon Dong-su (1842-?; sobriquet: Seokun). A rare example of an actual-view landscape painting by An Jung-sik, this painting is significant in that it depicts upper-class houses in Seoul in the early twentieth century. More importantly, it demonstrates an association among intellectuals of the time. Yun Deok-yeong (1873-1940; sobriquet: Byeoksu), who asked An Jung-sik to create this painting, was an uncle of Empress Sunjeonghyo (1894-1966), the consort of Emperor Sunjong. He was one of the most prominent collaborators who promoted the Japanese colonization of Korea. When Emperor Sunjong bestowed Yun Deok-yeong with a hanging board with an inscription reading "Scholar Byeoksu in a Pavilion," Yun requested the production of this painting to mark the event. Kim Taek-yeong, a master of Chinese literature during the late Korean Empire period, sought asylum in Nantong, Jiangsu Province in China with his family a month before the Protectorate Treaty was signed between Korea and Japan in 1905. In 1909, he returned to Korea. His decision to return was greatly influenced by Yun Deok-yeong and Yi Jae-wan (1855-1922). Upon his return, Kim Taek-yeong intended to gather materials for publishing a history book. Also, Kim continuously met his old acquaintances, made new friends, and socialized with them. He built relationships with people from various backgrounds, including those living in regions like Gurye, and even in other countries like Japan. This indicates that intellectuals of the time were still forming networks through poems and prose regardless of their political inclination, social rank, or nationality. Scholar Byeoksu in a Pavilion is of great value in that it shows an aspect of the intellectual exchanges among the learned people of the late nineteenth and early twentieth centuries.