scholarly journals A Grid-Density Based Algorithm by Weighted Spiking Neural P Systems with Anti-Spikes and Astrocytes in Spatial Cluster Analysis

Processes ◽  
2020 ◽  
Vol 8 (9) ◽  
pp. 1132
Author(s):  
Deting Kong ◽  
Yuan Wang ◽  
Xinyan Wu ◽  
Xiyu Liu ◽  
Jianhua Qu ◽  
...  
Keyword(s):  
Dimensional Space ◽  
P Systems ◽  
High Dimensional ◽  
P System ◽  
Inhibitory Influence ◽  
Spiking Neural P Systems ◽  
Clustering Approach ◽  
Spatial Cluster Analysis ◽  
Effectiveness And Efficiency ◽  
Real World Datasets

In this paper, we propose a novel clustering approach based on P systems and grid- density strategy. We present grid-density based approach for clustering high dimensional data, which first projects the data patterns on a two-dimensional space to overcome the curse of dimensionality problem. Then, through meshing the plane with grid lines and deleting sparse grids, clusters are found out. In particular, we present weighted spiking neural P systems with anti-spikes and astrocyte (WSNPA2 in short) to implement grid-density based approach in parallel. Each neuron in weighted SN P system contains a spike, which can be expressed by a computable real number. Spikes and anti-spikes are inspired by neurons communicating through excitatory and inhibitory impulses. Astrocytes have excitatory and inhibitory influence on synapses. Experimental results on multiple real-world datasets demonstrate the effectiveness and efficiency of our approach.

scholarly journals The Sparse MinMax k-Means Algorithm for High-Dimensional Clustering

2020 ◽  
Author(s):  
Sayak Dey ◽  
Swagatam Das ◽  
Rammohan Mallipeddi
Keyword(s):  
Real World ◽  
Dimensional Space ◽  
Sum Of Squares ◽  
High Dimensional ◽  
Clustering Methods ◽  
High Dimensional Space ◽  
Sparse Regularization ◽  
Clustering Approach ◽  
Real World Datasets ◽  
High Dimensional Clustering

Classical clustering methods usually face tough challenges when we have a larger set of features compared to the number of items to be partitioned. We propose a Sparse MinMax k-Means Clustering approach by reformulating the objective of the MinMax k-Means algorithm (a variation of classical k-Means that minimizes the maximum intra-cluster variance instead of the sum of intra-cluster variances), into a new weighted between-cluster sum of squares (BCSS) form. We impose sparse regularization on these weights to make it suitable for high-dimensional clustering. We seek to use the advantages of the MinMax k-Means algorithm in the high-dimensional space to generate good quality clusters. The efficacy of the proposal is showcased through comparison against a few representative clustering methods over several real world datasets.

scholarly journals Novel Numerical Spiking Neural P Systems with a Variable Consumption Strategy

Processes ◽  
2021 ◽  
Vol 9 (3) ◽  
pp. 549
Author(s):  
Xiu Yin ◽  
Xiyu Liu ◽  
Minghe Sun ◽  
Qianqian Ren
Keyword(s):  
Production Functions ◽  
P Systems ◽  
P System ◽  
Computing Device ◽  
Spiking Neural P Systems ◽  
Distributed Parallel Computing ◽  
Production Values ◽  
Novel Variant ◽  
Turing Universality ◽  
Variable Consumption

A novel variant of NSN P systems, called numerical spiking neural P systems with a variable consumption strategy (NSNVC P systems), is proposed. Like the spiking rules consuming spikes in spiking neural P systems, NSNVC P systems introduce a variable consumption strategy by modifying the form of the production functions used in NSN P systems. Similar to the delay feature of the spiking rules, NSNVC P systems introduce a postponement feature into the production functions. The execution of the production functions in NSNVC P systems is controlled by two, i.e., polarization and threshold, conditions. Multiple synaptic channels are used to transmit the charges and the production values in NSNVC P systems. The proposed NSNVC P systems are a type of distributed parallel computing models with a directed graphical structure. The Turing universality of the proposed NSNVC P systems is proved as number generating/accepting devices. Detailed descriptions are provided for NSNVC P systems as number generating/accepting devices. In addition, a universal NSNVC P system with 66 neurons is constructed as a function computing device.

Performing Balanced Ternary Logic and Arithmetic Operations with Spiking Neural P Systems with Anti-Spikes

2012 ◽  
Vol 505 ◽  
pp. 378-385 ◽  
Author(s):  
Xian Wu Peng ◽  
Xiao Ping Fan ◽  
Jian Xun Liu
Keyword(s):  
Logic Gates ◽  
P Systems ◽  
P System ◽  
Ternary Logic ◽  
Arithmetic Operations ◽  
Spiking Neural P Systems ◽  
Addition And Subtraction ◽  
Distributed And Parallel Computing ◽  
Computing Models ◽  
Natural Way

