{"title":"基于bsp的支持向量回归机并行框架","authors":"Hong Zhang, Yong-mei Lei","doi":"10.1109/ICIS.2013.6607862","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a BSP-Based Support Vector Regression Machine Parallel Framework which can implement the most of distributed Support Vector Regression Machine algorithms. The major difference in these algorithms is the network topology among distributed nodes. Therefore, we adopt the Bulk Synchronous Parallel model to solve the strongly connected graph problem in exchanging support vectors among distributed nodes. Besides, we introduce the dynamic algorithms that it can change the strongly connected graph among SVR distributed nodes in every BSP's super-step. The performance of this framework has been analyzed and evaluated with KDD99 data and four DPSVR algorithms with different topology on the high-performance computer. The results proved that the framework can implement the most of distributed SVR algorithms and keep the performance of original algorithm.","PeriodicalId":345020,"journal":{"name":"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)","volume":"219 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"BSP-based support vector regression machine parallel framework\",\"authors\":\"Hong Zhang, Yong-mei Lei\",\"doi\":\"10.1109/ICIS.2013.6607862\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a BSP-Based Support Vector Regression Machine Parallel Framework which can implement the most of distributed Support Vector Regression Machine algorithms. The major difference in these algorithms is the network topology among distributed nodes. Therefore, we adopt the Bulk Synchronous Parallel model to solve the strongly connected graph problem in exchanging support vectors among distributed nodes. Besides, we introduce the dynamic algorithms that it can change the strongly connected graph among SVR distributed nodes in every BSP's super-step. The performance of this framework has been analyzed and evaluated with KDD99 data and four DPSVR algorithms with different topology on the high-performance computer. The results proved that the framework can implement the most of distributed SVR algorithms and keep the performance of original algorithm.\",\"PeriodicalId\":345020,\"journal\":{\"name\":\"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)\",\"volume\":\"219 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-06-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIS.2013.6607862\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIS.2013.6607862","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
BSP-based support vector regression machine parallel framework
In this paper, we propose a BSP-Based Support Vector Regression Machine Parallel Framework which can implement the most of distributed Support Vector Regression Machine algorithms. The major difference in these algorithms is the network topology among distributed nodes. Therefore, we adopt the Bulk Synchronous Parallel model to solve the strongly connected graph problem in exchanging support vectors among distributed nodes. Besides, we introduce the dynamic algorithms that it can change the strongly connected graph among SVR distributed nodes in every BSP's super-step. The performance of this framework has been analyzed and evaluated with KDD99 data and four DPSVR algorithms with different topology on the high-performance computer. The results proved that the framework can implement the most of distributed SVR algorithms and keep the performance of original algorithm.