Efficient and Flexible Compression of Very Sparse Networks of Big Data

Author(s):  
Carson K. Leung ◽  
Fan Jiang ◽  
Yibin Zhang
Keyword(s):  
Big Data ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-7
Author(s):  
Chen Jicheng ◽  
Chen Hongchang ◽  
Li Hanchao

Link prediction is a concept of network theory that intends to find a link between two separate network entities. In the present world of social media, this concept has taken root, and its application is seen through numerous social networks. A typical example is 2004, 4 February “TheFeacebook,” currently known as just Facebook. It uses this concept to recommend friends by checking their links using various algorithms. The same goes for shopping and e-commerce sites. Notwithstanding all the merits link prediction presents, they are only enjoyed by large networks. For sparse networks, there is a wide disparity between the links that are likely to form and the ones that include. A barrage of literature has been written to approach this problem; however, they mostly come from the angle of unsupervised learning (UL). While it may seem appropriate based on a dataset’s nature, it does not provide accurate information for sparse networks. Supervised learning could seem reasonable in such cases. This research is aimed at finding the most appropriate link-based link prediction methods in the context of big data based on supervised learning. There is a tone of books written on the same; nonetheless, they are core issues that are not always addressed in these studies, which are critical in understanding the concept of link prediction. This research explicitly looks at the new problems and uses the supervised approach in analyzing them to devise a full-fledge holistic link-based link prediction method. Specifically, the network issues that we will be delving into the lack of specificity in the existing techniques, observational periods, variance reduction, sampling approaches, and topological causes of imbalances. In the subsequent sections of the paper, we explain the theory prediction algorithms, precisely the flow-based process. We specifically address the problems on sparse networks that are never discussed with other prediction methods. The resolutions made by addressing the above techniques place our framework above the previous literature’s unsupervised approaches.


ASHA Leader ◽  
2013 ◽  
Vol 18 (2) ◽  
pp. 59-59
Keyword(s):  

Find Out About 'Big Data' to Track Outcomes


2014 ◽  
Vol 35 (3) ◽  
pp. 158-165 ◽  
Author(s):  
Christian Montag ◽  
Konrad Błaszkiewicz ◽  
Bernd Lachmann ◽  
Ionut Andone ◽  
Rayna Sariyska ◽  
...  

In the present study we link self-report-data on personality to behavior recorded on the mobile phone. This new approach from Psychoinformatics collects data from humans in everyday life. It demonstrates the fruitful collaboration between psychology and computer science, combining Big Data with psychological variables. Given the large number of variables, which can be tracked on a smartphone, the present study focuses on the traditional features of mobile phones – namely incoming and outgoing calls and SMS. We observed N = 49 participants with respect to the telephone/SMS usage via our custom developed mobile phone app for 5 weeks. Extraversion was positively associated with nearly all related telephone call variables. In particular, Extraverts directly reach out to their social network via voice calls.


2017 ◽  
Vol 225 (3) ◽  
pp. 287-288
Keyword(s):  

An associated conference will take place at ZPID – Leibniz Institute for Psychology Information in Trier, Germany, on June 7–9, 2018. For further details, see: http://bigdata2018.leibniz-psychology.org


PsycCRITIQUES ◽  
2014 ◽  
Vol 59 (2) ◽  
Author(s):  
David J. Pittenger
Keyword(s):  

2015 ◽  
Author(s):  
Kirsten Weir
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document