臺灣博碩士論文加值系統

過去有研究初步證明了由文獻間鏈結關係所導出的集群與由文獻內容所導出的集群之間有一致性，也就是文獻之間的相關性同時也隱喻文獻之間內容的相似性，這樣的研究是以文獻的集群為分析單位。我們想知道經由與某研究議題相關之文獻間的參考關係拓墣所導引出的重要文獻是否也代表了此文獻與這研究議題有較高的相關性，文獻重要性與議題相關性的分析單位是各篇文章。為了證實文獻重要性也隱喻文獻與主題有較高的關聯性，我們應用鏈結分析來導出重要性，用LDA來塑模主題關聯性。
主題關聯性是透過文字探勘方法計算重要字詞的機率值所導出，而文獻的重要性則是由文集內之文獻間的鏈結所導出，本研究想探索由文獻參考鏈結所導出的重要性與由文獻內文所導出的主題機率分配之間是否有關聯。若能證明文獻主題之機率分配與文獻之重要性相關，就能由一個新的角度證明文獻鏈結關係與文獻主題有一致性。
本研究首先使用由本研究室自行開發的智識結構系統(Intellectual Structurer)從微軟學術資料庫蒐集三個議題的文集，透過蒐集到的引文資訊幫助我們找出適當的門檻值，並將文集進行鏈結分析(PageRank & HITS)得出每篇文獻的重要性權重值，並將門檻值內權重值較高的文獻保留後，使用隱含狄利克雷分佈模型(Latent Dirichlet allocation, LDA)進行LDA主題分佈機率值的運算，並使用K-means方法來與LDA方法中的資訊進行比對驗證，驗證無誤後將引文分析得出每篇文獻的被引用次數、鏈結分析得出每篇文獻的權重值與隱含狄利克雷分佈模型得出的LDA主題分佈機率值三者進行斯皮爾曼等級相關係數(Spearman's rank correlation coefficient)相關性檢定，最後研究結果顯示，鏈結分析的權重值與文獻主題之間呈現顯著相關。

Recent research has found that the relatedness between documents implies their content similarity. The relatedness metrics between documents are derived from the linkage relationships between them, such as citation and co-citation relationships. The content similarity is represented by the cosine values between their VSM (Vector Space Model) document vectors. The linkage relationships between documents have been used to derive the importance metrics through link analysis algorithms, such as PageRank and HITS. From past research, we already knew linkage between documents are correlated with their content similarity. We speculate that the linkage-derived importance metrics may also correlate with the content derived topics.
We collected document corpora of three distinct research fields from Microsoft Academic Research academic database, and calculated the importance metrics of these corpora using PageRank and HITS. We kept 100 to 200 documents with the highest importance metrics from each corpus and modeled latent topics of documents in the corpora using the Latent Dirichlet Allocation (LDA) model. The possibilities of documents belong to a topic become a ranked list of probabilities. Through the Spearman’s ranking correlation analysis, we found the sorted topic belonging possibilities correlated with the importance metrics of these documents. The result of this study implies that the more importance of a document, the higher relevance of the document to a topic. We found preliminary evidence that the importance (of document) implies relevance (to a topic).

中文摘要 I
英文摘要 II
目次 III
圖次 IV
表次 V
第一章、緒論 1
第一節、研究背景與動機 1
第二節、研究目的 2
第三節、研究架構 3
第二章 、文獻探討 5
第一節、 引文分析 5
第二節、 鏈結分析 7
2.2.1 PageRank演算法 8
2.2.2 Hyperlink-Induced Topic Search (HITS)演算法 10
第三節、 文字探勘 14
第四節、 隱含狄利克雷分佈模型 18
第三章、研究方法 21
第一節、研究流程 21
第二節、資料蒐集 22
第三節、資料運算 23
第四節、資料交叉比對 27
第五節、資料分析 28
第四章、研究結果與討論 30
第一節、研究實作 30
第二節、研究評估 48
第五章、結論與建議 54
第一節、結論 54
第二節、研究限制 55
第三節、未來研究建議 55
第六章、參考文獻 56
附錄一 測試文集完整結果呈現 61
附錄二 測試文集 LDA主題的關鍵字詞分佈 106
簡　　歷 118
著作權聲明 119

陳光華，江玉婷，莊雅蓁，許雅淑(1998). 引文分析研究發展現況。書府，18/19，15-47。
陳瑋. (2008). 鉅量引文資料分析. 臺北大學資訊管理研究所學位論文, 1-65.
Achlioptas, D., Fiat, A., Karlin, A. R., & McSherry, F. (2001). Web search via hub synthesis. Paper presented at the Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on.
Aiello, W., Chung, F., & Lu, L. (2000). A random graph model for massive graphs. Paper presented at the Proceedings of the thirty-second annual ACM symposium on Theory of computing.
Azzopardi, L., Girolami, M., & Van Rijsbergen, C. (2004). Topic based language models for ad hoc information retrieval. Paper presented at the Neural Networks, 2004. Proceedings. 2004 IEEE International Joint Conference on.
Barabási, A.-L., & Albert, R. (1999). Emergence of Scaling in Random Networks. Science, 286(5439), 509-512. doi:10.1126/science.286.5439.509
Bharat, K., & Henzinger, M. R. (1998). Improved algorithms for topic distillation in a hyperlinked environment. Paper presented at the Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval.
Bindra, A. (2012). SocialLDA: Scalable Topic Modeling in Social Networks. (Master), University of Washington.
Blei, D. M., Ng, A. Y., & Jordan, M. I. (2003). Latent dirichlet allocation. the Journal of machine Learning research, 3, 993-1022.
Borodin, A., Roberts, G. O., Rosenthal, J. S., & Tsaparas, P. (2005). Link analysis ranking: algorithms, theory, and experiments. ACM Transactions on Internet Technology (TOIT), 5(1), 231-297.
Brin S., and Page, L. (1998). The Anatomy of a Large-scale Hypertextual Web-search Engine. In Proceedings of the Seventh International World Wide Web Conference.
Chakrabarti, S., Dom, B., Raghavan, P., Rajagopalan, S., Gibson, D., & Kleinberg, J. (1998). Automatic resource compilation by analyzing hyperlink structure and associated text. Computer Networks and ISDN Systems, 30(1), 65-74.
Chen, C. (2000). Domain visualization for digital libraries. Paper presented at the Information Visualization, 2000. Proceedings. IEEE International Conference on.
Chen, T. T. (2012). The development and empirical study of a literature review aiding system. Scientometrics, 92(1), 105-116.
Chen, T. T. (2015). The congruity between linkage‐based factors and content‐based clusters—an experimental study using multiple document corpora. Journal of the Association for Information Science and Technology.
Chen, T. T., & Xie, L. Q. (2005). Identifying critical focuses in research domains. Paper presented at the Information Visualisation, 2005. Proceedings. Ninth International Conference on.
Chubin, D. E., Porter, A. L., & Rossini, F. A. (1984). “Citation classics” analysis: An approach to characterizing interdisciplinary research. Journal of the American Society for Information Science, 35(6), 360-368.
Cohn, D., & Chang, H. (2000). Learning to probabilistically identify authoritative documents. Paper presented at the ICML.
Dean, J., & Henzinger, M. R. (1999). Finding related pages in the World Wide Web. Computer Networks, 31(11–16), 1467-1479. doi: http://dx.doi.org/10.1016/S1389-1286(99)00022-5
Ding, C., He, X., Husbands, P., Zha, H., & Simon, H. D. (2002). PageRank, HITS and a unified framework for link analysis. Paper presented at the Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval.
Ding, Y., Yan, E., Frazho, A., & Caverlee, J. (2009). PageRank for ranking authors in co-citation networks. Journal of the American Society for Information Science and Technology, 60(11), 2229-2243. doi: 10.1002/asi.21171
Dwork, C., Kumar, R., Naor, M., & Sivakumar, D. (2001). Rank aggregation methods for the web. Paper presented at the Proceedings of the 10th international conference on World Wide Web.
Feldman, R., Fresko, M., Kinar, Y., Lindell, Y., Liphstat, O., Rajman, M., Schler, Y., and Zamir, O. (1998). Text Mining at the Term Level. In Proceedings of the 2nd European Symposium on Principles of Data Mining and Knowledge Discovery. pp. 65-73. Nantes, France.
Fishkin, R. (2010). "Latent Dirichlet Allocation (LDA) and Google's Rankings are Remarkably Well Correlated" Retrieved June 20, 2015 from https://moz.com/blog/lda-and-googles-rankings-well-correlated
Frigyik, B. A., Kapila, A., & Gupta, M. R. (2010). Introduction to the Dirichlet distribution and related processes. Department of Electrical Engineering, University of Washignton, UWEETR-2010-0006.
Garfield, E. (1955). Citation indexes for science: A new dimension in documentation through association of ideas. Science(New York, N.Y.), 122(3159), 108-111.
Gerard S., Michael J. (1986), Introduction to Modern Information Retrieval, McGraw-Hill, Inc., New York, NY
Gibson, D., Kleinberg, J., & Raghavan, P. (1998). Inferring web communities from link topology. In Proceedings of the 9th ACM Conference on Hypertext and Hypermedia (Pittsburgh, Pa., June 20–24). ACM, New York, pp. 225–234.
Griffiths, T. L., & Steyvers, M. (2004). Finding scientific topics. Proceedings of the National Academy of Sciences, 101(suppl 1), 5228-5235.
Guan, T., & Wong, K.-F. (1999). KPS: a Web information mining algorithm. Computer Networks, 31(11–16), 1495-1507. doi: http://dx.doi.org/10.1016/S1389-1286(99)00048-1
Haveliwala, T. H. (2003). Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search. Knowledge and Data Engineering, IEEE Transactions on, 15(4), 784-796.
Heinrich, G. (2003). CPSS Core Principles for Payment Systems. Current Developments in Monetary and Financial Law, 2, 691-722.
Heinrich, G. (2005). Parameter estimation for text analysis,. Tech. rep., University of Leipzig.
Henzinger, M. R. (2001). Hyperlink analysis for the web. Internet Computing, IEEE, 5(1), 45-50.
Hu, D. J. (2009). Latent dirichlet allocation for text, images, and music. University of California, San Diego. Retrieved April, 26, 2013.
Hull, D. A. (1996). Stemming algorithms: a case study for detailed evaluation. Journal of the American Society for information Science, 47(1), 70-84.
Imambi, S. S., & Sudha, T. (2011). A Novel Feature Selection Method for Classification of Medical Documents from Pubmed International Journal of Computer Applications, 26, 29-33.
Jardine, J., Teufel, S. (2014). Topical PageRank : A Model of Scientific Expertise for Bibliographic Search, In: Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics, pp. 501–510
Jeh, G., & Widom, J. (2002). SimRank: a measure of structural-context similarity. Paper presented at the Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining.
Kakkonen, T., Myller, N., Sutinen, E., & Timonen, J. (2008). Comparison of dimension reduction methods for automated essay grading. Journal of Educational Technology & Society, 11(3), 275-288.
Keim, D. A. (2001). Visual exploration of large data sets. Communications of the ACM, 44(8), 38-44.
Kleinberg, J. M. (1999). Authoritative sources in a hyperlinked environment. Journal of the ACM (JACM), 46(5), 604-632.
Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., & Upfal, E. (2000). Stochastic models for the web graph. Paper presented at the Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on.
Linstead, E., Rigor, P., Bajracharya, S., Lopes, C., & Baldi, P. (2007). Mining concepts from code with probabilistic topic models. Paper presented at the Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering.
Ma, N., Guan, J., & Zhao, Y. (2008). Bringing PageRank to the citation analysis.
Information Processing and Management, 44(2), 800-810.
MacQueen, J. (1967). Some methods for classification and analysis of multivariate observations. Paper presented at the Proceedings of the fifth Berkeley symposium on mathematical statistics and probability.
Neto, J., Santos, A., Kaestner, C., & Freitas, A. (2000). Document clustering and text summarization. In Proceedings of the 4th International Conference Practical Applications of Knowledge Discovery and Data Mining (PADD-2000) (pp. 41–55).
Ng, A. Y., Zheng, A. X., & Jordan, M. I. (2001). Stable algorithms for link analysis. Paper presented at the Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval.
Page, L., Brin, S., Motwani, R., and Winograd, T.(1998). The PageRank Citation Ranking: Bringing Order to the Web. Technical report, Stanford Digital Library Technologies Project.
Pazzani, M., Muramatsu, J. and Billsus, D.(1996). Syskill and Webert: Identifying interesting Web sites. Proceedings of the Thirteen National Conference on Arti¢cial Intelligence, AAAI'96, Portland, OR, pp. 54-61, Available online at http://www.ics.uci.edu/~pazzani/Syskill.html.
Salton, G., & Buckley, C. (1988). Term-weighting approaches in automatic text retrieval. Information processing & management, 24(5), 513-523.
Salton, G., & McGill, M. J. (1986). Introduction to Modern Information Retrieval: McGraw-Hill, Inc.
Sayyadi, H., & Getoor, L. (2009). FutureRank: Ranking Scientific Articles by Predicting their Future PageRank Proceedings of the 2009 SIAM International Conference on Data Mining (pp. 533-544).
Seo, Y., Ankolekar, A., & Sycara, K. (2004). Feature selection for extracting semantically rich words. Technical Report CMU-RI-TR-04-18, Robotics Institute, Carnegie Mellon University, Pittsburgh, PA
Shiri, A. (2004). Introduction to Modern Information Retrieval. Library Review, 53(9), 462-463.
Sil, D. K., Sengamedu, S. H., & Bhattacharyya, C. (2011). Readalong: reading articles and comments together. Paper presented at the Proceedings of the 20th international conference companion on World wide web.
Spertus, E. (1997). ParaSite: mining structural information on the Web. Computer Networks and ISDN Systems, 29(8–13), 1205-1215. doi: http://dx.doi.org/10.1016/S0169-7552(97)00033-0
Su, C., Pan, Y., Yuan, J., Guo, H., Yu, Z., & Hu, Z. (2009). PageRank, HITS and Impact Factor for Journal Ranking. Paper presented at the Computer Science and Information Engineering, 2009 WRI World Congress on.
Sugiyama, K., Hatano, K., Yoshikawa, M., & Uemura, S. (2003). Refinement of TF-IDF schemes for web pages using their hyperlinked neighboring pages. Paper presented at the Proceedings of the fourteenth ACM conference on Hypertext and hypermedia, Nottingham, UK.
Sugiyama, K., Hatano, K., Yoshikawa, M., & Uemura, S. (2005). Improvement in TF-IDF scheme for Web pages based on the contents of their hyperlinked neighboring pages. Systems and Computers in Japan, 36(14), 56-68. doi: 10.1002/scj.20189
Wang, J., Huang, Y., Wu, G., & Zhang, F. (1999). Web mining: knowledge discovery on the Web. Paper presented at the Systems, Man, and Cybernetics, 1999. IEEE SMC '99 Conference Proceedings. 1999 IEEE International Conference on.
Zhou, S., K. Li, and Y. Liu, (2008). Text Categorization Based on Topic Model, in Rough Sets and Knowledge Technology, G. Wang, et al., Editors. Springer Berlin Heidelberg. p. 572-579.