English  |  正體中文  |  简体中文  |  Items with full text/Total items : 888/888 (100%)
Visitors : 13628211      Online Users : 260
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: http://ccur.lib.ccu.edu.tw/handle/A095B0000Q/20

    Title: 以最小成本達成圖形分支度匿名化的快速演算法;An Efficient Algorithm for Minimal Edit Cost of Graph Degree Anonymity
    Authors: 陳依婷;Chen, Yi-Ting
    Contributors: 資訊工程研究所
    Keywords: 分支度匿名化;最短距離;社會網路;degree anonymity;shortest path lengths;social networks
    Date: 2018
    Issue Date: 2019-05-23 10:30:11 (UTC+8)
    Publisher: 資訊工程研究所
    Abstract: 在現今網路日益發達的時代,各方學者會希望利用網路資料進行使用者行為分析,因此在資料公開供學者分析使用時,個人隱私已成為重要的議題。攻擊者可能在其他管道獲得部分資訊,進而在公開的資料當中辨識出使用者的個人資訊,使得匿名技術逐漸被重視。現今已有許多學者發展出來的匿名技術,像是: k-anonymity, l-diversity, t-closeness 等等。本篇論文將著重在社會網路圖形上,藉由編輯圖上的邊使其符合分支度匿名化,同時盡量保持原本的最短距離。我們的方法主要分為兩大步驟:第一,我們提出一個快速的演算法找到新的degree數列及理論上的最小成本;第二,我們設計了五種編輯邊的方法,且根據新的degree數列編輯邊。本篇論文實驗結果呈現了我們修改圖的幅度非常小且其中一個編輯邊的方法能夠保持原本的最短距離。
    Personal privacy is an important issue when publishing data. An attacker may have information to reidentify private data. So, many researchers developed anonymization techniques, such as k-anonymity, l-diversity, t-closeness, etc. In this thesis, we focus on social network graphs k-degree anonymity by editing edges and try to keep shortest path lengths at the same time.Our method is divided into two steps. First, we propose an efficient algorithm to find a new degree sequence to achieve k-degree anonymity withtheoretically minimal edit cost. Second, we design five different types of edge operations to meet the new degree sequence by inserting, deleting or switching edges. The experiment results show that the modification are very small and one of the selection method can keep shortest path lengths.
    Appears in Collections:[資訊工程學系] 學位論文

    Files in This Item:

    File Description SizeFormat

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

    版權聲明 © 國立中正大學圖書館網頁內容著作權屬國立中正大學圖書館


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback