{"title":"基于树形结构的最新知识挖掘","authors":"Chun-Wei Lin, T. Hong, Wen-Hsiang Lu","doi":"10.1109/SoCPaR.2009.36","DOIUrl":null,"url":null,"abstract":"In the past, the up-to-date patterns is proposed to mine the frequent itemsets within its corresponding lifetime. This hybrid method is based on the Apriori-like approach, which requests high computational cost and memory requirement. In this paper, the up-to-date pattern tree (UDP tree) is proposed to keep the up-to-date patterns in a tree structure. The experimental results show that the proposed approach has a better performance than the level-wise up-to-date algorithm.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"317 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Mining Up-to-Date Knowledge Based on Tree Structures\",\"authors\":\"Chun-Wei Lin, T. Hong, Wen-Hsiang Lu\",\"doi\":\"10.1109/SoCPaR.2009.36\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the past, the up-to-date patterns is proposed to mine the frequent itemsets within its corresponding lifetime. This hybrid method is based on the Apriori-like approach, which requests high computational cost and memory requirement. In this paper, the up-to-date pattern tree (UDP tree) is proposed to keep the up-to-date patterns in a tree structure. The experimental results show that the proposed approach has a better performance than the level-wise up-to-date algorithm.\",\"PeriodicalId\":284743,\"journal\":{\"name\":\"2009 International Conference of Soft Computing and Pattern Recognition\",\"volume\":\"317 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-12-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference of Soft Computing and Pattern Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SoCPaR.2009.36\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference of Soft Computing and Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SoCPaR.2009.36","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Mining Up-to-Date Knowledge Based on Tree Structures
In the past, the up-to-date patterns is proposed to mine the frequent itemsets within its corresponding lifetime. This hybrid method is based on the Apriori-like approach, which requests high computational cost and memory requirement. In this paper, the up-to-date pattern tree (UDP tree) is proposed to keep the up-to-date patterns in a tree structure. The experimental results show that the proposed approach has a better performance than the level-wise up-to-date algorithm.