Search results for "FIMI"

Hits ?▲	Authors	Title	Venue	Year	Link
1	Roberto J. Bayardo Jr., Bart Goethals, Mohammed Javeed Zaki (eds.)	FIMI '04, Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, Brighton, UK, November 1, 2004	FIMI	2005	DBLP BibTeX RDF
1	Yudho Giri Sucahyo, Raj P. Gopalan	CT-PRO: A Bottom-Up Non Recursive Frequent Itemset Mining Algorithm Using Compressed FP-Tree Data Structure.	FIMI	2004	DBLP BibTeX RDF
1	Claudio Lucchese, Salvatore Orlando 0001, Raffaele Perego 0001	DCI Closed: A Fast and Memory Efficient Algorithm to Mine Frequent Closed Itemsets.	FIMI	2004	DBLP BibTeX RDF
1	Eray Özkural, Cevdet Aykanat	A Space Optimization for FP-Growth.	FIMI	2004	DBLP BibTeX RDF
1	Balázs Rácz	nonordfp: An FP-growth variation without rebuilding the FP-tree.	FIMI	2004	DBLP BibTeX RDF
1	Sagi Shporer	AIM2: Improved implementation of AIM.	FIMI	2004	DBLP BibTeX RDF
1	Christian Borgelt	Recursion Pruning for the Apriori Algorithm.	FIMI	2004	DBLP BibTeX RDF
1	Claudio Lucchese, Salvatore Orlando 0001, Raffaele Perego 0001	kDCI: on using direct count up to the third iteration.	FIMI	2004	DBLP BibTeX RDF
1	Jianfei Zhu, Gösta Grahne	Reducing the Main Memory Consumptions of FPmax* and FPclose.	FIMI	2004	DBLP BibTeX RDF
1	Lars Schmidt-Thieme	Algorithmic Features of Eclat.	FIMI	2004	DBLP BibTeX RDF
1	Claudio Lucchese, Salvatore Orlando 0001, Raffaele Perego 0001, Fabrizio Silvestri	WebDocs: a real-life huge transactional dataset.	FIMI	2004	DBLP BibTeX RDF
1	Ferenc Bodon	Surprising Results of Trie-based FIM Algorithms.	FIMI	2004	DBLP BibTeX RDF
1	Frédéric Flouvat, Fabien De Marchi, Jean-Marc Petit	ABS: Adaptive Borders Search of frequent itemsets.	FIMI	2004	DBLP BibTeX RDF
1	Takeaki Uno, Masashi Kiyomi, Hiroki Arimura	LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets	FIMI	2004	DBLP BibTeX RDF
1	Bart Goethals, Mohammed Javeed Zaki	Advances in Frequent Itemset Mining Implementations: Introduction to FIMI03.	FIMI	2003	DBLP BibTeX RDF
1	Vikram Pudi, Jayant R. Haritsa	ARMOR: Association Rule Mining based on ORacle.	FIMI	2003	DBLP BibTeX RDF
1	Ferenc Bodon	A fast APRIORI implementation.	FIMI	2003	DBLP BibTeX RDF
1	Gösta Grahne, Jianfei Zhu	Efficiently Using Prefix-trees in Mining Frequent Itemsets.	FIMI	2003	DBLP BibTeX RDF
1	Attila Gyenesei, Jukka Teuhola	Probabilistic Iterative Expansion of Candidates in Mining Frequent Itemsets.	FIMI	2003	DBLP BibTeX RDF
1	Guimei Liu, Hongjun Lu, Jeffrey Xu Yu, Wei Wang 0011, Xiangye Xiao	AFOPT: An Efficient Implementation of Pattern Growth Approach.	FIMI	2003	DBLP BibTeX RDF
1	Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Arimura	LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets.	FIMI	2003	DBLP BibTeX RDF
1	Taneli Mielikäinen	Intersecting data to closed sets with constraints.	FIMI	2003	DBLP BibTeX RDF
1	Andrea Pietracaprina, Dario Zandolin	Mining Frequent Itemsets using Patricia Tries.	FIMI	2003	DBLP BibTeX RDF
1	Bart Goethals, Mohammed Javeed Zaki (eds.)	FIMI '03, Frequent Itemset Mining Implementations, Proceedings of the ICDM 2003 Workshop on Frequent Itemset Mining Implementations, 19 December 2003, Melbourne, Florida, USA	FIMI	2003	DBLP BibTeX RDF
1	Salvatore Orlando 0001, Claudio Lucchese, Paolo Palmerini, Raffaele Perego 0001, Fabrizio Silvestri	kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets.	FIMI	2003	DBLP BibTeX RDF
1	Douglas Burdick, Manuel Calimlim, Jason Flannick, Johannes Gehrke, Tomi Yiu	MAFIA: A Performance Study of Mining Maximal Frequent Itemsets.	FIMI	2003	DBLP BibTeX RDF
1	Amos Fiat, Sagi Shporer	AIM: Another Itemset Miner.	FIMI	2003	DBLP BibTeX RDF
1	Walter A. Kosters, Wim Pijls	Apriori, A Depth First Implementation.	FIMI	2003	DBLP BibTeX RDF
1	Takeaki Uno, Ken Satoh	Detailed Description of an Algorithm for Enumeration of Maximal Frequent Sets with Irredundant Dualization.	FIMI	2003	DBLP BibTeX RDF
1	Osmar R. Zaïane, Mohammad El-Hajj	COFI-tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation.	FIMI	2003	DBLP BibTeX RDF

Publications at "FIMI"( http://dblp.L3S.de/Venues/FIMI )