{"title":"使用频繁模式列表生成封闭频繁项集","authors":"Qin Li, Sheng Chang","doi":"10.1109/DBTA.2010.5658741","DOIUrl":null,"url":null,"abstract":"An approach is proposed to discover closed frequent itemsets with a simple linear list structure called the Frequent Pattern List(FPL) in transaction database. The approach selects representation patterns from candidate itemsets to reduce combinational space of frequent patterns. By performing two operations, signature vertex conjunction and vertex counting, it simplify the process of closed itemsets generation.","PeriodicalId":320509,"journal":{"name":"2010 2nd International Workshop on Database Technology and Applications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Generating Closed Frequent Itemsets with the Frequent Pattern List\",\"authors\":\"Qin Li, Sheng Chang\",\"doi\":\"10.1109/DBTA.2010.5658741\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An approach is proposed to discover closed frequent itemsets with a simple linear list structure called the Frequent Pattern List(FPL) in transaction database. The approach selects representation patterns from candidate itemsets to reduce combinational space of frequent patterns. By performing two operations, signature vertex conjunction and vertex counting, it simplify the process of closed itemsets generation.\",\"PeriodicalId\":320509,\"journal\":{\"name\":\"2010 2nd International Workshop on Database Technology and Applications\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 2nd International Workshop on Database Technology and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DBTA.2010.5658741\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 2nd International Workshop on Database Technology and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DBTA.2010.5658741","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Generating Closed Frequent Itemsets with the Frequent Pattern List
An approach is proposed to discover closed frequent itemsets with a simple linear list structure called the Frequent Pattern List(FPL) in transaction database. The approach selects representation patterns from candidate itemsets to reduce combinational space of frequent patterns. By performing two operations, signature vertex conjunction and vertex counting, it simplify the process of closed itemsets generation.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
