Mirjana Simic

Prof. Mirjana Simic

orcid

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
9 July 2020 in Entropy
Verified
Journal Article
Open access
PDF file
SKStefan Kostić
Stefan Kostić
MSMirjana Simic
Mirjana Simic
MKMiroljub Kostic
Miroljub Kostic
Due to telecommunications market saturation, it is very important for telco operators to always have fresh insights into their customer’s dynamics. In that regard, social network analytics and its application with graph theory can be very useful. In this paper we analyze a social network that is represented by a large telco network graph and perform clustering of its nodes by studying a broad set of metrics, e.g., node in/out degree, first and second order influence, eigenvector, authority and hub values. This paper demonstrates that it is possible to identify some important nodes in our social network (graph) that are vital regarding churn prediction. We show that if such a node leaves a monitored telco operator, customers that frequently interact with that specific node will be more prone to leave the monitored telco operator network as well; thus, by analyzing existing churn and previous call patterns, we proactively predict new customers that will probably churn. The churn prediction results are quantified by using top decile lift metrics. The proposed method is general enough to be readily adopted in any field where homophilic or friendship connections can be assumed as a potential churn driver.

4 January 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
MRMaja Božidar Rosić
Maja Božidar Rosić
MSMiloš Sedak
Miloš Sedak
MSMirjana Simic
Mirjana Simic
PPPredrag Pejović
Predrag Pejović
This paper addresses the problem of time difference of arrival (TDOA) based passive target localizationand proposes an improved chaos-driven hybrid differential evolution (DE) algorithm and butterfly optimization algorithm (BOA), named ICDEBOA, to solve this complex optimization problem. The proposed algorithm consists of a new mutation strategy with the mechanisms of the BOA algorithm incorporated into the DE algorithm. To boost optimization effectiveness, chaos theory is employed to adjust the control parameter values. The considered localization problem is formulated using the maximum likelihood estimator. To perform the accuracy comparison, the convex constrained weighting least squares algorithm is applied to the considered localization problem as the widely used method in literature. The statistical analysis shows that the proposed modifications to the ICDEBOA algorithm improve its optimization performance, as demonstrated by the improved performance on the CEC2014 benchmark problems. The ICDEBOA algorithm is also shown to be more robust than existing algorithms in noisy environments. Numerical simulation results show that the proposed ICDEBOA algorithm meets the CRLB and achieves better performance than the CWLS, DE, and BOA algorithms.

31 July 2022 in Sensors
Verified
Journal Article
Open access
PDF file
MRMaja Božidar Rosić
Maja Božidar Rosić
MSMiloš Sedak
Miloš Sedak
MSMirjana Simic
Mirjana Simic
PPPredrag Pejović
Predrag Pejović
This paper considers the problem of finding the position of a passive target using noisy time difference of arrival (TDOA) measurements, obtained from multiple transmitters and a single receiver. The maximum likelihood (ML) estimator’s objective function is extremely nonlinear and non-convex, making it impossible to use traditional optimization techniques. In this regard, this paper proposes the chaos-enhanced adaptive hybrid butterfly particle swarm optimization algorithm, named CAHBPSO, as the hybridization of butterfly optimization (BOA) and particle swarm optimization (PSO) algorithms, to estimate passive target position. In the proposed algorithm, an adaptive strategy is employed to update the sensory fragrance of BOA algorithm, and chaos theory is incorporated into the inertia weight of PSO algorithm. Furthermore, an adaptive switch probability is employed to combine global and local search phases of BOA with the PSO algorithm. Additionally, the semidefinite programming is employed to convert the considered problem into a convex one. The statistical comparison on CEC2014 benchmark problems shows that the proposed algorithm provides a better performance compared to well-known algorithms. The CAHBPSO method surpasses the BOA, PSO and semidefinite programming (SDP) algorithms for a broad spectrum of noise, according to simulation findings, and achieves the Cramer–Rao lower bound (CRLB).

27 February 2020 in Journal of Sensors
Verified
Journal Article
Open access
PDF file
MRMaja Božidar Rosić
Maja Božidar Rosić
MSMirjana Simic
Mirjana Simic
PPPredrag V. Pejović
Predrag V. Pejović
This paper considers a passive target localization problem in Wireless Sensor Networks (WSNs) using the noisy time of arrival (TOA) measurements, obtained from multiple receivers and a single transmitter. The objective function is formulated as a maximum likelihood (ML) estimation problem under the Gaussian noise assumption. Consequently, the objective function of the ML estimator is a highly nonlinear and nonconvex function, where conventional optimization methods are not suitable for this type of problem. Hence, an improved algorithm based on the hybridization of an adaptive differential evolution (ADE) and Nelder-Mead (NM) algorithms, named HADENM, is proposed to find the estimated position of a passive target. In this paper, the control parameters of the ADE algorithm are adaptively updated during the evolution process. In addition, an adaptive adjustment parameter is designed to provide a balance between the global exploration and the local exploitation abilities. Furthermore, the exploitation is strengthened using the NM method by improving the accuracy of the best solution obtained from the ADE algorithm. Statistical analysis has been conducted, to evaluate the benefits of the proposed modifications on the optimization performance of the HADENM algorithm. The comparison results between HADENM algorithm and its versions indicate that the modifications proposed in this paper can improve the overall optimization performance. Furthermore, the simulation shows that the proposed HADENM algorithm can attain the Cramer-Rao lower bound (CRLB) and outperforms the constrained weighted least squares (CWLS) and differential evolution (DE) algorithms. The obtained results demonstrate the high accuracy and robustness of the proposed algorithm for solving the passive target localization problem for a wide range of measurement noise levels.

16 March 2014 in The Scientific World Journal
Verified
Journal Article
Open access
PDF file
MBMilenko Brković
Milenko Brković
MSMirjana Simic
Mirjana Simic
Accurate indoor localization of mobile users is one of the challenging problems of the last decade. Besides delivering high speed Internet, Wireless Local Area Network (WLAN) can be used as an effective indoor positioning system, being competitive both in terms of accuracy and cost. Among the localization algorithms, nearest neighbor fingerprinting algorithms based on Received Signal Strength (RSS) parameter have been extensively studied as an inexpensive solution for delivering indoor Location Based Services (LBS). In this paper, we propose the optimization of the signal space distance parameters in order to improve precision of WLAN indoor positioning, based on nearest neighbor fingerprinting algorithms. Experiments in a real WLAN environment indicate that proposed optimization leads to substantial improvements of the localization accuracy. Our approach is conceptually simple, is easy to implement, and does not require any additional hardware.

27 May 2009 in Annals of Telecommunications
Verified
Journal Article
Closed access
PDF file
MSMirjana Simic
Mirjana Simic
PPPredrag V. Pejović
Predrag V. Pejović