• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권1호
• /
• pp.421-433
• /
• 2015

Recently, there have been fast-growing social network services based on the Internet environment and web technology development, the prevalence of smartphones, etc. Social networks also allow the users to convey the information and news so that they have a great influence on the public opinion formed by social interaction among users as well as the spread of information. On the other hand, these social networks also serve as perfect environments for rampant malware. Malware is rapidly being spread because relationships are formed on trust among the users. In this paper, an effective patch strategy is proposed to deal with malicious worms based on social networks. A graph is formed to analyze the structure of a social network, and subgroups are formed in the graph for the distributed patch strategy. The weighted directions and activities between the nodes are taken into account to select reliable key nodes from the generated subgroups, and the Incremental PageRanking algorithm reflecting dynamic social network features (addition/deletion of users and links) is used for deriving the high influential key nodes. With the patch based on the derived key nodes, the proposed method can prevent worms from spreading over social networks.

• Journal of Information Processing Systems
• /
• 제14권2호
• /
• pp.455-468
• /
• 2018

The concepts of graph theory are applied to model and analyze dynamics of computer networks, biochemical networks and, semantics of social networks. The analysis of dynamics of complex networks is important in order to determine the stability and performance of networked systems. The analysis of non-stationary and nonlinear complex networks requires the applications of ordinary differential equations (ODE). However, the process of resolving input excitation to the dynamic non-stationary networks is difficult without involving external functions. This paper proposes an analytical formulation for generating solutions of nonlinear network ODE systems with functional decomposition. Furthermore, the input excitations are analytically resolved in linearized dynamic networks. The stability condition of dynamic networks is determined. The proposed analytical framework is generalized in nature and does not require any domain or range constraints.

• 유통과학연구
• /
• 제14권9호
• /
• pp.31-45
• /
• 2016

Purpose - This study develops a simulation model that looks at the dynamics between social capital and business performance in strategic networks to understand their behaviors in relation to each other, and to suggest dynamic relationship strategies. Research design, data, and methodology - Based on existing literature, this study identifies the complex causal loop diagram on social capital and business performance in strategic networks, and converts them into a simulation model for observing how the changes in business environment and relationship dependency affect social capital and business performance. Results - The simulation results showed that, first, the formation in social capital and business performance of networks with low relationship dependency was less affected by the changes in business environment. Second, the formation in social capital and business performance of networks with high relationship dependency was negatively impacted by the changes in business environment. In other words, higher relationship dependency strengthened the impact of changes in business environment on business performance. Conclusions - Thus, this study confirmed that in strategic networks, the changes in business environment and the degree of relationship dependency dynamically affect business performance, and that relationship dependency mediates the degree in which changes in the business environment affect business performance. The results of the simulations were further verified through actual business cases.

• 응용통계연구
• /
• 제34권1호
• /
• pp.25-38
• /
• 2021

최근 동적 연결망의 비정상적 변화를 감시하기 위한 연결망 모니터링의 필요성이 높아지고 있다. 이 논문에서는 연결망의 구조적 변화를 감시하기 위한 동적 연결망의 모형으로 DCSBM(degree corrected stochastic block model)을 고려하였다. 관리도 절차를 사용하여 동적 연결망을 감시하려면 제1국면을 통해 초기 연결망을 확보한 후 모형의 모수를 추정하는 단계를 거쳐야 한다. 그러나 연결망의 감시에서는 충분한 수의 초기 연결망을 확보하기 어려운 경우가 대부분이다. 이 논문에서는 동적 DCSBM을 감시하기 위한 자기출발 관리도 절차를 제안한다. 이 절차는 모형의 모수 추정을 위해 확보한 연결망의 수가 아주 적은 경우에 유용하게 사용할 수 있는 절차이다. 모의실험을 통해 절차의 성능을 평가한 결과, 제안된 절차는 초기 연결망의 수가 아주 적은 경우에도 좋은 관리상태의 성능을 나타내는 것을 알 수 있었다.

• 디지털콘텐츠학회 논문지
• /
• 제14권1호
• /
• pp.41-50
• /
• 2013

소셜 네트워크 분석은 1개의 연결을 가지는 n개의 노드를 대상으로 한다. 노드 수 n이 수십 또는 수백 정도의 소셜 네트워크를 분석할 때는 전체 데이터를 대상으로 분석이 가능하지만, 그 이상이 되면 육안으로 분석하기는 어렵다. 따라서 전체 소셜 네트워크를 분리할 필요가 있는데 이 때 사용할 수 있는 방법이 군집화이다. 군집화를 통해 전체 노드를 하위 그룹으로 구성하면, 소셜 네트워크의 특징 분석이나 노드간의 관계 분석을 쉽게 수행할 수 있게 된다. 군집화 기법은 하위 그룹의 개수를 미리 설정해야 하기 때문에 사용자와의 상호 작용이 필요하고, 이렇게 생성된 하위 그룹이 최적의 결과라는 것을 보증할 수 없다. 본 논문에서는 외부 커뮤니티 연관도를 활용한 동적인 하위 그룹 생성 방법을 제안한다. 발견된 하위 그룹의 개수와 하위 그룹 순도를 기준으로 기존의 연구들과 비교하였고, 실험 결과 제안하는 방법의 우수성을 확인할 수 있었다.

• Journal of Communications and Networks
• /
• 제15권5호
• /
• pp.504-513
• /
• 2013

