臺灣博碩士論文加值系統

近年來，資訊科技的迅速發展與網路技術的快速成長，使得商務網站日趨競爭。而面對未來資訊整合的時代，過去網站總是著重在內容建置與商品行銷，而隨著網路公司泡沫化後，如何在網站的經營模式中，找尋到網站的商機與如何減少網站的維護成本，均是值得網站經營者所應重視的問題。
因此，本研究以商務網站為案例，提出一個具網頁商品自動化佈置的方法，利用一般化指派問題(Generalized Assignment Problems: GAP)與關聯法則探勘(Association Rules Mining)技術，建構一資料庫驅動(Database-Driven)之整合型網站，使系統能蒐集使用者的相關記錄，並透過系統機制的運作，以提供網頁商品自動化佈置之推薦，進而調整現行的行銷策略與經營模式。
本研究的實驗結果，提供未來網站經營者一個資料庫驅動之網站雛型及商品自動化佈置的概念，以減少網站的維護成本，並藉由網頁商品自動化的佈置，以獲得更大的利潤，進而提升網站的競爭力。

In recent years, competition among the E-commerce websites is intense by the rapid development of information science and technology and the fast growth of the network technique. To face the age of integrated information in the future, the websites in the past stress the content constructing and production promotion. Along with the Internet bubble has collapsed, it is an important and worthy topic to the website manager to pay much attention that how to find the business opportunity of the website and reduce the cost of maintaining website in the business model of website.
Therefore, this study takes the commercial website as a case, proposes a method which is the web products’ automation layout. The method uses the generalized assignment problems (GAP) and the association rules mining technique to build a database-driven integrated website. This system can collect the related records through users and provide the recommending of the web products’ automation layout, further, modify the promotion strategy and business model currently.
The result of this study provides a prototype of database-driven website and the idea of web products’ automation layout in order to reduce the cost of maintaining website. And obtaining more profit and raising the website’s competition via the web products’ automation layout for the manager in the future.

摘　要 I
ABSTRACT II
誌　謝 III
目 錄 IV
表目錄 VI
圖目錄 VII
第一章 緒論 1
1.1 研究背景與動機 1
1.2 研究目的 3
1.3 研究流程 3
1.4 研究範圍與限制 4
1.5 論文架構 5
第二章 文獻探討 6
2.1網際探勘(WEB MINING) 6
2.1.1 網際探勘概述 6
2.1.2 網際探勘之分類 6
2.1.3 網際習慣探勘技術 9
2.1.4 網際習慣探勘之問題 9
2.1.5 網際探勘之應用 10
2.2關聯法則探勘(ASSOCIATION RULES MINING) 11
2.2.1 關聯法則探勘概述 11
2.2.2 關聯法則探勘名詞定義 11
2.2.3 Apriori演算法 13
2.2.4 關聯法則探勘之應用 14
2.3網頁佈置(WEB PAGE LAYOUT) 14
2.3.1 網頁佈置概述 14
2.3.2 網頁文件的分類 15
2.3.3 網頁佈置的準則 15
2.4指派問題(ASSIGNMENT PROBLEMS;AP) 16
2.4.1 指派問題概述 16
2.4.2 線性指派問題(Linear assignment problems;LAP) 16
2.4.3 一般化指派問題(Generalized assignment problems;GAP) 17
2.4.4 指派問題之應用 18
第三章 系統分析與設計 19
3.1 研究架構 19
3.1.1 系統架構 19
3.1.2 商務網站之功能架構樹狀圖 20
3.1.3 網站商品自動佈置之數學模型 20
3.1.4 網站商品自動佈置之效用理論模型 21
3.2 系統分析 22
3.2.1 系統開發工具 22
3.2.2 系統功能分析 23
3.3 系統設計 26
3.3.1 資料庫設計 26
3.3.2 模組設計 30
第四章 系統實作 33
4.1 實作環境 33
4.2 系統運作流程 34
4.2.1 商務網站展示 34
4.2.2 高頻項目集探勘 38
4.2.2.1 網頁商品之高頻項目集探勘 38
4.2.2.2 網頁廣告之高頻項目集探勘 39
4.2.3 一般化指派問題運算 39
4.2.3.1 網頁之商品一般化指派問題運算 39
4.2.3.2 網頁之廣告一般化指派問題運算 40
4.2.4 網頁物件之自動佈置 41
4.2.4.1 網頁之商品自動佈置 41
4.2.4.2 網頁之廣告自動佈置 43
第五章 結論與未來研究建議 46
5.1 結論 46
5.2 建議 47
參考文獻 48
附錄 51
A、APRIORI演算法步驟一之虛擬碼 52
B、APRIORI演算法步驟二之虛擬碼 53
C、版權聲明 54
作者簡介 55

