Satrap: Data and Network Heterogeneity Aware P2P Data-mining

• Main Authors: ANG, Hock Kee, Gopalkrishnan, Vivekanand, DATTA, Anwitaman, NG, Wee Keong, HOI, Steven C. H.
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2010
• Subjects: Computer Sciences; Databases and Information Systems
• Online Access: https://ink.library.smu.edu.sg/sis_research/2366; https://ink.library.smu.edu.sg/context/sis_research/article/3366/viewcontent/chp_3A10.1007_2F978_3_642_13672_6_7.pdf
• Institution: Singapore Management University

Distributed classification aims to build an accurate classifier by learning from distributed data while reducing computation and communication cost A P2P network where numerous users come together to share resources like data content, bandwidth, storage space and CPU resources is an excellent platform for distributed classification However, two important aspects of the learning environment have often been overlooked by other works, viz., 1) location of the peers which results in variable communication cost and 2) heterogeneity of the peers' data which can help reduce redundant communication In this paper, we examine the properties of network and data heterogeneity and propose a simple yet efficient P2P classification approach that minimizes expensive inter-region communication while achieving good generalization performance Experimental results demonstrate the feasibility and effectiveness of the proposed solution.