Communication in delay tolerant networks (DTNs) relies on message transport by mobile nodes, and a correct understanding of the node mobility characteristics is therefore crucial to the design of an efficient DTN routing protocol. However, previous work has mainly focused on uncovering all behaviors of node movement, which is not conducive to accurately detecting the specific movement characteristics of a different node. In this paper, we seek to address this problem based on a consideration of social relationships. We first consider social ties from both static and dynamic perspectives. For a static perspective, in addition to certain accidental events, social relations are considered for a long time granularity and tend to be stable over time. For a dynamic perspective, social relations are analyzed in a relatively short time granularity and are likely to change over time. Based on these perspectives, we adopted different efficient approaches to dividing node pairs into two classes, i.e., familiar and unfamiliar pairs. A threshold approach is used for static social ties whereas a density-based aggregation method is used for dynamic social relationships. Extensive experimental results show that both familiar and unfamiliar node pairs have the same inter-contact time distribution, which closely follows a power-law decay up to a certain point, beyond which it begins to exponentially decay. The results also demonstrate that the inter-contact time distribution of familiar pairs decays faster than that of unfamiliar pairs, whether from a static or dynamic perspective. In addition, we also analyze the reason for the difference between the inter-contact time distributions of both unfamiliar and familiar pairs.

• International Journal of Computer Science & Network Security
• /
• 제22권3호
• /
• pp.396-404
• /
• 2022

Online social networks contain a large amount of data that can be converted into valuable and insightful information. Text mining approaches allow exploring large-scale data efficiently. Therefore, this study reviews the recent literature on text mining in online social networks in a way that produces valid and valuable knowledge for further research. The review identifies text mining techniques used in social networking, the data used, tools, and the challenges. Research questions were formulated, then search strategy and selection criteria were defined, followed by the analysis of each paper to extract the data relevant to the research questions. The result shows that the most social media platforms used as a source of the data are Twitter and Facebook. The most common text mining technique were sentiment analysis and topic modeling. Classification and clustering were the most common approaches applied by the studies. The challenges include the need for processing with huge volumes of data, the noise, and the dynamic of the data. The study explores the recent development in text mining approaches in social networking by providing state and general view of work done in this research area.

• 인터넷정보학회논문지
• /
• 제10권3호
• /
• pp.131-140
• /
• 2009

최근 정보의 시각화를 연구하는 쪽에서는 그래프의 시각화에 많은 관심을 갖고 있는데, 그 중 사회망 (social network)의 시각화에 특히 집중하고 있다. 하지만 아직까지 사회망 내에서의 정보의 흐름을 시각화하는 방법에 대해서는 깊이 있는 연구가 진행되지 않고 있었다. 정보의 흐름은 사회망의 구조와 밀접하게 연관되어 있고, 또한 실제적인 상호관계의 동적인 구성을 보여주기 때문에 사회망의 구조적 특징보다 더 유용한 정보를 담고 있다. 따라서 정보의 흐름을 시각화하는 것은 매우 중요하다. 본 논문에서는 초대형 사회망을 마치 온라인 지도서비스를 이용하듯이 탐색하고, 사회망 내에서의 정보의 흐름을 관찰할 수 있는 방법에 관하여 제안한다. 이를 위하여 (i) 초대형 사회망을 2차원 그래프에 맵핑하는 방법과, (ii) 줌-인, 줌-아웃 기능 등을 활용하여 그래프를 탐색하는 방법, 그리고 (iii) 효율적인 질의 처리 프레임웍을 구축하는 방법을 고안하였다. 이 방법들을 이용하여 초대형 사회망을 제한적인 공간과 한정된 자원을 이용하여 효과적으로 표현할 수 있고, 이에 기반을 두어 사회망에서의 정보의 흐름을 시각화할 수 있게 된다.

• Journal of Communications and Networks
• /
• 제17권2호
• /
• pp.110-117
• /
• 2015

In mobile social network, it is a critical challenge to select an optimal set of devices to supply high quality service constantly under dynamic network topology and the limit of device capacity in mobile ad-hoc network (MANET). In this paper, a multi-devices composition and maintenance problem is proposed with ubiquitous service model and network model. In addition, a multi-devices composition and maintenance approach with dynamic planning is proposed to deal with this problem, consisting of service discovery, service composition, service monitor and service recover. At last, the simulation is implemented with OPNET and MATLAB and the result shows this mechanism is better applied to support complex ubiquitous service.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권8호
• /
• pp.3568-3584
• /
• 2016

In mobile opportunistic networks (MONs), human-carried mobile devices such as PDAs and smartphones, with the capability of short range wireless communications, could form various intermittent contacts due to the mobility of humans, and then could use the contact opportunity to communicate with each other. The dynamic changes of the network topology are closely related to the human mobility patterns. In this paper, we propose a social motivation-aware mobility model for MONs, which explains the basic laws of human mobility from the psychological point of view. We analyze and model social motivations of human mobility mainly in terms of expectancy value theory and affiliation motivation. Furthermore, we introduce a new concept of geographic functional cells, which not only incorporates the influence of geographical constraints on human mobility but also simplifies the complicated configuration of simulation areas. Lastly, we validate our model by simulating three real scenarios and comparing it with reality traces and other synthetic traces. The simulation results show that our model has a better match in the performance evaluation when applying social-based forwarding protocols like BUBBULE.