Branch-and-bound technique for solving optimal clustering

被引：0

作者：

Fränti, P ^{[1
]}

Virmajoki, O ^{[1
]}

Kaukoranta, T ^{[1
]}

机构：

[1] Univ Joensuu, Dept Comp Sci, FIN-80101 Joensuu, Finland

来源：

16TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOL II, PROCEEDINGS | 2002年

关键词：

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The problem of finding optimal clustering has not been well covered in literature. Solutions can be found only for special cases, which can be solved in polvnomial time. In this paper, we give solution for the general case. The method generates all possible clusterings by a series of merge steps. The clusterings are organized as a minimum redundancy search tree and the optimal clustering is found by a branch-and-bound technique. The result has theoretical interest and could also provide new insight to the problem itself.

引用

页码：232 / 235

页数：4

共 50 条

[41] A novel branch-and-bound algorithm for solving linear multiplicative programming problems [J].

Hu, Peng ;

Gu, Hengyang ;

Wang, Bowen .

OPTIMAL CONTROL APPLICATIONS & METHODS, 2024, 45 (06) :2636-2650

[42] A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs [J].

Linderoth, J .

MATHEMATICAL PROGRAMMING, 2005, 103 (02) :251-282

[43] RELIABILITY OPTIMIZATION WITH THE LAGRANGE-MULTIPLIER AND BRANCH-AND-BOUND TECHNIQUE [J].

KUO, W ;

LIN, HH ;

XU, ZK ;

ZHANG, WX .

IEEE TRANSACTIONS ON RELIABILITY, 1987, 36 (05) :624-630

[44] Applying branch-and-bound technique to route choice set generation [J].

Prato, Carlo Giacomo ;

Bekhor, Shlomo .

TRAVELER BEHAVIOR AND VALUES 2006, 2006, (1985) :19-28

[45] Multi-stage Branch-and-Bound for Maximum Variance Disparity Clustering [J].

Thakoor, Ninad ;

Devarajan, Venkat ;

Gao, Jean .

19TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOLS 1-6, 2008, :2344-2347

[46] Branch-and-bound task allocation with task clustering-based pruning [J].

Ma, YC ;

Chen, TF ;

Chung, CP .

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2004, 64 (11) :1223-1240

[47] Branch-and-bound algorithms on a hypercube [J].

Pargas, R.P. ;

Wooster, D.E. .

Conference on Hypercube Concurrent Computers and Applications, 1988,

[48] PROBLEMS UNSOLVABLE BY BRANCH-AND-BOUND [J].

JEROSLOW, RG .

NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1973, 20 (04) :A440-A441

[49] Compressing Branch-and-Bound Trees [J].

Munoz, Gonzalo ;

Paat, Joseph ;

Xavier, Alinson S. .

INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2023, 2023, 13904 :348-362

[50] AND/OR Branch-and-Bound for Graphical Models [J].

Marinescu, Radu ;

Dechter, Rina .

19TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-05), 2005, :224-229

← 1 2 3 4 5 →