第五章 結論
第四節 未來研究方向
國
立 政 治 大 學
‧
N a tio na
l C h engchi U ni ve rs it y
於期刊文章特性，並且考慮開放獲取期刊的期刊網站使用情境，提出了可行且專 為期刊文章所設計的推薦機制，縮短學者與研究者在眾多的期刊文章中搜尋的時 間。
第三節 研究限制
一、實驗方法的研究時間與受測者人數限制
過去研究的驗證方法是以過去資料分成兩部分，一部分訓練集，一部實驗集，
以訓練集的資料做為推薦方法的計算基礎，並在實驗集中模擬推薦項目，並以實 驗集當中的使用者行為做為評估成效的方法。
過去驗證的模擬方式仍與實際使用者是否接受推薦的情境有所差異，因此本 研究以實驗網站與問卷兩部分進行，受限於研究時間以及受測者需符合碩士與博 士班資格且修習過電子商務與行動商務的條件，雖得以衡量方法之間的成效優劣，
但若要了解推薦成效以及推薦成效隨著時間的變化，則必須花費長時間與人力才 得以了解其中變化。
二、有限資訊進行推薦之限制
本研究的推薦機制符合在開放獲取期刊的情境下，並不會要求使用者註冊與 填寫相關資訊，因此取得使用者相關資訊有限，僅利用使用者瀏覽紀錄與期刊文 章特徵做為推薦基礎。
第四節 未來研究方向
本論文提出之推薦機制，結合了協同式過濾與內容過濾基礎的優點，但在 整體上仍不夠完整，仍有改善的地方如下所述：
‧ 國
立 政 治 大 學
‧
N a tio na
l C h engchi U ni ve rs it y
一、運行速度之考量
本研究藉由計算最近鄰居，篩選出與自己最新相似使用者的瀏覽文章。這 個步驟能減少關聯規則產生所需的計算時間，並大幅去不需要的特徵，建立屬 於每個人自己的關聯規則樹，但隨著使用者越來越多，運算速度會越來越差。
本研究並無考慮運行速的問題，往後的研究可以設法解決最近鄰居法所帶來的 問題。
二、實驗方法之設計
本研究的實驗能得到方法之間的效果優劣驗證，但對於每種推薦方法的時 間變化觀察是一大難題，如何能模擬實際情況並加入時間變化因素，有賴後進 研究者發展。
三、開放獲取期刊發展的影響
開放獲取期刊的發展對於學術論文的推薦系統而言，受限了所能使用的推 薦基礎資源，不知道使用者的背景資訊、實際偏好與研究領域，未來的學術論 文推薦系統必須考慮此點影響，如何利用有限資訊進行推薦方法的計算，達到 最佳的推薦效果是未來此方向的一大挑戰。
‧ 國
立 政 治 大 學
‧
N a tio na
l C h engchi U ni ve rs it y
參考文獻
一、中文部分
1. 余明哲，2002，圖書館個人化館藏推薦系統，國立交通大學碩士論文。
2. 邱建豪，2008，使用分群結合技術增進線上產品的推薦–以 MovieLens 為 例，國立中正大學碩士論文。
3. 張景堯，2007，以多重觀點本體論驅策之系統發展方法，國立政治大學博 士論文。
4. 許正怡，2008，植基於個人本體論模型與合作式過濾技術之中文圖書館推 薦系統，國立中興大學碩士論文。
5. 郭秉仁，2012，基於個人本體論與 MapReduce 技術之圖書推薦系統，國立 中興大學碩士論文。
6. 陳慧玲，2007，植基於個人本體論的圖書館推薦系統－以中興大學圖書館 為例，國立中興大學碩士論文。
7. 廖學毅，2007，動態協同式過濾推薦之系統實做，國立交通大學碩士論 文。
8. 蔡松霖，2013，電子商務推薦系統模型之初探，國立東華大學博士論文。
9. 羅子文，2007，Web 2.0 概念的圖書館個人化推薦系統，國立交通大學碩士 論文。
10. 楊永芳，2002，語意擴充式文件推薦方法之研究，國立中山大學碩士論 文。
‧
1. Adomavicius, G., & Tuzhilin, A. (2004). Recommendation Technologies: Survey of Current Methods and Possible
Extensions (Working Paper). Stern School of Business, New York University.
2. Agrawal, R., Imieliński, T., & Swami, A. (1993). Mining Association Rules Between Sets of Items in Large Databases. Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, New York, NY, USA, pp. 207–216.
3. Agrawal, R., & Srikant, R. (1994). Fast Algorithms for Mining Association Rules in Large Databases. Proceedings of the 20th International Conference on Very Large Data Bases, pp. 487–499.
4. Arslan, A., & Yilmazel, O. (2011). Frequent Pattern Mining Over Movie Plot Keywords. In International Conference on Computer and Computer Intelligence (ICCCI 2011), ASME Press.
5. Bobadilla, J., Ortega, F., Hernando, A., & Bernal, J. (2012). A collaborative filtering approach to mitigate the new user cold start problem. Knowledge-Based Systems, Vol. 26, 225–238.
6. Bobadilla, J., Ortega, F., Hernando, A., & Gutiérrez, A. (2013).
Recommender systems survey. Knowledge-Based Systems, Vol. 46, pp.
109–132.
7. Borgelt, C. (2005). An Implementation of the FP-growth Algorithm.
Proceedings of the 1st International Workshop on Open Source Data Mining: Frequent Pattern Mining Implementations, New York, NY, USA, pp. 1–5.
‧
8. Breese, J. S., Heckerman, D., & Kadie, C. (1998). Empirical Analysis of Predictive Algorithms for Collaborative Filtering. Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence, San Francisco, CA, USA: Morgan Kaufmann Publishers Inc, pp. 43–52.
9. Christakou, C., & Stafylopatis, A. (2005). A hybrid movie
recommender system based on neural networks. 5th International Conference on Intelligent Systems Design and Applications, 2005.
ISDA ’05. Proceedings, pp. 500–505.
10. Goldberg, D., Nichols, D., Oki, B. M., & Terry, D. (1992). Using Collaborative Filtering to Weave an Information Tapestry. Commun.
ACM, Vol. 35(12), pp. 61–70.
11. Han, J., Pei, J., & Yin, Y. (2000). Mining Frequent Patterns Without Candidate Generation. Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, New York, NY, USA, pp. 1–12.
12. He, J., & Chu, W. W. (2010). A Social Network-Based Recommender System (SNRS). Data Mining for Social Network Data, pp. 47–74.
13. He, Q., Pei, J., Kifer, D., Mitra, P., & Giles, L. (2010). Context-aware Citation Recommendation. Proceedings of the 19th International Conference on World Wide Web, New York, NY, USA, pp. 421–430 14. Herlocker, J. L., Konstan, J. A., Borchers, A., & Riedl, J. (1999). An
Algorithmic Framework for Performing Collaborative Filtering.
Proceedings of the 22Nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, New York, NY, USA, pp. 230–237.
‧
15. Jinha, A. E. (2010). Article 50 million: an estimate of the number of scholarly articles in existence. Learned Publishing, Vol. 23(3), pp. 258–
263.
16. Kantor, P. B., Rokach, L., Ricci, F., & Shapira, B. (2011).
Recommender systems handbook. Springer.
17. Kim, B.-D., & Kim, S.-O. (2001). A new recommender system to combine content-based and collaborative filtering systems. Journal of Database Marketing & Customer Strategy Management, Vol. 8(3), pp.
244–252.
18. Kim, W., Choi, D. W., & Park, S. (2008). Agent based intelligent search framework for product information using ontology
mapping. Journal of Intelligent Information Systems, Vol. 30(3), pp.
227–247.
19. Koren, Y. (2008). Factorization Meets the Neighborhood: A
Multifaceted Collaborative Filtering Model. Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, NY, USA, pp. 426–434.
20. Lee, J., Lee, K., & Kim, J. G. (2013). Personalized Academic Research Paper Recommendation System. arXiv preprint arXiv:1304.5457.
21. Liang, T.-P., Yang, Y.-F., Chen, D.-N., & Ku, Y.-C. (2008). A semantic-expansion approach to personalized knowledge
recommendation. Decision Support Systems, Vol. 45(3), pp. 401–412.
22. Lilien, G. L., Rangaswamy, A., Van Bruggen, G. H., & Starke, K.
(2004). DSS Effectiveness in Marketing Resource Allocation Decisions: Reality vs. Perception. Information Systems Research,
‧ 國
立 政 治 大 學
‧
N a tio na
l C h engchi U ni ve rs it y
23. Lin, C.-W., Hong, T.-P., & Lu, W.-H. (2009). The Pre-FUFP algorithm for incremental mining. Expert Systems with Applications, Vol. 36(5),
pp. 9498–9505.
24. Linden, G., Smith, B., & York, J. (2003). Amazon.Com
Recommendations: Item-to-Item Collaborative Filtering. IEEE Internet Computing, Vol. 7(1), pp. 76–80.
25. LUO, J., & LI, Y. M. (2010). Improvement on Algorithm FP-Growth and Applications in Its E-Commerce. Journal of China West Normal University (Natural Sciences), 3, 018.
26. Matsatsinis, N. F., Lakiotaki, K., & Delias, P. (2007). A System based on Multiple Criteria Analysis for Scientific Paper Recommendation, Technical University of Crete.
27. McLaughlin, M. R., & Herlocker, J. L. (2004). A Collaborative
Filtering Algorithm and Evaluation Metric That Accurately Model the User Experience. Proceedings of the 27th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, New York, NY, USA, pp. 329–336.
28. Naak, A., Hage, H., & Aïmeur, E. (2009). A Multi-criteria
Collaborative Filtering Approach for Research Paper Recommendation in Papyres, E-Technologies: Innovation in an Open World, Springer Berlin Heidelberg, pp. 25–39.
29. Nunamaker, J. F., Jr., Chen, M., & Purdin, T. D. M. (1990). Systems Development in Information Systems Research. J. Manage. Inf. Syst., Vol. 7(3), pp. 89–106.
‧
Recommender System Architecture for SupportingE-Commerce, Intelligent Distributed Computing VI . Springer Berlin Heidelberg, pp. 71–81.
31. Piateski, G., & Frawley, W. (1991). Knowledge discovery in databases.
MIT press.
32. PIATETSKY-SHAPIRO, G. (1991). Discovery, Analysis and
Presentation of Strong Rules. Knowledge Discovery in Databases, pp.
229–238.
33. Resnick, P., & Varian, H. R. (1997). Recommender Systems, Commun.
ACM, Vol. 40(3), pp. 56–58.
34. Salton, G., Wong, A., & Yang, C. S. (1975). A Vector Space Model for Automatic Indexing. Commun. ACM, Vol. 18(11), pp. 613–620.
35. Sarwar, B., Karypis, G., Konstan, J., & Riedl, J. (2000). Analysis of Recommendation Algorithms for e-Commerce. Proceedings of the 2Nd ACM Conference on Electronic Commerce, New York, NY, USA, pp.
158–167.
36. Sarwar, B., Karypis, G., Konstan, J., & Riedl, J. (2001). Item-based Collaborative Filtering Recommendation Algorithms. Proceedings of the 10th International Conference on World Wide Web ,New York, NY, USA, pp. 285–295
37. Sarwar, B. M., Konstan, J. A., Borchers, A., Herlocker, J., Miller, B., &
Riedl, J. (1998). Using Filtering Agents to Improve Prediction Quality in the GroupLens Research Collaborative Filtering System.
Proceedings of the 1998 ACM Conference on Computer Supported
‧
38. Sinha, R., Sinha, and R., & Swearingen, K. (2001). Comparing
Recommendations Made by Online Systems and Friends. Proceedings of the DELOS-NSF Workshop on Personalization and Recommender Systems in Digital Libraries.
39. Sugiyama, K., & Kan, M.-Y. (2010). Scholarly Paper Recommendation via User’s Recent Research Interests. Proceedings of the 10th Annual Joint Conference on Digital Libraries, New York, NY, USA, pp. 29–
38.
40. Tan, P.-N., Steinbach, M., & Kumar, V. (2005). Introduction to data mining. Boston: Pearson Addison Wesley.
41. Wang, H.-F., & Wu, C.-T. (2012). A strategy-oriented operation module for recommender systems in E-commerce. Computers &
Operations Research, Vol. 39(8), pp. 1837–1849.
42. Wang, K., Tang, L., Han, J., & Liu, J. (2002). Top Down FP-Growth for Association Rule Mining. , Advances in Knowledge Discovery and Data Mining. pp. 334–340.
43. Wang, Y., Liu, J., Dong, X., Liu, T., & Huang, Y. (2012). Personalized Paper Recommendation Based on User Historical Behavior. In M.
Zhou, G. Zhou, D. Zhao, Q. Liu, & L. Zou (Eds.), Natural Language Processing and Chinese Computing, Springer Berlin Heidelberg.
Retrieved from, pp. 1–12.
44. Xiaoyun, C., Yanshan, H., Pengfei, C., Shengfa, M., Weiguo, S., &
Min, Y. (2009). HPFP-Miner: A Novel Parallel Frequent Itemset Mining Algorithm. In Fifth International Conference on Natural Computation, 2009. ICNC ’09, Vol.3, pp. 139–143.
‧ 國
立 政 治 大 學
‧
N a tio na
l C h engchi U ni ve rs it y
45. Zaki, M. J. (2000). Scalable Algorithms for Association Mining. IEEE Trans. on Knowl. and Data Eng., Vol. 12(3), pp. 372–390.
‧ 國
立 政 治 大 學
‧
N a tio na
l C h engchi U ni ve rs it y
三、網路部分
1. Open Access, Association of Research Libraries, http://www.arl.org/focus-areas/open-scholarship/open-access。
‧ 國
立 政 治 大 學
‧
N a tio na
l C h engchi U ni ve rs it y
附錄一、問卷
實驗說明
推薦系統根據下文（前測您所挑選的 key paper）推薦給您下列文章，請依據行動 商務主題及前測的搜尋文獻方向考量實用呈度。
評分範圍 1~7，1:極度沒幫助；7 極度有幫助。
您的 key paper
Web Services Enabled Procurement In The Extended Enterprise: An
Architectural Design And Implementation
Abstract:
Earlier supply chain implementations in EDI and XML have not fully supported the real time and dynamic requirements of e-procurement, in large part due to the limitations of the technologies available. The purpose of this paper is to illustrate how Web services can be used to implement a real time and dynamic supply chain operation. In particular, we focus on an e-procurement application in the context of business-to-business (B2B) supply chain integration. A prototype system has been developed to illustrate how Web services can enhance performance of the firms engaged in B2B procurement. The architecture and design of the system presented in this paper are based on a service-oriented architecture and on a three-tier enterprise design pattern. The impacts and implications of using Web services to enable real-time and dynamic business processes are also discussed.
‧ 國
立 政 治 大 學
‧
N a tio na
l C h engchi U ni ve rs it y
Key Word:
Web services e-procurement
dynamic e-busines ssupply chain management
‧ 國
立 政 治 大 學
‧
N a tio na
l C h engchi U ni ve rs it y
推薦文章
THE IMPACT OF SECURITY AND SCALABILITY OF CLOUD SERVICE ON SUPPLY CHAIN
PERFORMANCE
Abstract:
Cloud computing introduces flexibility in the way an organization conducts its business. On the other hand, it is advisable for organizations to select cloud service partners based on how prepared they are owing to the uncertainties present in the cloud. This study is a conceptual research which investigates the impact of some of these uncertainties and flexibilities embellished in the cloud. First, we look at the assessment of security and how it can impact the supply chain operations using entropy as an assessment tool. Based on queuing theory, we look at how scalability can moderate the relationship between cloud service and the purported benefits. We aim to show that cloud service can only prove beneficial to supply partners under a highly secured, highly scalable computing environment and hope to lend credence to the need for system thinking as well as strategic thinking when making cloud service adoption decisions.
選分數評量
1 2 3 4 5 6 7
‧
The Role Of Mass Customization In Enhancing Supply Chain Relationships In B2c E-Commerce Markets
Abstract:
Traditional supply chain management utilized traditional media and channels to link firms in linear inefficient relationships. The advent of electronic commerce over the Internet Protocol-based network has facilitated new relationships for connecting with new supply chain partners, thereby significantly increasing the quantity and quality of inter-organizational information flows. These information flows are theoretically evaluated using the principles of information quality dimensions, information asymmetry, and
"information moments." In addition, a new breed of market makers, or information intermediaries, is defining new functional relationships between the different players. Three distinct emerging marketspaces are presented, along with an analysis of each one’s informational dimension. First, the direct channel between manufacturers (or digital content providers) and consumers is enabling mass-customization, and is influencing the demand forecasting and inventory management functions. Second, the adserving industry is presented to portray the nature of emerging forms of supply chain relationships for digital goods. Third, the forces behind the creation of vertical portals, or “vortals,” are evaluated. These serve as integrators of moments of information from a supply chain perspective. Each of these three marketspaces is evaluated with respect to information quality dimensions, information asymmetry, and information moments (touchpoints). Emerging trends are discussed, such as combinatorial auctions and the role of intelligent agents and data mining in supply chain management. Finally, the impact of these new supply chain information flows on industries and macroeconomic conditions is discussed.
選分數評量
1 2 3 4 5 6 7
‧ Electronic Commerce Research And Practices
Abstract:
Web services refer to a family of technologies that can universally standardize the communication of applications in order to connect systems, business partners, and customers cost-effectively through the World Wide Web. Major software vendors such as IBM, Microsoft, SAP, SUN, and Oracle are all embracing Web services standards and are releasing new products or tools that are Web services enabled. Web services will ease the constraints of time, cost, and space for discovering, negotiating, and conducting e-business transactions. As a result, Web services will change the way businesses design their applications as services, integrate with other business entities, manage business process workflows, and conduct e-business transactions. The early adopters of Web services are showing promising results such as greater development productivity gains and easier and faster integration with trading partners. However, there are many issues worth studying regarding Web services in the context of e-commerce. This special issue of the JECR aims to encourage awareness and discussion of important issues and applications of Web Services that are related to electronic commerce from the organizational, economics, and technical perspectives. Research opportunities of Web services and e-commerce area are fruitful and important for both academics and practitioners. We wish that this introductory article can shed some light for researchers and practitioners to better understand important issues and future trends of Web services and e-business.
選分數評量
1 2 3 4 5 6 7
‧
APPLYING GENETIC ALGORITHM TO SELECT WEB SERVICES BASED ON WORKFLOW QUALITY OF SERVICE
Abstract:
Due to the rapid development of Web technologies, Internet applications increasingly use different programming languages and platforms. Web services technologies were introduced to ease the integration of applications on heterogeneous platforms. The quality of Web services has received much attention as it relates to the service discovery process. However, less work has been done on issues related to the quality of composite services. This study uses the selection model along with the concept of workflow quality of service (QoS) in order to improve the quality of service performance of current Web services in the discovery process. It also uses a selection model as the foundation for selecting Web services, conducting simulations to measure the overall workflow QoS performance when implemented in sequence. However, optimal solutions to service composition selection require exponential time in
Due to the rapid development of Web technologies, Internet applications increasingly use different programming languages and platforms. Web services technologies were introduced to ease the integration of applications on heterogeneous platforms. The quality of Web services has received much attention as it relates to the service discovery process. However, less work has been done on issues related to the quality of composite services. This study uses the selection model along with the concept of workflow quality of service (QoS) in order to improve the quality of service performance of current Web services in the discovery process. It also uses a selection model as the foundation for selecting Web services, conducting simulations to measure the overall workflow QoS performance when implemented in sequence. However, optimal solutions to service composition selection require exponential time in