Fredrik Erlandsson

Mr. Fredrik Erlandsson

orcid

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 April 2016 in Entropy
Verified
Journal Article
Open access
PDF file
FEFredrik Erlandsson
Fredrik Erlandsson
Piotr BródkaPiotr Bródka
Piotr Bródka
ABAnton Borg
Anton Borg
HJHenric Johnson
Henric Johnson
Influential users play an important role in online social networks since users tend to have an impact on one other. Therefore, the proposed work analyzes users and their behavior in order to identify influential users and predict user participation. Normally, the success of a social media site is dependent on the activity level of the participating users. For both online social networking sites and individual users, it is of interest to find out if a topic will be interesting or not. In this article, we propose association learning to detect relationships between users. In order to verify the findings, several experiments were executed based on social network analysis, in which the most influential users identified from association rule learning were compared to the results from Degree Centrality and Page Rank Centrality. The results clearly indicate that it is possible to identify the most influential users using association rule learning. In addition, the results also indicate a lower execution time compared to state-of-the-art methods.

1 September 2015
Verified
Conference Paper
Closed access
FEFredrik Erlandsson
Fredrik Erlandsson
RNRoozbeh Nia
Roozbeh Nia
MBMartin Boldt
Martin Boldt
HJHenric Johnson
Henric Johnson
SWS. Felix Wu
S. Felix Wu
Researchers put in tremendous amount of time and effort in order to crawl the information from online social networks. With the variety and the vast amount of information shared on online social networks today, different crawlers have been designed to capture several types of information. We have developed a novel crawler called SINCE. This crawler differs significantly from other existing crawlers in terms of efficiency and crawling depth. We are getting all interactions related to every single post. In addition, are we able to understand interaction dynamics, enabling support for making informed decisions on what content to re-crawl in order to get the most recent snapshot of interactions. Finally we evaluate our crawler against other existing crawlers in terms of completeness and efficiency. Over the last years we have crawled public communities on Facebook, resulting in over 500 million unique Facebook users, 50 million posts, 500 million comments and over 6 billion likes.

1 September 2012
Verified
Conference Paper
Closed access
FEFredrik Erlandsson
Fredrik Erlandsson
MBMartin Boldt
Martin Boldt
HJHenric Johnson
Henric Johnson
The popularity of Online Social Networks (OSNs) has increased the visibility of users profiles and interactions performed between users. In this paper we structure different privacy threats related to OSNs and describe six different types of privacy threats. One of these threats, named public information harvesting, is previously not documented so we therefore present it in further detail by also presenting the results from a proof-of-concept implementation of that threat. The basis of the attack is gathering of user interactions from various open groups on Facebook which then is transformed into a social interaction graph. Since the data gathered from the OSN originates from open groups it could be executed by any third-party connected to the Internet independently of the users' privacy settings. In addition to presenting the different privacy threats we also we propose a range of different protection techniques.

27 November 2017
Verified
Book Chapter
Closed access
PDF file
FEFredrik Erlandsson
Fredrik Erlandsson
Piotr BródkaPiotr Bródka
Piotr Bródka
ABAnton Borg
Anton Borg

13 December 2017 in Entropy
Verified
Journal Article
Open access
PDF file
FEFredrik Erlandsson
Fredrik Erlandsson
Piotr BródkaPiotr Bródka
Piotr Bródka
MBMartin Boldt
Martin Boldt
HJHenric Johnson
Henric Johnson
[-15]With the growing use of popular social media services like Facebook and Twitter it is challenging to collect all content from the networks without access to the core infrastructure or paying for it. Thus, if all content cannot be collected one must consider which data are of most importance. In this work we present a novel User-guided Social Media Crawling method (USMC) that is able to collect data from social media, utilizing the wisdom of the crowd to decide the order in which user generated content should be collected to cover as many user interactions as possible. USMC is validated by crawling 160 public Facebook pages, containing content from 368 million users including 1.3 billion interactions, and it is compared with two other crawling methods. The results show that it is possible to cover approximately 75% of the interactions on a Facebook page by sampling just 20% of its posts, and at the same time reduce the crawling time by 53%. In addition, the social network constructed from the 20% sample contains more than 75% of the users and edges compared to the social network created from all posts, and it has similar degree distribution.

1 December 2012
Verified
Conference Paper
Closed access
RNRoozbeh Nia
Roozbeh Nia
FEFredrik Erlandsson
Fredrik Erlandsson
PBPrantik Bhattacharyya
Prantik Bhattacharyya
MRMohammad Rezaur Rahman
Mohammad Rezaur Rahman
HJHenric Johnson
Henric Johnson
SWS. Felix Wu
S. Felix Wu
Online Social Networks (OSNs) are popular platforms for interaction, communication and collaboration between friends. In this paper we develop and present a new platform to make interactions in OSNs accessible. Most of today's social networks, including Facebook, Twitter, and Google+ provide support for third party applications to use their social network graph and content. Such applications are strongly dependent on the set of software tools and libraries provided by the OSNs for their own development and growth. For example, third party companies like CNN provide recommendation materials based on user interactions and user's relationship graph. One of the limitations with this graph (or APIs) is the segregation from the shared content. We believe, and present in this paper, that the content shared and the actions taken on the content, creates a Social Interaction Network (SIN). As such, we extend Facebook's current API in order to allow applications to retrieve a weighted graph instead of Facebooks unweighted graph. Finally, we evaluate the proposed platform based on completeness and speed of the crawled results from selected community pages. We also give a few example uses of our API on how it can be used by third party applications.