D-MFCLMin: A New Algorithm for Extracting Frequent Conceptual Links from Social Networks
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2017, Vol 8, Issue 12
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
- EP ID EP259119
- DOI 10.14569/IJACSA.2017.081240
- Views 98
- Downloads 0
Improvement of Sample Selection: A Cascade-Based Approach for Lesion Automatic Detection
Computer-Aided Detection (CADe) system has a significant role as a preventative effort in the early detection of breast cancer. There are some phases in developing the pattern recognition on the CADe system, including th...
Dimensionality Reduction technique using Neural Networks – A Survey
A self-organizing map (SOM) is a classical neural network method for dimensionality reduction. It comes under the unsupervised class. SOM is a neural network that is trained using unsupervised learning to produce a...
An Efficient Mechanism Protocol for Wireless Sensor Networks by using Grids
Multilevel short-distance clustering communication is an important scheme to reduce lost data packets over the path to the sink, particularly when nodes are deployed in a dense WSN (wireless sensor network). Our proposed...
An Extension of the Bisection Theorem to Symmetrical Circuits with Cross-Coupling
This paper demonstrates that the bisection theorem can be applied to the differential and common-mode analysis of balanced symmetrical circuits with cross coupling. This class of circuits is often found in the literature...
A New Hybrid Network Sniffer Model Based on Pcap Language and Sockets (Pcapsocks)
Nowadays, the protection and the security of data transited within computer networks represent a real challenge for developers of computer applications and network administrators. The Intrusion Detection System and Intru...