Summary: | 碩士 === 國立中山大學 === 資訊管理學系研究所 === 95 === With the dramatic growth of the Internet, it is much easier for us to acquire information than before. It is, however, relatively difficult to extract desired information through the huge information pool. One method is to rely on the search engines by analyzing the queried keywords to locate the relevant information. The other one is to recommend users what they may be interested in via recommender systems that analyze the users’ past preferences or other users with similar interests to lessen our information processing loadings.
Typical recommendation techniques are classified into content-based filtering technique and collaborative filtering (CF) technique. Several research works in literature have indicated that the performance of collaborative filtering is superior to that of content-based filtering in that it is subject to neither the content format nor users’ past experiences. The collaborative filtering technique, however, has its own limitation of the sparsity problem. To relieve such a problem, researchers proposed several CF-typed variants, including item-based CF and trust-based CF. Few works in literature, however, focus on their performance comparison. The objective of this research is thus to evaluate both approaches under different settings such as the sparsity degrees, data scales, and number of neighbors to make recommendations.
We conducted two experiments to examine their performance. The results show that trust-based CF is generally better than item-based CF in sparsity problem. Their difference, however, becomes insignificant with the sparsity decreasing. In addition, the computational time for trust-based CF increases more quickly than that for item-based CF, even though both exhibit exponential growths. Finally, the optimal number of nearest neighbors in both approaches does not heavily depend on the data scale but displays steady robustness.
|