1
|
Coroama LG, Diosan L, Telecan T, Andras I, Crisan N, Andreica A, Caraiani C, Lebovici A, Bálint Z, Boca B. A Light, 3D UNet-based Architecture for Fully Automatic Segmentation of Prostate Lesions from T2-MRI Images. Curr Med Imaging 2023:CMIR-EPUB-131997. [PMID: 37218191 DOI: 10.2174/1573405620666230522151445] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [What about the content of this article? (0)] [Affiliation(s)] [Abstract] [Key Words] [Journal Information] [Subscribe] [Scholar Register] [Received: 10/05/2022] [Revised: 02/14/2023] [Accepted: 02/28/2023] [Indexed: 05/24/2023]
Abstract
INTRODUCTION Prostate magnetic resonance imaging (MRI) has been recently integrated into the pathway of diagnosis of prostate cancer (PCa). However, the lack of an optimal contrast-to-noise ratio hinders automatic recognition of suspicious lesions, thus developing a solution for proper delimitation of the tumour and its separation from the healthy parenchyma, which is of primordial importance. METHOD As a solution to this unmet medical need, we aimed to develop a decision support system based on artificial intelligence, which automatically segments the prostate and any suspect area from the 3D MRI images. We assessed retrospective data from all patients diagnosed with PCa by MRI-US fusion prostate biopsy, who underwent prostate MRI in our department due to a clinical or biochemical suspicion of PCa (n=33). All examinations were performed using a 1.5 Tesla MRI scanner. All images were reviewed by two radiologists, who performed manual segmentation of the prostate and all lesions. A total of 145 augmented datasets were generated. The performance of our fully automated end-to-end segmentation model based on a 3D UNet architecture and trained in two learning scenarios (on 14 or 28 patient datasets) was evaluated by two loss functions. RESULTS Our model had an accuracy of over 90% for automatic segmentation of prostate and PCa nodules, as compared to manual segmentation. We have shown low complexity networks, UNet architecture with less than five layers, as feasible and to show good performance for automatic 3D MRI image segmentation. A larger training dataset could further improve the results. CONCLUSION Therefore, herein, we propose a less complex network, a slim 3D UNet with superior performance, being faster than the original five-layer UNet architecture.
Collapse
Affiliation(s)
- Larisa Gabriela Coroama
- Faculty of Mathematics and Computer Science, Babeș-Bolyai University, 400084 Cluj-Napoca, Romania
| | - Laura Diosan
- Faculty of Mathematics and Computer Science, Babeș-Bolyai University, 400084 Cluj-Napoca, Romania
| | - Teodora Telecan
- Department of Urology, Faculty of Medicine, Iuliu Hațieganu University of Medicine and Pharmacy, 400012 Cluj-Napoca, Romania
- Department of Urology, Municipal Clinical Hospital, 400139 Cluj-Napoca, Romania
| | - Iulia Andras
- Department of Urology, Faculty of Medicine, Iuliu Hațieganu University of Medicine and Pharmacy, 400012 Cluj-Napoca, Romania
- Department of Urology, Municipal Clinical Hospital, 400139 Cluj-Napoca, Romania
| | - Nicolae Crisan
- Department of Urology, Faculty of Medicine, Iuliu Hațieganu University of Medicine and Pharmacy, 400012 Cluj-Napoca, Romania
- Department of Urology, Municipal Clinical Hospital, 400139 Cluj-Napoca, Romania
| | - Anca Andreica
- Faculty of Mathematics and Computer Science, Babeș-Bolyai University, 400084 Cluj-Napoca, Romania
| | - Cosmin Caraiani
- Department of Medical Imaging, Iuliu Hațieganu University of Medicine and Pharmacy, 400012 Cluj-Napoca, Romania
| | - Andrei Lebovici
- Department of Radiology, Faculty of Medicine, Iuliu Hațieganu University of Medicine and Pharmacy, 400012 Cluj-Napoca, Romania
- Department of Radiology, Emergency Clinical County Hospital of Cluj-Napoca, 400006 Cluj-Napoca, Romania
| | - Zoltán Bálint
- Department of Biomolecular Physics, Faculty of Physics, Babeș-Bolyai University, 400084 Cluj-Napoca, Romania
| | - Bianca Boca
- Department of Urology, Municipal Clinical Hospital, 400139 Cluj-Napoca, Romania
- Department of Radiology and Medical Imaging, Faculty of Medicine, George Emil Palade University of Medicine, Pharmacy, Science and Technology of Târgu Mureș, 540139 Târgu Mureș, Romania
| |
Collapse
|
2
|
Coroamă DM, Dioșan L, Telecan T, Andras I, Crișan N, Medan P, Andreica A, Caraiani C, Lebovici A, Boca B, Bálint Z. Fully automated bladder tumor segmentation from T2 MRI images using 3D U-Net algorithm. Front Oncol 2023; 13:1096136. [PMID: 36969047 PMCID: PMC10033524 DOI: 10.3389/fonc.2023.1096136] [Citation(s) in RCA: 2] [Impact Index Per Article: 2.0] [Reference Citation Analysis] [What about the content of this article? (0)] [Affiliation(s)] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 11/14/2022] [Accepted: 02/20/2023] [Indexed: 03/12/2023] Open
Abstract
IntroductionBladder magnetic resonance imaging (MRI) has been recently integrated in the diagnosis pathway of bladder cancer. However, automatic recognition of suspicious lesions is still challenging. Thus, development of a solution for proper delimitation of the tumor and its separation from the healthy tissue is of primordial importance. As a solution to this unmet medical need, we aimed to develop an artificial intelligence-based decision support system, which automatically segments the bladder wall and the tumor as well as any suspect area from the 3D MRI images.MaterialsWe retrospectively assessed all patients diagnosed with bladder cancer, who underwent MRI at our department (n=33). All examinations were performed using a 1.5 Tesla MRI scanner. All images were reviewed by two radiologists, who performed manual segmentation of the bladder wall and all lesions. First, the performance of our fully automated end-to-end segmentation model based on a 3D U-Net architecture (by considering various depths of 4, 5 or 6 blocks) trained in two data augmentation scenarios (on 5 and 10 augmentation datasets per original data, respectively) was tested. Second, two learning setups were analyzed by training the segmentation algorithm with 7 and 14 MRI original volumes, respectively.ResultsWe obtained a Dice-based performance over 0.878 for automatic segmentation of bladder wall and tumors, as compared to manual segmentation. A larger training dataset using 10 augmentations for 7 patients could further improve the results of the U-Net-5 model (0.902 Dice coefficient at image level). This model performed best in terms of automated segmentation of bladder, as compared to U-Net-4 and U-Net-6. However, in this case increased time for learning was needed as compared to U-Net-4. We observed that an extended dataset for training led to significantly improved segmentation of the bladder wall, but not of the tumor.ConclusionWe developed an intelligent system for bladder tumors automated diagnostic, that uses a deep learning model to segment both the bladder wall and the tumor. As a conclusion, low complexity networks, with less than five-layers U-Net architecture are feasible and show good performance for automatic 3D MRI image segmentation in patients with bladder tumors.
Collapse
Affiliation(s)
- Diana Mihaela Coroamă
- Faculty of Mathematics and Computer Science, Babeș-Bolyai University, Cluj-Napoca, Romania
| | - Laura Dioșan
- Faculty of Mathematics and Computer Science, Babeș-Bolyai University, Cluj-Napoca, Romania
| | - Teodora Telecan
- Department of Urology, Faculty of Medicine, Iuliu Hațieganu University of Medicine and Pharmacy, Cluj-Napoca, Romania
- Department of Urology, Municipal Clinical Hospital, Cluj-Napoca, Romania
- *Correspondence: Zoltán Bálint, ; Teodora Telecan,
| | - Iulia Andras
- Department of Urology, Faculty of Medicine, Iuliu Hațieganu University of Medicine and Pharmacy, Cluj-Napoca, Romania
- Department of Urology, Municipal Clinical Hospital, Cluj-Napoca, Romania
| | - Nicolae Crișan
- Department of Urology, Faculty of Medicine, Iuliu Hațieganu University of Medicine and Pharmacy, Cluj-Napoca, Romania
- Department of Urology, Municipal Clinical Hospital, Cluj-Napoca, Romania
| | - Paul Medan
- Department of Urology, Faculty of Medicine, Iuliu Hațieganu University of Medicine and Pharmacy, Cluj-Napoca, Romania
- Department of Urology, Municipal Clinical Hospital, Cluj-Napoca, Romania
| | - Anca Andreica
- Faculty of Mathematics and Computer Science, Babeș-Bolyai University, Cluj-Napoca, Romania
| | - Cosmin Caraiani
- Department of Medical Imaging, Iuliu Hațieganu University of Medicine and Pharmacy, Cluj-Napoca, Romania
| | - Andrei Lebovici
- Department of Radiology, Faculty of Medicine, Iuliu Hațieganu University of Medicine and Pharmacy, Cluj-Napoca, Romania
- Department of Radiology, Emergency Clinical County Hospital of Cluj-Napoca, Cluj-Napoca, Romania
| | - Bianca Boca
- Department of Medical Imaging, Iuliu Hațieganu University of Medicine and Pharmacy, Cluj-Napoca, Romania
- Department of Radiology, Faculty of Medicine, George Emil Palade University of Medicine, Pharmacy, Science and Technology of Târgu Mureș, Târgu Mureș, Romania
| | - Zoltán Bálint
- Department of Biomolecular Physics, Faculty of Physics, Babeș-Bolyai University, Cluj-Napoca, Romania
- *Correspondence: Zoltán Bálint, ; Teodora Telecan,
| |
Collapse
|
3
|
Sista F, Carandina S, Andreica A, Zulian V, Pietroletti R, Cappelli S, Balla A, Nedelcu M, Clementi M. Long-term results of laparoscopic gastric sleeve: the importance of follow-up adherence. Eur Rev Med Pharmacol Sci 2022; 26:6691-6699. [PMID: 36196719 DOI: 10.26355/eurrev_202209_29770] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [What about the content of this article? (0)] [Affiliation(s)] [Abstract] [Subscribe] [Scholar Register] [Indexed: 01/19/2023]
Abstract
OBJECTIVE This study was conducted to assess the long-term results of the Laparoscopic Sleeve Gastrectomy (LSG) in patients not compliant with follow-up, and in patients who completed a postoperative follow-up program. PATIENTS AND METHODS The data concerning LSG patients operated from February 2011 to December 2013 were retrospectively reviewed basing on a single center database. The patients with complete long-term follow-up were scheduled in Group A, while patients who failed to attend controls for more than two years were scheduled in Group B. Long-term results (weight loss, comorbidity improvement and late complications) were compared between the two groups. RESULTS The study population consisted of 285 patients. Of these, 101 had a complete follow-up with a mean duration of 71 ± 7.6 months (Group A). The remaining 184 patients (Group B) were not compliant with follow-up and, consequently, the mean duration of follow-up was 5.5 ± 7.3 months (p < 0.00001). A higher number of patients with insufficient weight loss was recorded in Group B with respect to Group A (78 vs. 23; p = 0.001). The number of patients with results below 25% EWL was significantly higher in Group B than in Group A (24 vs. 5; p = 0.04). In the long-term, the rate of patients with symptomatic reflux requiring medical treatment was two-fold higher in Group B than in Group A. CONCLUSIONS The adherence to a long-term follow-up plan after LSG seems to decrease the number of patients experiencing insufficient weight loss and those at risk for developing a gastro-esophageal reflux disease.
Collapse
Affiliation(s)
- F Sista
- San Salvatore Hospital, Department of Surgery, L'Aquila, Italy.
| | | | | | | | | | | | | | | | | |
Collapse
|
4
|
Dioşan L, Andreica A, Voiculescu I. On the use of multi–objective evolutionary classifiers for breast cancer detection. PLoS One 2022; 17:e0269950. [PMID: 35853014 PMCID: PMC9295958 DOI: 10.1371/journal.pone.0269950] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [What about the content of this article? (0)] [Affiliation(s)] [Abstract] [MESH Headings] [Grants] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 12/05/2021] [Accepted: 05/31/2022] [Indexed: 11/20/2022] Open
Abstract
Purpose Breast cancer is one of the most common tumours in women, nevertheless, it is also one of the cancers that is most usually treated. As a result, early detection is critical, which can be accomplished by routine mammograms. This paper aims to describe, analyze, compare and evaluate three image descriptors involved in classifying breast cancer images from four databases. Approach Multi–Objective Evolutionary Algorithms (MOEAs) prove themselves as being efficient methods for selection and classification problems. This paper aims to study combinations of well–known classification objectives in order to compare the results of their application in solving very specific learning problems. The experimental results undergo empirical analysis which is supported by a statistical approach. The results are illustrated on a collection of medical image databases, but with a focus on the MOEAs’ performance in terms of several well–known measures. The databases were chosen specifically to feature reliable human annotations, so as to measure the correlation between the gold standard classifications and the various MOEA classifications. Results We have seen how different statistical tests rank one algorithm over the others in our set as being better. These findings are unsurprising, revealing that there is no single gold standard for comparing diverse techniques or evolutionary algorithms. Furthermore, building meta-classifiers and evaluating them using a single, favorable metric is both extremely unwise and unsatisfactory, as the impact is to skew the results. Conclusions The best method to address these flaws is to select the right set of objectives and criteria. Using accuracy-related objectives, for example, is directly linked to maximizing the number of true positives. If, on the other hand, accuracy is chosen as the generic metric, the primary classification goal is shifted to increasing the positively categorized data points.
Collapse
Affiliation(s)
- Laura Dioşan
- Department of Computer Science, Babes-Bolyai University, Cluj-Napoca, Romania
- * E-mail:
| | - Anca Andreica
- Department of Computer Science, Babes-Bolyai University, Cluj-Napoca, Romania
| | - Irina Voiculescu
- Department of Computer Science, University of Oxford, Oxford, United Kingdom
| |
Collapse
|
5
|
Iancu SD, Cozan RG, Stefancu A, David M, Moisoiu T, Moroz-Dubenco C, Bajcsi A, Chira C, Andreica A, Leopold LF, Eniu D, Staicu A, Goidescu I, Socaciu C, Eniu DT, Diosan L, Leopold N. SERS liquid biopsy in breast cancer. What can we learn from SERS on serum and urine? Spectrochim Acta A Mol Biomol Spectrosc 2022; 273:120992. [PMID: 35220052 DOI: 10.1016/j.saa.2022.120992] [Citation(s) in RCA: 13] [Impact Index Per Article: 6.5] [Reference Citation Analysis] [What about the content of this article? (0)] [Affiliation(s)] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Received: 11/02/2021] [Revised: 01/21/2022] [Accepted: 02/01/2022] [Indexed: 06/14/2023]
Abstract
SERS analysis of biofluids, coupled with classification algorithms, has recently emerged as a candidate for point-of-care medical diagnosis. Nonetheless, despite the impressive results reported in the literature, there are still gaps in our knowledge of the biochemical information provided by the SERS analysis of biofluids. Therefore, by a critical assignment of the SERS bands, our work aims to provide a systematic analysis of the molecular information that can be achieved from the SERS analysis of serum and urine obtained from breast cancer patients and controls. Further, we compared the relative performance of five different machine learning algorithms for breast cancer and control samples classification based on the serum and urine SERS datasets, and found comparable classification accuracies in the range of 61-89%. This result is not surprising since both biofluids show striking similarities in their SERS spectra providing similar metabolic information, related to purine metabolites. Lastly, by carefully comparing the two datasets (i.e., serum and urine) we show that it is possible to link the misclassified samples to specific metabolic imbalances, such as carotenoid levels, or variations in the creatinine concentration.
Collapse
Affiliation(s)
- Stefania D Iancu
- Faculty of Physics, Babeș-Bolyai University, 400084 Cluj-Napoca, Romania
| | - Ramona G Cozan
- Faculty of Physics, Babeș-Bolyai University, 400084 Cluj-Napoca, Romania
| | - Andrei Stefancu
- Faculty of Physics, Babeș-Bolyai University, 400084 Cluj-Napoca, Romania
| | - Maria David
- Faculty of Chemistry and Chemical Engineering, Babeș-Bolyai University, 400028 Cluj-Napoca, Romania
| | - Tudor Moisoiu
- Clinical Institute of Urology and Renal Transplant, 400006 Cluj-Napoca, Romania; Faculty of Medicine, Iuliu Hatieganu University of Medicine and Pharmacy, 400349 Cluj-Napoca, Romania; Biomed Data Analytics SRL, 400696 Cluj-Napoca, Romania
| | - Cristiana Moroz-Dubenco
- Department of Computer Science, Faculty of Mathematics and Computer Science, Babeș-Bolyai University, 400084 Cluj-Napoca, Romania
| | - Adel Bajcsi
- Department of Computer Science, Faculty of Mathematics and Computer Science, Babeș-Bolyai University, 400084 Cluj-Napoca, Romania
| | - Camelia Chira
- Department of Computer Science, Faculty of Mathematics and Computer Science, Babeș-Bolyai University, 400084 Cluj-Napoca, Romania; Department of Computer Science, Faculty of Mathematics and Computer Science, Babeș-Bolyai University, 400084 Cluj-Napoca, Romania
| | - Anca Andreica
- Department of Computer Science, Faculty of Mathematics and Computer Science, Babeș-Bolyai University, 400084 Cluj-Napoca, Romania
| | - Loredana F Leopold
- Faculty of Food Science and Technology, University of Agricultural Sciences and Veterinary Medicine, 400372 Cluj-Napoca, Romania
| | - Daniela Eniu
- Faculty of Medicine, Iuliu Hatieganu University of Medicine and Pharmacy, 400349 Cluj-Napoca, Romania
| | - Adelina Staicu
- Faculty of Medicine, Iuliu Hatieganu University of Medicine and Pharmacy, 400349 Cluj-Napoca, Romania
| | - Iulian Goidescu
- Faculty of Medicine, Iuliu Hatieganu University of Medicine and Pharmacy, 400349 Cluj-Napoca, Romania
| | - Carmen Socaciu
- Faculty of Food Science and Technology, University of Agricultural Sciences and Veterinary Medicine, 400372 Cluj-Napoca, Romania; BIODIATECH Research Centre for Applied Biotechnology, SC Proplanta, 400478 Cluj-Napoca, Romania
| | - Dan T Eniu
- Faculty of Medicine, Iuliu Hatieganu University of Medicine and Pharmacy, 400349 Cluj-Napoca, Romania; Department of Surgical and Gynecological Oncology, Ion Chiricuta Clinical Cancer Center, 400015 Cluj-Napoca, Romania
| | - Laura Diosan
- Department of Computer Science, Faculty of Mathematics and Computer Science, Babeș-Bolyai University, 400084 Cluj-Napoca, Romania.
| | - Nicolae Leopold
- Faculty of Physics, Babeș-Bolyai University, 400084 Cluj-Napoca, Romania; Biomed Data Analytics SRL, 400696 Cluj-Napoca, Romania.
| |
Collapse
|
6
|
Mursa BEM, Dioşan L, Andreica A. Network motifs: A key variable in the equation of dynamic flow between macro and micro layers in Complex Networks. Knowl Based Syst 2021. [DOI: 10.1016/j.knosys.2020.106648] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [What about the content of this article? (0)] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 02/02/2023]
|
7
|
Mărginean R, Andreica A, Dioşan L, Bálint Z. Butterfly Effect in Chaotic Image Segmentation. Entropy (Basel) 2020; 22:e22091028. [PMID: 33286797 PMCID: PMC7597087 DOI: 10.3390/e22091028] [Citation(s) in RCA: 5] [Impact Index Per Article: 1.3] [Reference Citation Analysis] [What about the content of this article? (0)] [Affiliation(s)] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 07/24/2020] [Revised: 09/06/2020] [Accepted: 09/11/2020] [Indexed: 11/16/2022]
Abstract
The exploitation of the important features exhibited by the complex systems found in the surrounding natural and artificial space will improve computational model performance. Therefore, the purpose of the current paper is to use cellular automata as a tool simulating complexity, able to bring forth an interesting global behaviour based only on simple, local interactions. We show that, in the context of image segmentation, a butterfly effect arises when we perturb the neighbourhood system of a cellular automaton. Specifically, we enhance a classical GrowCut cellular automaton with chaotic features, which are also able to improve its performance (e.g., a Dice coefficient of 71% in case of 2D images). This enhanced GrowCut flavor (referred to as Band-Based GrowCut) uses an extended, stochastic neighbourhood, in which randomly-selected remote neighbours reinforce the standard local ones. We demonstrate the presence of the butterfly effect and an increase in segmentation performance by numerical experiments performed on synthetic and natural images. Thus, our results suggest that, by having small changes in the initial conditions of the performed task, we can induce major changes in the final outcome of the segmentation.
Collapse
Affiliation(s)
- Radu Mărginean
- IMOGEN Research Institute, County Clinical Emergency Hospital, 400006 Cluj-Napoca, Romania; (A.A.); (L.D.); (Z.B.)
- Correspondence: ; Tel.: +40-742-277-182
| | - Anca Andreica
- IMOGEN Research Institute, County Clinical Emergency Hospital, 400006 Cluj-Napoca, Romania; (A.A.); (L.D.); (Z.B.)
- Faculty of Mathematics and Computer Science, Babeş–Bolyai University, 400084 Cluj-Napoca, Romania
| | - Laura Dioşan
- IMOGEN Research Institute, County Clinical Emergency Hospital, 400006 Cluj-Napoca, Romania; (A.A.); (L.D.); (Z.B.)
- Faculty of Mathematics and Computer Science, Babeş–Bolyai University, 400084 Cluj-Napoca, Romania
| | - Zoltán Bálint
- IMOGEN Research Institute, County Clinical Emergency Hospital, 400006 Cluj-Napoca, Romania; (A.A.); (L.D.); (Z.B.)
- Faculty of Physics, Babeş–Bolyai University, 400084 Cluj-Napoca, Romania
| |
Collapse
|
8
|
|
9
|
Abstract
Modelled as finite homogeneous Markov chains, probabilistic cellular automata with local transition probabilities in (0, 1) always posses a stationary distribution. This result alone is not very helpful when it comes to predicting the final configuration; one needs also a formula connecting the probabilities in the stationary distribution to some intrinsic feature of the lattice configuration. Previous results on the asynchronous cellular automata have showed that such feature really exists. It is the number of zero-one borders within the automaton's binary configuration. An exponential formula in the number of zero-one borders has been proved for the 1-D, 2-D and 3-D asynchronous automata with neighborhood three, five and seven, respectively. We perform computer experiments on a synchronous cellular automaton to check whether the empirical distribution obeys also that theoretical formula. The numerical results indicate a perfect fit for neighbourhood three and five, which opens the way for a rigorous proof of the formula in this new, synchronous case.
Collapse
Affiliation(s)
- Alexandru Agapie
- Bucharest University of Economic Studies, Department of Applied Mathematics, Bucharest, Romania, and Institute for Mathematical Statistics and Applied Mathematics, Bucharest, Romania
- * E-mail:
| | - Anca Andreica
- Babes-Bolyai University, Faculty of Mathematics & Informatics, Cluj-Napoca, Romania
| | - Camelia Chira
- Babes-Bolyai University, Faculty of Mathematics & Informatics, Cluj-Napoca, Romania
| | - Marius Giuclea
- Bucharest University of Economic Studies, Department of Applied Mathematics, Bucharest, Romania
| |
Collapse
|
10
|
Abstract
Cellular automata are binary lattices used for modeling complex dynamical systems. The automaton evolves iteratively from one configuration to another, using some local transition rule based on the number of ones in the neighborhood of each cell. With respect to the number of cells allowed to change per iteration, we speak of either synchronous or asynchronous automata. If randomness is involved to some degree in the transition rule, we speak of probabilistic automata, otherwise they are called deterministic. With either type of cellular automaton we are dealing with, the main theoretical challenge stays the same: starting from an arbitrary initial configuration, predict (with highest accuracy) the end configuration. If the automaton is deterministic, the outcome simplifies to one of two configurations, all zeros or all ones. If the automaton is probabilistic, the whole process is modeled by a finite homogeneous Markov chain, and the outcome is the corresponding stationary distribution. Based on our previous results for the asynchronous case-connecting the probability of a configuration in the stationary distribution to its number of zero-one borders-the article offers both numerical and theoretical insight into the long-term behavior of synchronous cellular automata.
Collapse
Affiliation(s)
- Alexandru Agapie
- 1 Department of Applied Mathematics, University of Economic Studies , Bucharest, Romania
| | | | | |
Collapse
|
11
|
Abstract
The detection of evolving communities in dynamic complex networks is a challenging problem that recently received attention from the research community. Dynamics clearly add another complexity dimension to the difficult task of community detection. Methods should be able to detect changes in the network structure and produce a set of community structures corresponding to different timestamps and reflecting the evolution in time of network data. We propose a novel approach based on game theory elements and extremal optimization to address dynamic communities detection. Thus, the problem is formulated as a mathematical game in which nodes take the role of players that seek to choose a community that maximizes their profit viewed as a fitness function. Numerical results obtained for both synthetic and real-world networks illustrate the competitive performance of this game theoretical approach.
Collapse
Affiliation(s)
- Rodica Ioana Lung
- Department of Statistics, Forecasting and Mathematics, Babeş-Bolyai University, Cluj Napoca, Romania
- * E-mail:
| | - Camelia Chira
- Department of Computer Science, Babeş-Bolyai University, Cluj Napoca, Romania
| | - Anca Andreica
- Department of Computer Science, Babeş-Bolyai University, Cluj Napoca, Romania
| |
Collapse
|