學術出版;;Publications
Permanent URI for this communityhdl:11536/1
收集所有交通大學研究人員與學生個人或團體所發表之各項學術著作,涵蓋期刊論文、教師專書、學位論文等項。;;Collections of Publications of NCTU Researchers and Students Like Journal Papers and Thesis.
Browse
2 results
🏛️國立陽明交通大學機構典藏
Search Results
Item type:Item, Sequence-based trust in collaborative filtering for document recommendation(2011-08-01) ;Liu, Duen-Ren ;Lai, Chin-Hui ;Chiu, Hsuan ;資訊管理與財務金融系 註:原資管所+財金所Department of Information Management and FinanceCollaborative filtering (CF) recommender systems have emerged in various applications to support item recommendation, which solve the information-overload problem by suggesting items of interest to users. Recently, trust-based recommender systems have incorporated the trustworthiness of users into CF techniques to improve the quality of recommendation. They propose trust computation models to derive the trust values based on users' past ratings on items. A user is more trustworthy if s/he has contributed more accurate predictions than other users. Nevertheless, conventional trust-based CF methods do not address the issue of deriving the trust values based on users' various information needs on items over time. In knowledge-intensive environments, users usually have various information needs in accessing required documents over time, which forms a sequence of documents ordered according to their access time. We propose a sequence-based trust model to derive the trust values based on users' sequences of ratings on documents. The model considers two factors time factor and document similarity - in computing the trustworthiness of users. The proposed model enhanced with the similarity of user profiles is incorporated into a standard collaborative filtering method to discover trustworthy neighbors for making predictions. The experiment result shows that the proposed model can improve the prediction accuracy of CF method in comparison with other trust-based recommender systems. (C) 2011 Elsevier Ltd. All rights reserved.Item type:Item, Integrating knowledge flow mining and collaborative filtering to support document recommendation(2009-12-01) ;Lai, Chin-Hui ;Liu, Duen-Ren ;資訊管理與財務金融系 註:原資管所+財金所Department of Information Management and FinanceKnowledge is a critical resource that organizations use to gain and maintain competitive advantages. In the constantly changing business environment, organizations Must exploit effective and efficient methods of preserving, sharing and reusing knowledge in order to help knowledge workers find task-relevant information. Hence, an important issue is how to discover and model the knowledge flow (KF) of workers from their historical work records. The objectives of a knowledge flow model are to understand knowledge workers' task-needs and the ways they reference documents, and then provide adaptive knowledge support. This work proposes hybrid recommendation methods based on the knowledge flow model, which integrates KF mining, sequential rule mining and collaborative filtering techniques to recommend codified knowledge. These KF-based recommendation methods involve two phases: a KF mining phase and a KF-based recommendation phase. The KF mining phase identifies each worker's knowledge flow by analyzing his/her knowledge referencing behavior (information needs), while the KF-based recommendation phase utilizes the proposed hybrid methods to proactively provide relevant codified knowledge for the worker. Therefore, the proposed methods use workers' preferences for codified knowledge as well as their knowledge referencing behavior to predict their topics of interest and recommend task-related knowledge. Using data collected from a research institute laboratory, experiments are conducted to evaluate the performance of the proposed hybrid methods and compare them with the traditional CF method. The results of experiments demonstrate that utilizing the document preferences and knowledge referencing behavior of workers can effectively improve the quality of recommendations and facilitate efficient knowledge sharing. (C) 2009 Elsevier Inc. All rights reserved.