• Journal of the Korean Society for information Management
• /
• v.32 no.4
• /
• pp.205-221
• /
• 2015

The impact of a journal is commonly used as the impact of an individual paper within that journal. It is problematic to interpret a journal's impact as a single paper's impact of the journal, so there are several researches to measure a single paper's impact with its own citation counts. This study applied 8 impact indicators to Korean Citation Index database and examined discipline bias of each indicator. Analyzed indicators are simple citation counts, PageRank, f-value, CCI, c-index, single publication h-index, single publication hs-index, and cl-index. PageRank has the least discipline bias at highly ranked papers and journal bias in a discipline. On the contrary, simple citation counts showed strongly biased results toward a certain discipline or a journal. KCI database provides only simple citation counts. It needs to show PageRank (global indicator) to discover influential papers in diverse areas. Furthermore it needs to consider to provide the best of local indicators. Local indicators can be calculated only with papers in users' search results because they uses citation counts of citing papers and the number of references. They are more efficient than global indicators which explore the whole database. KCI should also consider to provide Cl-index (local indicator).

• Journal of Internet Computing and Services
• /
• v.22 no.4
• /
• pp.1-11
• /
• 2021

As the Internet developed, various and complex cyber attacks began to emerge. Various detection systems were used outside the network to defend against attacks, but systems and studies to detect attackers inside were remarkably rare, causing great problems because they could not detect attackers inside. To solve this problem, studies on the lateral movement detection system that tracks and detects the attacker's movements have begun to emerge. Especially, the method of using the Remote Desktop Protocol (RDP) is simple but shows very good results. Nevertheless, previous studies did not consider the effects and relationships of each logon host itself, and the features presented also provided very low results in some models. There was also a problem that the model could not explain why it predicts that way, which resulted in reliability and robustness problems of the model. To address this problem, this study proposes an interpretable RDP-based lateral movement detection system using page rank algorithm and SHAP(Shapley Additive Explanations). Using page rank algorithms and various statistical techniques, we create features that can be used in various models and we provide explanations for model prediction using SHAP. In this study, we generated features that show higher performance in most models than previous studies and explained them using SHAP.

• Journal of Korean Library and Information Science Society
• /
• v.41 no.2
• /
• pp.297-315
• /
• 2010

This study investigates the various statistical data and measures of coauthorship network in the Korean LIS Research Community such as patterns of coauthorship, structural properties, types of cluster, centrality & impact analysis. This issues are mostly addressed through a Social Network Analysis of articles published from 2000 to 2009(10 years) in Korean Library & Information Science major four Journals. The coauthorship network was constructed and various measures of four centralities, PageRank, Effect size were calculated. The results show three implications. 1) There presents a phenomenon of Pareto's law in the articles publishing counts. 2) The top authors based on publishing counts prefer co-work publishing than solo-publishing. 3) The counts of article publishing are significantly correlated with five measures of network and not correlated with the case of power centrality.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06a
• /
• pp.98-100
• /
• 2012

모바일 웜의 전파 속도는 시간이 지날수록 급격히 빨라진다. 급속도로 전파하는 웜을 억제하기 위한 연구가 계속 진행되어 왔다. 기존 연구 중 하나로 소셜 네트워크를 그래프(Graph)로 표현하고 분할한 뒤 각 파티션의 대표노드(Key Node)를 선택해 웜 패치를 전파하는 기법이 있다. 이 기법은 패치 전파 속도를 웜 전파 속도보다 빠르게 해서 웜을 억제 시킨다. 하지만 이 기법에서는 대표노드에 가중치(Weight)가 낮은 간선(Edge)이 연결 될 수 있거나 대표노드가 없는 파티션이 생길 수 있다. 잘못된 대표노드 선정은 패치 전파속도를 저하시키고 웜 억제를 지연시킬 수 있다. 본 논문에서는 페이지랭크를 이용해서 대표노드를 선정하는 개선된 소셜 네트워크 기반의 웜 패칭 기법을 제안한다. 제안 기법은 웜 패칭 전략에 사용할 수 있도록 수정한 페이지랭크를 각 파티션에 적용해서 대표노드를 선정한다. 파티션마다 전파 능력이 가장 높은 노드가 대표노드로 선정되기 때문에 웜 패치 전파 속도를 향상시킬 수 있다.

• The Journal of the Korea Contents Association
• /
• v.21 no.1
• /
• pp.24-38
• /
• 2021

This study aims to measure Korea's global competitiveness in intelligent information technology, which is the core technology of the 4th industrial revolution. For analysis, we collect patents of each field and prior patents cited by them, which are applied at the U.S. Patent Office (USPTO) between 2010 and 2018 from PATSTAT Online. A global knowledge transfer network was established by grouping citing- and cited-relationships at a national level. The in-degree centrality is used to evaluate technology acceptance, which indicates the process of absorbing existing technological knowledge to create new knowledge in each field. Second, to evaluate the impact of existing technological knowledge on the creation of new one, the out-degree centrality is investigated. Third, we apply the PageRank algorithm to qualitatively and quantitatively investigate the importance of the relationships between countries. As a result, it is confirmed through all the indicators that the AI sector is currently the least competitive.

• Journal of KIISE
• /
• v.43 no.10
• /
• pp.1131-1143
• /
• 2016

