1,429 research outputs found
์ค์ธ๊ณ ๊ทธ๋ํ ํน์ง์ ํ์ฉํ ๋๋ค ์ํฌ ๊ธฐ๋ฐ ๋๊ท๋ชจ ๊ทธ๋ํ ๋ง์ด๋
ํ์๋
ผ๋ฌธ(๋ฐ์ฌ)--์์ธ๋ํ๊ต ๋ํ์ :๊ณต๊ณผ๋ํ ์ปดํจํฐ๊ณตํ๋ถ,2020. 2. ๊ฐ์ .Numerous real-world relationships are represented as graphs such as social networks, hyperlink networks, and protein interaction networks. Analyzing those networks is important to understand the real-life phenomena. Among various graph analysis techniques, random walk has been widely used in many applications with satisfactory results. However, various real-world graphs are large and complicated with diverse labels. Traditional random walk based methods require heavy computational cost, and disregards those labels for performing random walks; thus, its utilization has been limited in such large and complicated graphs.
In this thesis, I handle the technical challenges of mining large real-world graphs based on random walk. Real-world graphs have distinct structural properties which become a basis to increase the performance of the random walk in terms of speed and quality. Based upon this idea, I develop fast, scalable, and exact methods for node ranking using random walk in large-scale plain networks. I also design accurate models using random walks for node ranking and relational reasoning in labeled graphs such as signed networks and knowledge bases.
Through extensive experiments on various real-world graphs, I demonstrate the effectiveness of the methods and models proposed by this thesis. The proposed methods process 100 times larger graphs, and require up to 130 times less memory with up to 9 times faster speed compared to other existing methods, successfully scaling to billion-scale graphs. Also, the proposed models substantially improve the predictive performance of a variety of tasks in labeled graphs such as signed networks and knowledge bases.๋ค์ํ ์ค์ธ๊ณ ์์ฐ ํ์์์์ ๊ด๊ณ๋ค์ ์์
๋คํธ์ํฌ, ํ์ดํผ๋งํฌ ๋คํธ์ํฌ์ ๋จ๋ฐฑ์ง ์ํธ์์ฉ ๋คํธ์ํฌ์ ๊ฐ์ด ์ ์ ๊ณผ ๊ฐ์์ ๊ทธ๋ํ๋ก ํํ๋๋ค. ์ด๋ฌํ ๋คํธ์ํฌ๋ฅผ ๋ถ์ํ๋ ๊ฒ์ ์ค์ธ๊ณ์ ํ์์ ์ดํดํ๋๋ฐ ๋งค์ฐ ์ค์ํ๋ค. ๋ค์ํ ๊ทธ๋ํ ๋ถ์ ๊ธฐ๋ฒ์ค์ ๋๋ค ์ํฌ๋ผ๋ ๊ธฐ๋ฒ์ด ๋ง์กฑ์ค๋ฌ์ด ์ฑ๋ฅ๊ณผ ํจ๊ป ๋ง์ ๊ทธ๋ํ ๋ง์ด๋ ์์ฉ์ ๋๋ฆฌ ํ์ฉ๋์ด ์๋ค. ๊ทธ๋ฌ๋ ๋๋ค์์ ์ค์ธ๊ณ ๊ทธ๋ํ๋ ๊ทธ ๊ท๋ชจ๊ฐ ๊ต์ฅํ ํฌ๊ณ ๋ค์ํ ๋ผ๋ฒจ ์ ๋ณด์ ํจ๊ป ๋ณต์กํ๊ฒ ํํ๋๋ค. ์ ํต์ ์ธ ๋๋ค ์ํฌ ๊ธฐ๋ฐ์ ๊ธฐ๋ฒ๋ค์ ๊ณ์ฐ๋์ด ๋ง์ด ์๊ตฌ๋๊ณ , ๋๋ค ์ํฌ๋ฅผ ํ๋๋ฐ ์์ด์ ๋ค์ํ ๋ผ๋ฒจ ์ ๋ณด๋ฅผ ์ ํ ๊ณ ๋ คํ์ง ์์ ๋ผ๋ฒจ๋ก ํํ๋๋ ๊ทธ๋ํ์ ๊ณ ์ ํ ํน์ฑ์ด ๋ฌด์๋๊ฒ ๋๋ค. ๊ทธ๋์ ์ด์ ๊ฐ์ด ๋ณต์กํ๋ฉด์ ๋๊ท๋ชจ ๊ทธ๋ํ์์๋ ๋๋ค ์ํฌ์ ์ค์ง์ ํ์ฉ์ด ์ ํ๋์ด์๋ค.
๋ณธ ํ์ ๋
ผ๋ฌธ์์๋ ๋๋ค ์ํฌ ๊ธฐ๋ฐ์ ๋๊ท๋ชจ ์ค์ธ๊ณ ๊ทธ๋ํ ๋ถ์์ ๊ธฐ์ ์ ํ๊ณ๋ฅผ ํด๊ฒฐํ๊ณ ์ ํ๋ค. ์ค์ธ๊ณ ๊ทธ๋ํ๋ ๊ณ ์ ํ ๊ตฌ์กฐ์ ํน์ง๋ค์ ๊ฐ์ง๊ณ ์์ผ๋ฉฐ ์ด๋ฌํ ๊ตฌ์กฐ์ ํน์ง๋ค์ ์๋์ ํ์ง์ ์ธก๋ฉด์์ ๋๋ค ์ํฌ์ ์ฑ๋ฅ์ ํฅ์์ํค๋๋ฐ ๊ธฐ๋ฐ์ด ๋ ์ ์๋ค. ์ด๋ฌํ ์์ด๋์ด๋ฅผ ํ์ฉํ์ฌ, ๋๊ท๋ชจ์ ๋ผ๋ฒจ์ด ์๋ ์ผ๋ฐ์ ์ธ ๋คํธ์ํฌ์์ ๋๋ค ์ํฌ ๊ธฐ๋ฐ์ ๊ฐ์ธํ๋ ์ ์ ๋ญํน ๊ณ์ฐ์ ๋น ๋ฅด๊ณ , ํ์ฅ์ฑ ์๊ณ ์ ํํ๊ฒ ๊ตฌํ๋ ๊ธฐ๋ฒ์ ์ ์ํ๋ค. ๋ํ ๋ถํธํ๋ ๋คํธ์ํฌ ๋๋ ์ง์ ๋ฒ ์ด์ค์ ๊ฐ์ ๋ผ๋ฒจ์ด ์๋ ๊ทธ๋ํ์์ ๊ฐ์ธํ๋ ์ ์ ๋ญํน๊ณผ ๊ด๊ณ ์ถ๋ก ์ ์ํ ๋๋ค ์ํฌ ๊ธฐ๋ฐ์ ๋ชจ๋ธ์ ์ ์ํ๋ค.
๋ค์ํ ์ค์ธ๊ณ ๊ทธ๋ํ์์ ๊ด๋ฒ์ํ ์คํ์ ํตํด ๋ณธ ํ์ ๋
ผ๋ฌธ์ ์ํด ์ ์๋ ๋ฐฉ๋ฒ๊ณผ ๋ชจ๋ธ์ ํจ๊ณผ์ฑ์ ๋ณด์ธ๋ค. ์ ์ํ๋ ๋ฐฉ๋ฒ์ ๋ค๋ฅธ ๊ฒฝ์ ๊ธฐ๋ฒ๋ค๊ณผ ๋น๊ตํ์ ๋ ์ต๋ 100๋ฐฐ ๋ ํฐ ๊ทธ๋ํ๋ฅผ ์ฒ๋ฆฌํ ์ ์๊ณ , ์ต๋ 130๋ฐฐ ์ ๊ฒ ๋ฉ๋ชจ๋ฆฌ๋ฅผ ์ฌ์ฉํ๋ฉด์, ์ต๋ 9๋ฐฐ ๋น ๋ฅธ ์๋๋ฅผ ๋ณด์ด๋ฉฐ, ๊ฒฐ๊ณผ์ ์ผ๋ก ์ ์ญ์ต ๊ท๋ชจ์ ๊ทธ๋ํ์์ ๋๋ค ์ํฌ ๊ธฐ๋ฐ์ ๊ฐ์ธํ๋ ์ ์ ๋ญํน์ ์ฑ๊ณต์ ์ผ๋ก ๊ตฌํ ์ ์๋ค. ๋ํ, ์ ์ํ๋ ๋๋ค ์ํฌ ๊ธฐ๋ฐ์ ๋ชจ๋ธ๋ค์ ๋ถํธํ๋ ๋คํธ์ํฌ์ ์ง์ ๋ฒ ์ด์ค์ ๊ฐ์ ๋ผ๋ฒจ์ด ์๋ ๊ทธ๋ํ์์ ๋ถํธ ์์ธก, ๊ฐ์ ์์ธก, ์ด์ ํ์ ํ์ง, ๊ด๊ณ ์ถ๋ก ๋ฑ์ ๋ค์ํ ์์ฉ์์ ๋ค๋ฅธ ๊ฒฝ์ ๋ชจ๋ธ๋ค๋ณด๋ค ๋ ์ข์ ์์ธก ์ฑ๋ฅ์ ๋ณด์ธ๋ค.Chapter1 Overview .... 1
1.1 Motivation .... 1
1.2 Research Statement .... 4
1.2.1 Research Goals and Importance .... 4
1.2.2 Technical Challenges .... 6
1.2.3 Main Approaches .... 7
1.2.4 Contributions .... 9
1.2.5 Overall Impact .... 10
1.3 Thesis Organization .... 11
Chapter2 Background .... 12
2.1 Definitions .... 12
2.1.1 Notations on Graphs .... 12
2.1.2 Random Walk with Restart .... 13
2.2 Related Works .... 15
2.2.1 Previous Methods for RWR in Plain Graphs .... 15
2.2.2 Ranking Models in Signed Networks .... 17
2.2.3 Relational Reasoning Models in Edge-labeled Graphs .... 19
Chapter 3 Fast and Scalable Ranking in Large-scale Plain Graphs .... 21
3.1 Introduction .... 21
3.2 Preliminaries .... 23
3.2.1 Iterative Methods for RWR .... 24
3.2.2 Preprocessing Methods for RWR .... 25
3.3 Proposed Method .... 26
3.3.1 Overview .... 26
3.3.2 BePI-B: Exploiting Graph Characteristics for Node Reordering and Block Elimination .... 28
3.3.3 BePI-B: Incorporating an Iterative Method into Block Elimination .... 32
3.3.4 BePI-S: Sparsifying the Schur Complement .... 34
3.3.5 BePI: Preconditioning a Linear System for the Iterative Method .... 36
3.4 Theoretical Results .... 39
3.4.1 Time Complexity .... 39
3.4.2 Space Complexity .... 40
3.4.3 Accuracy Bound .... 41
3.4.4 Lemmas and Proofs .... 43
3.5 Experiments .... 48
3.5.1 Experimental Settings .... 49
3.5.2 Preprocessing Cost .... 51
3.5.3 Query Cost .... 53
3.5.4 Scalability .... 53
3.5.5 Effects of Sparse Schur Complement and Preconditioning .... 54
3.5.6 Effects of the Hub Selection Ratio .... 57
3.5.7 Accuracy .... 58
3.5.8 Comparison with the-State-of-the-Art Method .... 59
3.6 Summary .... 60
Chapter 4 Personalized Ranking in Signed Graphs .... 61
4.1 Introduction .... 61
4.2 Problem Definition .... 65
4.3 Proposed Method .... 65
4.3.1 Signed Random Walk with Restart Model .... 66
4.3.2 SRWR-Iter: Iterative Algorithm for Signed Random Walk with Restart .... 76
4.3.3 SRWR-Pre: Preprocessing Algorithm for Signed Random Walk with Restart .... 82
4.4 Experiments .... 93
4.4.1 Experimental Settings .... 94
4.4.2 Link Prediction Task .... 96
4.4.3 User Preference Preservation Task .... 99
4.4.4 Troll Identification Task .... 100
4.4.5 Sign Prediction Task .... 104
4.4.6 Effectiveness of Balance Attenuation Factors .... 109
4.4.7 Performance of SRWR-Pre .... 110
4.5 Summary .... 113
Chapter 5 Relational Reasoning in Edge-labeled Graphs .... 114
5.1 Introduction .... 114
5.2 Preliminary .... 116
5.3 Proposed Method .... 118
5.3.1 Label Transition Observation .... 120
5.3.2 Learning Label Transition Probabilities .... 121
5.3.3 Multi-Labeled Random Walk with Restart .... 123
5.3.4 Formulation for MuRWR .... 125
5.3.5 Algorithm for MuRWR .... 127
5.4 Theoretical Results .... 131
5.4.1 Lemma for Solution of Label Transition Probabilities and Convexity .... 131
5.4.2 Lemma for Recursive Equation of MuRWR Score Matrix .... 134
5.4.3 Lemma for Spectral Radius in Convergence Theorem .... 136
5.4.4 Lemma for Complexity Analysis .... 137
5.5 Experiment .... 138
5.5.1 Experimental Settings .... 139
5.5.2 Relation Inference Task .... 140
5.5.3 Effects of Label Weights in MuRWR .... 142
5.5.4 Effects of Restart Probability in MuRWR .... 143
5.5.5 Convergence of MuRWR .... 144
5.6 Summary .... 145
Chapter6 Future Works .... 146
6.1 Fast and Accurate Pseudoinverse Computation .... 146
6.2 Fast and Scalable Signed Network Generation .... 147
6.3 Disk-based Algorithms for Random Walk .... 147
Chapter7 Conclusion .... 149
References .... 151
Appendix .... 166
A.1 Hub-and-Spoke Reordering Method .... 166
A.2 Time Complexity of Sparse Matrix Multiplication .... 167
A.3 Details of Preconditioned GMRES .... 167
A.4 Detailed Description of Evaluation Metrics .... 170
A.4.1 Link Prediction .... 170
A.4.2 Troll Identification .... 171
A.5 Discussion on Relative Trustworthiness of SRWR .... 173
Abstract in Korean .... 176Docto
SybilBelief: A Semi-supervised Learning Approach for Structure-based Sybil Detection
Sybil attacks are a fundamental threat to the security of distributed
systems. Recently, there has been a growing interest in leveraging social
networks to mitigate Sybil attacks. However, the existing approaches suffer
from one or more drawbacks, including bootstrapping from either only known
benign or known Sybil nodes, failing to tolerate noise in their prior knowledge
about known benign or Sybil nodes, and being not scalable.
In this work, we aim to overcome these drawbacks. Towards this goal, we
introduce SybilBelief, a semi-supervised learning framework, to detect Sybil
nodes. SybilBelief takes a social network of the nodes in the system, a small
set of known benign nodes, and, optionally, a small set of known Sybils as
input. Then SybilBelief propagates the label information from the known benign
and/or Sybil nodes to the remaining nodes in the system.
We evaluate SybilBelief using both synthetic and real world social network
topologies. We show that SybilBelief is able to accurately identify Sybil nodes
with low false positive rates and low false negative rates. SybilBelief is
resilient to noise in our prior knowledge about known benign and Sybil nodes.
Moreover, SybilBelief performs orders of magnitudes better than existing Sybil
classification mechanisms and significantly better than existing Sybil ranking
mechanisms.Comment: 12 page
Recommender Systems
The ongoing rapid expansion of the Internet greatly increases the necessity
of effective recommender systems for filtering the abundant information.
Extensive research for recommender systems is conducted by a broad range of
communities including social and computer scientists, physicists, and
interdisciplinary researchers. Despite substantial theoretical and practical
achievements, unification and comparison of different approaches are lacking,
which impedes further advances. In this article, we review recent developments
in recommender systems and discuss the major challenges. We compare and
evaluate available algorithms and examine their roles in the future
developments. In addition to algorithms, physical aspects are described to
illustrate macroscopic behavior of recommender systems. Potential impacts and
future directions are discussed. We emphasize that recommendation has a great
scientific depth and combines diverse research fields which makes it of
interests for physicists as well as interdisciplinary researchers.Comment: 97 pages, 20 figures (To appear in Physics Reports
Trust-based recommendation systems: an axiomatic approach
ABSTRACT High-quality, personalized recommendations are a key feature in many online systems. Since these systems often have explicit knowledge of social network structures, the recommendations may incorporate this information. This paper focuses on networks which represent trust and recommendations which incorporate trust relationships. The goal of a trust-based recommendation system is to generate personalized recommendations from known opinions and trust relationships. In analogy to prior work on voting and ranking systems, we use the axiomatic approach from the theory of social choice. We develop an natural set of five axioms which we desire any recommendation system exhibit. Then we show that no system can simultaneously satisfy all these axioms. We also exhibit systems which satisfy any four of the five axioms. Next we consider ways of weakening the axioms, which can lead to a unique recommendation system based on random walks. We consider other recommendation systems (personal page rank, majority of majorities, and min cut) and search for alternative axiomatizations which uniquely characterize these systems. Finally, we determine which of these systems are incentive compatible. This is an important property for systems deployed in a monetized environment: groups of agents interested in manipulating recommendations to make others share their opinion have nothing to gain from lying about their votes or their trust links
- โฆ