Kanishka Bhaduri
Kanishka Bhaduri has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Hillol Kargupta
University of Maryland
3 shared publications Ashok N. Srivastava
NASA Ames Research Center, Moffett Field, CA, USA
1 shared publicationChris Giannella
The MITRE Corporation, 300 Sentinel Dr. Suite 600, Annapolis Junction MD 20701, USA
1 shared publicationHillol Kargupta
CSEE Department, UMBC, 1000 Hilltop Circle, Baltimore, MD 21250, USA
1 shared publicationKamalika Das
Stinger Ghaffarian Technologies Inc., NASA Ames Research Center, MS 269-3, Moffett Field, CA 94035, USA
1 shared publication- Kamalika Das
NASA Ames Research Center
1 shared publication
Latest Publications
- 12 October 2011
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 24 (2) , 311-324
Introduction to data mining for sustainability
- 12 October 2011
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 24 (2) , 311-324
Introduction to data mining for sustainability
- 31 March 2011
- Published by Wiley in Statistical Analysis and Data Mining: An ASA Data Science Journal
- Vol. 4 (3) , 336-352
Scalable, asynchronous, distributed eigen monitoring of astronomy data streams
In this paper, we develop a distributed algorithm for monitoring the principal components (PCs) for next generation of astronomy petascale data pipelines such as the Large Synoptic Survey Telescopes (LSST). This telescope will take repeated images of the night sky every 20 s, thereby generating 30 terabytes of calibrated imagery every night that will need to be co‐analyzed with other astronomical data stored at different locations around the world. Event detection, classification, and isolation in such data sets may provide useful insights to unique astronomical phenomenon displaying astrophysically significant variations: quasars, supernovae, variable stars, and potentially hazardous asteroids. However, performing such data mining tasks is a challenging problem for such high‐throughput distributed data streams. In this paper, we propose a highly scalable and distributed asynchronous algorithm for monitoring the PCs of such dynamic data streams and discuss a prototype web‐based system PADMINI (Peer‐to‐Peer Astronomy Data Mining) which implements this algorithm for use by the astronomers. We demonstrate the algorithm on a large set of distributed astronomical data to accomplish well‐known astronomy tasks such as measuring variations in the fundamental plane of galaxy parameters. The proposed algorithm is provably correct (i.e., converges to the correct PCs without centralizing any data) and can seamlessly handle changes to the data or the network. Real experiments performed on Sloan Digital Sky Survey (SDSS) catalogue data show the effectiveness of the algorithm. © 2011 Wiley Periodicals, Inc. Statistical Analysis and Data Mining 2011
- 31 March 2011
- Published by Wiley in Statistical Analysis and Data Mining: An ASA Data Science Journal
- Vol. 4 (3) , 336-352
Scalable, asynchronous, distributed eigen monitoring of astronomy data streams
In this paper, we develop a distributed algorithm for monitoring the principal components (PCs) for next generation of astronomy petascale data pipelines such as the Large Synoptic Survey Telescopes (LSST). This telescope will take repeated images of the night sky every 20 s, thereby generating 30 terabytes of calibrated imagery every night that will need to be co‐analyzed with other astronomical data stored at different locations around the world. Event detection, classification, and isolation in such data sets may provide useful insights to unique astronomical phenomenon displaying astrophysically significant variations: quasars, supernovae, variable stars, and potentially hazardous asteroids. However, performing such data mining tasks is a challenging problem for such high‐throughput distributed data streams. In this paper, we propose a highly scalable and distributed asynchronous algorithm for monitoring the PCs of such dynamic data streams and discuss a prototype web‐based system PADMINI (Peer‐to‐Peer Astronomy Data Mining) which implements this algorithm for use by the astronomers. We demonstrate the algorithm on a large set of distributed astronomical data to accomplish well‐known astronomy tasks such as measuring variations in the fundamental plane of galaxy parameters. The proposed algorithm is provably correct (i.e., converges to the correct PCs without centralizing any data) and can seamlessly handle changes to the data or the network. Real experiments performed on Sloan Digital Sky Survey (SDSS) catalogue data show the effectiveness of the algorithm. © 2011 Wiley Periodicals, Inc. Statistical Analysis and Data Mining 2011
- 28 June 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)
- Vol. 41 (1) , 260-272
Privacy-Preserving Outlier Detection Through Random Nonlinear Data Distortion
Consider a scenario in which the data owner has some private or sensitive data and wants a data miner to access them for studying important patterns without revealing the sensitive information. Privacy-preserving data mining aims to solve this problem by randomly transforming the data prior to their release to the data miners. Previous works only considered the case of linear data perturbations - additive, multiplicative, or a combination of both - for studying the usefulness of the perturbed output. In this paper, we discuss nonlinear data distortion using potentially nonlinear random data transformation and show how it can be useful for privacy-preserving anomaly detection from sensitive data sets. We develop bounds on the expected accuracy of the nonlinear distortion and also quantify privacy by using standard definitions. The highlight of this approach is to allow a user to control the amount of privacy by varying the degree of nonlinearity. We show how our general transformation can be used for anomaly detection in practice for two specific problem instances: a linear model and a popular nonlinear model using the sigmoid function. We also analyze the proposed nonlinear transformation in full generality and then show that, for specific cases, it is distance preserving. A main contribution of this paper is the discussion between the invertibility of a transformation and privacy preservation and the application of these techniques to outlier detection. The experiments conducted on real-life data sets demonstrate the effectiveness of the approach.
- 28 June 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)
- Vol. 41 (1) , 260-272
Privacy-Preserving Outlier Detection Through Random Nonlinear Data Distortion
Consider a scenario in which the data owner has some private or sensitive data and wants a data miner to access them for studying important patterns without revealing the sensitive information. Privacy-preserving data mining aims to solve this problem by randomly transforming the data prior to their release to the data miners. Previous works only considered the case of linear data perturbations - additive, multiplicative, or a combination of both - for studying the usefulness of the perturbed output. In this paper, we discuss nonlinear data distortion using potentially nonlinear random data transformation and show how it can be useful for privacy-preserving anomaly detection from sensitive data sets. We develop bounds on the expected accuracy of the nonlinear distortion and also quantify privacy by using standard definitions. The highlight of this approach is to allow a user to control the amount of privacy by varying the degree of nonlinearity. We show how our general transformation can be used for anomaly detection in practice for two specific problem instances: a linear model and a popular nonlinear model using the sigmoid function. We also analyze the proposed nonlinear transformation in full generality and then show that, for specific cases, it is distance preserving. A main contribution of this paper is the discussion between the invertibility of a transformation and privacy preservation and the application of these techniques to outlier detection. The experiments conducted on real-life data sets demonstrate the effectiveness of the approach.
- 22 June 2010
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 4 (2) , 192-209
Multi-objective optimization based privacy preserving distributed data mining in Peer-to-Peer networks
- 22 June 2010
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 4 (2) , 192-209
Multi-objective optimization based privacy preserving distributed data mining in Peer-to-Peer networks
- 25 November 2009
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 24 (3) , 341-367
A local asynchronous distributed privacy preserving feature selection algorithm for large peer-to-peer networks
- 25 November 2009
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 24 (3) , 341-367
A local asynchronous distributed privacy preserving feature selection algorithm for large peer-to-peer networks