中大學術數位典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/106476
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 94201/94201 (100%)
造访人次 : 81802108      在线人数 : 1661
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://ir.lib.ncu.edu.tw/handle/987654321/106476


    题名: Co-clustering with augmented matrix
    作者: 張嘉惠;Wu, Meng-Lun;Chang, Chia-Hui;Liu, Rui-Zhe
    贡献者: 資訊電機學院資訊工程學系
    关键词: Advertisements;Algorithms;Applied sciences;Artificial Intelligence;Classification;Clustering;Cobalt;Collaboration;Computer Science;Computer science;control theory;systems;Computer systems and distributed systems. User interface;Data analysis;Data mining;Data processing. List processing. Character string processing;Descriptions;Dyadics;Exact sciences and technology;Information theory;Machines;Manufacturing;Mechanical Engineering;Memory organisation. Data processing;On-line systems;Online advertising;Preprocessing;Processes;Random variables;Recommender systems;Software
    日期: 2013-07-01
    上传时间: 2026-04-23 13:24:23 (UTC+8)
    出版者: Springer Netherlands;Boston: Springer US
    摘要: 摘要: Clustering plays an important role in data mining as many applications use it as a preprocessing step for data analysis. Traditional clustering focuses on the grouping of similar objects, while two-way co-clustering can group dyadic data (objects as well as their attributes) simultaneously. Most co-clustering research focuses on single correlation data, but there might be other possible descriptions of dyadic data that could improve co-clustering performance. In this research, we extend ITCC (Information Theoretic Co-Clustering) to the problem of co-clustering with augmented matrix. We proposed CCAM (Co-Clustering with Augmented Matrix) to include this augmented data for better co-clustering. We apply CCAM in the analysis of on-line advertising, where both ads and users must be clustered. The key data that connect ads and users are the user-ad link matrix, which identifies the ads that each user has linked; both ads and users also have their feature data, i.e. the augmented matrix. To evaluate the proposed method, we use two measures: classification accuracy and K - L divergence. The experiment is done using the advertisements and user data from Morgenstern, a financial social website that focuses on the advertisement agency. The experiment results show that CCAM provides better performance than ITCC since it considers the use of augmented matrix during clustering.
    其他題名: Appl Intell
    出版者: Boston: Springer US
    出版日期: 2013-07-01
    出處: Applied intelligence (Dordrecht, Netherlands), 2013-07, Vol.39 (1), p.153-164
    資源來源: ABI/INFORM Global (ProQuest Business Suite) (LAB)
    版權: Springer Science+Business Media New York 2012
    版權: 2015 INIST-CNRS
    版權: Springer Science+Business Media New York 2013
    識別號: ISSN: 0924-669X
    識別號: EISSN: 1573-7497
    識別號: DOI: 10.1007/s10489-012-0401-9
    显示于类别:[資訊工程學系] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML13检视/开启


    在NCUIR中所有的数据项都受到原著作权保护.

    社群 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 ©   - 隱私權政策聲明