中大學術數位典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/106481
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 94201/94201 (100%)
Visitors : 81671808      Online Users : 2676
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: https://ir.lib.ncu.edu.tw/handle/987654321/106481


    Title: Cluster ensembles in collaborative filtering recommendation
    Authors: 蔡志豐;Tsai, Chih-Fong;Hung, Chihli
    Contributors: 管理學院資訊管理學系
    Keywords: Cluster ensembles;Collaborative filtering;k-Means;Recommender systems;Self-organizing maps
    Date: 2012-01-01
    Issue Date: 2026-04-23 13:24:29 (UTC+8)
    Publisher: Elsevier BV;Elsevier B.V
    Abstract: 摘要: [Display omitted] ► This paper examines clustering ensembles in collaborative filtering. ► k-means and SOM clustering algorithms are used and compared. ► The ensemble methods are based on CSPA, HGAP and majority voting. ► Clustering ensembles significantly outperform single clustering techniques. Recommender systems, which recommend items of information that are likely to be of interest to the users, and filter out less favored data items, have been developed. Collaborative filtering is a widely used recommendation technique. It is based on the assumption that people who share the same preferences on some items tend to share the same preferences on other items. Clustering techniques are commonly used for collaborative filtering recommendation. While cluster ensembles have been shown to outperform many single clustering techniques in the literature, the performance of cluster ensembles for recommendation has not been fully examined. Thus, the aim of this paper is to assess the applicability of cluster ensembles to collaborative filtering recommendation. In particular, two well-known clustering techniques (self-organizing maps (SOM) and k-means), and three ensemble methods (the cluster-based similarity partitioning algorithm (CSPA), hypergraph partitioning algorithm (HGPA), and majority voting) are used. The experimental results based on the Movielens dataset show that cluster ensembles can provide better recommendation performance than single clustering techniques in terms of recommendation accuracy and precision. In addition, there are no statistically significant differences between either the three SOM ensembles or the three k-means ensembles. Either the SOM or k-means ensembles could be considered in the future as the baseline collaborative filtering technique.
    出版者: Elsevier B.V
    出版日期: 2012-04-01
    出處: Applied soft computing, 2012-04, Vol.12 (4), p.1417-1425
    版權: 2011 Elsevier B.V.
    識別號: ISSN: 1568-4946
    識別號: EISSN: 1872-9681
    識別號: DOI: 10.1016/j.asoc.2011.11.016
    Appears in Collections:[Department of Information Management] journal & Dissertation

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML15View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明