An Approach for Personalized Social Matching Systems by Using Ant Colony


Personalized social matching systems can be seen as recommender systems that recommend people to others in the social networks, with desirable skills/characteristics. In this work, an algorithm based on Ant Colony is proposed to solve the optimization problem of clustering/matching people in a social network specifically designed for this purpose; during this process, their personal characteristics and preferences (and the degree of importance thereof) are taken into account. The numerical results indicate that the proposed algorithm can successfully perform clustering with a variable number of individuals.

Share and Cite:

de Mendonça, L. (2014) An Approach for Personalized Social Matching Systems by Using Ant Colony. Social Networking, 3, 102-107. doi: 10.4236/sn.2014.32013.

Conflicts of Interest

The authors declare no conflicts of interest.


[1] L. F. Mendon?a, “An Approach for Personalized Social Matching Systems by Using Ant Colony,” Proceedings of the Brazilian Workshop on Social Network Analysis and Mining, XXXII Congress of the Brazilian Computer Society Computer Society, Curitiba, 2012.
[2] M. Dorigo and T. Stutzle, “Ant Colony Optimization,” The MIT Press, Cambridge, 2004.
[3] S. Alsaleh, R. Nayak, Y. Xu and L. Chen, “Improving Matching Process in Social Network Using Implicit and Explicit User Information,” Proceedings of the Asia-Pa- cific Web Conference, Lecture Notes in Computer Science, Beijing, 2011, pp. 313-320.
[4] E. M. Morgan, T. C. Richards and E. M. VanNess, “Comparing Narratives of Personal and Preferred Partner Characteristics in Online Dating Advertisements,” Computers in Human Behavior, Vol. 26, No. 5, 2010, pp. 883-888.
[5] L. Terveen and D. W. McDonald, “Social Matching: A Framework and Research Agenda,” ACM Transactions on Computer-Human Interaction, Vol. 12, No. 3, 2005, pp. 401-434.
[6] H. Oinas-Kukkonen, K. Lyytinen and Y. Yoo, “Social Networks and Information Systems: Ongoing and Future Research Streams,” Journal of the Association for Information Systems, Vol. 11, No. 2, 2010, pp. 555-566.
[7] R. Andreani, J. M. Martínez, M. Salvatierra and F. Yano, “Quasi-Newton Methods for Order-Value Optimization and Value-at-Risk Calculations,” Pacific Journal of Optimization, Vol. 2, 2006, pp. 11-33.
[8] T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, “Introduction to Algorithms,” The MIT Press, Cambridge, 2009.
[9] M. Dorigo, G. Di Caro and L. M. Gambardella, “Ant Algorithms for Discrete Optimization,” Artificial Life, Vol. 5, No. 2, 1999, pp. 137-172.
[10] M. Dorigo, V. Maniezzo and A. Colorni, “The Ant System: Optimization by a Colony of Cooperating Agents,” IEEE Transactions on Systems, Man and Cybernetics, Part B: Cybernetics, Vol. 26, No. 1, 1996, pp. 29-41.
[11] E. Alba, “Parallel Metaheuristics: A New Class of Algorithms,” Wiley Series on Parallel and Distributed Computing, Wiley-Interscience, Hoboken, 2005.

Copyright © 2023 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.