[1] 王錫中，運用關聯法則技術於產品開發設計之研究，碩士論文，元智大學工業工程與管理研究所，中壢，2002。
[2] 吳曉蘋，應用資料探勘於物流中心之訂單統合，碩士論文，國立臺北科技大學商業自動化與管理研究所，台北，2001。
[3] 李明德，網路廣告輪播系統之開發，碩士論文，國立中央大學機械工程研究所，中壢，2000。
[4] 張恭維，結合關聯法則與模糊叢聚之網際探勘架構，碩士論文，元智大學資訊管理學系碩士班，中壢，2001。
[5] 許靜芬，應用網際探勘於網頁及商品自動化推薦系統之研究，碩士論文，國立台灣科技大學資訊管理系，台北，2001。
[6] 陳建中，交叉集關聯法則，碩士論文，國立台灣大學資訊管理研究所，台北，2000。
[7] 陳建銘，類神經網路於Web Mining 之應用，碩士論文，國立臺北科技大學商業自動化與管理研究所，台北，2001。
[8] Balachandran, V. "An integer generalized transportation model for optimal job assignment in computer networks", Operations Research, v. 24, n.4, p.742-749, 1976.
[9] Catrysse, D. and Van Wassenhove, L.N., "A survey of algorithms for the Generalized Assignment Problem", European Journal of Operational Research., vol. 60, 1992, pp. 260-272.
[10] Chen M.S., Part J.S., and Yu P.S., 1998, "Efficient Data Mining for Path Traversal Patterns", IEEE Transactions on Knowledge and Data Engineering, vol. 10, no. 2, 1998, pp. 209-221.
[11] Cooley, R., Mobasher, B. and Srivastava, J., "Web Mining: Information and Pattern Discovery on the World Wide Web", Technical Report TR 97-027, University of Minnesota, Dept. of Computer Science and Engineering, (1996).
[12] De Farias Jr., I.R. and Nemhauser, G.L. (2001). "A family of inequalities for the generalized assignment poltope," Operations Research Letters, 29. 49-55.
[13] De Maio, A. and Roveda, C., "An all zero-one algorithm for a certain class of transportation problems", Operations Research, vol. 19, 1971, pp. 406-1418.
[14] Dijin Gong, Mitsuo Gen, Genji Yamazaki, Weixuan Xu, "Neural Network Approach for General Assignment Problem", IEEE, 1995, pp.1861-1866.
[15] Etzioni., "The World Wide Web: Quagmire or Gold Mine?", CACM, Nov 96/Vol.39, No.11.
[16] Fayyad, U.M., "Data mining and knowledge discovery:making sense out of data", IEEE Expert, vol 11, no 5, 1996, pp. 20-25.
[17] Fisher, M.L., Jaikumar, R., "A generalized assignment heuristic for vehicle routing", Networks, V. 11, p. 109-124, 1981.
[18] H. Toivonen, "Sampling Large Databases for Association Rules", Proc. Of the 21st VLDB Conference , 1996, pp. 134-145.
[19] J. S. Park, M. S. Chen, and P. S. Yu, "An effective hash based algorithm for mining association rules", Proc. Of the ACM SIGMOD, 1995 , pages 175-186.
[20] Jan Borchers, Oliver Deussen, Arnold Klingert, Clemens Knorzer, "Layout Rules for Graphical Web Documents", Computers & Graphics, vol. 20, no. 3, 1996.
[21] Jiawei Han and Micheline Kamber, "Data Mining: Concepts and Techniques", August 2000.
[22] Koopmans, T.C. and Beckmann, M. (1957). "Assignment problems and the location of economic activities," Econometrica, 25. 53-76.
[23] Michael Chan, Gin Yu, "Extracting Web Design Knowledge:The Web De-Compiler", IEEE, 1999.
[24] P. van Schaik, J. Ling, "The effects of frame layout and differential background contrast on visual search performance in Web pages", Interacting with Computers, vol. 13, no. 5, 2001, pp.513-525.
[25] R. Agrawal and R. Srikant, "Fast Algorithm for Mining Association Rules", In Proc. 1994 int''1 Conf. VLDB, pp.487-499, Santiago, Chile, Sep.1994.
[26] R. Agrawal and R. Srikant, "Mining Sequential Patterns", In Proc. of the 11th Int''l Conference on Data Engineering, Taipei, Taiwan, March 1995.
[27] R. Agrawal, Tomasz Imielinshki, and Arun Swami, "Mining association rules between sets of items in large databases", In Proc. Of the ACM SIGMOD Conference on Management of Data, pp. 207-216, Washington, D.C., May 1993.
[28] Romeijn, H.E. and Morales, D.R., "A class of greedy algorithms for the generalized assignment problem," Discrete Applied Mathematics, 103. 2000, pp.209-235.
[29] Ross, G.T. and Soland, R.M.,"A branch and bound algorithm for the generalized problem," Mathematical Programming, 8. 1975, 91-103.
[30] S. Brin, R. Motwani, J. D. Ullman, and S. Tsur, "Dynamic itemset counting and implication rules for market basket data," Proc. Of the ACM SIGMOD, 1997, pages 255-264.
[31] Savasee, E. Omiecinski, and S. Navathe, "An efficient algorithm for mining association rules in large databases", Proc. Of the 21st VLDB Conference, 1995, pp.432-444.
[32] Taha, H., "Integer Programming: Theory, Applications and Computaions," Academy Press, New York, 1975.
[33] Thorndike, R.L. "The problem of classification of personnel," Psychometrika, 15, 1950, pp.215-235.
[34] X. Zhu, J. Yu, and J. Doyle. "Heavy tails, generalized coding, and optimal web layout", In Proceedings of IEEE INFOCOM, 2001.
[35] Yi, J. and Sundaresan, N., "Mining the Web for Acronyms Using the Duality of Patterns and Relations", Proceedings of the Second International Workshop on Web Information and Data Management, 1999, pp.48-52.
[36] Tingshao Zhu, Web Mining, http://www.cs.ualberta.ca/~tszhu/webmining.htm
[37] Zaiane O.R., Web Usage Mining, http://www.cs.ualberta.ca/~tszhu/webproject.htm