Noising methods for a clique partitioning problem

详细信息    查看全文

• 作者：Irè ; ne Charon and Olivier Hudry
• 关键词：Noising methods ; Metaheuristics ; Simulated annealing ; Threshold accepting algorithms ; Clique partitioning of a weighted graph ; Aggregation of relations ; Classification ; Clustering ; Ré ; gnier's problem ; Zahn's problem
• 刊名：Discrete Applied Mathematics
• 出版年：2006
• 出版时间：1 April 2006
• 年：2006
• 卷：154
• 期：5
• 页码：754-769
• 全文大小：254 K

文摘

This paper deals with the application of noising methods to a clique partitioning problem for a weighted graph. The aim is to study different ways to add noise to the data, and to show that the choice of the noise-adding-scheme may have some impact on the performance of these methods. Among the noise-adding-schemes described here, two of them are totally new, leading to the “forgotten vertices” and to the “forgotten edges” methods. We also experimentally study a generic noising method that automatically tunes its parameters. For each noise-adding-scheme, we compare a variant which inserts descents and a variant which does not.