Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.
Digital Object Identifier (DOI) : 10.14569/IJACSA.2017.081240
Article Published in International Journal of Advanced Computer Science and Applications(IJACSA), Volume 8 Issue 12, 2017.
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.
Hamid Tabatabaee, “D-MFCLMin: A New Algorithm for Extracting Frequent Conceptual Links from Social Networks” International Journal of Advanced Computer Science and Applications(IJACSA), 8(12), 2017. http://dx.doi.org/10.14569/IJACSA.2017.081240