neighborhood topology
Recently Published Documents


TOTAL DOCUMENTS

45
(FIVE YEARS 13)

H-INDEX

9
(FIVE YEARS 1)

2021 ◽  
Author(s):  
Yassmine Soussi ◽  
Nizar Rokbani ◽  
Seyedali Mirjalili ◽  
Ali Wali ◽  
Adel Alimi

In this paper a new technique is integrated to Multi-Objective Particle Swarm Optimization (MOPSO) algorithm, named Pareto Neighborhood (PN) topology, to produce MOPSO-PN algorithm. This technique involves iteratively selecting a set of best solutions from the Pareto-Optimal-Fronts and trying to explore them in order to find better clustering results in the next iteration. MOPSO-PN was then used as a Multi?Objective Clustering Optimization (MOCO) Algorithm, it was tested on various datasets (real-life and artificial datasets). Two scenarios have been used to test the performances of MOPSO-PN for clustering: In the first scenario MOPSO-PN utilizes, as objective functions, two clusters validity index (Silhouette?Index and overall-cluster-deviation), three datasets for test, four algorithms for comparison and the average Minkowski Score as metric for evaluating the final clustering result; In the second scenario MOPSO-PN used, as objectives functions, three clusters validity index (I-index, Con-index and Sym?index), 20 datasets for test, ten algorithms for comparison and the F-Measure as metric for evaluating the final clustering result. In both scenarios, MOPSO-PN provided a competitive clustering results and a correct number of clusters for all datasets.


2021 ◽  
Author(s):  
Yassmine Soussi ◽  
Nizar Rokbani ◽  
Ali Wali ◽  
Adel Alimi

In this paper a new technique is integrated to Multi-Objective Particle Swarm Optimization (MOPSO) algorithm, named Pareto Neighborhood (PN) topology, to produce MOPSO-PN algorithm. This technique involves iteratively selecting a set of best solutions from the Pareto-Optimal-Fronts and trying to explore them in order to find better clustering results in the next iteration. MOPSO-PN was then used as a Multi?Objective Clustering Optimization (MOCO) Algorithm, it was tested on various datasets (real-life and artificial datasets). Two scenarios have been used to test the performances of MOPSO-PN for clustering: In the first scenario MOPSO-PN utilizes, as objective functions, two clusters validity index (Silhouette?Index and overall-cluster-deviation), three datasets for test, four algorithms for comparison and the average Minkowski Score as metric for evaluating the final clustering result; In the second scenario MOPSO-PN used, as objectives functions, three clusters validity index (I-index, Con-index and Sym?index), 20 datasets for test, ten algorithms for comparison and the F-Measure as metric for evaluating the final clustering result. In both scenarios, MOPSO-PN provided a competitive clustering results and a correct number of clusters for all datasets.


2021 ◽  
Author(s):  
Yassmine Soussi ◽  
Nizar Rokbani ◽  
Ali Wali ◽  
Adel Alimi

In this paper a new technique is integrated to Multi-Objective Particle Swarm Optimization (MOPSO) algorithm, named Pareto Neighborhood (PN) topology, to produce MOPSO-PN algorithm. This technique involves iteratively selecting a set of best solutions from the Pareto-Optimal-Fronts and trying to explore them in order to find better clustering results in the next iteration. MOPSO-PN was then used as a Multi?Objective Clustering Optimization (MOCO) Algorithm, it was tested on various datasets (real-life and artificial datasets). Two scenarios have been used to test the performances of MOPSO-PN for clustering: In the first scenario MOPSO-PN utilizes, as objective functions, two clusters validity index (Silhouette?Index and overall-cluster-deviation), three datasets for test, four algorithms for comparison and the average Minkowski Score as metric for evaluating the final clustering result; In the second scenario MOPSO-PN used, as objectives functions, three clusters validity index (I-index, Con-index and Sym?index), 20 datasets for test, ten algorithms for comparison and the F-Measure as metric for evaluating the final clustering result. In both scenarios, MOPSO-PN provided a competitive clustering results and a correct number of clusters for all datasets.


2021 ◽  
Author(s):  
Debanjan Konar ◽  
Bijaya Ketan Panigrahi ◽  
Siddhartha Bhattacharyya ◽  
Nilanjan Dey ◽  
Richard Jiang

