Abstract
Numerous methods have been proposed in order to perform clustering from social networks. While significant works have been carried out on the design of new approaches, able to search for various kinds of clusters, a major challenge concerns the scalability of these approaches. Indeed, given the mass of data that can now be collected from online social networks, particularly from social platforms, it is important to have efficient methods for exploring and analyzing these very large amount of data. One of the recent social network clustering approaches is the extraction of conceptual links, a new approach that performs link clustering by exploiting both the structure of the network and attributes of nodes to identify strong links between groups of nodes in which nodes share common attributes. In this paper, we focus on the optimization of the search for conceptual links. In particular, we propose PALM, a parallel algorithm that aims to improve the efficiency of the extraction by simultaneously exploring several areas of the search space. For this purpose, we begin by demonstrating that the solution space forms a concept lattice. Then, we propose an approach that explores in parallel the branches of the lattice while reducing the search space based on various properties of conceptual links. We demonstrate the efficiency of the algorithm by comparing the performances with the original extraction approach. The results obtained show a significant gain on the computation time.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Barabasi, A., Crandall, R.: Linked: the new science of networks. Am. J. Phys. 71, 409 (2003)
Fowler, J., Christakis, N.: The dynamic spread of happiness in a large social network. BMJ Br. Med. J. 337, a2338 (2008)
Tang, J., Sun, J., Wang, C., Yang, Z.: Social influence analysis in large-scale networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2009, pp. 807–816. ACM, New York (2009)
Leskovec, J., Adamic, L.A., Huberman, B.A.: The dynamics of viral marketing. ACM Trans. Web 1, 228–237 (2007)
Tumasjan, A., Sprenger, T.O., Sandner, P.G., Welpe, I.M.: Predicting elections with twitter: what 140 characters reveal about political sentiment. ICWSM 10(1), 178–185 (2010)
Getoor, L., Diehl, C.P.: SIGKDD Explor. 7, 3–12 (2005)
Kleinberg, J.M.: Challenges in mining social network data: processes, privacy, and paradoxes. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 4–5. ACM (2007)
Stattner, E., Collard, M.: Descriptive modeling of social networks. Procedia Comput. Sci. 52, 226–233 (2015)
Blondel, V., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech: Theory Exp. 2008, P10008 (2008)
Fortunato, S.: Community detection in graphs. Phys. Rep. 486, 75–174 (2010)
Zhou, Y., Cheng, H., Yu, J.: Graph clustering based on structural/attribute similarities. VLDB Endowment 2(1), 718–729 (2009)
Stattner, E., Collard, M.: MAX-FLMin: an approach for mining maximal frequent links and generating semantical structures from social networks. In: Liddle, S.W., Schewe, K.-D., Tjoa, A.M., Zhou, X. (eds.) DEXA 2012. LNCS, vol. 7446, pp. 468–483. Springer, Heidelberg (2012). doi:10.1007/978-3-642-32600-4_35
Liben-Nowell, D., Kleinberg, J.: The link-prediction problem for social networks. J. Am. Soc. Inf. Sci. Technol. 58, 1019–1031 (2007)
Heatherly, R., Kantarcioglu, M., Li, X.: Social network classification incorporating link type. In: Proceedings of IEEE Intelligence and Security Informatics, Dallas, Texas, June 2009
Gaume, B., Navarro, E., Prade, H.: A parallel between extended formal concept analysis and bipartite graphs analysis. In: Hüllermeier, E., Kruse, R., Hoffmann, F. (eds.) IPMU 2010. LNCS, vol. 6178, pp. 270–280. Springer, Heidelberg (2010). doi:10.1007/978-3-642-14049-5_28
Kuramochi, M., Karypis, G.: Discovering frequent geometric subgraphs. Inf. Syst. 32(8), 1101–1120 (2007)
Newman, M.E.: Modularity and community structure in networks. Proc. Natl. Acad. Sci. 103(23), 8577–8582 (2006)
Yoon, S.H., Song, S.S., Kim, S.W.: Efficient link-based clustering in a large scaled blog network. In: Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication, ICUIMC 2011, pp. 71:1–71:5. ACM, New York (2011)
Bothorel, C., Cruz, J.D., Magnani, M., Micenkova, B.: Clustering attributed graphs: models, measures and methods. Netw. Sci. 3(3), 408–444 (2015)
Stattner, E., Collard, M.: Social-based conceptual links: conceptual analysis applied to social networks. In: International Conference on Advances in Social Networks Analysis and Mining (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Stattner, E., Eugenie, R., Collard, M. (2017). PALM: A Parallel Mining Algorithm for Extracting Maximal Frequent Conceptual Links from Social Networks. In: Benslimane, D., Damiani, E., Grosky, W., Hameurlain, A., Sheth, A., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2017. Lecture Notes in Computer Science(), vol 10439. Springer, Cham. https://doi.org/10.1007/978-3-319-64471-4_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-64471-4_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-64470-7
Online ISBN: 978-3-319-64471-4
eBook Packages: Computer ScienceComputer Science (R0)