Publikation: Widened KRIMP : Better Performance through Diverse Parallelism
Lade...
Dateien
Datum
2014
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
DOI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published
Erschienen in
BLOCKEEL, Hendrik, ed.. Advances in Intelligent Data Analysis XIII : 13th International Symposium, IDA 2014, Leuven, Belgium, October 30 – November 1, 2014 ; Proceedings. Cham: Springer, 2014, pp. 276-285. Lecture Notes in Computer Science. 8819. ISBN 978-3-319-12570-1. Available under: doi: 10.1007/978-3-319-12571-8_24
Zusammenfassung
We demonstrate that the previously introduced Widening framework is applicable to state-of-the-art Machine Learning algorithms. Using Krimp, an itemset mining algorithm, we show that parallelizing the search finds better solutions in nearly the same time as the original, sequential/greedy algorithm. We also introduce Reverse Standard Candidate Order (RSCO) as a candidate ordering heuristic for Krimp.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
KRIMP, Widening, Parallelization
Konferenz
13th International Symposium, IDA 2014, 30. Okt. 2014 - 1. Nov. 2014, Leuven, Belgium
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690
SAMPSON, Oliver R., Michael R. BERTHOLD, 2014. Widened KRIMP : Better Performance through Diverse Parallelism. 13th International Symposium, IDA 2014. Leuven, Belgium, 30. Okt. 2014 - 1. Nov. 2014. In: BLOCKEEL, Hendrik, ed.. Advances in Intelligent Data Analysis XIII : 13th International Symposium, IDA 2014, Leuven, Belgium, October 30 – November 1, 2014 ; Proceedings. Cham: Springer, 2014, pp. 276-285. Lecture Notes in Computer Science. 8819. ISBN 978-3-319-12570-1. Available under: doi: 10.1007/978-3-319-12571-8_24BibTex
@inproceedings{Sampson2014Widen-29811,
year={2014},
doi={10.1007/978-3-319-12571-8_24},
title={Widened KRIMP : Better Performance through Diverse Parallelism},
url={http://link.springer.com/chapter/10.1007%2F978-3-319-12571-8_24},
number={8819},
isbn={978-3-319-12570-1},
publisher={Springer},
address={Cham},
series={Lecture Notes in Computer Science},
booktitle={Advances in Intelligent Data Analysis XIII : 13th International Symposium, IDA 2014, Leuven, Belgium, October 30 – November 1, 2014 ; Proceedings},
pages={276--285},
editor={Blockeel, Hendrik},
author={Sampson, Oliver R. 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/29811">
<dc:language>eng</dc:language>
<dcterms:abstract xml:lang="eng">We demonstrate that the previously introduced Widening framework is applicable to state-of-the-art Machine Learning algorithms. Using Krimp, an itemset mining algorithm, we show that parallelizing the search finds better solutions in nearly the same time as the original, sequential/greedy algorithm. We also introduce Reverse Standard Candidate Order (RSCO) as a candidate ordering heuristic for Krimp.</dcterms:abstract>
<dc:rights>terms-of-use</dc:rights>
<dc:creator>Sampson, Oliver R.</dc:creator>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dcterms:issued>2014</dcterms:issued>
<bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/29811"/>
<dc:contributor>Sampson, Oliver R.</dc:contributor>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2015-02-10T11:02:36Z</dc:date>
<dc:creator>Berthold, Michael R.</dc:creator>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<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"/>
<dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
<dc:contributor>Berthold, Michael R.</dc:contributor>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2015-02-10T11:02:36Z</dcterms:available>
<dcterms:title>Widened KRIMP : Better Performance through Diverse Parallelism</dcterms:title>
<dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/29811/3/Sampson_0-260678.pdf"/>
<dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/29811/3/Sampson_0-260678.pdf"/>
</rdf:Description>
</rdf:RDF>Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
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
