-
1
-
-
0011841137
-
Negative log-likelihood and statistical hypothesis testing as the basis of model selection in IDEAs
-
A. Feelders, editor, Tilburg, Tilburg University
-
P. A. N. Bosman and D. Thierens. Negative log-likelihood and statistical hypothesis testing as the basis of model selection in IDEAs. In A. Feelders, editor, Proceedings of the Tenth Belgium-Netherlands Conference on Machine Learning - BENELEARN 2000, pages 109-116, Tilburg, 2000. Tilburg University.
-
(2000)
Proceedings of the Tenth Belgium-Netherlands Conference on Machine Learning - BENELEARN 2000
, pp. 109-116
-
-
Bosman, P.A.N.1
Thierens, D.2
-
4
-
-
34548420071
-
Optimal implementations of UPGMA and other common clustering algorithms
-
I. Gronau and S. Moran. Optimal implementations of UPGMA and other common clustering algorithms. Information Processing Letters, 104(9):205-210, 2007.
-
(2007)
Information Processing Letters
, vol.104
, Issue.9
, pp. 205-210
-
-
Gronau, I.1
Moran, S.2
-
5
-
-
51849133416
-
Linkage learning via probabilistic modeling in the extended compact genetic algorithm (ECGA)
-
M. Pelikan et al., editors, Springer-Verlag, Berlin
-
G. R. Harik, F. G. Lobo, and K. Sastry. Linkage learning via probabilistic modeling in the extended compact genetic algorithm (ECGA). In M. Pelikan et al., editors, Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications, pages 39-61. Springer-Verlag, Berlin, 2006.
-
(2006)
Scalable Optimization Via Probabilistic Modeling: From Algorithms to Applications
, pp. 39-61
-
-
Harik, G.R.1
Lobo, F.G.2
Sastry, K.3
-
6
-
-
84860417120
-
Pairwise and problem-specific distance metrics in the linkage tree genetic algorithm
-
New York, New York, ACM Press
-
M. Pelikan, M. W. Hauschild, and D. Thierens. Pairwise and problem-specific distance metrics in the linkage tree genetic algorithm. In Proceedings of the Genetic and Evolutionary Computation Conference - GECCO-2011, pages 1005-1012, New York, New York, 2011. ACM Press.
-
(2011)
Proceedings of the Genetic and Evolutionary Computation Conference - GECCO-2011
, pp. 1005-1012
-
-
Pelikan, M.1
Hauschild, M.W.2
Thierens, D.3
-
7
-
-
72749108865
-
Performance of evolutionary algorithms on NK landscapes with nearest neighbor interactions and tunable overlap
-
New York, New York, ACM Press
-
M. Pelikan, K. Sastry, D. E. Goldberg, M. V. Butz, and M. Hauschild. Performance of evolutionary algorithms on NK landscapes with nearest neighbor interactions and tunable overlap. In Proceedings of the Genetic and Evolutionary Computation Conference - GECCO-2009, pages 851-858, New York, New York, 2009. ACM Press.
-
(2009)
Proceedings of the Genetic and Evolutionary Computation Conference - GECCO-2009
, pp. 851-858
-
-
Pelikan, M.1
Sastry, K.2
Goldberg, D.E.3
Butz, M.V.4
Hauschild, M.5
-
9
-
-
77954940445
-
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations
-
F. Rendl, G. Rinaldi, and A. Wiegele. Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations. Math. Programming, 121(2):307, 2010.
-
(2010)
Math. Programming
, vol.121
, Issue.2
, pp. 307
-
-
Rendl, F.1
Rinaldi, G.2
Wiegele, A.3
-
10
-
-
0012303220
-
Cross-entropy and rare events for maximal cut and partition problems
-
R. Y. Rubinstein. Cross-entropy and rare events for maximal cut and partition problems. ACM Transactions on Modeling and Computer Simulation, 12(1):27-53, 2002.
-
(2002)
ACM Transactions on Modeling and Computer Simulation
, vol.12
, Issue.1
, pp. 27-53
-
-
Rubinstein, R.Y.1
-
11
-
-
72749121071
-
Why one must use reweighting in estimation of distribution algorithms
-
G. Raidl et al., editors, New York, New York, ACM Press
-
F. Teytaud and O. Teytaud. Why one must use reweighting in estimation of distribution algorithms. In G. Raidl et al., editors, Proceedings of the Genetic and Evolutionary Computation Conference - GECCO-2009, pages 453-460, New York, New York, 2009. ACM Press.
-
(2009)
Proceedings of the Genetic and Evolutionary Computation Conference - GECCO-2009
, pp. 453-460
-
-
Teytaud, F.1
Teytaud, O.2
-
12
-
-
78149244967
-
The linkage tree genetic algorithm
-
Berlin, Springer-Verlag
-
D. Thierens. The linkage tree genetic algorithm. In Parallel Problem Solving from Nature - PPSN XI, pages 264-273, Berlin, 2010. Springer-Verlag.
-
(2010)
Parallel Problem Solving from Nature - PPSN XI
, pp. 264-273
-
-
Thierens, D.1
-
15
-
-
0001972601
-
The large-sample distribution of the likelihood ratio for testing composite hypotheses
-
S. S. Wilks. The large-sample distribution of the likelihood ratio for testing composite hypotheses. The Annals of Mathematical Statistics, 9:60-62, 1938.
-
(1938)
The Annals of Mathematical Statistics
, vol.9
, pp. 60-62
-
-
Wilks, S.S.1
|