• Title/Summary/Keyword: pagerank

Search Result 9, Processing Time 0.02 seconds

Experimental Evaluation of PageRank/BFS Queries on Distributed Graph Processing Systems (최신 분산 그래프 처리 시스템에서의 PageRank/BFS 질의 처리 성능 평가)

  • Lee, Kyeong-Jun;Kim, Hyeonji;Lee, Yukyoung;Lee, Juneyoung;Kim, Kangsu;Han, Wook-Shin
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2017.04a
    • /
    • pp.826-828
    • /
    • 2017
  • 그래프는 객체와 객체 간의 관계를 표현하는 데에 있어 효과적인 데이터 표현 방법이다. 그래프 데이터는 웹 그래프, 사회 관계망 서비스, 신약 개발, 생명정보학 등의 다양한 분야에서 활용되고 있으며, 그래프 마이닝 응용에서 활용되기 위한 효율적인 처리 기술을 필요로 한다. 최근까지 그래프 데이터의 처리 및 분석을 위한 많은 시스템들이 개발되었다. 본 논문에서는 최신 분산 그래프 처리 시스템 중에서 대표적인 그래프 분석 질의인 페이지랭크(pagerank)와 너비 우선 탐색(breadth first search)를 수행하고 시스템의 성능을 평가한다.

SNA to assess the Influence of Organization Members (Focusing on core members of North Korea)

  • Lee, Young-Seok;Yoon, Soungwoong;Lee, Sang-Hoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.23 no.7
    • /
    • pp.73-80
    • /
    • 2018
  • There are various organizations in modern society, in which people have direct and indirect relationships. Internal structure of these organizations can be analyzed by the relationships which are officially pressed on the media. However, this task will be difficult when the media information is strictly limited, though the necessity of analyzing organization structure remains. In this study, we try to estimate the influence of North Korea's core members by using PageRank centrality to supplement the limitation of previous SNA analysis methods. Experimental results show that we can show and predict NK's power shifts more efficiently.

Performance Optimization Strategies for Fully Utilizing Apache Spark (아파치 스파크 활용 극대화를 위한 성능 최적화 기법)

  • Myung, Rohyoung;Yu, Heonchang;Choi, Sukyong
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.7 no.1
    • /
    • pp.9-18
    • /
    • 2018
  • Enhancing performance of big data analytics in distributed environment has been issued because most of the big data related applications such as machine learning techniques and streaming services generally utilize distributed computing frameworks. Thus, optimizing performance of those applications at Spark has been actively researched. Since optimizing performance of the applications at distributed environment is challenging because it not only needs optimizing the applications themselves but also requires tuning of the distributed system configuration parameters. Although prior researches made a huge effort to improve execution performance, most of them only focused on one of three performance optimization aspect: application design, system tuning, hardware utilization. Thus, they couldn't handle an orchestration of those aspects. In this paper, we deeply analyze and model the application processing procedure of the Spark. Through the analyzed results, we propose performance optimization schemes for each step of the procedure: inner stage and outer stage. We also propose appropriate partitioning mechanism by analyzing relationship between partitioning parallelism and performance of the applications. We applied those three performance optimization schemes to WordCount, Pagerank, and Kmeans which are basic big data analytics and found nearly 50% performance improvement when all of those schemes are applied.

The Study on the Ranking Algorithm of Web-based Sear ching Using Hyperlink Structure (하이퍼링크 구조를 이용한 웹 검색의 순위 알고리즘에 관한 연구)

  • Kim, Sung-Hee;O, Gun-Teak
    • Journal of Information Management
    • /
    • v.37 no.2
    • /
    • pp.33-50
    • /
    • 2006
  • In this paper, after reviewing hyperlink based ranking methods, we saw various other parameters that effect ranking. Then, We analyzed the PageRank and HITS(Hypertext Induced Topic Search) algorithm, which are two popular methods that use eigenvector computations to rank results in terms of their characteristics. Finally, google and Ask.com search engines were examined as examples for applying those methods. The results showed that use of Hyperlink structure can be useful for efficiency of web site search.

Comparison between Social Network Based Rank Discrimination Techniques of Data Envelopment Analysis: Beyond the Limitations (사회 연결망 분석 기반 자료포락분석 순위 결정 기법간 비교와 한계 극복 방안에 대한 연구)

  • Hee Jay Kang
    • Journal of Information Technology Services
    • /
    • v.22 no.1
    • /
    • pp.57-74
    • /
    • 2023
  • It has been pointed out as a limitation that the rank of some efficient DMUs(decision making units) cannot be discriminated due to the relativity nature of efficiency measured by DEA(data envelopment analysis), comparing the production structure. Recently, to solve this problem, a DEA-SNA(social network analysis) model that combines SNA techniques with data envelopment analysis has been studied intensively. Several models have been proposed using techniques such as eigenvector centrality, pagerank centrality, and hypertext induced topic selection(HITS) algorithm, but DMUs that cannot be ranked still remain. Moreover, in the process of extracting latent information within the DMU group to build effective network, a problem that violates the basic assumptions of the DEA also arises. This study is meaningful in finding the cause of the limitations by comparing and analyzing the characteristics of the DEA-SNA model proposed so far, and based on this, suggesting the direction and possibility to develop more advanced model. Through the results of this study, it will be enable to further expand the field of research related to DEA.

