Παρακαλώ χρησιμοποιήστε αυτό το αναγνωριστικό για να παραπέμψετε ή να δημιουργήσετε σύνδεσμο προς αυτό το τεκμήριο:
https://ruomo.lib.uom.gr/handle/7000/1171
Πλήρης εγγραφή μεταδεδομένων
Πεδίο DC | Τιμή | Γλώσσα |
---|---|---|
dc.contributor.author | Ponos, Pavlos | - |
dc.contributor.author | Ougiaroglou, Stefanos | - |
dc.contributor.author | Evangelidis, Georgios | - |
dc.date.accessioned | 2022-08-26T07:55:53Z | - |
dc.date.available | 2022-08-26T07:55:53Z | - |
dc.date.issued | 2019-09-26 | - |
dc.identifier | 10.1145/3351556.3351584 | en_US |
dc.identifier.isbn | 9781450371933 | en_US |
dc.identifier.uri | https://doi.org/10.1145/3351556.3351584 | en_US |
dc.identifier.uri | https://ruomo.lib.uom.gr/handle/7000/1171 | - |
dc.description.abstract | In this paper, we investigate the effect of parallelism on two data reduction algorithms that use k-Means clustering in order to find homogeneous clusters in the training set. By homogeneous, we refer to clusters where all instances belong to the same class label. Our approach divides the training set into subsets and applies the data reduction algorithm on each separate subset in parallel. Then, the reduced subsets are merged back to the final reduced set. In our experimental study, we split the datasets into 8, 16, 32 and 64 subsets. The results obtained reveal that parallelism can achieve very low preprocessing costs. Also, when the number of subsets is high, in some datasets the accuracy of k-NN classification is almost equal (if not better) to the one achieved when using the standard execution of the reduction algorithms, with a small loss in the reduction rate. | en_US |
dc.language.iso | en | en_US |
dc.rights | Attribution-NonCommercial-ShareAlike 4.0 International | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | * |
dc.subject | FRASCATI::Natural sciences::Computer and information sciences | en_US |
dc.subject.other | k-NN Classification | en_US |
dc.subject.other | Data Reduction | en_US |
dc.subject.other | Prototype Merging | en_US |
dc.subject.other | Parallel Implementation | en_US |
dc.subject.other | Clustering | en_US |
dc.title | The Effect of Parallelism on Data Reduction | en_US |
dc.type | Conference Paper | en_US |
dc.contributor.department | Τμήμα Εφαρμοσμένης Πληροφορικής | en_US |
local.identifier.firstpage | 1 | en_US |
local.identifier.lastpage | 4 | en_US |
local.identifier.volumetitle | Proceedings of the 9th Balkan Conference on Informatics | en_US |
Εμφανίζεται στις Συλλογές: | Τμήμα Εφαρμοσμένης Πληροφορικής |
Αρχεία σε αυτό το Τεκμήριο:
Αρχείο | Περιγραφή | Μέγεθος | Μορφότυπος | |
---|---|---|---|---|
2019_BCI_POE.pdf | 594,39 kB | Adobe PDF | Προβολή/Ανοιγμα |
Αυτό το τεκμήριο προστατεύεται από Αδεια Creative Commons