Fast SDP relaxations of graph cut clustering, transduction, and other combinatorial problems

Tijl De Bie, Nello Cristianini
Fast SDP relaxations of graph cut clustering, transduction, and other combinatorial problems
Journal of Machine Learning Research, 7(Jul):1409-1436, 2006.

pdf

By tijldebie at 07/24/2009 - 09:28

News

Multiple vacancies (fully funded PhD studentships and postdoc positions)
Vacancy: postdoc position on ERC & Odysseus projects
ERC Consolidator Grant FORSIED
Eirini Spyropoulou wins Carl H. Smith award for her paper at Discovery Science 2013

Projects

Statistical foundations of data mining
Music information retrieval
Machine learning
Bioinformatics
Web and text mining

Selected Publications

Informative Data Projections: A Framework and Two Examples
Subjective interestingness of subgraph patterns
P-N-RMiner: A Generic Framework for Mining Interesting Structured Relational Patterns
Subjectively interesting alternative clusterings
Interesting pattern mining in multi-relational data
Automatic Chord Estimation from Audio: a Review of the State of the Art
Understanding effects of subjectivity in measuring chord estimation accuracy
Knowledge discovery interestingness measures based on unexpectedness
CCA and Multi-way Extension for Investigating Common Components Between Audio, Lyrics and Tags
An end-to-end machine learning system for harmonic analysis of music
An Information Theoretic Framework for Data Mining

Research homepage - Tijl De Bie

Fast SDP relaxations of graph cut clustering, transduction, and other combinatorial problems

News

Projects

Selected Publications