{"title":"基于Weka-JUNG框架高层数据结构的FP-Growth算法实现","authors":"Shui Wang, Le Wang","doi":"10.4156/JCIT.VOL5.ISSUE9.30","DOIUrl":null,"url":null,"abstract":"FP-Growth is a classical data mining algorithm; most of its current implementations are based on programming language's primitive data types for their data structures; this leads to poor readability & reusability of the codes. Weka is an open source platform for data mining, but lacks of the ability in dealing with tree-structured data; JUNG is a network/graph computation framework. Starting from the analysis on Weka's foundation classes, builds a concise implementation for FP-Growth algorithm based on high level object-oriented data objects of the Weka-JUNG framework; comparison experiments against Weka's built-in Apriori implementation are carried out and its correctness is verified. This implementation has been published as an open source Google Code project.","PeriodicalId":360193,"journal":{"name":"J. Convergence Inf. Technol.","volume":"439 ","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"An Implementation of FP-Growth Algorithm Based on High Level Data Structures of Weka-JUNG Framework\",\"authors\":\"Shui Wang, Le Wang\",\"doi\":\"10.4156/JCIT.VOL5.ISSUE9.30\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"FP-Growth is a classical data mining algorithm; most of its current implementations are based on programming language's primitive data types for their data structures; this leads to poor readability & reusability of the codes. Weka is an open source platform for data mining, but lacks of the ability in dealing with tree-structured data; JUNG is a network/graph computation framework. Starting from the analysis on Weka's foundation classes, builds a concise implementation for FP-Growth algorithm based on high level object-oriented data objects of the Weka-JUNG framework; comparison experiments against Weka's built-in Apriori implementation are carried out and its correctness is verified. This implementation has been published as an open source Google Code project.\",\"PeriodicalId\":360193,\"journal\":{\"name\":\"J. Convergence Inf. Technol.\",\"volume\":\"439 \",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"J. Convergence Inf. Technol.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4156/JCIT.VOL5.ISSUE9.30\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"J. Convergence Inf. Technol.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4156/JCIT.VOL5.ISSUE9.30","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Implementation of FP-Growth Algorithm Based on High Level Data Structures of Weka-JUNG Framework
FP-Growth is a classical data mining algorithm; most of its current implementations are based on programming language's primitive data types for their data structures; this leads to poor readability & reusability of the codes. Weka is an open source platform for data mining, but lacks of the ability in dealing with tree-structured data; JUNG is a network/graph computation framework. Starting from the analysis on Weka's foundation classes, builds a concise implementation for FP-Growth algorithm based on high level object-oriented data objects of the Weka-JUNG framework; comparison experiments against Weka's built-in Apriori implementation are carried out and its correctness is verified. This implementation has been published as an open source Google Code project.