Search Results - "Lung, Rodica Ioana"
-
1
A new clustering method based on multipartite networks
Published in PeerJ. Computer science (13-10-2023)“…The clustering problem is one of the most studied and challenging in machine learning, as it attempts to identify similarities within data without any prior…”
Get full text
Journal Article -
2
A game-theoretic model for the classification of selected oil companies' price changes
Published in PeerJ. Computer science (25-01-2023)“…One of the essential properties of a machine learning model is to be able to capture nuanced connections within data. This ability can be enhanced by…”
Get full text
Journal Article -
3
Approximation of Nash equilibria and the network community structure detection problem
Published in PloS one (03-05-2017)“…Game theory based methods designed to solve the problem of community structure detection in complex networks have emerged in recent years as an alternative to…”
Get full text
Journal Article -
4
A game theoretic decision forest for feature selection and classification
Published in Logic journal of the IGPL (14-05-2024)“…Classification and feature selection are two of the most intertwined problems in machine learning. Decision trees (DTs) are straightforward models that address…”
Get full text
Journal Article -
5
A hypergraph model for representing scientific output
Published in Scientometrics (01-12-2018)“…Representation and analysis of publication data in the form of a network has become a common method of illustrating and evaluating the scientific output of a…”
Get full text
Journal Article -
6
A Pseudo-Deterministic Noisy Extremal Optimization algorithm for the pairwise connectivity Critical Node Detection Problem
Published in Logic journal of the IGPL (20-05-2024)“…The critical node detection problem is a central task in computational graph theory due to its large applicability, consisting in deleting $k$ nodes to…”
Get full text
Journal Article -
7
Game theory and extremal optimization for community detection in complex dynamic networks
Published in PloS one (26-02-2014)“…The detection of evolving communities in dynamic complex networks is a challenging problem that recently received attention from the research community…”
Get full text
Journal Article -
8
Characterization and Detection of ϵ-Berge-Zhukovskii Equilibria
Published in PloS one (15-07-2015)“…The Berge-Zhukovskii equilibrium is an alternate solution concept in non-cooperative game theory that formalizes cooperation in a noncooperative setting. In…”
Get full text
Journal Article -
9
Identification of influential nodes with Shapley Influence Maximization Extremal Optimization algorithm
Published in Applied soft computing (01-10-2023)Get full text
Journal Article -
10
A new network model for the study of scientific collaborations: Romanian computer science and mathematics co-authorship networks
Published in Scientometrics (01-08-2016)“…Co-authorship networks have been used to study collaboration patterns in various fields, evaluate researchers and recommend policies. In their simplest form…”
Get full text
Journal Article -
11
Evolutionary swarm cooperative optimization in dynamic environments
Published in Natural computing (01-03-2010)“…A hybrid approach called Evolutionary Swarm Cooperative Algorithm (ESCA) based on the collaboration between a particle swarm optimization algorithm and an…”
Get full text
Journal Article -
12
Pareto-based evolutionary multiobjective approaches and the generalized Nash equilibrium problem
Published in Journal of heuristics (01-08-2020)“…Pareto-based evolutionary multiobjective approaches are methods that use the Pareto dominance concept to guide the search of evolutionary algorithms towards…”
Get full text
Journal Article -
13
Noisy extremal optimization
Published in Soft computing (Berlin, Germany) (01-03-2017)“…Noisy extremal optimization is a new optimization-based heuristic designed to identify the community structure of complex networks by maximizing the modularity…”
Get full text
Journal Article -
14
Direct Evolutionary Search for Nash Equilibria Detection
Published in International journal of computers, communications & control (01-08-2016)“…A Direct method of computing mixed form Nash equilibria of a normal form game by using a simple evolutionary algorithm is proposed. The Direct Evolutionary…”
Get full text
Journal Article -
15
A collaborative model for tracking optima in dynamic environments
Published in 2007 IEEE Congress on Evolutionary Computation (01-09-2007)“…A new hybrid approach to optimization in dynamic environments called collaborative evolutionary-swarm optimization (CESO) is presented. CESO is a simple method…”
Get full text
Conference Proceeding -
16
A new evolutionary approach to minimax problems
Published in 2011 IEEE Congress of Evolutionary Computation (CEC) (01-06-2011)“…Minimax or worst-case optimization is concerned with the minimization of the maximum output in all scenarios of a given problem. The minimax problem can be…”
Get full text
Conference Proceeding -
17
Detecting Strong Berge Pareto equilibrium in a non-cooperative game using an evolutionary approach
Published in 2011 6th IEEE International Symposium on Applied Computational Intelligence and Informatics (SACI) (01-05-2011)“…Nash equilibrium is an important solving concept in Game Theory. Playing in Nash sense means that no player (agent) wants to deviate from the equilibrium…”
Get full text
Conference Proceeding -
18
A Nash Equilibrium Approach based on Differential Evolution to Probit Classification
Published in 2021 IEEE AFRICON (13-09-2021)“…The possibility of enhancing the performance of the Probit classification model by adding a game theoretic flavour to the model parameters is explored in this…”
Get full text
Conference Proceeding -
19
Guest editorial: special issue on nature inspired cooperative strategies for optimization
Published in Memetic computing (01-12-2012)Get full text
Journal Article -
20
A Game Theoretic Based K-Nearest Neighbor Approach for Binary Classification
Published in 2023 IEEE Symposium Series on Computational Intelligence (SSCI) (05-12-2023)“…K-nearest neighbor is one of the simplest and most intuitive binary classification methods providing robust results on a wide range of data. However,…”
Get full text
Conference Proceeding