Download now Free registration required
Local thresholding algorithms were first presented more than a decade ago and have since been applied to a variety of data mining tasks in peer-to-peer systems, wireless sensor networks, and in grid systems. One critical assumption made by those algorithms has always been cycle-free routing. The existence of even one cycle may lead all peers to the wrong outcome. Outside the lab, unfortunately, cycle freedom is not easy to achieve. This paper is the first to lift the requirement of cycle freedom by presenting a local thresholding algorithm suitable for general network graphs.
- Format: PDF
- Size: 240.47 KB