Asynchronous Peer-to-Peer Data Mining with Stochastic Gradient Descent
Autor: | Márk Jelasity, Istvan Hegedus, Róbert Ormándi |
---|---|
Rok vydání: | 2011 |
Předmět: |
Computer science
business.industry Distributed computing Online machine learning 020206 networking & telecommunications 02 engineering and technology computer.file_format Peer-to-peer computer.software_genre Random walk Machine learning Support vector machine Stochastic gradient descent Asynchronous communication 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Data mining Artificial intelligence Communication complexity business computer BitTorrent |
Zdroj: | Euro-Par 2011 Parallel Processing ISBN: 9783642233999 Euro-Par (1) |
DOI: | 10.1007/978-3-642-23400-2_49 |
Popis: | Fully distributed data mining algorithms build global models over large amounts of data distributed over a large number of peers in a network, without moving the data itself. In the area of peer-to-peer (P2P) networks, such algorithms have various applications in P2P social networking, and also in trackerless BitTorrent communities. The difficulty of the problem involves realizing good quality models with an affordable communication complexity, while assuming as little as possible about the communication model. Here we describe a conceptually simple, yet powerful generic approach for designing efficient, fully distributed, asynchronous, local algorithms for learning models of fully distributed data. The key idea is that many models perform a random walk over the network while being gradually adjusted to fit the data they encounter, using a stochastic gradient descent search. We demonstrate our approach by implementing the support vector machine (SVM) method and by experimentally evaluating its performance in various failure scenarios over different benchmark datasets. Our algorithm scheme can implement a wide range of machine learning methods in an extremely robust manner. |
Databáze: | OpenAIRE |
Externí odkaz: |