請用此 Handle URI 來引用此文件：
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/64287完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 陳銘憲(Ming-Syan Chen) | |
| dc.contributor.author | Yu-Wei Chu | en |
| dc.contributor.author | 褚友維 | zh_TW |
| dc.date.accessioned | 2021-06-16T17:38:50Z | - |
| dc.date.available | 2015-08-16 | |
| dc.date.copyright | 2012-08-16 | |
| dc.date.issued | 2012 | |
| dc.date.submitted | 2012-08-14 | |
| dc.identifier.citation | [1] L. Getoor and C.P. Diehl, “Link mining: a survey,” ACM SIGKDD Explorations
Newsletter, vol. 7, no. 2, pp. 3–12, 2005. [2] Y. Sun, Y. Yu, and J. Han, “Ranking-based clustering of heterogeneous information networks with star network schema,” in Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 797–806, 2009. [3] M. Ji, J. Han, and M. Danilevsky, “Ranking-based classification of heterogeneous information networks,” in Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 1298–1306, 2011. [4] D. Cai, Z. Shao, X. He, X. Yan, and J. Han, “Mining hidden community in hetero- geneous social networks,” in Proceedings of the 3rd international workshop on Link discovery, pp. 58–65, 2005. [5] D. Liben-Nowell and J. Kleinberg, “The link-prediction problem for social net- works,” Journal of the American society for information science and technology, vol. 58, no. 7, pp. 1019–1031, 2007. [6] R.A. Jarvis and E.A. Patrick, “Clustering using a similarity measure based on shared near neighbors,” Computers, IEEE Transactions on, vol. 100, no. 11, pp. 1025– 1034, 1973. [7] A.G. Maguitman, F. Menczer, F. Erdinc, H. Roinestad, and A. Vespignani, “Algo- rithmic computation and approximation of semantic similarity,” World Wide Web, vol. 9, no. 4, pp. 431–456, 2006. [8] G. Jeh and J. Widom, “Simrank: a measure of structural-context similarity,” in Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 538–543, 2002. [9] Yehuda Koren, Stephen C. North, and Chris Volinsky, “Measuring and extracting proximity graphs in networks,” ACM Trans. Knowl. Discov. Data, vol. 1, no. 3, 2007. [10] E. A. Leicht, Petter Holme, and M. E. J. Newman, “Vertex similarity in networks,” Phys. Rev. E, vol. 73, no. 2, 2006. [11] C. Li, J. Han, G. He, X. Jin, Y. Sun, Y. Yu, and T. Wu, “Fast computation of simrank for static and dynamic information networks,” in Proceedings of the 13th International Conference on Extending Database Technology, pp. 465–476, 2010. [12] C. Gentry, “Fully homomorphic encryption using ideal lattices,” in Proceedings of the 41st annual ACM symposium on Theory of computing, pp. 169–178, 2009. [13] C. Gentry and S. Halevi, “Implementing gentry’s fully-homomorphic encryption scheme,” Advances in Cryptology–EUROCRYPT 2011, pp. 129–148, 2011. [14] J.G. Kemeny, J.L. Snell, and G.L. Thompson, Introduction to finite mathematics, Prentice-Hall, 1966. | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/64287 | - |
| dc.description.abstract | 資訊網路分析在最近幾年吸引了許多研究者的注意。而在各種已知的網路資料分析方法中，如何去計算各個節點之間的相似程度是一個很重要的問題。如果我們能夠計算各個節點之間的相似程度，對於像是資料分群、連結預測和群組辨識等等的應用都會有很大的幫助。然而在一個龐大的資料網路中，節點之間連結的分布通常都是非常稀疏的，需要將更多的資料結合在一起做分析才能得到更準確的節點相似程度計算結果。這也使得各個資料擁有者願意彼此合作來完成資料的分析。如何在不洩漏任何隱私的情況下結合各個陣營的資料來計算節點間相似程度便是一個很重要的問題。在這篇論文中，我們提出了一個解決方法，PP-SimRank。PP-SimRank利用完全同態加密來保護所有節點間連結的資訊，並且在不會洩漏任何隱私的情況下完成所有節點相似程度的計算。 | zh_TW |
| dc.description.abstract | Information network analysis has drawn a lot attention in recent years. Among all the aspects of network analysis, similarity measure of nodes has been shown useful in many applications, such as clustering, link prediction and community identification, to name a few. As linkage data in a large network is inherently sparse, it is noted that collecting more data can improve the quality of similarity measure. This gives different parties a motivation to cooperate. In this paper, we address the problem of link-based similarity measure of nodes in an information network distributed over different parties. Concerning the data privacy, we propose a privacy-preserving SimRank protocol based on fully-homomorphic encryption to provide cryptographic protection for the links. | en |
| dc.description.provenance | Made available in DSpace on 2021-06-16T17:38:50Z (GMT). No. of bitstreams: 1 ntu-101-R99942137-1.pdf: 907963 bytes, checksum: 0aabd08c71ea2307551122246fba26f1 (MD5) Previous issue date: 2012 | en |
| dc.description.tableofcontents | 口 試 委 員 會審定 書 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . i
ACKNOWLEDGEMENTS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ii 中 文摘 要 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iii ABSTRACT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iv Chapter 1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 Chapter 2 Preliminary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.1 Problem Formulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.2 SimRank Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 Chapter 3 Privacy-preserving SimRank Protocol . . . . . . . . . . . . . . . . . 11 3.1 Protocol Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 3.2 Encoding and Encryption of Links . . . . . . . . . . . . . . . . . . . . . 13 3.3 Construction of Virtual Graphs . . . . . . . . . . . . . . . . . . . . . . . 15 3.4 Computation of SimRank Score . . . . . . . . . . . . . . . . . . . . . . 17 Chapter 4 Implementation Issues . . . . . . . . . . . . . . . . . . . . . . . . . 20 4.1 Arithmetic Operations in the Ciphertext Field . . . . . . . . . . . . . . . 20 4.2 Efficiency Improvement . . . . . . . . . . . . . . . . . . . . . . . . . . . 24 Chapter 5 Performance Analysis . . . . . . . . . . . . . . . . . . . . . . . . . 28 5.1 Security of PP-SimRank . . . . . . . . . . . . . . . . . . . . . . . . . . 28 5.2 Communication and Computation Complexity . . . . . . . . . . . . . . . 29 Chapter 6 Extension to Multi-party Scenario . . . . . . . . . . . . . . . . . . . 32 Chapter 7 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 REFERENCES . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 | |
| dc.language.iso | en | |
| dc.subject | 隱私保護 | zh_TW |
| dc.subject | 節點相似程度計算 | zh_TW |
| dc.subject | Similarity Measure | en |
| dc.subject | Privacy-preserving | en |
| dc.title | 分散式資訊網路資料下之隱私保護SimRank計算方法 | zh_TW |
| dc.title | Privacy-preserving SimRank over Distributed Information Network | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 100-2 | |
| dc.description.degree | 碩士 | |
| dc.contributor.oralexamcommittee | 雷欽隆(Chin-Laung Lei),黃寶儀(Polly Huang),曾祺堯(Chi-Yao Tseng),戴志華(Chih-hua Tai) | |
| dc.subject.keyword | 隱私保護,節點相似程度計算, | zh_TW |
| dc.subject.keyword | Privacy-preserving,Similarity Measure, | en |
| dc.relation.page | 36 | |
| dc.rights.note | 有償授權 | |
| dc.date.accepted | 2012-08-15 | |
| dc.contributor.author-college | 電機資訊學院 | zh_TW |
| dc.contributor.author-dept | 電信工程學研究所 | zh_TW |
| 顯示於系所單位： | 電信工程學研究所 | |
文件中的檔案：
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-101-1.pdf 未授權公開取用 | 886.68 kB | Adobe PDF |
系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。