dc.contributor.author | Vinterbo, Staal | |
dc.contributor.author | Que, Jialan | |
dc.date.accessioned | 2019-04-15T09:32:50Z | |
dc.date.available | 2019-04-15T09:32:50Z | |
dc.date.created | 2019-01-19T10:56:34Z | |
dc.date.issued | 2018 | |
dc.identifier.issn | 1892-0713 | |
dc.identifier.uri | http://hdl.handle.net/11250/2594622 | |
dc.description.abstract | Count queries belong to a class of summary statistics routinely used in basket analysis, inventory tracking, and study cohort finding. In this article, we demonstrate how it is possible to use simple count queries for parallelizing sequential data mining algorithms. Specifically,
we parallelize a published algorithm for finding minimum sets of discriminating features and demonstrate that the parallel speedup is close to the expected optimum. | nb_NO |
dc.language.iso | eng | nb_NO |
dc.publisher | Norsk informatikkonferanse | nb_NO |
dc.title | Parallel Feature Selection Using Only Counts | nb_NO |
dc.type | Journal article | nb_NO |
dc.type | Peer reviewed | nb_NO |
dc.description.version | publishedVersion | nb_NO |
dc.source.journal | NIK: Norsk Informatikkonferanse | nb_NO |
dc.identifier.cristin | 1660802 | |
dc.description.localcode | Open Access. Artikler fra NIK publiseres digitalt gjennom Open Journal Systems. | nb_NO |
cristin.unitcode | 194,63,30,0 | |
cristin.unitname | Institutt for informasjonssikkerhet og kommunikasjonsteknologi | |
cristin.ispublished | true | |
cristin.fulltext | postprint | |
cristin.qualitycode | 1 | |