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


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


    题名: 基於相似度群集之社群維護;Social Community Maintenance based on Similarity Clustering
    作者: 傅勻垣;Fu,Yun-yuan
    贡献者: 資訊工程研究所
    关键词: 社群偵測;使用者行為分析;K-means群集演算法;社群網路分析;user behavior analysis;community detection;K-Means Clustering Algorithm;Social network analysis
    日期: 2012-08-13
    上传时间: 2012-09-11 18:52:02 (UTC+8)
    出版者: 國立中央大學
    摘要: 社群網路分析利用使用者之間的社交訊息及行為,分析出社群的行為表現與關係。我們找出隱藏的社群以輔佐推薦系統,可依據分析結果來支援搜尋引擎,提高特定主題搜尋的準確率。然而隨著社群網路結構的日新月異,過去同樣的分析結果無法持續地提供有效且正確的資訊,未來使用者所發布的新文章勢必會影響到各個社群的結構,甚至自己所應該歸屬的社群可能會因而改變。在本篇論文中,我們根據使用者所發布的文章主題建立出由數個主題組成特殊化複合社群。藉由主題和主題之間的相似度(Fuzzy RT relation)將相似的主題利用K-means演算法群集,並將使用者歸屬至他有所興趣之該群集。隨著新進的文章所帶來對社群結構演變之影響,我們也透過K-means演算法之特性對該社群網路做結構變化之更新。Social network analysis utilizes the social messages and behaviors between users to analyze the relationships and characteristics of communities. We try to support recommending search engine system by discovering the hidden information to help increasing the precision when searching specific subject related contents. Nevertheless the result analyzed in the past may not always provide a proper or correct information, new documents posted in the future would definitely influence the appearance and structure of communities, users themselves may even have to be assigned to another different community. In our research, we construct a special hybrid community structure which is assembled by several subject categories. With the documents shared by the users at the social network, we cluster similar categories with K-Means Clustering Algorithm according to the similarity (in our research we refer it as Fuzzy RT relation) between categories. With this clustering technique, we assign the users to the cluster which contains the subject category that they’re interested in. Considering the influence brought by the new documents in the future, we also employ an update scheme that is also based on K-Means clustering to adjust the structure if the communities.
    显示于类别:[資訊工程研究所] 博碩士論文

    文件中的档案:

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


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