최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기韓國컴퓨터情報學會論文誌 = Journal of the Korea Society of Computer and Information, v.21 no.1, 2016년, pp.25 - 31
Han, Chi-Geun (Dept. of Computer Science, Kyung Hee University) , Lee, Sang-Hoon (Dept. of Computer Science, Kyung Hee University)
There are many methods to describe the importance of a node, centrality, in a graph. In this paper, we focus on the eigenvector centrality. In this paper, an analytical method to estimate the difference of centrality with an additional edge in a graph is proposed. In order to validate the analytical...
* AI 자동 식별 결과로 적합하지 않은 문장이 있을 수 있으니, 이용에 유의하시기 바랍니다.
P. Boldi and S. Vigna, "Axioms for Centrality", Social and Information Networks, Nov. 2013.
R. Lempel and S. Moran, "Rank-Stability and Rank-Similarity of Link-Based Web Ranking Algorithms in Authority-Connected Graphs", Information Retrieval, Vol. 8, No. 2, pp 245-264, 2005.
K. Avrachenkov and N. Litvak, "The Effect of New Links on Google Pagerank, Stochastic Models", 22 (2), pp. 319-331, 2006.
J. Ronqui and T. Gonzalo, "Analyzing Complex Networks Through Correlations in Centrality Measurements", Social and Information Networks, June 2014.
S. Borgatti, K. Carley and D. Krackhardt, "On the Robustness of Centrality Measures under Conditions of Imperfect Data", Social Networks 28.2, pp.124-136, 2006.
S. Segarra and A. Ribeiro, "Stability and Continuity of Centrality Measures in Weighted Graphs", Social and Information Networks, Oct. 2014.
T. Chartier, E. Kreutzer, A. Langville, and K. Pedings, "Sensitivity and Stability of Ranking Vectors", SIAM J. Sci. Comput., 33(3), pp. 1077-1102, 2011.
A. Ng, A. Zheng and M. Jordan, "Stable Algorithms for Link Analysis", SIGIR '01 Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 258-266, 2001.
C. Correa and K. Ma, "Visual Reasoning about Social Networks using Centrality Sensitivity", IEEE Transactions on Visualization and Computer Graphics, Vol. 18, No. 1, pp. 106-120, 2012.
G. Golub and C. Loan, "Matrix Computations", Johns Hopkins, 1988.
P. Erdos and A. Renyi, "On Random Graphs, I", Publicationes Mathematicae 6, pp. 290-297, 1959.
A.-L. Barabasi and R. Albert, "Emergence of Scaling in Random Networks", Science, 286, pp. 509-512, 1997.
D. Watts and S. Strogatz, "Collective Dynamics of 'Small-World' Networks", Nature 393 (6684), pp. 440-442. 1998.
Woo-Key Lee, "Detecting Intentionally Biased Web Pages In terms of Hypertext Information", Journal of The Korea Society of Computer and Information, Vol. 10, No. 1, pp.59-66, 2005.
Sang-Un Lee, "Maximum Degree Vertex Central Located Algorithm for Bandwidth Minimization Problem", Journal of The Korea Society of Computer and Information, Vol. 20, No. 7, pp.41-47, 2015.
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
Free Access. 출판사/학술단체 등이 허락한 무료 공개 사이트를 통해 자유로운 이용이 가능한 논문
※ AI-Helper는 부적절한 답변을 할 수 있습니다.