About
Publications
Courses
Articles
Contact
Light
Dark
Automatic
Publications
Type
Conference paper
Journal article
Book section
Date
2020
2018
2017
2015
2014
2011
2009
Total Influence and Hybrid Simulation of Independent Cascade Model using Rough Knowledge Granules
The paper defines a new theoretical measure Total Influence, of a node as well as a set of nodes in the social network. Total influence …
suman
PDF
Cite
DOI
Fuzzy Relative Willingness: Modeling Influence of Exogenous Factors in Driving Information Propagation Through a Social Network
A high percentage of information that propagates through a social network is sourced from different exogenous sources. E.g., …
S. Kundu
,
T. Kajdanowicz
,
P. Kazienko
,
N. Chawla
Cite
DOI
Double bounded rough set, tension measure, and social link prediction
The paper describes a new approach of viewing a social relation as a string with various forces acting on it. Accordingly, a tension …
suman
,
Sankar K. Pal
PDF
Cite
DOI
Granular Social Network: Model and Applications
Sankar K Pal
,
suman
PDF
Cite
DOI
Fuzzy-rough community in social networks
Community detection in a social network is a well-known problem that has been studied in computer science since early 2000. The …
suman
,
Sankar K. Pal
PDF
Cite
DOI
FGSN: Fuzzy Granular Social Networks - Model and applications
Social network data has been modeled with several approaches, including Sociogram and Sociomatrices, which are popular and …
suman
,
Sankar K. Pal
PDF
Cite
DOI
Deprecation based greedy strategy for target set selection in large scale social networks
The problem of target set selection for large scale social networks is addressed in the paper. We describe a novel deprecation based …
suman
,
Sankar K. Pal
PDF
Cite
DOI
Centrality measures, upper bound, and influence maximization in large scale directed social networks
The paper addresses the problem of finding top k influential nodes in large scale directed social networks. We propose two new …
Sankar K. Pal
,
suman
,
C. A. Murthy
PDF
Cite
DOI
A new centrality measure for influence maximization in social networks
The paper addresses the problem of finding top k influential nodes in large scale directed social networks. We propose a centrality …
suman
,
C. A. Murthy
,
S. K. Pal
PDF
Cite
DOI
An Efficient Algorithm to Reconstruct a Minimum Spanning Tree in an Asynchronous Distributed Systems
In a highly dynamic asynchronous distributed network, node failure (or recovery) and link failure (or recovery) triggers topological …
suman
,
Uttam Kr. Roy
PDF
Cite
Cite
×