臺灣博碩士論文加值系統

隨著Web2.0網路應用成功的發展，社交網路不再只是一種概念，而是能夠實際存在網路上的一種社會結構。在現實世界中，存在許多不同種類的社群網路，但是現今網路上的社群網路平台大部分都建立於朋友關係之上，例如: Facebook、Twitter、Google+。目前沒有一個學術網路可以提供研究者探索及了解其他研究者的學術網路。因此，這篇論文的目的是建立一個台灣資訊領域的學術網路，提供使用者能更有效地了解研究者和他們之間的關聯。在我們的研究方法中，首先收集266 學者發表的16,981篇著作篇名，利用維基百科電腦科學內文建立LSA分類器，將著作篇名透過LSA分類器對應至所屬領域，從中取得學者在各研究領域的成果。最後透過研究者之間的研究領域、合作關係、機構單位建立台灣資訊學術網路。

第一章 緒論 1
1.1 研究動機與目的 1
1.2 問題定義 1
1.3 方法簡介 1
1.4 論文架構 2
第二章 相關研究 3
2.1 主題-關鍵詞 3
2.2 主題模型 4
第三章 研究方法 6
3.1 語料處理 7
3.1.1 單字詞 9
3.1.2 名詞片語 11
3.2 學術研究關係處理 12
3.3 學術合作 19
3.3.1 論文合作 19
3.3.2 教育合作 20
3.4 機構關係 22
3.5 關係結果處理 22
第四章 實驗與實驗分析 24
4.1分類實驗 24
4.2 統計結果 24
4.3分群實驗 25
第五章 結論 37
參考文獻 38
附錄 40

[1] Deerwester, S. , Dumais, S. T. , Furnas, G. W. , Landauer, T. K. , & Harshman, R. (1990) , "Indexing By Latent Semantic Analysis", Journal of the American Society For Information Science,41, 391-407. 10
[2] Griths T. L, and Steyvers M. (2004) , "Finding scientic topics", Proceedings of the National Academy of Sciences,101 (suppl. 1), 5228-5235.
[3] Blei D. M., Ng A. Y., and Jordan M. I. (2003) , "Latent Dirichlet Allocation",Journal of Machine Learning Research, 3 : 993-1022.
[4] Y. Yang, (1999) , "An evaluation of statistical approaches to text categorization", Information Retrieval, 1, pp. 69-90.
[5] Lagus, K, Honkela, T., Kaski, S., and Kohonen, T. (1999) , "WEBSOM for textual data mining", Articial Intelligence Review, 13 (5{6), pp. 345-364.
[6] Kaski, S. (1998) , " Dimensionality Reduction by Random Mapping: Fast Similarity Computation for Clustering", In Proceedings of IJCNN ’98, International Joint Conference on Neural Networks 1 413–418. IEEE Service Center: Piscataway, NJ.
[7] Berry, M.W., Dumais, S. T., and O'Brien, G. W. (1995) , "Using linear algebra for intelligent information retrieval", SIAM Review, vol. 37, no. 4, pp. 573-595.
[8] Hofmann, T. (1999) , "Probabilistic latent semantic indexing", in Proceedings of the 22nd International Conference on Research and Development in Information Retrieval (SIGIR'99)
[9] Rosen-Zvi, M., Griths, T., Steyvers, M., Smyth, P. (2004), "The author-topic model for authors and documents", Proceedings of the 20th UAI Conference
[10] Tang J., Zhang J., Yao L., Li J., Zhang L., and Su. Z. (2008), "Arnetminer: Extraction and mining of academic social networks". In Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (SIGKDD’08), pages 990–998.
[11] 楊瀟，馬軍，楊同峰，杜言琦，邵海敏(2010)，"主題模型LDA的文檔自動文摘"，智能系統學報
[12] 李文波，孫樂，黃瑞紅，馮元勇，張大鯤(2008)，"基於Labeled-LDA模型的本文分類新算法”，第三屆全國信息檢索與內容安全學會會議
[13] Porter M(1980), Porter stemming algorithm, software available at http://nltk.googlecode.com/svn/trunk/doc/api/nltk.stem.porter-module.html
[14] Chris Manning, Dan Jurafsky(2010), Stanford parser, software available at http://nlp.stanford.edu/software/lex-parser.shtml
[15] Schutze, H., Hull, D. A, et.al. "A comparison of classifiers and document representations for the routing problem", In Proceedings of SIGIR-95, 1995. 229–237.
[16] L Chen, N Tokuda, A Nagai (2003). "A new differential LSI space-based probabilistic document classifier", Information Processing Letters 2003,88(5):203-212
[17] Steyvers M., Smyth P., and Griffiths T. (2004). "Probabilistic author-topic models for information discovery. ", In Proc. of SIGKDD’04.
[18] Griffiths T.L., Steyvers M., Blei D., and Tenenbaum J.B. "Integrating topics and syntax. " In Advances in Neural Information Processing Systems 17. MIT Press, Cambridge, MA, 2005.
[19] McCallum A., Corrada Emmanuel A., and X. Wang. "The author-recipient-topic model for topic and role discovery in social networks". Technical Report UM-CS-2004-096, Department of Computer Science,University of Massachusetts, 2004.
[20] Buntine W., Lofstrm J., Perki J., Perttu S., Poroshin V., Silander T., Tirri H., Tuominen A., and Tuulos. V."A scalable topic-based open source search engine". In IEEE/WIC/ACM International Conference on Web Intelligence, pages 228–234, 2004.
[21] Blei D. and Lafferty J.. "Correlated topic models". In Neural Information Processing Systems, volume 18,2006.
[22] Shou-de Lin and Hans Chalupsky ,”using unsupervised link discovery methods to find interesting facts and connections in a bibliography dataset”, in a bibliography dataset. SIGKDD Explorations, 5(2) 173-178, December 2003
[23] Shou-de Lin and Hans Chalupsky. Unsupervised Link Discovery in Multi-relational Data via Rarity Analysis. In Proceedings of the Third IEEE International Conference on Data Mining. Melbourne, Florida. 2003