Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, July 06, 2004, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Julian Lorenz

Concise Representations for Frequent Itemsets

Many data mining problems require the discovery of frequent itemsets in a dataset of transactions. Since the number of frequent itemsets is usually huge, a lot of work has been focused on concise representations. In this talk, we will deal with concise representations based on closed itemsets and key itemsets, and how both can naturally be combined to a representation giving a flexible plateau-like decomposition of the space of frequent itemsets. We will also discuss how to efficiently mine the representations from a dataset of transactions.


Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks


Automatic MiSe System Software Version 1.4803M   |   admin login