Abstract Infection of Novel Coronavirus 2019 (COVID-19) on lung cells and human respiratory systems have raised real concern to the human lives during the current pandemic spread across the world. Recent observations on CT images of human lungs infected by COVID-19 is a challenging task for the researchers in finding suitable image patterns for automatic diagnosis. In this paper, a novel semi-supervised shallow learning network model comprising Parallel Quantum-Inspired Self-supervised Network (PQIS-Net) with Fully Connected (FC) layers is proposed for automatic segmentation followed by patch-based classifications on segmented lung CT images for the diagnosis of COVID-19 disease. The PQIS-Net model is incorporated for fully automated segmentation of lung CT scan images obviating pre-trained convolutional neural network models for feature learning. The PQIS-Net model comprises a trinity of layered structures of quantum bits inter-connected through rotation gates using an 8-connected second-order neighborhood topology for the segmentation of wide variation of local intensities of the CT images. Intensive experiments have been carried out on two publicly available lung CT image data sets thereby achieving promising segmentation outcome and diagnosis efficiency (F1-score and AUC) while compared with the state of the art pre-trained convolutional based models.


Author(s):  
Debanjan Konar ◽  
Suman Kalyan Kar

This chapter proposes a quantum multi-layer neural network (QMLNN) architecture suitable for handwritten character recognition in real time, assisted by quantum backpropagation of errors calculated from the quantum-inspired fuzziness measure of network output states. It is composed of three second-order neighborhood-topology-based inter-connected layers of neurons represented by qubits known as input, hidden, and output layers. The QMLNN architecture is a feed forward network with standard quantum backpropagation algorithm for the adjustment of its weighted interconnection. QMLNN self-organizes the quantum fuzzy input image information by means of the quantum backpropagating errors at the intermediate and output layers of the architecture. The interconnection weights are described using rotation gates. After the network is stabilized, a quantum observation at the output layer destroys the superposition of quantum states in order to obtain true binary outputs.


2021 ◽  
Vol 421 ◽  
pp. 273-284
Author(s):  
Yizhang Liu ◽  
Yanping Li ◽  
Luanyuan Dai ◽  
Changcai Yang ◽  
Lifang Wei ◽  
...  

2020 ◽  
Author(s):  
Debanjan Konar ◽  
Bijaya Ketan Panigrahi ◽  
Siddhartha Bhattacharyya ◽  
Nilanjan Dey

Abstract Infection of Novel Coronavirus 2019 (COVID-19) on lung cells and human respiratory systems have raised real concern to the human lives during the current pandemic spread across the world. Recent observations on CT images of human lungs infected by COVID-19 is a challenging task for the researchers in finding suitable image patterns for automatic diagnosis. In this paper, a novel semi-supervised shallow learning network model comprising Parallel Quantum-Inspired Self-supervised Network (PQIS-Net) with Fully Connected (FC) layers is proposed for automatic segmentation followed by patch-based classifications on segmented lung CT images for the diagnosis of COVID-19 disease. The PQIS-Net model is incorporated for fully automated segmentation of lung CT scan images obviating pre-trained convolutional neural network models for feature learning. The PQIS-Net model comprises a trinity of layered structures of quantum bits inter-connected through rotation gates using an 8-connected second-order neighborhood topology for the segmentation of wide variation of local intensities of the CT images. Intensive experiments have been carried out on two publicly available lung CT image data sets thereby achieving promising segmentation outcome and diagnosis efficiency (F1-score and AUC) while compared with the state of the art pre-trained convolutional based models.


2019 ◽  
Vol 9 (21) ◽  
pp. 4511 ◽  
Author(s):  
Maria H. Listewnik ◽  
Hanna Piwowarska-Bilska ◽  
Krzysztof Safranow ◽  
Jacek Iwanowski ◽  
Maria Laszczyńska ◽  
...  

The paper introduces a fitting method for Single-Photon Emission Computed Tomography (SPECT) images of parathyroid glands using generalized Gaussian function for quantitative assessment of preoperative parathyroid SPECT/CT scintigraphy results in a large patient cohort. Parathyroid glands are very small for SPECT acquisition and the overlapping of 3D distributions was observed. The application of multivariate generalized Gaussian function mixture allows modeling, but results depend on the optimization algorithm. Particle Swarm Optimization (PSO) with global best, ring, and random neighborhood topologies were compared. The obtained results show benefits of random neighborhood topology that gives a smaller error for 3D position and the position estimation was improved by about 3 % voxel size, but the most important is the reduction of processing time to a few minutes, compared to a few hours in relation to the random walk algorithm. Moreover, the frequency of obtaining low MSE values was more than two times higher for this topology. The presented method based on random neighborhood topology allows quantifying activity in a specific voxel in a short time and could be applied it in clinical practice.


Sign in / Sign up

Export Citation Format

Share Document