User Reputation Evaluation Using Co-occurrence Feature and Collective Intelligence (동시출현 자질과 집단 지성을 이용한 지식검색 문서 사용자 명성 평가)

  • Lee, Hyun-Woo;Han, Yo-Sub;Kim, Lae-Hyun;Cha, Jeong-Won
    • Korean Journal of Cognitive Science
    • /
    • v.19 no.4
    • /
    • pp.459-476
    • /
    • 2008
  • The user needs to find the answer to your question is growing fast at the service using collective intelligent knowledge. In the previous researches, it was proven that the non-text information like view counting, referrer number, and number of answer is good in evaluating answers. There were also many works about evaluating answers using the various kinds of word dictionaries. In this work, we propose new method to evaluate answers to question effectively using user reputation that estimated by the social activity. We use a modified PageRank algorithm for estimating user reputation. We also use the similarity between question and answer. From the result of experiment in the Naver GisikiN corpus, we can see that the proposed method gives meaningful performance to complement the answer selection rate.

  • PDF

Analysis of the different of Interest words between Korea and Vietnam using network theory - Focusing on smart city (네트워크 이론을 이용한 한국과 베트남의 관심어 차이 분석 - 스마트시티를 중심으로)

  • Jeong, Seong Yun;Kim, Nam Gon
    • Smart Media Journal
    • /
    • v.11 no.8
    • /
    • pp.73-83
    • /
    • 2022
  • In order to support new construction engineering companies with weak information power to successfully advance into the overseas construction market, this study tried to analyze what are the keywords of interest in the overseas construction market and how they differ from Korea. For this purpose, we recently collected 2,473 news article titles and major articles targeting smart cities that are of high interest in Korea and Vietnam. Through network configuration and topic modeling, we examined the connection relationship between the word of interest and the word of interest. In addition, the influence of the word of interest in the network was measured using PageRank centrality. Through this analysis, it was found that there is a high interest in smart city-related construction, cities, and digital in both countries, and the difference in terms of interest between Korea and Vietnam was inferred. Finally, the limitations of this study and additional research directions to complement them are presented.

Korea National College of Agriculture and Fisheries in Naver News by Web Crolling : Based on Keyword Analysis and Semantic Network Analysis (웹 크롤링에 의한 네이버 뉴스에서의 한국농수산대학 - 키워드 분석과 의미연결망분석 -)

  • Joo, J.S.;Lee, S.Y.;Kim, S.H.;Park, N.B.
    • Journal of Practical Agriculture & Fisheries Research
    • /
    • v.23 no.2
    • /
    • pp.71-86
    • /
    • 2021
  • This study was conducted to find information on the university's image from words related to 'Korea National College of Agriculture and Fisheries (KNCAF)' in Naver News. For this purpose, word frequency analysis, TF-IDF evaluation and semantic network analysis were performed using web crawling technology. In word frequency analysis, 'agriculture', 'education', 'support', 'farmer', 'youth', 'university', 'business', 'rural', 'CEO' were important words. In the TF-IDF evaluation, the key words were 'farmer', 'dron', 'agricultural and livestock food department', 'Jeonbuk', 'young farmer', 'agriculture', 'Chonju', 'university', 'device', 'spreading'. In the semantic network analysis, the Bigrams showed high correlations in the order of 'youth' - 'farmer', 'digital' - 'agriculture', 'farming' - 'settlement', 'agriculture' - 'rural', 'digital' - 'turnover'. As a result of evaluating the importance of keywords as five central index, 'agriculture' ranked first. And the keywords in the second place of the centrality index were 'farmers' (Cc, Cb), 'education' (Cd, Cp) and 'future' (Ce). The sperman's rank correlation coefficient by centrality index showed the most similar rank between Degree centrality and Pagerank centrality. The KNCAF articles of Naver News were used as important words such as 'agriculture', 'education', 'support', 'farmer', 'youth' in terms of word frequency. However, in the evaluation including document frequency, the words such as 'farmer', 'dron', 'Ministry of Agriculture, Food and Rural Affairs', 'Jeonbuk', and 'young farmers' were found to be key words. The centrality analysis considering the network connectivity between words was suitable for evaluation by Cd and Cp. And the words with strong centrality were 'agriculture', 'education', 'future', 'farmer', 'digital', 'support', 'utilization'.

RDP-based Lateral Movement Detection using PageRank and Interpretable System using SHAP (PageRank 특징을 활용한 RDP기반 내부전파경로 탐지 및 SHAP를 이용한 설명가능한 시스템)

  • Yun, Jiyoung;Kim, Dong-Wook;Shin, Gun-Yoon;Kim, Sang-Soo;Han, Myung-Mook
    • 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.