Spiking neural P systems are a class of distributed and parallel computing models inspired by P systems and spiking neural networks.Spiking neural P system with anti-spikes can encode the balanced ternary three digits in a natural way using three states called anti-spikes, no-input and spikes. In this paper we use this variant of SN P system to simulate universal balanced ternary logic gates including AND,OR and NOT gate and to perform some basic balanced ternary arithmetic operations like addition and subtraction on balanced ternary integers. This paper provides an applicational answer to an open problem formulated by L.Pan and Gh. Păun.

Spiking Neural P Systems with Astrocytes

2012 ◽  
Vol 24 (3) ◽  
pp. 805-825 ◽  
Author(s):  
Linqiang Pan ◽  
Jun Wang ◽  
Hendrik Jan Hoogeboom
Keyword(s):  
Nervous System ◽  
Simple Form ◽  
P Systems ◽  
Inhibitory Influence ◽  
Spiking Neural P Systems ◽  
Biological Inspiration ◽  
Semilinear Sets

In a biological nervous system, astrocytes play an important role in the functioning and interaction of neurons, and astrocytes have excitatory and inhibitory influence on synapses. In this work, with this biological inspiration, a class of computation devices that consist of neurons and astrocytes is introduced, called spiking neural P systems with astrocytes (SNPA systems). The computation power of SNPA systems is investigated. It is proved that SNPA systems with simple neurons (all neurons have the same rule, one per neuron, of a very simple form) are Turing universal in both generative and accepting modes. If a bound is given on the number of spikes present in any neuron along a computation, then the computation power of SNPA systems is diminished. In this case, a characterization of semilinear sets of numbers is obtained.

scholarly journals Mining of high dimensional data using enhanced clustering approach

2018 ◽  
Vol 7 (2.21) ◽  
pp. 291
Author(s):  
S Sivakumar ◽  
Kumar Narayanan ◽  
Swaraj Paul Chinnaraju ◽  
Senthil Kumar Janahan
Keyword(s):  
Data Mining ◽  
Similarity Measure ◽  
Dimensional Space ◽  
Clustering Algorithms ◽  
High Dimensional ◽  
Projected Clustering ◽  
Low Dimensionality ◽  
Clustering Approach ◽  
Numerous Data ◽  
Dimension Space

Extraction of useful data from a set is known as Data mining. Clustering has top information mining process it supposed to help an individual, divide and recognize numerous data from records inside group consistent with positive similarity measure. Clustering excessive dimensional data has been a chief undertaking. Maximum present clustering algorithms have been inefficient if desired similarity is computed among statistics factors inside the complete dimensional space. Varieties of projected clustering algorithms were counseled for addressing those problems. However many of them face problems whilst clusters conceal in some space with low dimensionality. These worrying situations inspire our system to endorse a look at partitional distance primarily based projected clustering set of rules. The aimed paintings is successfully deliberate for projects clusters in excessive huge dimension space via adapting the stepped forward method in k Mediods set of pointers. The main goal for second one gadget is to take away outliers, at the same time as the 1/3 method will find clusters in numerous spaces. The (clustering) technique is based on the adequate Mediods set of guidelines, an excess distance managed to set of attributes everywhere values are dense.

scholarly journals SPIKE TRAINS IN SPIKING NEURAL P SYSTEMS

2006 ◽  
Vol 17 (04) ◽  
pp. 975-1002 ◽  
Author(s):  
GHEORGHE PĂUN ◽  
MARIO J. PÉREZ-JIMÉNEZ ◽  
GRZEGORZ ROZENBERG
Keyword(s):  
Spike Train ◽  
Spike Trains ◽  
P Systems ◽  
P System ◽  
Spiking Neural P System ◽  
Spiking Neural P Systems ◽  
Semilinear Sets ◽  
Research Problems ◽  
Electrical Impulses

We continue here the study of the recently introduced spiking neural P systems, which mimic the way that neurons communicate with each other by means of short electrical impulses, identical in shape (voltage), but emitted at precise moments of time. The sequence of moments when a neuron emits a spike is called the spike train (of this neuron); by designating one neuron as the output neuron of a spiking neural P system II, one obtains a spike train of II. Given a specific way of assigning sets of numbers to spike trains of II, we obtain sets of numbers computed by II. In this way, spiking neural P systems become number computing devices. We consider a number of ways to assign (code) sets of numbers to (by) spike trains, and prove then computational completeness: the computed sets of numbers are exactly Turing computable sets. When the number of spikes present in the system is bounded, a characterization of semilinear sets of numbers is obtained. A number of research problems is also formulated.

scholarly journals Turing Universality of Weighted Spiking Neural P Systems with Anti-spikes

2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Qianqian Ren ◽  
Xiyu Liu ◽  
Minghe Sun
Keyword(s):  
P Systems ◽  
P System ◽  
Number Generator ◽  
Working Process ◽  
Computing Device ◽  
Spiking Neural P Systems ◽  
Turing Universality

