Skip to Main content Skip to Navigation
New interface
Conference papers

Efficient Vertical Mining of Frequent Closures and Generators

Abstract : The effective construction of many association rule bases requires the computation of both frequent closed and frequent generator itemsets (FCIs/FGs). However, only few miners address both concerns, typically by applying levelwise breadth-first traversal. As depth-first traversal is known to be superior, we examine here the depth-first FCI/FG-mining. The proposed algorithm, Touch, deals with both tasks separately, i.e., uses a well-known vertical method, Charm, to extract FCIs and a novel one, Talky-G, to extract FGs. The respective outputs are matched in a post-processing step. Experimental results indicate that Touch is highly efficient and outperforms its levelwise competitors.
Document type :
Conference papers
Complete list of metadata
Contributor : Laszlo Szathmary Connect in order to contact the contributor
Submitted on : Saturday, September 3, 2011 - 3:37:12 AM
Last modification on : Saturday, June 25, 2022 - 7:42:30 PM
Long-term archiving on: : Tuesday, November 13, 2012 - 9:50:50 AM


Files produced by the author(s)




Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, Robert Godin. Efficient Vertical Mining of Frequent Closures and Generators. 8th International Symposium on Intelligent Data Analysis - IDA 2009, Aug 2009, Lyon, France. pp.393--404, ⟨10.1007/978-3-642-03915-7_34⟩. ⟨inria-00618805⟩



Record views


Files downloads