How can we effectively compress big graphs composed of billions of edges? By concentrating non-zeros in the adjacency matrix through vertex rearrangement, we can compress big graphs more efficiently. Also, we can boost the performance of several graph mining algorithms such as PageRank. SlashBurn is a state-of-the-art vertex rearrangement method. It processes real-world graphs effectively by utilizing the power-law characteristic of the real-world networks. However, the original SlashBurn algorithm displays a noticeable slowdown for large-scale graphs, and cannot be used at all when graphs are too large to fit in a single machine since it is designed to run on a single machine. In this paper, we propose a distributed SlashBurn algorithm to overcome these limitations. Distributed SlashBurn processes big graphs much faster than the original SlashBurn algorithm does. In addition, it scales up well by performing the large-scale vertex rearrangement process in a distributed fashion. In our experiments using real-world big graphs, the proposed distributed SlashBurn algorithm was found to run more than 45 times faster than the single machine counterpart, and process graphs that are 16 times bigger compared to the original method.

• The Journal of Society for e-Business Studies
• /
• v.17 no.4
• /
• pp.69-93
• /
• 2012

Various influence-related relationships in Social Network Services (SNS) among users, posts, and user-and-post, can be expressed using links. The current research evaluates the influence of specific users or posts by analyzing the link structure of relevant social network graphs to identify influential users. We applied the concept of mutual interactions proposed for ranking semantic web resources, rather than the voting notion of Page Rank or HITS, to blogosphere, one of the early SNS. Through many experiments with network models, where the performance and validity of each alternative approach can be analyzed, we showed the applicability and strengths of our approach. The weight tuning processes for the links of these network models enabled us to control the experiment errors form the link weight differences and compare the implementation easiness of alternatives. An additional example of how to enter the content scores of commercial or spam posts into the graph-based method is suggested on a small network model as well. This research, as a starting point of the study on identifying influential users in SNS, is distinctive from the previous researches in the following points. First, various influence-related properties that are deemed important but are disregarded, such as scraping, commenting, subscribing to RSS feeds, and trusting friends, can be considered simultaneously. Second, the framework reflects the general phenomenon where objects interacting with more influential objects increase their influence. Third, regarding the extent to which a bloggers causes other bloggers to act after him or her as the most important factor of influence, we treated sequential referencing relationships with a viewpoint from that of PageRank or HITS (Hypertext Induced Topic Selection).

• Journal of Intelligence and Information Systems
• /
• v.20 no.1
• /
• pp.195-211
• /
• 2014

Cloud computing services provide IT resources as services on demand. This is considered a key concept, which will lead a shift from an ownership-based paradigm to a new pay-for-use paradigm, which can reduce the fixed cost for IT resources, and improve flexibility and scalability. As IT services, cloud services have evolved from early similar computing concepts such as network computing, utility computing, server-based computing, and grid computing. So research into cloud computing is highly related to and combined with various relevant computing research areas. To seek promising research issues and topics in cloud computing, it is necessary to understand the research trends in cloud computing more comprehensively. In this study, we collect bibliographic information and citation information for cloud computing related research papers published in major international journals from 1994 to 2012, and analyzes macroscopic trends and network changes to citation relationships among papers and the co-occurrence relationships of key words by utilizing social network analysis measures. Through the analysis, we can identify the relationships and connections among research topics in cloud computing related areas, and highlight new potential research topics. In addition, we visualize dynamic changes of research topics relating to cloud computing using a proposed cloud computing "research trend map." A research trend map visualizes positions of research topics in two-dimensional space. Frequencies of key words (X-axis) and the rates of increase in the degree centrality of key words (Y-axis) are used as the two dimensions of the research trend map. Based on the values of the two dimensions, the two dimensional space of a research map is divided into four areas: maturation, growth, promising, and decline. An area with high keyword frequency, but low rates of increase of degree centrality is defined as a mature technology area; the area where both keyword frequency and the increase rate of degree centrality are high is defined as a growth technology area; the area where the keyword frequency is low, but the rate of increase in the degree centrality is high is defined as a promising technology area; and the area where both keyword frequency and the rate of degree centrality are low is defined as a declining technology area. Based on this method, cloud computing research trend maps make it possible to easily grasp the main research trends in cloud computing, and to explain the evolution of research topics. According to the results of an analysis of citation relationships, research papers on security, distributed processing, and optical networking for cloud computing are on the top based on the page-rank measure. From the analysis of key words in research papers, cloud computing and grid computing showed high centrality in 2009, and key words dealing with main elemental technologies such as data outsourcing, error detection methods, and infrastructure construction showed high centrality in 2010~2011. In 2012, security, virtualization, and resource management showed high centrality. Moreover, it was found that the interest in the technical issues of cloud computing increases gradually. From annual cloud computing research trend maps, it was verified that security is located in the promising area, virtualization has moved from the promising area to the growth area, and grid computing and distributed system has moved to the declining area. The study results indicate that distributed systems and grid computing received a lot of attention as similar computing paradigms in the early stage of cloud computing research. The early stage of cloud computing was a period focused on understanding and investigating cloud computing as an emergent technology, linking to relevant established computing concepts. After the early stage, security and virtualization technologies became main issues in cloud computing, which is reflected in the movement of security and virtualization technologies from the promising area to the growth area in the cloud computing research trend maps. Moreover, this study revealed that current research in cloud computing has rapidly transferred from a focus on technical issues to for a focus on application issues, such as SLAs (Service Level Agreements).