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: Tuesday, September 20, 2005, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Volker Roth

Feature Selection in Unsupervised Clustering: Applications in Computer Vision and Bioinformatics

In supervised learning scenarios, feature selection has been studied widely in the literature. Selecting features in unsupervised partitioning scenarios, however, is a much harder problem, due to the absence of class labels that would guide the search for relevant information. Most approaches to this combined partitioning and extraction problem suffer both from conceptual shortcomings and ambiguous solutions. In this work I propose to overcome these problems by combining a Gaussian mixture model with a Bayesian relevance determination principle. This interleaved handling of clustering and feature selection makes it possible to formulate both aspects as a joint optimization problem that involves only one single objective function. Applications in the fields of Computer Vision and Bioinformatics show that the proposed approach is capable of simultaneously finding meaningful partitions and extracting relevant features or influence factors.

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