A Theoretical Approach to Discover Mutual Friendships from Social Graph Networks

被引:11
作者
Singh, Sehaj Pal [1 ]
Leung, Carson K. [1 ]
Jiang, Fan [2 ]
Cuzzocrea, Alfredo [3 ]
机构
[1] Univ Manitoba, Dept Comp Sci, Winnipeg, MB, Canada
[2] Univ Northern British Columbia UNBC, Dept Comp Sci, Prince George, BC, Canada
[3] Univ Calabria, iDEA Lab, Arcavacata Di Rende, CS, Italy
来源
IIWAS2019: THE 21ST INTERNATIONAL CONFERENCE ON INFORMATION INTEGRATION AND WEB-BASED APPLICATIONS & SERVICES | 2019年
基金
加拿大自然科学与工程研究理事会;
关键词
data science; data mining; social network analysis; web-based applications & services; graph databases; mathematical graph theory;
D O I
10.1145/3366030.3366077
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Due to popularity of social networking in the current era of big data, many social networking sites (e.g., Facebook) has been generating huge volumes of social data. In this paper, we aim to discover interesting relationships in a undirected (social) graph via a theoretical approach. Specifically, we examine the graph theory and linear algebra approaches to find mutual friendships from social networks represented in the form of big graphs or big graph databases.
引用
收藏
页码:212 / 221
页数:10
相关论文
共 26 条
[1]   An extraction and unification methodology for social networks data: an application to public security [J].
Abid, Amal ;
Ameur, Hanen ;
Mbarek, Atika ;
Rekik, Amal ;
Jamoussi, Salma ;
Ben Hamadou, Abdelmajid .
19TH INTERNATIONAL CONFERENCE ON INFORMATION INTEGRATION AND WEB-BASED APPLICATIONS & SERVICES (IIWAS2017), 2017, :176-180
[2]  
Akachar E., 2018, P 20 INT C INF INT W, P282
[3]   A Novel Information Diffusion Model for Online Social Networks [J].
AlSuwaidan, Lulwah ;
Ykhlef, Mourad .
19TH INTERNATIONAL CONFERENCE ON INFORMATION INTEGRATION AND WEB-BASED APPLICATIONS & SERVICES (IIWAS2017), 2017, :116-120
[4]  
Chavoshi N, 2018, 2018 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM), P178, DOI 10.1109/ASONAM.2018.8508279
[5]   Approximate range-sum query answering on data cubes with probabilistic guarantees [J].
Cuzzocrea, Alfredo ;
Wang, Wei .
JOURNAL OF INTELLIGENT INFORMATION SYSTEMS, 2007, 28 (02) :161-197
[6]   Privacy Preserving OLAP over Distributed XML Data: A Theoretically-Sound Secure-Multiparty-Computation Approach [J].
Cuzzocrea, Alfredo ;
Bertino, Elisa .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2011, 77 (06) :965-987
[7]   Logical Design of Graph Databases from an Entity-Relationship Conceptual Model [J].
de Sousa, Victor Martins ;
del Val Cura, Luis Mariano .
IIWAS2018: THE 20TH INTERNATIONAL CONFERENCE ON INFORMATION INTEGRATION AND WEB-BASED APPLICATIONS & SERVICES, 2014, :183-189
[8]  
Fan CX, 2018, 2018 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM), P833, DOI 10.1109/ASONAM.2018.8508262
[9]  
Jiang F, 2016, PROCEEDINGS OF THE 2016 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING ASONAM 2016, P921, DOI 10.1109/ASONAM.2016.7752349
[10]   Visualizing and Analyzing Street Crimes Using Personalized Security Information Service PRISM [J].
Kagawa, Takuhiro ;
Saiki, Sachio ;
Nakamura, Masahide .
19TH INTERNATIONAL CONFERENCE ON INFORMATION INTEGRATION AND WEB-BASED APPLICATIONS & SERVICES (IIWAS2017), 2017, :208-214