Suman Kundu is an Assistant Professor of the Department of Computer Science and Engineering at Indian Institute of Technology Jodhpur. He received B.Tech in Information Technology from West Bengal University of Technology, Kolkata, India in 2005 and M.E. in Software Engineering from Jadavpur University in 2009. His doctoral research was carried out at Center for Soft Computing Research, Indian Statistical Institute between 2010 and 2015. He had visited engine group at Wroclaw University of Science and Technology from June 2018 to April 2019 for his postdoctoral research.
Dr. Kundu has more than 6 years of industrial software development experience with ZINFI Software Systems Pvt. Ltd., Kolkata. He published 8 articles in the area of social network analysis, granular computing, soft computing. His research interests includes social network analysis, network data science, soft computing, crowd sourcing, fuzzy and rough set, and granular computing.
PhD in Social Network Analysis, 2017
Center for Soft Computing Research, Indian Statistical Insitute (Degree awarded by Jadavpur University)
ME in Software Engineering, 2009
Jadavpur University, Kolkata
BTech in Information Technology, 2005
Netaji Subhash Engineering College, Kolkata
The paper describes a new approach of viewing a social relation as a string with various forces acting on it. Accordingly, a tension measure for a relation is defined. Various component forces of the tension measure are identified based on the structural information of the network. A new variant of rough set, namely, double bounded rough set is developed in order to define these forces mathematically. It is revealed experimentally with synthetic and real-world data that positive and negative tension characterize, relatively, the presence and absence of a physical link between two nodes. An algorithm based on tension measure is proposed for link prediction. Superiority of the algorithm is demonstrated on nine real-world networks which include four temporal networks. The source code for calculating tension measure and link prediction algorithm is publicly available at My GitLab.
Community detection in a social network is a well-known problem that has been studied in computer science since early 2000. The algorithms available in the literature mainly follow two strategies, one, which allows a node to be a part of multiple communities with equal membership, and the second considers a disjoint partition of the whole network where a node belongs to only one community. In this paper, we proposed a novel community detection algorithm which identifies fuzzy-rough communities where a node can be a part of many groups with different memberships of their association. The algorithm runs on a new framework of social network representation based on fuzzy granular theory. A new index viz. normalized fuzzy mutual information, to quantify the goodness of detected communities is used. Experimental results on benchmark data show the superiority of the proposed algorithm compared to other well known methods, particularly when the network contains overlapping communities.