政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/49477

政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/49477

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | 全文筆數/總筆數 : 113648/144635 (79%)
造訪人次 : 51614761 線上人數 : 754

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

搜尋範圍

查詢小技巧：

您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果

若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料

進階搜尋

主頁 ‧ 登入 ‧ 上傳 ‧ 說明 ‧ 關於政大典藏 ‧ 管理

到手機版

政大機構典藏 > 資訊學院 > 資訊科學系 > 學位論文 > Item 140.119/49477

請使用永久網址來引用或連結此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/49477

題名:	由史料中探勘社會網絡：以乾隆時期為例 Social Network Mining from Historical Documents- by Example during Qianlong`s Reign
作者:	朱政吉 Chu, Cheng Ji
貢獻者:	沈錳坤 Shan, Man Kwan 朱政吉 Chu, Cheng Ji
關鍵詞:	社會網絡探勘乾隆 Social Network Mining Qianlong
日期:	2007
上傳時間:	2010-12-08 12:11:08 (UTC+8)
摘要:	古今中外歷史中，在政治權力的結構裡，除了在最上位的領袖外，其下的文武百官，往往根據其職份或私交等情況，自成人際關係網絡。然而，依照每個人在網絡中位置的不同，重要程度也有所不同。在網絡中扮演重要角色者，除了代表其人際關係愈複雜外，同時也暗示其政治影響力愈大。這些人物往往也就是足以影響當時政治的「權臣」。然而在歷史上，有些皇帝的在位時間較長、統治時間較久。在其統治期間，可能因為皇帝本身，或政治環境遞嬗等因素，使得不同的時期有不同「權臣」，或是其晚年才出現明顯的「權臣」。本論文便是基於這樣的歷史現象，研究由史料中探勘當時的人脈網絡。我們先從文本中，自動擷取出人名。然後，藉由人物在文本中與其他人物的共現場合，建立歷史人物的人脈網絡，接著利用社會網絡分析的理論基礎，分析這些網絡，進而在網絡中找出權臣，以及偵測政治權力結構的變化，為時代作出分期。本研究選用的文本為《清實錄》中的《高宗純皇帝實錄》，意欲以清高宗 (乾隆)時期為例，探勘該朝的人脈網絡，完成上述之工作。希望這樣的研究，可以在中國政治制度史等研究上，協助史學研究者。 In power structure from ancient times to the present, officials who under the leader usually take part in the social network according to their positions or friendship. However, the importance of each person is different by their locations in network. The people who play important roles in network have complex interpersonal relationship as well as high influence in political situation. We call them "chief counselors." But in the history, some emperors reign for extremely many years. Due to some causes, such like emperor himself or changing of political circumstances, there could be several different chief counselors during their reign. This thesis focuses on social network mining from historical documents in view of above-mentioned historical phenomenon. After extracting person names from the corpus, we can construct social network by co-occurrence of people, then to find chief counselors and detect transition of power structure by Social Network Analysis. The "Veritable Records of Gaozong" is taken as the example for experiments and the result of effectiveness analysis demonstrates that the proposed methods are helpful to assist historian for historical research.
參考文獻:	[1] 毛婷婷、李麗雙與黃德根，"基於混合模型的中國人名識別"，《中文信息學報》，第二十一卷，第二期，2007年。 [2] 古鴻廷，清代官制研究，五南圖書出版社，臺北，2005年。 [3] 江建忠，蝕日者，年輪文化出版社，臺北，1999年。 [4] 李中國與劉穎，"邊界模板和局部統計相結合的中國人名識別"，《中文信息學報》第二十卷，第五期，2006年。 [5] 杜維運，史學方法論，三民書局出版社，臺北，2001年10月。 [6] 李澍田編，清實錄東北史料全輯 (共三冊)，吉林文史出版社，長春，1988年。 [7] 張尚斌，"詞夾子演算法在專有名詞辨識上的應用─以歷史文件為例"，臺灣大學資訊工程學系碩士論文，2005年。 [8] 張敏與毛少平，"用於信息檢索的古文統計分析"，《中文信息學報》第十五卷第六期，2001年。 [9] 陳捷先，滿文清實錄研究，大化書局出版社，臺北，1978年。 [10] 趙爾巽等纂修，清史稿 (共五冊)，博愛出版社，臺北，1983年。 [11] 蔡秉叡，"和珅與乾隆朝晚期(1775－1795)政局之研究"，成功大學歷史學系碩士論文，2007年。 [12] 蕭一山，清代通史(共三冊)，商務出版社，臺北，1962年。 [13] 蕭一山，清史，中華文化出版社，臺北，1952年。 [14] 錢實甫編，清代職官年表 (共四冊)，中華書局出版社，北京，1980年。 [15] 羅鳳珠，"臺灣地區中國古籍數位化的現況與展望"，第三次兩岸古籍整理研究學術討論會，2001年4月。 [16] E. Agichtein and L. Gravano, "Snowball: Extracting Relations from Large Plain-text Collections," Proceedings of the 5th ACM Conference on Digital Libraries, pages 85-94, 2000. [17] R. Baeza-Yates and B. Ribeiro-Neto, Modern Information Retrieval, The ACM Press, 1999. [18] M. A. Beauchamp, "An Improved Index of Centrality," Behavioral Science, Vol. 10, pages 161-163, 1965. [19] R. L. Breiger, The Analysis of Social Networks: In Handbook of Data Analysis, London: Sage Publication, 2004. [20] D. Davidov, A. Rappoport and M. Koppel, "Fully Unsupervised Discovery of Concept-Specific Relationships by Web Mining," Proceedings of the 45th Annual Meeting of the Association of Computational Linguistics, pages 232-239, 2007. [21] C. K. Fan and W. H. Tsai, "Automatic Word Identification in Chinese Sentences by the Relaxation Technique," Proceedings of National Computer Symposium, pages 423-431, 1987. [22] L. Freeman, "Centrality in Social Networks: Conceptual Clarification," Social Networks, Vol. 1, No. 3, pages 215-239, 1979. [23] S. L. Hakimi, "Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph," Operations Research, Vol. 12, No. 3, pages 450-459. [24] M. Hearst, "Automatic Acquisition of Hyponyms from Large Text Corpora," Proceedings of the 14th Annual Meeting of the Association of Computational Linguistics, pages 535-545, 1992. [25] A.K. Jain and R.C. Dubes, Algorithms for Clustering Data, Englewood Cliffs: Prentice Hall Publication, 1988. [26] B.Y. Li, S. Lin, C.F. Sun and M.S. Sun, "A Maximal Matching Automatic Chinese Word Segmentation Algorithm Using Corpus Tagging for Ambiguity Resolution," Proceedings of R.O.C. Computational Linguistics Conference, pages 135-146, 1991. [27] K.T Lua and K.W Gan, "An Application of Information Theory in Chinese Word Segmentation," Journal of Computer Processing of Chinese and Oriental Language, Vol. 8, No. 1, pages115-124, 1994. [28] U. Manber, Introduction to Algorithms: A Creative Approach, Addison Wesley, 1989. [29] S. Miller, H. Fox, L. Ramshaw, and R. Weischedel, "A Novel Use of Statistical Parsing to Extract Information from Text," Proceedings of the 6th Applied Natural Language Processing Conference, pages 226-233, 2000. [30] M. Newman, "The structure and function of complex networks," SIAM Review, Vol. 45, No. 2, pages 167- 256, 2003. [31] J. Y. Nie, M. L. Hannan, and W. Jin, "Unknown Word Detection and Segmentation of Chinese Using Statistical and Heuristic Knowledge," Journal of Communications of the Chinese and Oriental Languages Information Processing Society, Vol. 5, pages 47-57, 1995. [32] J. Nieminen, "On Centrality in a Graph," Scandinavian Journal of Psychology, Vol. 15, pages 332-226, 1974. [33] W. D. Nooy, Exploratory network analysis with Pajek, New York: Cambridge University Press, 2005. [34] E. Riloff and R. Jones, "Learning Dictionaries for Information Extraction by Multi-level Bootstrapping," Proceedings of the 16th National Conference on Artificial Intelligence, pages 474-479, 1999. [35] P. Turney, "Expressing Implicit Semantic Relations without Supervision," Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association of Computational Linguistics, pages 313-320, 2006. [36] S. Wasserman and K. Faust, Social Network Analysis: Methods and Applications, New York: Cambridge University Press, 1994. [37] D. Zelenko, C. Aone, and A. Richardella, "Kernel Methods for Relation Extraction," Journal of Machine Learning Research, Vol. 3, pages 1083-1106, 2003. [38] X. Zhu, M. Li, J. Gao and C.N. Huang, "Single Character Chinese Named Entity Recognition," Proceedings of the 2nd SIGHAN Workshop on Chinese Language Processing, pages 125-132, 2003.
描述:	碩士國立政治大學資訊科學學系 95753014 96
資料來源:	http://thesis.lib.nccu.edu.tw/record/#G0957530141
資料類型:	thesis
顯示於類別:	[資訊科學系] 學位論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
014101.pdf		54Kb	Adobe PDF2	631	檢視/開啟
014102.pdf		280Kb	Adobe PDF2	617	檢視/開啟
014103.pdf		150Kb	Adobe PDF2	650	檢視/開啟
014104.pdf		225Kb	Adobe PDF2	581	檢視/開啟
014105.pdf		384Kb	Adobe PDF2	633	檢視/開啟
014106.pdf		485Kb	Adobe PDF2	791	檢視/開啟
014107.pdf		696Kb	Adobe PDF2	662	檢視/開啟
014108.pdf		576Kb	Adobe PDF2	640	檢視/開啟
014109.pdf		162Kb	Adobe PDF2	563	檢視/開啟
014110.pdf		161Kb	Adobe PDF2	657	檢視/開啟
014111.pdf		595Kb	Adobe PDF2	943	檢視/開啟

在政大典藏中所有的資料項目都受到原著作權保護.

社群 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 © - 回饋