Distributed Classification in Peer-to-Peer Networks  thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Distributed Classification in Peer-to-Peer Networks

Published on Aug 14, 20075606 Views

This work studies the problem of distributed classification in peer-to-peer (P2P) networks. While there has been a significant amount of work in distributed classification, most of existing algorithms

Related categories

Chapter list

Distributed Classification in Peer-to-Peer Networks00:00
Overview-part0100:19
Research Motivation00:57
Research Motivation (2)02:21
Problem Formulation03:24
Our Contributions04:13
Overview-part0205:10
Building Local Classifiers05:13
Overview-part0306:11
Problem Formulation Of DPV06:14
An Example Of DPV07:14
Comparison Between DPV and Distributed Majority Voting (DMV, by Wolff et al. [TSMC’04])07:37
Comparison Between DPV and DMV (2)09:06
Challenges for DPV10:14
DPV Protocol Overview10:44
The Condition for Sending Messages12:08
The Condition for Sending Messages (2)13:37
The Correctness of DPV Protocol14:12
The Optimality of DPV Protocol15:05
The Extension of DPV Protocol16:23
Overview-part0417:36
Accuracy of P2P Classification17:39
The Performance of DPV Protocol18:55
The Performance of DPV Protocol (2)19:28
The Performance of DPV Protocol (3)19:55
The Performance of DPV Protocol (4)20:17
Overview-part0521:33
Related Work - Ensemble Classifiers21:36
Related Work - P2P Data Mining21:52
Overview-part0623:07
Summary23:09
Q. & A.23:44