Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

How to extract frequent links with frequent itemsets in social networks?

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Stattner, E. ; LAMIA Lab., Univ. of the French West Indies & Guiana, France ; Collard, M.

In the area of the link mining, frequent pattern discovery tasks generally consist in the search for subgraphs frequently found in a network or a set of networks. Very recently, new axes of this problem has been proposed through the search for frequent links. Unlike traditional approaches that focus solely on structural regularities, frequent link mining methods exploit both the network structure and the attributes of nodes for extracting regularities in the links existing between node groups that share common characteristics. However, extracting frequent links is still a particularly challenging and computationally intensive issue since it is much dependent on the number of links. In this study, we propose a solution that is able to reduce the computing time by reducing the search to only a subset of of nodes. Experiments were conducted to understand the effects of different thresholds of the subset size on the loss of patterns and the gain in terms of computation time. Our solution proves to be efficient for a rather wide range of thresholds.

Published in:

Research Challenges in Information Science (RCIS), 2012 Sixth International Conference on

Date of Conference:

16-18 May 2012