English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 112721/143689 (78%)
Visitors : 49610258      Online Users : 807
RC Version 6.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
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version


    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/55455


    Title: 合作式個人化推薦系統之進階技術研究及其應用 (I)
    Other Titles: The Research of Advanced Techniques and Their Applications for a Collaborative Personalized Recommendation System
    Authors: 陳良弼
    Contributors: 國立政治大學資訊科學系
    行政院國家科學委員會
    Keywords: 合作式個人化推薦系統
    Date: 2009
    Issue Date: 2012-11-12 11:03:49 (UTC+8)
    Abstract: 伴隨著資訊科技之發展，各式各樣的物件在網際網路上迅速的累積，資訊過量成為主要的問題。因此，如何在大量的資料中，精確地推薦有用的資訊給使用者，即成為極具挑戰的研究課題。合作式推薦是其中一個解決資訊過量的方法；然而，隨著應用規模的成長，現階段合作式推薦系統所面臨的資料型態、處理模式與處理規模，都與過去單純的資料環境有著極大的不同，也導致現有技術有其侷限性。為了克服該問題，本計畫以三年為期研發一下世代合作式推薦系統。 在本年度計畫執行過程中，我們已完成預定完成之研究項目，分別為具不確定資料環境之子空間天際線查詢處理、高維度空間之任意子空間KNN查詢及具高準確率之鏈結樣式社群探索技術，並已發表於國際一流會議。本期中報告茲就本年度所完成的研究成果進行報告。
    With rapid growth of the Internet technology, the information overloading starts to be a challenge. Therefore, an efficient and effec-tive approach to assist users to precisely get the useful information from the massive data-set is needed. The collaborative recommenda-tion mechanism is a popular solution to solve this problem. However, with the growth of the scale of applications, nowadays collaborative recommendation systems have to deal with dynamic and fast growing environments, in which the existing techniques become ineffi-cient and ineffective for high-quality recom-mendation results. Therefore, the advanced techniques for collaborative recommendation become important research issues to further study. In this progress report, we report three research results we achieved in this year. They are (1) efficient computation of sub-space top-k probabilistic skylines on uncertain data, (2) enhancing the accuracy of multimedia data retrieval by an online classifier, and (3) dis-covering link-pattern based communities by classical clustering methods.
    Relation: 應用研究
    學術補助
    研究期間:9808~ 9907
    研究經費:1949仟元
    Data Type: report
    Appears in Collections:[資訊科學系] 國科會研究計畫

    Files in This Item:

    File SizeFormat
    index.html0KbHTML2783View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback