1 / 4

Homework - 2

Homework - 2. March 2013 Youn-Hee Han http://link.koreatech.ac.kr. Twitter, Facebook 쇼셜 그래프 특성 분석. 활용할 데이터 집합 http://snap.stanford.edu/data/egonets-Facebook.html http://snap.stanford.edu/data/egonets-Twitter.html SCC (Strongly Connected Components)

gotzon
Download Presentation

Homework - 2

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Homework - 2 March 2013 Youn-Hee Han http://link.koreatech.ac.kr

  2. Twitter, Facebook 쇼셜 그래프특성분석 • 활용할데이터 집합 • http://snap.stanford.edu/data/egonets-Facebook.html • http://snap.stanford.edu/data/egonets-Twitter.html • SCC (Strongly Connected Components) • A directed graph is “strongly connected” if it contains a directed path from u to v and a directed path from v to u for every pair of vertices u and v. • The strong connected components are the maximal strongly connected subgraphs. • WCC (Weakly Connected Components) • A directed graph is “weakly connected” if replacing all of its directed edges with undirected edges produces a connected graph. • The weakly connected components are the maximal weakly connected subgraphs. LINK@KOREATECH

  3. Twitter, Facebook 쇼셜 그래프특성분석 • 두개의 데이터 집합 (Twitter, Facebook)에 대하여 방향 그래프를 생성하고 다음 사항을 조사하라. • 총 노드의 수 • 총 간선의 수 • Average clustering coefficient • Radius & Diameter • 최대 WCC안의 총 노드의 수 • 최대 WCC안의 총 간선의 수 • 최대 SCC안의 총 노드의 수 • 최대 SCC안의 총 간선의 수 • Top 10 Nodes of Degree Centrality • Top 10 Nodes of Closeness Centrality • Top10 Nodes of Betweenness Centrality • Top10 Nodes of Eigenvector Centrality [note] 만약 Centrality 를 구하는 데 시간이 너무 많이 걸리면 일정한 기준에 맞추어 노드와 간선의 수를 줄인 후에 계산할 것 LINK@KOREATECH

  4. Graph Generators 를사용한그래프특성분석 • 참고사이트 • SCC & WCC • http://networkx.github.com/documentation/latest/reference/algorithms.component.html • Centrality • http://networkx.github.com/documentation/latest/reference/algorithms.centrality.html • 제출방법 • 서론, 본론, 결론형태의보고서작성 • 결론부분에는고찰한내용의종합적인내용과본과제후소감을적을것 • yh21.han@koreatech.ac.kr계정으로이메일제출 • 기한: 2013년 4월 7일 (일요일) 자정까지 LINK@KOREATECH

More Related