Acta Marisiensis.
Seria Technologica



ISSN 2668-4217
ISSN-L 2668-4217
(Online)


Română

HomeEditorial boardSubmit paperPublication ethicsContactIndexing
Year 2023
Volume 20 (XXXVII), no 1
Volume 20 (XXXVII), no 2

Year 2022
Volume 19 (XXXVI), no 1
Volume 19 (XXXVI), no 2

Year 2021
Volume 18 (XXXV), no 1
Volume 18 (XXXV), no 2

Year 2020
Volume 17 (XXXIV), no 1
Volume 17 (XXXIV), no 2

Year 2019
Volume 16 (XXXIII), no 1
Volume 16 (XXXIII), no 2

Year 2018
Volume 15 (XXXII), no 1
Volume 15 (XXXII), no 2

Year 2017
Volume 14 (XXXI), no 1
Volume 14 (XXXI), no 2

Year 2016
Volume 13 (XXX), no 1
Volume 13 (XXX), no 2

Year 2015
Volume 12 (XXIX), no 1
Volume 12 (XXIX), no 2

Year 2014
Volume 11 (XXVIII), no 1
Volume 11 (XXVIII), no 2

Year 2013
Volume 10 (XXVII), no 1
Volume 10 (XXVII), no 2

Year 2012
Volume 9 (XXVI), no 1
Volume 9 (XXVI), no 2

Year 2011
Volume 8 (XXV), no 1
Volume 8 (XXV), no 2

Year 2010
Volume 7 (XXIV), no 1
Volume 7 (XXIV), no 2

Year 2009
Volume 6 (XXIII)

2023, Volume 20 (XXXVII), no 1

Efficient Algorithms for Patterns Identification in Medical Data

Author(s):
Avram CALIN, Adrian GLIGOR, Victoria NYLAS, George Emil Palade University of Medicine, Pharmacy, Science and Technology of Targu Mures, ROMANIA
Roman DUMITRU, Sintef, Forskningsveien, Norway

Abstract:
Recently, medical databases have expanded rapidly, and the amount of information is huge. This abundance of data appears as a consequence of the new technologies that have been developed in the medical field and that allow easy data collection. The performance of the technique depends on the input data and available resources. Whereas, in Eclat the repeated scanning of the database is eliminated and consumes less time and we can conclude that Eclat is better than Apriori and Fpgrowth. If we refer to the execution time and memory usage, then the FP-Growth algorithm is more efficient than the Eclat algorithm or the Apriori algorithm. If we consider factor other than time, the result may vary from one factor to another.

DOI: https://doi.org/10.2478/amset-2023-0006

Pages: 32-36

View full article
Update: 21-Mar-2024 © Published by University Press