Andrejaana  Andova Andova

Ms. Andrejaana Andova Andova


Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 March 2019 in Non-Coding RNA
Verified
Journal Article
Open access
PDF file
CGClarissa Gomes
Clarissa Gomes
BABence Agg
Bence Agg
AAAndrejaana Andova Andova
Andrejaana Andova Andova
SASerdal Arslan
Serdal Arslan
Andy BakerAndy Baker
Andy Baker
Yvan DevauxYvan Devaux
Yvan Devaux
Cardiovascular disease (CVD) remains the leading cause of death worldwide and, despite continuous advances, better diagnostic and prognostic tools, as well as therapy, are needed. The human transcriptome, which is the set of all RNA produced in a cell, is much more complex than previously thought and the lack of dialogue between researchers and industrials and consensus on guidelines to generate data make it harder to compare and reproduce results. This European Cooperation in Science and Technology (COST) Action aims to accelerate the understanding of transcriptomics in CVD and further the translation of experimental data into usable applications to improve personalized medicine in this field by creating an interdisciplinary network. It aims to provide opportunities for collaboration between stakeholders from complementary backgrounds, allowing the functions of different RNAs and their interactions to be more rapidly deciphered in the cardiovascular context for translation into the clinic, thus fostering personalized medicine and meeting a current public health challenge. Thus, this Action will advance studies on cardiovascular transcriptomics, generate innovative projects, and consolidate the leadership of European research groups in the field. COST (European Cooperation in Science and Technology) is a funding organization for research and innovation networks (www.cost.eu).

10 May 2022 in Sensors
Verified
Journal Article
Open access
PDF file
SKStefan Kalabakov
Stefan Kalabakov
SSSimon Stankoski
Simon Stankoski
IKIvana Kiprijanovska
Ivana Kiprijanovska
AAAndrejaana Andova Andova
Andrejaana Andova Andova
Nina ReščičNina Reščič
Nina Reščič
Mitja LuštrekMitja Luštrek
Mitja Luštrek
From 2018 to 2021, the Sussex-Huawei Locomotion-Transportation Recognition Challenge presented different scenarios in which participants were tasked with recognizing eight different modes of locomotion and transportation using sensor data from smartphones. In 2019, the main challenge was using sensor data from one location to recognize activities with sensors in another location, while in the following year, the main challenge was using the sensor data of one person to recognize the activities of other persons. We use these two challenge scenarios as a framework in which to analyze the effectiveness of different components of a machine-learning pipeline for activity recognition. We show that: (i) selecting an appropriate (location-specific) portion of the available data for training can improve the F1 score by up to 10 percentage points (p. p.) compared to a more naive approach, (ii) separate models for human locomotion and for transportation in vehicles can yield an increase of roughly 1 p. p., (iii) using semi-supervised learning can, again, yield an increase of roughly 1 p. p., and (iv) temporal smoothing of predictions with Hidden Markov models, when applicable, can bring an improvement of almost 10 p. p. Our experiments also indicate that the usefulness of advanced feature selection techniques and clustering to create person-specific models is inconclusive and should be explored separately in each use-case.


7 December 2025 in Swarm and Evolutionary Computation
Verified
Journal Article
Open access
AAAndrejaana Andova Andova
Andrejaana Andova Andova
JCJordan N. Cork
Jordan N. Cork
TTTea Tušar
Tea Tušar
BFBogdan Filipič
Bogdan Filipič

14 July 2024
Verified
Conference Paper
Open access
AAAndrejaana Andova Andova
Andrejaana Andova Andova
JCJordan N. Cork
Jordan N. Cork
TTTea Tušar
Tea Tušar
BFBogdan Filipič
Bogdan Filipič
A research problem studied extensively in recent years is the prediction of optimization algorithm performance. A common approach is using the landscape features of optimization problems to train machine learning models. These models are then used to predict algorithm performance. Due to the small number of constrained multiobjective optimization problems (CMOPs) available for benchmarking, training a machine learning model to predict algorithm performance is a hard task. To address this issue, this study uses the functions from the bbob and bbob-constrained benchmark problems to generate new CMOPs. These are then used as additional training examples for the machine learning models. Given the large number of generated CMOPs, the experiments in this study are limited to those with two objectives and two variables. The obtained results are promising. Using additional problems in the training phase improves the predictions in half of the defined classification tasks.