ISBN:
9783319059129
Language:
English
Pages:
1 online resource (375 pages)
Edition:
1st ed.
Series Statement:
Lecture Notes in Social Networks Ser.
Parallel Title:
Erscheint auch als
DDC:
302.30285
Keywords:
Online social networks ; Design..
;
Data mining ; Data processing
;
Electronic books
Abstract:
Social network analysis increasingly bridges the discovery of patterns in diverse areas of study as more data becomes available and complex. Yet the construction of huge networks from large data often requires entirely different approaches for analysis including; graph theory, statistics, machine learning and data mining. This work covers frontier studies on social network analysis and mining from different perspectives such as social network sites, financial data, e-mails, forums, academic research funds, XML technology, blog content, community detection and clique finding, prediction of user's- behavior, privacy in social network analysis, mobility from spatio-temporal point of view, agent technology and political parties in parliament. These topics will be of interest to researchers and practitioners from different disciplines including, but not limited to, social sciences and engineering.
Abstract:
Intro -- Preface -- Contents -- 1 A Randomized Approach for Structural and Message Based Private Friend Recommendation in Online Social Networks -- 1 Introduction -- 1.1 Problem Definition -- 1.2 Main Contribution -- 2 Related Work -- 2.1 Other Existing PFR Protocols -- 3 Order Preserving Scoring Function -- 3.1 Normalization Factor -- 3.2 Scalar Factor -- 4 The Proposed Protocol -- 4.1 Phase 1: Secure Computation of Scalar Factors -- 4.2 Phase 2: Secure Computation of Recommendation Scores -- 4.3 Security Analysis -- 4.4 Complexity Analysis -- 5 Practical Implementation Details -- 5.1 Masking Number of Shortest Paths -- 5.2 Data Encryption and Secure Peer-to-Peer Communication -- 6 Inherent Security Issue -- 7 Extension to PFR -- 7.1 Initialization Step -- 7.2 Phase 1: Secure Computation of Scalar Factors -- 7.3 Phase 2: Secure Computation of Recommendation Scores -- 8 Empirical Analysis -- 8.1 Platform and Dataset Description -- 8.2 Performance of PFR -- 8.3 Computation Costs: PFR Versus PFRrand -- 9 Conclusion -- References -- 2 Context Based Semantic Relations in Tweets -- 1 Introduction -- 2 Term Relationship Metrics -- 2.1 First Order Relationships -- 2.2 Second Order Relationships with Cosine Similarity -- 2.3 Second Order Relationships with City-Block Distance -- 3 Event Detection and Semantic Expansion -- 4 Evaluation and Results -- 4.1 Evaluation of Term Similarity Analysis -- 4.2 Evaluation of Event Detection -- 5 Related Work -- 6 Conclusion -- References -- 3 Fast Exact and Approximate Computation of Betweenness Centrality in Social Networks -- 1 Introduction -- 2 Related work -- 3 Background -- 4 Our Algorithm: SPVB -- 4.1 Algorithm Formalization and Description -- 4.2 Algorithm Pseudo-Code -- 5 Experiments -- 6 Approximating Betweenness Centrality -- 6.1 Approximate Algorithm Pseudo Code.
Note:
Description based on publisher supplied metadata and other sources
Permalink
