Zobrazeno 1 - 10
of 73
pro vyhledávání: '"B. Parv"'
Autor:
A. Bareket, B. Parv
Publikováno v:
IEEE Access, Vol 12, Pp 84968-84983 (2024)
Predicting stock index movements is challenging due to market randomness. This paper addresses the problem of predicting medium-term stock index direction, an area with limited coverage in existing literature. We propose a novel model based on machin
Externí odkaz:
https://doaj.org/article/eb9ed9a03e5e4799a7a5a395b9dc84ff
Autor:
A. Bareket, B. Parv
Publikováno v:
IEEE Access, Vol 12, Pp 84306-84322 (2024)
This study stands out for its focus on medium-term stock market forecasting over a horizon of 70 trading days, approximately 3.5 months, targeting major indices such as NASDAQ100, Dow Jones, and DAX. Diverging from prevalent short-term, often next-da
Externí odkaz:
https://doaj.org/article/435a7ff299784118aac386fcfe24b813
Autor:
B. Parv, Camelia-Florina Andor
Publikováno v:
Studia Universitatis Babeș-Bolyai Informatica. 63:80-93
This paper describes an experimental study regarding NoSQL database performance. Two NoSQL databases were considered (MongoDB and Cassandra), two different workloads (update heavy and mostly read) and several degrees of parallelism. The results refer
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::661738dc0bf20bf2223902817e724de3
https://doi.org/10.24193/subbi.2018.1.06
https://doi.org/10.24193/subbi.2018.1.06
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
SYNASC
The Whale Optimization Algorithm (WOA) is a novel nature-inspired algorithm, being originally dedicated to continuous function optimization. This paper modifies it to address combinatorial, i.e. discrete function optimization; the new algorithm is ca
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2ea50694af0266173d8127de536bf90a
https://doi.org/10.1109/synasc49474.2019.00030
https://doi.org/10.1109/synasc49474.2019.00030
Autor:
B. Parv, Calin Eugen Nicolae Gal-Chis
Publikováno v:
CSCS
Smart Home systems control a multitude of automated devices and bring together different types of stakeholders. From software perspective, this rises architecture and design challenges, as different stakeholder viewpoints are sources of different req
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4c4f72d361121ad91462eb9d4ee60bf4
https://doi.org/10.1109/cscs.2019.00050
https://doi.org/10.1109/cscs.2019.00050
Publikováno v:
Advances in Data Analysis and Classification. 11:611-627
This paper presents a multi-objective retinal blood vessels localization approach based on flower pollination search algorithm (FPSA) and pattern search (PS) algorithm. FPSA is a new evolutionary algorithm based on the flower pollination process of f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cb2bc1bd14922b1916e9bafa9d01bec7
https://doi.org/10.1007/s11634-016-0257-7
https://doi.org/10.1007/s11634-016-0257-7
Publikováno v:
Examples and Counterexamples, Vol 3, Iss , Pp 100100- (2023)
The A-energy of a graph G, denoted by EA(G), is defined as sum of the absolute values of eigenvalues of adjacency matrix of G. Nikiforov in Nikiforov (2016) proved that EA(G¯)−EA(G)≤2μ¯1and EA(G)−EA(G¯)≤2μ1for any graph G and posed a pro
Externí odkaz:
https://doaj.org/article/df0b09eb725d42aebf49348155068c29
Publikováno v:
INISTA
In this work, a proposed hybrid dragonfly algorithm (DA) with extreme learning machine (ELM) system for prediction problem is presented. ELM model is considered a promising method for data regression and classification problems. It has fast training
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bae0a4e1f1598bbb7a9301a54a40068b
https://doi.org/10.1109/inista.2016.7571839
https://doi.org/10.1109/inista.2016.7571839