請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/18406
標題: | 在異質性社群網路中尋找最小獨特子圖 Identifying Smallest Unique Subgraphs in a Heterogeneous Social Network |
作者: | Yen-Kai Wang 王彥凱 |
指導教授: | 林守德(Shou-De Lin) |
關鍵字: | 獨特,最小,子圖,異質性,全等, unique,smallest,subgaph,heterogeneous,isomorphism, |
出版年 : | 2014 |
學位: | 碩士 |
摘要: | 本研究旨在尋找一個網路中的對於任一單元周邊發現有價值的網路結構。對於價值我們給予一個新的定義─簡單但獨特。而為了有效尋找這種結構我們將它化為一個子圖找尋問題。接著我們先檢驗這個問題所需要的複雜度不適合實際應用。再提出一個貪婪的作法在可行的時間內盡可能尋找最好的結構。最後我們將它應用在一個實際的社群網路上以驗證這個方法的實用性和有效性。 This paper proposes to study a novel problem, discovering a Smallest Unique Subgraph (SUS) for any node of interest specified by user in a heterogeneous social network. The rationale of the SUS problem lies in how a person is different from any others in a social network, and how to represent the identity of a person using her surrounding relational structure in a social network. To deal with the proposed SUS problem, we develop an Ego-Graph Heuristic (EGH) method to efficiently solve the SUS problem in an approximated manner. EGH intelligently examine whether one graph is not isomorphic to the other, instead of using the conventional subgraph isomorphism test. We also prove SUS is a NP-complete problem through doing a reduction from Minimum Vertex Cover (MVC) in a homogeneous tree structure. Experimental results conducted on a real-world movie heterogeneous social network data show both the promising efficiency and compactness of our method. |
URI: | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/18406 |
全文授權: | 未授權 |
顯示於系所單位: | 資訊工程學系 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-103-1.pdf 目前未授權公開取用 | 2.08 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。