Unmanned aerial vehicles(UAVs)have become one of the key technologies to achieve future data collection due to their high mobility,rapid deployment,low cost,and the ability to establish line-of-sight communication lin...Unmanned aerial vehicles(UAVs)have become one of the key technologies to achieve future data collection due to their high mobility,rapid deployment,low cost,and the ability to establish line-of-sight communication links.However,when UAV swarm perform tasks in narrow spaces,they often encounter various spatial obstacles,building shielding materials,and high-speed node movements,which result in intermittent network communication links and cannot support the smooth comple-tion of tasks.In this paper,a high mobility and dynamic topol-ogy of the UAV swarm is particularly considered and the high dynamic mobile topology-based clustering(HDMTC)algorithm is proposed.Simulation and real flight verification results verify that the proposed HDMTC algorithm achieves higher stability of net-work,longer link expiration time(LET),and longer node lifetime,all of which improve the communication performance for UAV swarm networks.展开更多
Aiming at the complexity of seismic gestation mechanism and spatial distribution, we hypothesize that the seismic data are composed of background earthquakes and anomaly earthquakes in a certain temporal-spatial scope...Aiming at the complexity of seismic gestation mechanism and spatial distribution, we hypothesize that the seismic data are composed of background earthquakes and anomaly earthquakes in a certain temporal-spatial scope. Also the background earthquakes and anomaly earthquakes both satisfy the 2-D Poisson process of different parameters respectively. In the paper, the concept of N-th order distance is introduced in order to transform 2-D superimposed Poisson process into 1-D mixture density function. On the basis of choosing the distance, mixture density function is decomposed to recognize the anomaly earthquakes through genetic algorithm. Combined with the temporal scanning of C value, the algorithm is applied to the recognition on spatial pattern of foreshock anomalies by exam-ples of Songpan and Longling sequences in the southwest of China.展开更多
The clustering evaluation can be used to scientifically classify the objects to be evaluated according to the information aggregation of various evaluation rules. In grey weighted clustering evaluation, the index clus...The clustering evaluation can be used to scientifically classify the objects to be evaluated according to the information aggregation of various evaluation rules. In grey weighted clustering evaluation, the index clustering rule relies on the construction of the whitenization weight function, while the existing construction method of the linear function lacks the construction mechanism analysis and validity explanation. A normative construction principle is put forward by analyzing the construction mechanism of the function. Through proving the normative principle of the function,the basic modal function(BMF) is proposed and characterized by different function forms. Then, a new type of the whitenization weight function and its grey clustering evaluation model algorithm are given by studying the mechanism and nature of the construction of different forms of the function. Finally, the comparative study for self-innovation capability of defense science and technology industry(DSTI) is taken as an example. The results show that the different construction ways of the function have an effect on the clustering result. The proposed construction mechanism can better explain the index clustering rules and evaluation effectiveness,which will perfect the theoretical system of grey clustering evaluation and be applied to practice effectively.展开更多
This paper proposes a suppression method of the deceptive false target(FT) produced by digital radio frequency memory(DRFM) in a multistatic radar system. The simulated deceptive false targets from DRFM cannot be easi...This paper proposes a suppression method of the deceptive false target(FT) produced by digital radio frequency memory(DRFM) in a multistatic radar system. The simulated deceptive false targets from DRFM cannot be easily discriminated and suppressed with traditional radar systems. Therefore, multistatic radar has attracted considerable interest as it provides improved performance against deception jamming due to several separated receivers. This paper first investigates the received signal model in the presence of multiple false targets in all receivers of the multistatic radar. Then, obtain the propagation time delays of the false targets based on the cross-correlation test of the received signals in different receivers. In doing so, local-density-based spatial clustering of applications with noise(LDBSCAN) is proposed to discriminate the FTs from the physical targets(PTs) after compensating the FTs time delays, where the FTs are approximately coincident with one position, while PTs possess small dispersion.Numerical simulations are carried out to demonstrate the feasibility and validness of the proposed method.展开更多
Intuitionistic fuzzy sets(IFSs) are useful means to describe and deal with vague and uncertain data.An intuitionistic fuzzy C-means algorithm to cluster IFSs is developed.In each stage of the intuitionistic fuzzy C-me...Intuitionistic fuzzy sets(IFSs) are useful means to describe and deal with vague and uncertain data.An intuitionistic fuzzy C-means algorithm to cluster IFSs is developed.In each stage of the intuitionistic fuzzy C-means method the seeds are modified,and for each IFS a membership degree to each of the clusters is estimated.In the end of the algorithm,all the given IFSs are clustered according to the estimated membership degrees.Furthermore,the algorithm is extended for clustering interval-valued intuitionistic fuzzy sets(IVIFSs).Finally,the developed algorithms are illustrated through conducting experiments on both the real-world and simulated data sets.展开更多
The existing trajectory clustering （TRACLUS） is sensitive to the input parameters c and MinLns. The parameter value is changed a little, but cluster results are entirely different. Aiming at this vulnerability, a sh...The existing trajectory clustering （TRACLUS） is sensitive to the input parameters c and MinLns. The parameter value is changed a little, but cluster results are entirely different. Aiming at this vulnerability, a shielding parameters sensitivity trajectory cluster （SPSTC） algorithm is proposed which is insensitive to the input parameters. Firstly, some definitions about the core distance and reachable distance of line segment are presented, and then the algorithm generates cluster sorting according to the core dis- tance and reachable distance. Secondly, the reachable plots of line segment sets are constructed according to the cluster sorting and reachable distance. Thirdly, a parameterized sequence is extracted according to the reachable plot, and then the final trajectory cluster based on the parameterized sequence is acquired. The parameterized sequence represents the inner cluster structure of trajectory data. Experiments on real data sets and test data sets show that the SPSTC algorithm effectively reduces the sensitivity to the input parameters, meanwhile it can obtain the better quality of the trajectory cluster.展开更多
To avoid uneven energy consuming in wireless sen- sor networks, a clustering routing model is proposed based on a Bayesian game. In the model, Harsanyi transformation is introduced to convert a static game of incomple...To avoid uneven energy consuming in wireless sen- sor networks, a clustering routing model is proposed based on a Bayesian game. In the model, Harsanyi transformation is introduced to convert a static game of incomplete information to the static game of complete but imperfect information. In addition, the existence of Bayesian nash equilibrium is proved. A clustering routing algorithm is also designed according to the proposed model, both cluster head distribution and residual energy are considered in the design of the algorithm. Simulation results show that the algorithm can balance network load, save energy and prolong network lifetime effectively.展开更多
Feature extraction of range images provided by ranging sensor is a key issue of pattern recognition. To automatically extract the environmental feature sensed by a 2D ranging sensor laser scanner, an improved method b...Feature extraction of range images provided by ranging sensor is a key issue of pattern recognition. To automatically extract the environmental feature sensed by a 2D ranging sensor laser scanner, an improved method based on genetic clustering VGA-clustering is presented. By integrating the spatial neighbouring information of range data into fuzzy clustering algorithm, a weighted fuzzy clustering algorithm （WFCA） instead of standard clustering algorithm is introduced to realize feature extraction of laser scanner. Aimed at the unknown clustering number in advance, several validation index functions are used to estimate the validity of different clustering algorithms and one validation index is selected as the fitness function of genetic algorithm so as to determine the accurate clustering number automatically. At the same time, an improved genetic algorithm IVGA on the basis of VGA is proposed to solve the local optimum of clustering algorithm, which is implemented by increasing the population diversity and improving the genetic operators of elitist rule to enhance the local search capacity and to quicken the convergence speed. By the comparison with other algorithms, the effectiveness of the algorithm introduced is demonstrated.展开更多
This paper introduces niching particle swarm optimiza- tion （nichePSO） into clustering analysis and puts forward a cluster- ing algorithm which uses nichePSO to optimize density functions. Firstly, this paper improv...This paper introduces niching particle swarm optimiza- tion （nichePSO） into clustering analysis and puts forward a cluster- ing algorithm which uses nichePSO to optimize density functions. Firstly, this paper improves main swarm training models and in- creases their ability of space searching. Secondly, the radius of sub-swarms is defined adaptively according to the actual clus- tering problem, which can be useful for the niches＇ forming and searching. At last, a novel method that distributes samples to the corresponding cluster is proposed. Numerical results illustrate that this algorithm based on the density function and nichePSO could cluster unbalanced density datasets into the correct clusters auto- matically and accurately.展开更多
In this paper, a Grey clustering method is applied to the evaluation research of sporting clothing style, the result shows that the methods proposed in the paper is feasible and effective.
Blind separation of sparse sources （BSSS） is discussed. The BSSS method based on the conventional K-means clustering is very fast and is also easy to implement. However, the accuracy of this method is generally not ...Blind separation of sparse sources （BSSS） is discussed. The BSSS method based on the conventional K-means clustering is very fast and is also easy to implement. However, the accuracy of this method is generally not satisfactory. The contribution of the vector x（t） with different modules is theoretically proved to be unequal, and a weighted K-means clustering method is proposed on this grounds. The proposed algorithm is not only as fast as the conventional K-means clustering method, but can also achieve considerably accurate results, which is demonstrated by numerical experiments.展开更多
Development of computational agent organizations or “societies” has become the domiant computing paradigm in the arena of Distributed Artificial Intelligence, and many foreseeable future applications need agent orga...Development of computational agent organizations or “societies” has become the domiant computing paradigm in the arena of Distributed Artificial Intelligence, and many foreseeable future applications need agent organizations, in which diversified agents cooperate in a distributed manner, forming teams. In such scenarios, the agents would need to know each other in order to facilitate the interactions. Moreover, agents in such an environment are not statically defined in advance but they can adaptively enter and leave an organization. This begs the question of how agents locate each other in order to cooperate in achieving organizational goals. Locating agents is a quite challenging task, especially in organizations that involve a large number of agents and where the resource avaiability is intermittent. The authors explore here an approach based on self organization map (SOM) which will serve as a clustering method in the light of the knowledge gathered about various agents. The approach begins by categorizing agents using a selected set of agent properties. These categories are used to derive various ranks and a distance matrix. The SOM algorithm uses this matrix as input to obtain clusters of agents. These clusters reduce the search space, resulting in a relatively short agent search time.展开更多
The fuzzy C-means clustering algorithm(FCM) to the fuzzy kernel C-means clustering algorithm(FKCM) to effectively perform cluster analysis on the diversiform structures are extended, such as non-hyperspherical data, d...The fuzzy C-means clustering algorithm(FCM) to the fuzzy kernel C-means clustering algorithm(FKCM) to effectively perform cluster analysis on the diversiform structures are extended, such as non-hyperspherical data, data with noise, data with mixture of heterogeneous cluster prototypes, asymmetric data, etc. Based on the Mercer kernel, FKCM clustering algorithm is derived from FCM algorithm united with kernel method. The results of experiments with the synthetic and real data show that the FKCM clustering algorithm is universality and can effectively unsupervised analyze datasets with variform structures in contrast to FCM algorithm. It is can be imagined that kernel-based clustering algorithm is one of important research direction of fuzzy clustering analysis.展开更多
Intuitionistic fuzzy set （IFS） is a set of 2-tuple arguments, each of which is characterized by a membership degree and a nonmembership degree. The generalized form of IFS is interval-valued intuitionistic fuzzy set...Intuitionistic fuzzy set （IFS） is a set of 2-tuple arguments, each of which is characterized by a membership degree and a nonmembership degree. The generalized form of IFS is interval-valued intuitionistic fuzzy set （IVIFS）, whose components are intervals rather than exact numbers. IFSs and IVIFSs have been found to be very useful to describe vagueness and uncertainty. However, it seems that little attention has been focused on the clustering analysis of IFSs and IVIFSs. An intuitionistic fuzzy hierarchical algorithm is introduced for clustering IFSs, which is based on the traditional hierarchical clustering procedure, the intuitionistic fuzzy aggregation operator, and the basic distance measures between IFSs： the Hamming distance, normalized Hamming, weighted Hamming, the Euclidean distance, the normalized Euclidean distance, and the weighted Euclidean distance. Subsequently, the algorithm is extended for clustering IVIFSs. Finally the algorithm and its extended form are applied to the classifications of building materials and enterprises respectively.展开更多
To improve the recognition rate of signal modulation recognition methods based on the clustering algorithm under the low SNR, a modulation recognition method is proposed. The characteristic parameter of the signal is ...To improve the recognition rate of signal modulation recognition methods based on the clustering algorithm under the low SNR, a modulation recognition method is proposed. The characteristic parameter of the signal is extracted by using a clustering algorithm, the neural network is trained by using the algorithm of variable gradient correction （Polak-Ribiere） so as to enhance the rate of convergence, improve the performance of recognition under the low SNR and realize modulation recognition of the signal based on the modulation system of the constellation diagram. Simulation results show that the recognition rate based on this algorithm is enhanced over 30% compared with the methods that adopt clustering algorithm or neural network based on the back propagation algorithm alone under the low SNR. The recognition rate can reach 90% when the SNR is 4 dB, and the method is easy to be achieved so that it has a broad application prospect in the modulating recognition.展开更多
The key challenge of the extended target probability hypothesis density (ET-PHD) filter is to reduce the computational complexity by using a subset to approximate the full set of partitions. In this paper, the influen...The key challenge of the extended target probability hypothesis density (ET-PHD) filter is to reduce the computational complexity by using a subset to approximate the full set of partitions. In this paper, the influence for the tracking results of different partitions is analyzed, and the form of the most informative partition is obtained. Then, a fast density peak-based clustering (FDPC) partitioning algorithm is applied to the measurement set partitioning. Since only one partition of the measurement set is used, the ET-PHD filter based on FDPC partitioning has lower computational complexity than the other ET-PHD filters. As FDPC partitioning is able to remove the spatially close clutter-generated measurements, the ET-PHD filter based on FDPC partitioning has good tracking performance in the scenario with more clutter-generated measurements. The simulation results show that the proposed algorithm can get the most informative partition and obviously reduce computational burden without losing tracking performance. As the number of clutter-generated measurements increased, the ET-PHD filter based on FDPC partitioning has better tracking performance than other ET-PHD filters. The FDPC algorithm will play an important role in the engineering realization of the multiple extended target tracking filter.展开更多
基金supported by the National Key Research and Development Program of China(2024YFB4504500)Shanghai Collaborative Innovation Project(24xtcx00500).
文摘Unmanned aerial vehicles(UAVs)have become one of the key technologies to achieve future data collection due to their high mobility,rapid deployment,low cost,and the ability to establish line-of-sight communication links.However,when UAV swarm perform tasks in narrow spaces,they often encounter various spatial obstacles,building shielding materials,and high-speed node movements,which result in intermittent network communication links and cannot support the smooth comple-tion of tasks.In this paper,a high mobility and dynamic topol-ogy of the UAV swarm is particularly considered and the high dynamic mobile topology-based clustering(HDMTC)algorithm is proposed.Simulation and real flight verification results verify that the proposed HDMTC algorithm achieves higher stability of net-work,longer link expiration time(LET),and longer node lifetime,all of which improve the communication performance for UAV swarm networks.
基金National Science Fund for Distinguished Young Scholars (40225004), The CAS Hundred Scholars Program.
文摘Aiming at the complexity of seismic gestation mechanism and spatial distribution, we hypothesize that the seismic data are composed of background earthquakes and anomaly earthquakes in a certain temporal-spatial scope. Also the background earthquakes and anomaly earthquakes both satisfy the 2-D Poisson process of different parameters respectively. In the paper, the concept of N-th order distance is introduced in order to transform 2-D superimposed Poisson process into 1-D mixture density function. On the basis of choosing the distance, mixture density function is decomposed to recognize the anomaly earthquakes through genetic algorithm. Combined with the temporal scanning of C value, the algorithm is applied to the recognition on spatial pattern of foreshock anomalies by exam-ples of Songpan and Longling sequences in the southwest of China.
基金supported by the National Natural Science Foundation of China(71671090)the Aeronautical Science Foundation of China(2016ZG52068)+1 种基金the Liberal Arts and Social Sciences Foundation of the Ministry of Education(MOE)in China(15YJCZH189)the Qinglan Project for Excellent Youth or Middle-aged Academic Leaders in Jiangsu Province
文摘The clustering evaluation can be used to scientifically classify the objects to be evaluated according to the information aggregation of various evaluation rules. In grey weighted clustering evaluation, the index clustering rule relies on the construction of the whitenization weight function, while the existing construction method of the linear function lacks the construction mechanism analysis and validity explanation. A normative construction principle is put forward by analyzing the construction mechanism of the function. Through proving the normative principle of the function,the basic modal function(BMF) is proposed and characterized by different function forms. Then, a new type of the whitenization weight function and its grey clustering evaluation model algorithm are given by studying the mechanism and nature of the construction of different forms of the function. Finally, the comparative study for self-innovation capability of defense science and technology industry(DSTI) is taken as an example. The results show that the different construction ways of the function have an effect on the clustering result. The proposed construction mechanism can better explain the index clustering rules and evaluation effectiveness,which will perfect the theoretical system of grey clustering evaluation and be applied to practice effectively.
文摘This paper proposes a suppression method of the deceptive false target(FT) produced by digital radio frequency memory(DRFM) in a multistatic radar system. The simulated deceptive false targets from DRFM cannot be easily discriminated and suppressed with traditional radar systems. Therefore, multistatic radar has attracted considerable interest as it provides improved performance against deception jamming due to several separated receivers. This paper first investigates the received signal model in the presence of multiple false targets in all receivers of the multistatic radar. Then, obtain the propagation time delays of the false targets based on the cross-correlation test of the received signals in different receivers. In doing so, local-density-based spatial clustering of applications with noise(LDBSCAN) is proposed to discriminate the FTs from the physical targets(PTs) after compensating the FTs time delays, where the FTs are approximately coincident with one position, while PTs possess small dispersion.Numerical simulations are carried out to demonstrate the feasibility and validness of the proposed method.
基金supported by the National Natural Science Foundation of China for Distinguished Young Scholars(70625005)
文摘Intuitionistic fuzzy sets(IFSs) are useful means to describe and deal with vague and uncertain data.An intuitionistic fuzzy C-means algorithm to cluster IFSs is developed.In each stage of the intuitionistic fuzzy C-means method the seeds are modified,and for each IFS a membership degree to each of the clusters is estimated.In the end of the algorithm,all the given IFSs are clustered according to the estimated membership degrees.Furthermore,the algorithm is extended for clustering interval-valued intuitionistic fuzzy sets(IVIFSs).Finally,the developed algorithms are illustrated through conducting experiments on both the real-world and simulated data sets.
基金supported by the National High Technology Research and Development Program of China(863 Program)(2007AA01Z404)the Funding of Jiangsu Provincial Innovation Program for Graduate Education(CXLX110206)
文摘The existing trajectory clustering （TRACLUS） is sensitive to the input parameters c and MinLns. The parameter value is changed a little, but cluster results are entirely different. Aiming at this vulnerability, a shielding parameters sensitivity trajectory cluster （SPSTC） algorithm is proposed which is insensitive to the input parameters. Firstly, some definitions about the core distance and reachable distance of line segment are presented, and then the algorithm generates cluster sorting according to the core dis- tance and reachable distance. Secondly, the reachable plots of line segment sets are constructed according to the cluster sorting and reachable distance. Thirdly, a parameterized sequence is extracted according to the reachable plot, and then the final trajectory cluster based on the parameterized sequence is acquired. The parameterized sequence represents the inner cluster structure of trajectory data. Experiments on real data sets and test data sets show that the SPSTC algorithm effectively reduces the sensitivity to the input parameters, meanwhile it can obtain the better quality of the trajectory cluster.
基金supported by the National Natural Science Fundation of China (60974082 60874085)+2 种基金the Fundamental Research Funds for the Central Universities (K50510700004)the Technology Plan Projects of Guangdong Province (20110401)the Team Project of Hanshan Normal University (LT201001)
文摘To avoid uneven energy consuming in wireless sen- sor networks, a clustering routing model is proposed based on a Bayesian game. In the model, Harsanyi transformation is introduced to convert a static game of incomplete information to the static game of complete but imperfect information. In addition, the existence of Bayesian nash equilibrium is proved. A clustering routing algorithm is also designed according to the proposed model, both cluster head distribution and residual energy are considered in the design of the algorithm. Simulation results show that the algorithm can balance network load, save energy and prolong network lifetime effectively.
基金the National Natural Science Foundation of China (60234030)the Natural Science Foundationof He’nan Educational Committee of China (2007520019, 2008B520015)Doctoral Foundation of Henan Polytechnic Universityof China (B050901, B2008-61)
文摘Feature extraction of range images provided by ranging sensor is a key issue of pattern recognition. To automatically extract the environmental feature sensed by a 2D ranging sensor laser scanner, an improved method based on genetic clustering VGA-clustering is presented. By integrating the spatial neighbouring information of range data into fuzzy clustering algorithm, a weighted fuzzy clustering algorithm （WFCA） instead of standard clustering algorithm is introduced to realize feature extraction of laser scanner. Aimed at the unknown clustering number in advance, several validation index functions are used to estimate the validity of different clustering algorithms and one validation index is selected as the fitness function of genetic algorithm so as to determine the accurate clustering number automatically. At the same time, an improved genetic algorithm IVGA on the basis of VGA is proposed to solve the local optimum of clustering algorithm, which is implemented by increasing the population diversity and improving the genetic operators of elitist rule to enhance the local search capacity and to quicken the convergence speed. By the comparison with other algorithms, the effectiveness of the algorithm introduced is demonstrated.
基金supported by the National Natural Science Foundation of China (708710157103100271171030)
文摘This paper introduces niching particle swarm optimiza- tion （nichePSO） into clustering analysis and puts forward a cluster- ing algorithm which uses nichePSO to optimize density functions. Firstly, this paper improves main swarm training models and in- creases their ability of space searching. Secondly, the radius of sub-swarms is defined adaptively according to the actual clus- tering problem, which can be useful for the niches＇ forming and searching. At last, a novel method that distributes samples to the corresponding cluster is proposed. Numerical results illustrate that this algorithm based on the density function and nichePSO could cluster unbalanced density datasets into the correct clusters auto- matically and accurately.
文摘In this paper, a Grey clustering method is applied to the evaluation research of sporting clothing style, the result shows that the methods proposed in the paper is feasible and effective.
基金the National Natural Science Foundation of China (60672061)
文摘Blind separation of sparse sources （BSSS） is discussed. The BSSS method based on the conventional K-means clustering is very fast and is also easy to implement. However, the accuracy of this method is generally not satisfactory. The contribution of the vector x（t） with different modules is theoretically proved to be unequal, and a weighted K-means clustering method is proposed on this grounds. The proposed algorithm is not only as fast as the conventional K-means clustering method, but can also achieve considerably accurate results, which is demonstrated by numerical experiments.
文摘Development of computational agent organizations or “societies” has become the domiant computing paradigm in the arena of Distributed Artificial Intelligence, and many foreseeable future applications need agent organizations, in which diversified agents cooperate in a distributed manner, forming teams. In such scenarios, the agents would need to know each other in order to facilitate the interactions. Moreover, agents in such an environment are not statically defined in advance but they can adaptively enter and leave an organization. This begs the question of how agents locate each other in order to cooperate in achieving organizational goals. Locating agents is a quite challenging task, especially in organizations that involve a large number of agents and where the resource avaiability is intermittent. The authors explore here an approach based on self organization map (SOM) which will serve as a clustering method in the light of the knowledge gathered about various agents. The approach begins by categorizing agents using a selected set of agent properties. These categories are used to derive various ranks and a distance matrix. The SOM algorithm uses this matrix as input to obtain clusters of agents. These clusters reduce the search space, resulting in a relatively short agent search time.
文摘The fuzzy C-means clustering algorithm(FCM) to the fuzzy kernel C-means clustering algorithm(FKCM) to effectively perform cluster analysis on the diversiform structures are extended, such as non-hyperspherical data, data with noise, data with mixture of heterogeneous cluster prototypes, asymmetric data, etc. Based on the Mercer kernel, FKCM clustering algorithm is derived from FCM algorithm united with kernel method. The results of experiments with the synthetic and real data show that the FKCM clustering algorithm is universality and can effectively unsupervised analyze datasets with variform structures in contrast to FCM algorithm. It is can be imagined that kernel-based clustering algorithm is one of important research direction of fuzzy clustering analysis.
基金supported by the National Natural Science Foundation of China (70571087)the National Science Fund for Distinguished Young Scholars of China (70625005)
文摘Intuitionistic fuzzy set （IFS） is a set of 2-tuple arguments, each of which is characterized by a membership degree and a nonmembership degree. The generalized form of IFS is interval-valued intuitionistic fuzzy set （IVIFS）, whose components are intervals rather than exact numbers. IFSs and IVIFSs have been found to be very useful to describe vagueness and uncertainty. However, it seems that little attention has been focused on the clustering analysis of IFSs and IVIFSs. An intuitionistic fuzzy hierarchical algorithm is introduced for clustering IFSs, which is based on the traditional hierarchical clustering procedure, the intuitionistic fuzzy aggregation operator, and the basic distance measures between IFSs： the Hamming distance, normalized Hamming, weighted Hamming, the Euclidean distance, the normalized Euclidean distance, and the weighted Euclidean distance. Subsequently, the algorithm is extended for clustering IVIFSs. Finally the algorithm and its extended form are applied to the classifications of building materials and enterprises respectively.
基金supported by the National Natural Science Foundation of China(6107207061301179)the National Science and Technology Major Project(2010ZX03006-002-04)
文摘To improve the recognition rate of signal modulation recognition methods based on the clustering algorithm under the low SNR, a modulation recognition method is proposed. The characteristic parameter of the signal is extracted by using a clustering algorithm, the neural network is trained by using the algorithm of variable gradient correction （Polak-Ribiere） so as to enhance the rate of convergence, improve the performance of recognition under the low SNR and realize modulation recognition of the signal based on the modulation system of the constellation diagram. Simulation results show that the recognition rate based on this algorithm is enhanced over 30% compared with the methods that adopt clustering algorithm or neural network based on the back propagation algorithm alone under the low SNR. The recognition rate can reach 90% when the SNR is 4 dB, and the method is easy to be achieved so that it has a broad application prospect in the modulating recognition.
基金supported by the National Natural Science Foundation of China(61401475)
文摘The key challenge of the extended target probability hypothesis density (ET-PHD) filter is to reduce the computational complexity by using a subset to approximate the full set of partitions. In this paper, the influence for the tracking results of different partitions is analyzed, and the form of the most informative partition is obtained. Then, a fast density peak-based clustering (FDPC) partitioning algorithm is applied to the measurement set partitioning. Since only one partition of the measurement set is used, the ET-PHD filter based on FDPC partitioning has lower computational complexity than the other ET-PHD filters. As FDPC partitioning is able to remove the spatially close clutter-generated measurements, the ET-PHD filter based on FDPC partitioning has good tracking performance in the scenario with more clutter-generated measurements. The simulation results show that the proposed algorithm can get the most informative partition and obviously reduce computational burden without losing tracking performance. As the number of clutter-generated measurements increased, the ET-PHD filter based on FDPC partitioning has better tracking performance than other ET-PHD filters. The FDPC algorithm will play an important role in the engineering realization of the multiple extended target tracking filter.
