No More Graph Clustering Algorithms, Please: Disjoint Clustering Algorithms Now Able To Detect Overlapping Clusters
Share This:
                           

About The Author

Tanmoy Chakraborty is an assistant professor at the Indraprastha Institute of Information. His primary research interests include Network Science, Data Mining, Natural Language Processing and Data-driven cybersecurity. He has served as a PC member in various top conferences including WWW, AAAI, PAKDD, IJCAI, and reviewer of top journals including ACM TKDD, IEEE TKDE, ACM TIST, CACM.

                       

No More Graph Clustering Algorithms, Please: Disjoint Clustering Algorithms Now Able To Detect Overlapping Clusters

Published by Tanmoy Chakraborty IIIT Delhi, India These findings are described in the article entitled Ensemble-based overlapping community detection using disjoint community structures, recently published in the journal Knowledge-Based Systems (Knowledge-Based Systems 163 (2019) 241-251). This work was conducted by Tanmoy Chakraborty from IIIT Delhi, Saptarshi Ghosh from IIT Kharagpur, and Noseong Park from George Mason University. Most of the complex systems such as social networks (e.g., Facebook, Twitter), biological systems (e.g., protein-protein interactions) can be modeled by networks/graphs where...

Read more