Kanishka Bhaduri
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Interests
Kanishka Bhaduri has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
Chris Giannella
Department of Computer Science, New Mexico State University, Las Cruces NM, 88003, USA
1 shared publicationHillol Kargupta
Department of Computer Science and Electrical Engineering, University of Maryland, Baltimore County, 1000 Hilltop Circle, Baltimore, Maryland, 21250, USA
1 shared publication- Hillol Kargupta
University of Maryland
1 shared publication - Kamalika Das
NASA Ames Research Center
1 shared publication - Krishnamoorthy Sivakumar
Washington State University
1 shared publication Ran Wolff
Department of Management Information Systems, Haifa University, Haifa, 31905, Israel
1 shared publication
Latest Publications
- 20 May 2008
- Published by Wiley in Statistical Analysis and Data Mining: An ASA Data Science Journal
- Vol. 1 (2) , 85-103
Distributed Decision‐Tree Induction in Peer‐to‐Peer Systems
This paper offers a scalable and robust distributed algorithm for decision‐tree induction in large peer‐to‐peer (P2P) environments. Computing a decision tree in such large distributed systems using standard centralized algorithms can be very communication‐expensive and impractical because of the synchronization requirements. The problem becomes even more challenging in the distributed stream monitoring scenario where the decision tree needs to be updated in response to changes in the data distribution. This paper presents an alternate solution that works in a completely asynchronous manner in distributed environments and offers low communication overhead, a necessity for scalability. It also seamlessly handles changes in data and peer failures. The paper presents extensive experimental results to corroborate the theoretical claims. Copyright © 2008 Wiley Periodicals, Inc., A Wiley Company Statistical Analy Data Mining 1: 000‐000, 2008
- 20 May 2008
- Published by Wiley in Statistical Analysis and Data Mining: An ASA Data Science Journal
- Vol. 1 (2) , 85-103
Distributed Decision‐Tree Induction in Peer‐to‐Peer Systems
This paper offers a scalable and robust distributed algorithm for decision‐tree induction in large peer‐to‐peer (P2P) environments. Computing a decision tree in such large distributed systems using standard centralized algorithms can be very communication‐expensive and impractical because of the synchronization requirements. The problem becomes even more challenging in the distributed stream monitoring scenario where the decision tree needs to be updated in response to changes in the data distribution. This paper presents an alternate solution that works in a completely asynchronous manner in distributed environments and offers low communication overhead, a necessity for scalability. It also seamlessly handles changes in data and peer failures. The paper presents extensive experimental results to corroborate the theoretical claims. Copyright © 2008 Wiley Periodicals, Inc., A Wiley Company Statistical Analy Data Mining 1: 000‐000, 2008