This site is dedicated to the research works done by the Social Networks team from KID department in the LGI2P laboratory of Ecole des Mines d’Alès University/ Engineer School located in Nîmes/FRANCE.
You may try just below to test your own data. You will find explanation below on our research works. Try the algorithm Now:
Social networks have become a very new field of investigation courted by research and industry. However, social links work in general from the emergence of communities. The creation and life of communities are social, cultural and economic in nature. The study and engineering of social networks open a brand new field of research of research which is scientifically and industrially potent the issue of which are not limited to the social sphere.
We propose an innovative community detection method for finding partitioned and overlapping communities in bipartite, directed or unipartite graphs. We apply game theory principles and particularly the Nash Equilibrium to improve our results. This method is described in our paper which was awarded “Best Paper Award” at the 2013 Knowledge Engineering Conference, in Lille.
Our team built an Application Programming Interface named COMMET, COMMunity Evaluation and Transformation, this API allows you to test the detection algorithm for finding communities on your own network. Other possible applications are described in the ONLINE API section.
Detection of communities from observation can help identify trends, make recommendations, offer new services, or facilitate communication. But the issues are not limited to the social sphere, it can be extended to the political sphere with the evolution of the partitioning of voters according to the evolution of the collection of voting intentions. Some other fields of application could be:
- restructuring of services
- reorganization of entities
- personalized dissemination
- common interests center
- brain connection path,