{"title":"发现P2P网络上的频繁项集","authors":"Wei Song, Lei Gao, Junshan Wang, Jinhong Li","doi":"10.1109/ICICIS.2011.104","DOIUrl":null,"url":null,"abstract":"Mining frequent item sets over P2P network is a challenging problem. The obstacles mainly lie in numerous frequent item sets and huge communication cost. To solve the two problems, a maximal item set mining algorithm P2PMaxSet is proposed. Firstly, only maximal item set is considered, which reduces the number of item sets greatly. Secondly, mining results are only interchanged between neighbor nodes, which save communication cost. Finally, adjust strategies are discussed for dynamic environment. Experimental results show P2PMaxSet is not only accurate but also with lower communication cost.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Discovering Frequent Itemsets over P2P Network\",\"authors\":\"Wei Song, Lei Gao, Junshan Wang, Jinhong Li\",\"doi\":\"10.1109/ICICIS.2011.104\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mining frequent item sets over P2P network is a challenging problem. The obstacles mainly lie in numerous frequent item sets and huge communication cost. To solve the two problems, a maximal item set mining algorithm P2PMaxSet is proposed. Firstly, only maximal item set is considered, which reduces the number of item sets greatly. Secondly, mining results are only interchanged between neighbor nodes, which save communication cost. Finally, adjust strategies are discussed for dynamic environment. Experimental results show P2PMaxSet is not only accurate but also with lower communication cost.\",\"PeriodicalId\":255291,\"journal\":{\"name\":\"2011 International Conference on Internet Computing and Information Services\",\"volume\":\"49 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-09-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Internet Computing and Information Services\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICICIS.2011.104\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Internet Computing and Information Services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICIS.2011.104","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Mining frequent item sets over P2P network is a challenging problem. The obstacles mainly lie in numerous frequent item sets and huge communication cost. To solve the two problems, a maximal item set mining algorithm P2PMaxSet is proposed. Firstly, only maximal item set is considered, which reduces the number of item sets greatly. Secondly, mining results are only interchanged between neighbor nodes, which save communication cost. Finally, adjust strategies are discussed for dynamic environment. Experimental results show P2PMaxSet is not only accurate but also with lower communication cost.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
