Publikation:

Crossover Operators for Multiobjective k-Subset Selection

Lade...
Vorschaubild

Dateien

meinl_crossover.pdf
meinl_crossover.pdfGröße: 254.7 KBDownloads: 494

Datum

2009

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

ArXiv-ID

Internationale Patentnummer

Angaben zur Forschungsförderung

Projekt

Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published

Erschienen in

Proceedings of the 11th Annual conference on Genetic and evolutionary computation - GECCO '09. New York, New York, USA: ACM Press, 2009, pp. 1809-1810. ISBN 978-1-60558-325-9. Available under: doi: 10.1145/1569901.1570173

Zusammenfassung

Genetic algorithms are often applied to combinatorial optimization problems, the most popular one probably being the traveling salesperson problem. In contrast to permutations used for TSP, the selection of a subset from a larger set has so far gained surprisingly little interest. One intriguing example of this type of problems occurs in diversity selection for virtual high throughput screening, where k molecules need to be selected from a set of n while optimizing certain constraints. In this paper we present a novel representation for k-subsets and several genetic operators for it.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

genetic algorithm, subset, operators

Konferenz

The 11th Annual conference on Genetic and evolutionary computation - GECCO '09, 8. Juli 2009 - 12. Juli 2009, Montreal, Québec, Canada
Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690MEINL, Thorsten, Michael R. BERTHOLD, 2009. Crossover Operators for Multiobjective k-Subset Selection. The 11th Annual conference on Genetic and evolutionary computation - GECCO '09. Montreal, Québec, Canada, 8. Juli 2009 - 12. Juli 2009. In: Proceedings of the 11th Annual conference on Genetic and evolutionary computation - GECCO '09. New York, New York, USA: ACM Press, 2009, pp. 1809-1810. ISBN 978-1-60558-325-9. Available under: doi: 10.1145/1569901.1570173
BibTex
@inproceedings{Meinl2009Cross-5697,
  year={2009},
  doi={10.1145/1569901.1570173},
  title={Crossover Operators for Multiobjective k-Subset Selection},
  isbn={978-1-60558-325-9},
  publisher={ACM Press},
  address={New York, New York, USA},
  booktitle={Proceedings of the 11th Annual conference on Genetic and evolutionary computation - GECCO '09},
  pages={1809--1810},
  author={Meinl, Thorsten and Berthold, Michael R.}
}
RDF
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/5697">
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:59:26Z</dc:date>
    <dc:creator>Meinl, Thorsten</dc:creator>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:59:26Z</dcterms:available>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Meinl, Thorsten</dc:contributor>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5697"/>
    <dcterms:title>Crossover Operators for Multiobjective k-Subset Selection</dcterms:title>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-sa/2.0/"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:issued>2009</dcterms:issued>
    <dcterms:bibliographicCitation>First publ. in:  GECCO '09: Proceedings of the 11th Annual conference on Genetic and evolutionary computation, 2009, pp. 1809-1810</dcterms:bibliographicCitation>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5697/1/meinl_crossover.pdf"/>
    <dc:language>eng</dc:language>
    <dc:rights>Attribution-ShareAlike 2.0 Generic</dc:rights>
    <dc:format>application/pdf</dc:format>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5697/1/meinl_crossover.pdf"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:abstract xml:lang="eng">Genetic algorithms are often applied to combinatorial optimization problems, the most popular one probably being the traveling salesperson problem. In contrast to permutations used for TSP, the selection of a subset from a larger set has so far gained surprisingly little interest. One intriguing example of this type of problems occurs in diversity selection for virtual high throughput screening, where k molecules need to be selected from a set of n while optimizing certain constraints. In this paper we present a novel representation for k-subsets and several genetic operators for it.</dcterms:abstract>
    <dc:creator>Berthold, Michael R.</dc:creator>
    <dc:contributor>Berthold, Michael R.</dc:contributor>
  </rdf:Description>
</rdf:RDF>

Interner Vermerk

xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter

Kontakt
URL der Originalveröffentl.

Prüfdatum der URL

Prüfungsdatum der Dissertation

Finanzierungsart

Kommentar zur Publikation

Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Ja
Begutachtet
Diese Publikation teilen