政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/51321
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 113648/144635 (79%)
Visitors : 51671921      Online Users : 755
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/51321


    Title: 動態社會網路之趨勢指標發展與應用之研究─以政府官員異動為例
    Development and application of trend metrics in dynamic social networks─a case study in government officials changes
    Authors: 鄭遠祥
    Cheng, Yuan Hsiang
    Contributors: 劉吉軒
    Liu, Jyi Shane
    鄭遠祥
    Cheng, Yuan Hsiang
    Keywords: 動態網路分析
    社會網路分析
    政府官員異動
    政治權力關係
    資料探勘
    資料分析
    Dynamic Network Analysis
    Social Network Analysis
    Government official’s changing
    Political power relations
    Data Mining
    Data Analysis
    Date: 2010
    Issue Date: 2011-10-05 14:43:53 (UTC+8)
    Abstract: 對於零碎且結構複雜的資料來源時,社會網路分析能夠給予整體性的觀察,還能檢視個體之間的關係。目前社會網路分析研究中,因為將網路退化至簡單連結關係,所以會遺失許多珍貴的資訊。而網路規模和型態隨著研究議題的不同,也會跟著增大或趨於多變,但動態網路分析能夠提供我們檢視每個時期,網路的變化或社群的形成或消失,甚至能知道節點間的互動影響。本論文研究,以政府人事異動資料為主,並且加入了其他政府組織的相關資料,建構出政府組織的從屬網路,並在每個網路快照中,擷取出重要的官員異動;每一筆人事異動都是一個事件的發生,而特任或簡任官員在本研究中視為重要事件,從這些重要事件的發生,我們能夠對每個時間的官員,使用EventRank的演算法做排名計算。最後能從時間的變化中,觀察出每個時期的佔有重要影響力的官員。
    To fragmented and complex structure data, social network analysis (SNA) can give an overall observation, but also view the relationship between individuals. Recent research in SNA is the degradation of the network link to a simple relationship but it will lose a lot of valuable information. The size and type of network with different research topics will follow the increase or rapidly changing, dynamic network analysis can provide our view of changes in the network or community to form or disappear in every period, even know the impact of the interaction between nodes. This thesis is based on the government official changes and other related data to construct manager-subordinate network of the government organization and capture the important interactions between officials in every network snapshot. An official change is the occurrence of an event and special level official changes in this study as a critical event. From these critical events, we can use the Event Rank algorithm to rank the officials. Finally, we can observe which official has more influence from the time changes.
    Reference: [1]顏秋來.〈政務官與事務官體制運作之研究〉,第二卷第一期.《國家菁英》, 2006.頁21-28 pp.
    [2]胡龍騰.〈政黨輪替前後高階行政主官流動之比較〉,第三卷第四期.《國家精英》, 2007.頁31-42 pp.
    [3]林嘉誠.〈政務首長的流動分析-2000.5-2007.5〉,第三卷第四期.《國家精英》, 2007.頁1-28 pp.
    [4]林岡隆.〈政府官員異動之社會網路分析〉.《國立政治大學資訊科學系碩士論文》, 2009.
    [5]黃俊生.〈基於社會網路分析連結預測理論之政府官員職位與職務歷程影響硏究〉.《國立政治大學資訊科學系碩士論文》, 2010.
    [6] V. Krebs. The social life of routers. The Internet Protocol Journal, 3(4):14–25, 2000.
    [7] P.J. Carrington, J. Scott, and S. Wasserman. Models and methods in social network analysis. Cambridge Univ Pr, 2005. ISBN 0521809592.
    [8] D. Knoke and J.H. Kuklinski. Network analysis. Sage Publications, Inc, 1982. ISBN 080391914X. ISSN 0149-192X.
    [9] R.A. Hanneman and M. Riddle. Introduction to social network methods. University of California Riverside, CA, 2005. 74
    [10] A. Ahmed, V. Batagelj, X. Fu, S.H. Hong, D. Merrick, and A. Mrvar. Visu¬alisation and analysis of the Internet movie database. In Visualization, 2007. APVIS’07. 2007 6th International Asia-Pacific Symposium on, pages 17–24. IEEE, 2007. ISBN 1424408091.
    [11] T.Y. Berger-Wolf and J. Saia. A framework for analysis of dynamic social networks. In Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 523–528. ACM, 2006. ISBN 1595933395.
    [12] K. Matthias. Towards autonomic management in system administration. 2008.
    [13] K. Lerman, R. Ghosh, and J.H. Kang. Centrality metric for dynamic networks. In Proceedings of the Eighth Workshop on Mining and Learning with Graphs, pages 70–77. ACM, 2010.
    [14] L. Getoor and C.P. Diehl. Link mining: a survey. ACM SIGKDD Explorations Newsletter, 7(2):3–12, 2005. ISSN 1931-0145.
    [15] S. Bender-deMoll and D.A. McFarland. The art and science of dynamic net¬work visualization. Journal of Social Structure, 7(2), 2006.
    [16] K.M. Carley. Dynamic network analysis. In Dynamic social network modeling and analysis: Workshop summary and papers, pages 133–145. Comittee on Human Factors, National Research Council, 2003.
    [17] J. O’Madadhain, J. Hutchins, and P. Smyth. Prediction and ranking algo¬rithms for event-based network data. ACM SIGKDD Explorations Newsletter, 7(2):23–30, 2005. ISSN 1931-0145.
    [18] J. O’Madadhain and P. Smyth. EventRank: A framework for ranking time-varying networks. In Proceedings of the 3rd international workshop on Link discovery, pages 9–16. ACM, 2005. ISBN 1595932151.
    [19] S. Yuan, Q. Bai, M. Zhang, and K.T. Win. Discovery of core-nodes in event-based social networks. In Fuzzy Systems and Knowledge Discovery, 2009. FSKD’09. Sixth International Conference on, volume 2, pages 430–434. IEEE, 2009.
    [20] S. Asur, S. Parthasarathy, and D. Ucar. An event-based framework for charac-terizing the evolutionary behavior of interaction graphs. ACM Transactions on Knowledge Discovery from Data (TKDD), 3(4):1–36, 2009. ISSN 1556-4681.
    [21] M. Takaffoli, F. Sangi, J. Fagnan, and O.R. Za ”ıane. A Framework for Analyzing Dynamic Social Networks. In 7th Confer¬ence on Applications of Social Network Analysis (ASNA)., 2010.
    [22] L. Licamele and L. Getoor. Social capital in friendship-event networks. In Data Mining, 2006. ICDM’06. Sixth International Conference on, pages 959–964. IEEE, 2007. ISSN 1550-4786.
    [23] J.M. Kleinberg. Hubs, authorities, and communities. ACM Computing Surveys(CSUR), 31(4es):5–es, 1999. 76
    [24] L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation rank¬ing: Bringing order to the web. 1999.
    Description: 碩士
    國立政治大學
    資訊科學學系
    98753026
    99
    Source URI: http://thesis.lib.nccu.edu.tw/record/#G0098753026
    Data Type: thesis
    Appears in Collections:[Department of Computer Science ] Theses

    Files in This Item:

    File SizeFormat
    302601.pdf9853KbAdobe PDF2895View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback