One of the most common tasks in the area of social network mining is the extraction of frequent patterns from social networks. Although traditional approaches have been mainly focused on subgraphs occurring frequently in a network or a set of networks, new approaches have attempted to exploit network structure and node properties in order to elicit new kinds of patterns. One of these news approaches is the extraction of conceptual links, a solution that combines both structure and node properties for providing knowledge on the groups of nodes the most connected in a social network. However, if the extraction of conceptual links offers a great potential in terms of knowledge discovery as well as network visualization, the search for these kinds of patterns remains a computationally intensive problem. Thus, the efficiency of the extraction processes highly depends on the efficiency of the underlying algorithm. In this paper, we focus on the extraction of maximal frequent conceptual links (MFCL) and we propose a hybrid algorithm that applies a filter on the nodes for reducing the search space to the most frequent groups of nodes. Although our solution potentially causes loss of some patterns, we demonstrate its efficiency by comparison with the MFCLMin algorithm. We investigate the potential loss of patterns, the gain on the runtime, and the gain on the number of comparisons.