To enhance the clustering ability of self-organization network, this paper introduces a quantum inspired self-organization clustering algorithm. First, the clustering samples and the weight values in the competitive l...To enhance the clustering ability of self-organization network, this paper introduces a quantum inspired self-organization clustering algorithm. First, the clustering samples and the weight values in the competitive layer are mapped to the qubits on the Bloch sphere, and then, the winning node is obtained by computing the spherical distance between sample and weight value. Finally, the weight values of the winning nodes and its neighborhood are updated by rotating them to the sample on the Bloch sphere until the convergence. The clustering results of IRIS sample show that the proposed approach is obviously superior to the classical self-organization network and the K-mean clustering algorithm.展开更多
Wireless sensor networks consist of hundreds or thousands of sensor nodes that involve numerous restrictions in-cluding computation capability and battery capacity.Topology control is an important issue for achieving ...Wireless sensor networks consist of hundreds or thousands of sensor nodes that involve numerous restrictions in-cluding computation capability and battery capacity.Topology control is an important issue for achieving a balanced placement of sensor nodes.The clustering scheme is a widely known and efficient means of topology control for transmitting information to the base station in two hops.The automatic routing scheme of the self-organizing technique is another critical element of wireless sensor networks.In this paper we propose an optimal algorithm with cluster balance taken into consideration,and compare it with three well known and widely used approaches,i.e.,LEACH,MEER,and VAP-E,in performance evaluation.Experimental results show that the proposed approach increases the overall network lifetime,indicating that the amount of energy required for com-munication to the base station will be reduced for locating an optimal cluster.展开更多
In this paper, the authors present three different algorithms for data clustering. These are Self-Organizing Map （SOM）, Neural Gas （NG） and Fuzzy C-Means （FCM） algorithms. SOM and NG algorithms are based on comp...In this paper, the authors present three different algorithms for data clustering. These are Self-Organizing Map （SOM）, Neural Gas （NG） and Fuzzy C-Means （FCM） algorithms. SOM and NG algorithms are based on competitive leaming. An important property of these algorithms is that they preserve the topological structure of data. This means that data that is close in input distribution is mapped to nearby locations in the network. The FCM algorithm is an algorithm based on soft clustering which means that the different clusters are not necessarily distinct, but may overlap. This clustering method may be very useful in many biological problems, for instance in genetics, where a gene may belong to different clusters. The different algorithms are compared in terms of their visualization of the clustering of proteomic data.展开更多
提出了一种基于DI-FCM(double indices fuzzy C-means)算法框架的无监督距离学习算法——基于混合距离学习的双指数模糊C均值算法HDDI-FCM(double indices fuzzy C-m eans with hybrid distance).数据集未知距离度量被表示为若干已有距...提出了一种基于DI-FCM(double indices fuzzy C-means)算法框架的无监督距离学习算法——基于混合距离学习的双指数模糊C均值算法HDDI-FCM(double indices fuzzy C-m eans with hybrid distance).数据集未知距离度量被表示为若干已有距离的线性组合,然后执行HDDI-FCM,在对数据集进行有效聚类的同时进行距离学习.为了保证迭代算法收敛,引入了Steffensen迭代法来改进计算簇中心点的迭代公式.讨论了算法中参数的选择.基于UCI(University of California,Irvine)数据集的实验结果表明该算法是有效的.展开更多
文摘To enhance the clustering ability of self-organization network, this paper introduces a quantum inspired self-organization clustering algorithm. First, the clustering samples and the weight values in the competitive layer are mapped to the qubits on the Bloch sphere, and then, the winning node is obtained by computing the spherical distance between sample and weight value. Finally, the weight values of the winning nodes and its neighborhood are updated by rotating them to the sample on the Bloch sphere until the convergence. The clustering results of IRIS sample show that the proposed approach is obviously superior to the classical self-organization network and the K-mean clustering algorithm.
基金supported by the Chung-Ang University Research Scholarship Grants,Korea
文摘Wireless sensor networks consist of hundreds or thousands of sensor nodes that involve numerous restrictions in-cluding computation capability and battery capacity.Topology control is an important issue for achieving a balanced placement of sensor nodes.The clustering scheme is a widely known and efficient means of topology control for transmitting information to the base station in two hops.The automatic routing scheme of the self-organizing technique is another critical element of wireless sensor networks.In this paper we propose an optimal algorithm with cluster balance taken into consideration,and compare it with three well known and widely used approaches,i.e.,LEACH,MEER,and VAP-E,in performance evaluation.Experimental results show that the proposed approach increases the overall network lifetime,indicating that the amount of energy required for com-munication to the base station will be reduced for locating an optimal cluster.
文摘In this paper, the authors present three different algorithms for data clustering. These are Self-Organizing Map （SOM）, Neural Gas （NG） and Fuzzy C-Means （FCM） algorithms. SOM and NG algorithms are based on competitive leaming. An important property of these algorithms is that they preserve the topological structure of data. This means that data that is close in input distribution is mapped to nearby locations in the network. The FCM algorithm is an algorithm based on soft clustering which means that the different clusters are not necessarily distinct, but may overlap. This clustering method may be very useful in many biological problems, for instance in genetics, where a gene may belong to different clusters. The different algorithms are compared in terms of their visualization of the clustering of proteomic data.
文摘提出了一种基于DI-FCM(double indices fuzzy C-means)算法框架的无监督距离学习算法——基于混合距离学习的双指数模糊C均值算法HDDI-FCM(double indices fuzzy C-m eans with hybrid distance).数据集未知距离度量被表示为若干已有距离的线性组合,然后执行HDDI-FCM,在对数据集进行有效聚类的同时进行距离学习.为了保证迭代算法收敛,引入了Steffensen迭代法来改进计算簇中心点的迭代公式.讨论了算法中参数的选择.基于UCI(University of California,Irvine)数据集的实验结果表明该算法是有效的.
