D-MFCLMin: A New Algorithm for Extracting Frequent Conceptual Links from Social Networks

Abstract

Massive amounts of data in social networks have made researchers look for ways to display a summary of the information provided and extract knowledge from them. One of the new approaches to describe knowledge of the social network is through a concise structure called conceptual view. In order to build this view, it is first needed to extract conceptual links from the intended network. However, extracting these links for large scale networks is very time consuming. In this paper, a new algorithm for extracting frequent conceptual link from social networks is provided where by introducing the concept of dependency, it is tried to accelerate the process of extracting conceptual links. Although the proposed algorithm will be able to accelerate this process if there are dependencies between data, but the tests carried out on Pokec social network, which lacks dependency between its data, revealed that absence of dependency, increases execution time of extracting conceptual links only up to 15 percent.

Authors and Affiliations

Hamid Tabatabaee

Keywords

Related Articles

Appraising Research Direction & Effectiveness of Existing Clustering Algorithm for Medical Data

The applicability and effectiveness of clustering algorithms had unquestioningly benefitted solving various sectors of real-time problems. However, with the changing time, there is a significant change in forms of the da...

Immuno-Computing-based Neural Learning for Data Classification

The paper proposes two new algorithms based on the artificial immune system of the human body called Clonal Selection Algorithm (CSA) and the modified version of Clonal Selection Algorithm (MCSA), and used them to train...

Coronary Heart Disease Diagnosis using Deep Neural Networks

According to the World Health Organization, cardiovascular disease (CVD) is the top cause of death worldwide. In 2015, over 30% of global deaths was due to CVD, leading to over 17 million deaths, a global health burden....

Designing Graphical Data Storage Model for Gene-Protein and Gene-Gene Interaction Networks

Graph is an expressive way to represent dynamic and complex relationships in highly connected data. In today’s highly connected world, general purpose graph databases are providing opportunities to experience benefits of...

A Qualitative Analysis to Evaluate Key Characteristics of Web Mining based e-Commerce Applications

E-Commerce applications are playing vital role by providing competitive advantage over business peers. It is important to get interesting patterns from e-commerce transactions to analyze customer experience, customer lik...

Download PDF file
  • EP ID EP259119
  • DOI 10.14569/IJACSA.2017.081240
  • Views 71
  • Downloads 0

How To Cite

Hamid Tabatabaee (2017). D-MFCLMin: A New Algorithm for Extracting Frequent Conceptual Links from Social Networks. International Journal of Advanced Computer Science & Applications, 8(12), 315-321. https://europub.co.uk/articles/-A-259119