Souptik Datta

Clustering distributed data streams in peer-to-peer environments

Ujjwal Maulik, Sanghamitra Bandyopadhyay, Kun Liu, 2006, Inf. Sci..

An Integrated Approach For Efficient Privacy Preserving Distributed Data

S. Datta, Qi Wang, Souptik Datta, 2022 .

Random-data perturbation techniques and privacy-preserving data mining

Qi Wang, Hillol Kargupta, Krishnamoorthy Sivakumar, 2005, Knowledge and Information Systems.

Analysis of privacy preserving random perturbation techniques: further explorations

Haimonti Dutta, Hillol Kargupta, Krishnamoorthy Sivakumar, 2003, WPES '03.

An Optimization based Modified Maximum Sensitive Item-Sets Conflict First Algorithm (MSICF) for Hiding Sensitive Item-Sets

D. Jaya Kumari, Nistala. V. E. S. Murthy, S. Srinivasa Suresh, 2013 .

On the privacy preserving properties of random data perturbation techniques

Qi Wang, Hillol Kargupta, Krishnamoorthy Sivakumar, 2003, Third IEEE International Conference on Data Mining.

Distributed Data Mining in Peer-to-Peer Networks

H. Kargupta, Kanishka Bhaduri, C. Giannella, 2006, IEEE Internet Computing.

Approximate Distributed K-Means Clustering over a Peer-to-Peer Network

Hillol Kargupta, Chris Giannella, Souptik Datta, 2009, IEEE Transactions on Knowledge and Data Engineering.

K-Means Clustering Over a Large, Dynamic Network

Hillol Kargupta, Chris Giannella, Souptik Datta, 2006, SDM.