{"title":"通过概率神经网络委员会机进行分布式隐私保护 P2P 数据挖掘","authors":"Y. Kokkinos, K. Margaritis","doi":"10.1109/IISA.2013.6623688","DOIUrl":null,"url":null,"abstract":"This work describes a probabilistic neural network (PNN) committee machine for Peer-to-Peer data mining. The pattern neurons of the PNN committee are composed of locally trained class-specialized regularization network Peer classifiers. The training takes into account the asynchronous distributed and privacy-preserving requirements that can be met in P2P systems. The Peer classifiers are first trained in parallel based on their local data. While no local data exchange is possible among them, the peers can exchange their classifiers in the form of binaries, or agents. Then an asynchronous distributed computing P2P cycle is executed to construct a mutual validation matrix. The train set of one Peer becomes the validation set of the other and only average rates are returned back. From this matrix we demonstrate that it is possible to perform weight based ensemble selection of best peer members for every class and in this way to find class-specialized Peer modules for the committee machine.","PeriodicalId":261368,"journal":{"name":"IISA 2013","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Distributed privacy-preserving P2P data mining via probabilistic neural network committee machines\",\"authors\":\"Y. Kokkinos, K. Margaritis\",\"doi\":\"10.1109/IISA.2013.6623688\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This work describes a probabilistic neural network (PNN) committee machine for Peer-to-Peer data mining. The pattern neurons of the PNN committee are composed of locally trained class-specialized regularization network Peer classifiers. The training takes into account the asynchronous distributed and privacy-preserving requirements that can be met in P2P systems. The Peer classifiers are first trained in parallel based on their local data. While no local data exchange is possible among them, the peers can exchange their classifiers in the form of binaries, or agents. Then an asynchronous distributed computing P2P cycle is executed to construct a mutual validation matrix. The train set of one Peer becomes the validation set of the other and only average rates are returned back. From this matrix we demonstrate that it is possible to perform weight based ensemble selection of best peer members for every class and in this way to find class-specialized Peer modules for the committee machine.\",\"PeriodicalId\":261368,\"journal\":{\"name\":\"IISA 2013\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IISA 2013\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IISA.2013.6623688\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IISA 2013","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IISA.2013.6623688","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Distributed privacy-preserving P2P data mining via probabilistic neural network committee machines
This work describes a probabilistic neural network (PNN) committee machine for Peer-to-Peer data mining. The pattern neurons of the PNN committee are composed of locally trained class-specialized regularization network Peer classifiers. The training takes into account the asynchronous distributed and privacy-preserving requirements that can be met in P2P systems. The Peer classifiers are first trained in parallel based on their local data. While no local data exchange is possible among them, the peers can exchange their classifiers in the form of binaries, or agents. Then an asynchronous distributed computing P2P cycle is executed to construct a mutual validation matrix. The train set of one Peer becomes the validation set of the other and only average rates are returned back. From this matrix we demonstrate that it is possible to perform weight based ensemble selection of best peer members for every class and in this way to find class-specialized Peer modules for the committee machine.