Weighted spiking neural P systems with anti-spikes (AWSN P systems) are proposed by adding anti-spikes to spiking neural P systems with weighted synapses. Anti-spikes behave like spikes of inhibition of communication between neurons. Both spikes and anti-spikes are used in the rule expressions. An illustrative example is given to show the working process of the proposed AWSN P systems. The Turing universality of the proposed P systems as number generating and accepting devices is proved. Finally, a universal AWSN P system having 34 neurons is proved to work as a function computing device by using standard rules, and one having 30 neurons is proved to work as a number generator.

scholarly journals Automatic Implementation of Fuzzy Reasoning Spiking Neural P Systems for Diagnosing Faults in Complex Power Systems

Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-16 ◽  
Author(s):  
Haina Rong ◽  
Kang Yi ◽  
Gexiang Zhang ◽  
Jianping Dong ◽  
Prithwineel Paul ◽  
...  
Keyword(s):  
Fault Diagnosis ◽  
Power Systems ◽  
Large Scale ◽  
Membrane Computing ◽  
Good Description ◽  
Fuzzy Reasoning ◽  
P Systems ◽  
P System ◽  
Spiking Neural P Systems ◽  
Complex Power

As an important variant of membrane computing models, fuzzy reasoning spiking neural P systems (FRSN P systems) were introduced to build a link between P systems and fault diagnosis applications. An FRSN P system offers an intuitive illustration based on a strictly mathematical expression, a good fault-tolerant capacity, a good description for the relationships between protective devices and faults, and an understandable diagnosis model-building process. However, the implementation of FRSN P systems is still at a manual process, which is a time-consuming and hard labor work, especially impossible to perform on large-scale complex power systems. This manual process seriously limits the use of FRSN P systems to diagnose faults in large-scale complex power systems and has always been a challenging and ongoing task for many years. In this work we develop an automatic implementation method for automatically fulfilling the hard task, named membrane computing fault diagnosis (MCFD) method. This is a very significant attempt in the development of FRSN P systems and even of the membrane computing applications. MCFD is realized by automating input and output, and diagnosis processes consists of network topology analysis, suspicious fault component analysis, construction of FRSN P systems for suspicious fault components, and fuzzy inference. Also, the feasibility of the FRSN P system is verified on the IEEE14, IEEE 39, and IEEE 118 node systems.

scholarly journals Spiking Neural P Systems with Polarizations and Rules on Synapses

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Suxia Jiang ◽  
Jihui Fan ◽  
Yijun Liu ◽  
Yanfeng Wang ◽  
Fei Xu
Keyword(s):  
P Systems ◽  
Neural Systems ◽  
P System ◽  
Spiking Neural P Systems ◽  
Computable Functions

Spiking neural P systems are a class of computation models inspired by the biological neural systems, where spikes and spiking rules are in neurons. In this work, we propose a variant of spiking neural P systems, called spiking neural P systems with polarizations and rules on synapses (PSNRS P systems), where spiking rules are placed on synapses and neurons are associated with polarizations used to control the application of such spiking rules. The computation power of PSNRS P systems is investigated. It is proven that PSNRS P systems are Turing universal, both as number generating and accepting devices. Furthermore, a universal PSNRS P system with 151 neurons for computing any Turing computable functions is given. Compared with the case of SN P systems with polarizations but without spiking rules in neurons, less number of neurons are used to construct a universal PSNRS P system.

scholarly journals A Fault Diagnosis Method for Power Transmission Networks Based on Spiking Neural P Systems with Self-Updating Rules considering Biological Apoptosis Mechanism

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-18 ◽  
Author(s):  
Wei Liu ◽  
Tao Wang ◽  
Tianlei Zang ◽  
Zhu Huang ◽  
Jun Wang ◽  
...  
Keyword(s):  
Fault Diagnosis ◽  
Power Systems ◽  
Power Transmission ◽  
Attribute Reduction ◽  
P Systems ◽  
P System ◽  
Transmission Networks ◽  
Spiking Neural P Systems ◽  
Diagnosis Method ◽  
Power Transmission Networks

Power transmission networks play an important role in smart girds. Fast and accurate faulty-equipment identification is critical for fault diagnosis of power systems; however, it is rather difficult due to uncertain and incomplete fault alarm messages in fault events. This paper proposes a new fault diagnosis method of transmission networks in the framework of membrane computing. We first propose a class of spiking neural P systems with self-updating rules (srSNPS) considering biological apoptosis mechanism and its self-updating matrix reasoning algorithm. The srSNPS, for the first time, effectively unitizes the attribute reduction ability of rough sets and the apoptosis mechanism of biological neurons in a P system, where the apoptosis algorithm for condition neurons is devised to delete redundant information in fault messages. This simplifies the complexity of the srSNPS model and allows us to deal with the uncertainty and incompleteness of fault information in an objective way without using historical statistics and expertise. Then, the srSNPS-based fault diagnosis method is proposed. It is composed of the transmission network partition, the SNPS model establishment, the pulse value correction and computing, and the protection device behavior evaluation, where the first two components can be finished before failures to save diagnosis time. Finally, case studies based on the IEEE 14- and IEEE 118-bus systems verify the effectiveness and superiority of the proposed method.

Sign in / Sign up

Export Citation Format

Share Document