Osaba, EnekoDel Ser, JavierCamacho, DavidGalvez, AkemiIglesias, AndresFister, IztokFister, IztokCamacho, DavidNovais, PauloTallón-Ballesteros, Antonio J.Yin, Hujun2024-07-242024-07-242018Osaba , E , Del Ser , J , Camacho , D , Galvez , A , Iglesias , A , Fister , I & Fister , I 2018 , Community detection in weighted directed networks using nature-inspired heuristics . in D Camacho , P Novais , A J Tallón-Ballesteros & H Yin (eds) , Intelligent Data Engineering and Automated Learning – IDEAL 2018 - 19th International Conference, Proceedings . Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , vol. 11315 LNCS , Springer Verlag , pp. 325-335 , 19th International Conference on Intelligent Data Engineering and Automated Learning, IDEAL 2018 , Madrid , Spain , 21/11/18 . https://doi.org/10.1007/978-3-030-03496-2_36conference97830300349550302-9743https://hdl.handle.net/11556/1941Publisher Copyright: © Springer Nature Switzerland AG 2018.Finding groups from a set of interconnected nodes is a recurrent paradigm in a variety of practical problems that can be modeled as a graph, as those emerging from Social Networks. However, finding an optimal partition of a graph is a computationally complex task, calling for the development of approximative heuristics. In this regard, the work presented in this paper tackles the optimal partitioning of graph instances whose connections among nodes are directed and weighted, a scenario significantly less addressed in the literature than their unweighted, undirected counterparts. To efficiently solve this problem, we design several heuristic solvers inspired by different processes and phenomena observed in Nature (namely, Water Cycle Algorithm, Firefly Algorithm, an Evolutionary Simulated Annealing and a Population based Variable Neighborhood Search), all resorting to a reformulated expression for the well-known modularity function to account for the direction and weight of edges within the graph. Extensive simulations are run over a set of synthetically generated graph instances, aimed at elucidating the comparative performance of the aforementioned solvers under different graph sizes and levels of intra- and inter-connectivity among node groups. We statistically verify that the approach relying on the Water Cycle Algorithm outperforms the rest of heuristic methods in terms of Normalized Mutual Information with respect to the true partition of the graph.11enginfo:eu-repo/semantics/restrictedAccessconference output10.1007/978-3-030-03496-2_36Bio-inspired computationCommunity detectionTheoretical Computer ScienceGeneral Computer Sciencehttp://www.scopus.com/inward/record.url?scp=85057115403&partnerID=8YFLogxK