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 A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, June 24, 2004, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Takeaki Uno (National Institute of Informatics (NII)

Efficient Maximal Clique Enumeration and its Application to Frequent Set Mining Problem

We address the problems of enumerating maximal cliques in a given graph and maximal bipartite cliques in a bipartite graph. The problem of enumerating maximal cliques in G=(V,E) can be solved in output polynomial time, O(|V|||E|) time for each. We propose two algorithms, which run in O(M(n)) time and O(\Delta4) for each, where M(n) denotes the time for multiply two n-by-n matrices, and \Delta is the maximal degree of G. The enumeration of maximal bipartite clique has an application for a problem of data mining, that is, frequent itemset mining problems. We implemented our algorithm with some practical improvements, and submitted to a data mining programming competition. Our algorithms performed well not all but many instances.

(Joint work with Kazuhisa Makino, Hiroaki Arimura, Yazo Uchida and Tatsuya Asai)

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

Previous talks by year:   2024  2023  2022  2021  2020  2019  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