From clustering to algorithms
author: Riccardo Zecchina,
Department of Applied Science and Technology (DISAT), Politecnico di Torino
published: Feb. 25, 2007, recorded: January 2005, views: 4626
published: Feb. 25, 2007, recorded: January 2005, views: 4626
Related content
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Description
In this talk we firstly provide a rigorous probabilistic proof of the clustering phenomenon taking place in the space of solution of random combinatorial problems. Secondly we will discuss a generalization of the survey propagation equations efficiently exploring the clustered geometry. Finally, we discuss the computational consequences of the possibility of finding single clusters by describing a \"physical\" lossy compression scheme. Performance are optimized when the number of well separated clusters is maximal in the underlying physical model.
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !
Write your own review or comment: