메뉴 건너뛰기




Volumn , Issue , 2012, Pages 585-592

Linkage neighbors, optimal mixing and forced improvements in genetic algorithms

Author keywords

estimation of distribution algorithms; genetic algorithms; linkage learning; optimal mixing

Indexed keywords

BENCH-MARK PROBLEMS; BUILDING MODEL; COMBINATORIAL OPTIMIZATION PROBLEMS; ESTIMATION OF DISTRIBUTION ALGORITHMS; EXCELLENT PERFORMANCE; LATEST DEVELOPMENT; LEARNING APPROACH; LINKAGE INFORMATION; LINKAGE LEARNING; LT MODEL; MAX-CUT; MULTIPLE SCALE; MULTISCALES; OPTIMAL MIXING;

EID: 84864644098     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2330163.2330247     Document Type: Conference Paper
Times cited : (37)

References (15)
  • 1
    • 0011841137 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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
  • 9
    • 77954940445 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고
    • 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


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.