A novel model of fuzzy clustering, i.e. an allied fuzzy c means （AFCM） model is proposed based on the combination of advantages of fuzzy c means （FCM） and possibilistic c means （PCM） clustering. PCM is sensitive...A novel model of fuzzy clustering, i.e. an allied fuzzy c means （AFCM） model is proposed based on the combination of advantages of fuzzy c means （FCM） and possibilistic c means （PCM） clustering. PCM is sensitive to initializations and often generates coincident clusters. AFCM overcomes this shortcoming and it is an ex tension of PCM. Membership and typicality values can be simultaneously produced in AFCM. Experimental re- suits show that noise data can be well processed, coincident clusters are avoided and clustering accuracy is better.展开更多
Partition-based clustering with weighted feature is developed in the framework of shadowed sets. The objects in the core and boundary regions, generated by shadowed sets-based clustering, have different impact on the ...Partition-based clustering with weighted feature is developed in the framework of shadowed sets. The objects in the core and boundary regions, generated by shadowed sets-based clustering, have different impact on the prototype of each cluster. By integrating feature weights, a formula for weight calculation is introduced to the clustering algorithm. The selection of weight exponent is crucial for good result and the weights are updated iteratively with each partition of clusters. The convergence of the weighted algorithms is given, and the feasible cluster validity indices of data mining application are utilized. Experimental results on both synthetic and real-life numerical data with different feature weights demonstrate that the weighted algorithm is better than the other unweighted algorithms.展开更多
The complex geometry and topology of soil is widely recognised as the key driver in many ecological processes. X-ray computed tomography (CT) provides insight into the internal structure of soil pores automatically an...The complex geometry and topology of soil is widely recognised as the key driver in many ecological processes. X-ray computed tomography (CT) provides insight into the internal structure of soil pores automatically and accurately. Until recently, there have not been methods to identify soil pore structures. This has restricted the development of soil science, particularly regarding pore geometry and spatial distribution. Through the adoption of the fuzzy clustering theory and the establishment of pore identification rules, a novel pore identification method is described to extract pore structures from CT soil images. The robustness of the adaptive fuzzy C-means method (AFCM), the adaptive threshold method, and Image-Pro Plus tools were compared on soil specimens under different conditions, such as frozen, saturated, and dry situations. The results demonstrate that the AFCM method is suitable for identifying pore clusters, especially tiny pores, under various soil conditions. The method would provide an optional technique for the study of soil micromorphology.展开更多
A fast and effective fuzzy clustering algorithm is proposed. The algorithm splits an image into n × n blocks, and uses block variance to judge whether the block region is homogeneous. Mean and center pixel of eac...A fast and effective fuzzy clustering algorithm is proposed. The algorithm splits an image into n × n blocks, and uses block variance to judge whether the block region is homogeneous. Mean and center pixel of each homogeneous block are extracted for feature. Each inhomogeneous block is split into separate pixels and the mean of neighboring pixels within a window around each pixel and pixel value are extracted for feature. Then cluster of homogeneous blocks and cluster of separate pixels from inhomogeneous blocks are carried out respectively according to different membership functions. In fuzzy clustering stage, the center pixel and center number of the initial clustering are calculated based on histogram by using mean feature. Then different membership functions according to comparative result of block variance are computed. Finally, modified fuzzy c-means with spatial information to complete image segmentation axe used. Experimental results show that the proposed method can achieve better segmental results and has shorter executive time than many well-known methods.展开更多
Wind farm power prediction is proposed based on adaptive feature weight entropy fuzzy clustering algorithm.According to the fuzzy clustering method,a large number of historical data of a wind farm in Inner Mongolia ar...Wind farm power prediction is proposed based on adaptive feature weight entropy fuzzy clustering algorithm.According to the fuzzy clustering method,a large number of historical data of a wind farm in Inner Mongolia are analyzed and classified.Model of adaptive entropy weight for clustering is built.Wind power prediction model based on adaptive entropy fuzzy clustering feature weights is built.Simulation results show that the proposed method could distinguish the abnormal data and forecast more accurately and compute fastly.展开更多
The premise and basis of load modeling are substation load composition inquiries and cluster analyses.However,the traditional kernel fuzzy C-means(KFCM)algorithm is limited by artificial clustering number selection an...The premise and basis of load modeling are substation load composition inquiries and cluster analyses.However,the traditional kernel fuzzy C-means(KFCM)algorithm is limited by artificial clustering number selection and its convergence to local optimal solutions.To overcome these limitations,an improved KFCM algorithm with adaptive optimal clustering number selection is proposed in this paper.This algorithm optimizes the KFCM algorithm by combining the powerful global search ability of genetic algorithm and the robust local search ability of simulated annealing algorithm.The improved KFCM algorithm adaptively determines the ideal number of clusters using the clustering evaluation index ratio.Compared with the traditional KFCM algorithm,the enhanced KFCM algorithm has robust clustering and comprehensive abilities,enabling the efficient convergence to the global optimal solution.展开更多
In recent years, microarray technology has been widely applied in biological and clinical studies for simultaneous monitoring of gene expression in thousands of genes. Gene clustering analysis is found useful for disc...In recent years, microarray technology has been widely applied in biological and clinical studies for simultaneous monitoring of gene expression in thousands of genes. Gene clustering analysis is found useful for discovering groups of correlated genes potentially co-regulated or associated to the disease or conditions under investigation. Many clustering methods including k-means, fuzzy c-means, and hierarchical clustering have been widely used in literatures. Yet no comprehensive comparative study has been performed to evaluate the effectiveness of these methods, specially, in yeast saccharomyces cerevisiae. In this paper, these three gene clustering methods are compared. Classification accuracy and CPU time cost are employed for measuring performance of these algorithms. Our results show that hierarchical clustering outperforms k-means and fuzzy c-means clustering. The analysis provides deep insight to the complicated gene clustering problem of expression profile and serves as a practical guideline for routine microarray cluster analysis of gene expression.展开更多
To guarantee the accuracy and real-time of the 3D reconstruction method for outdoor scene,an algorithm based on region segmentation and matching was proposed.Firstly,on the basis of morphological gradient information,...To guarantee the accuracy and real-time of the 3D reconstruction method for outdoor scene,an algorithm based on region segmentation and matching was proposed.Firstly,on the basis of morphological gradient information,obtained by comparing color weight gradient images and proposing a multi-threshold segmentation,scene contour features were extracted by a watershed algorithm and a fuzzy c-means clustering algorithm.Secondly,to reduce the search area,increase the correct matching ratio and accelerate the matching speed,the region constraint was established according to a region＇s local position,area and gray characteristics,the edge pixel constraint was established according to the epipolar constraint and the continuity constraint.Finally,by using the stereo matching edge pixel pairs,their 3D coordinates were estimated according to the binocular stereo vision imaging model.Experimental results show that the proposed method can yield a high stereo matching ratio and reconstruct a 3D scene quickly and efficiently.展开更多
For a semi-supervised classification system, with the increase of the training samples number, the system needs to be continually updated. As the size of samples set is increasing, many unreliable samples will also be...For a semi-supervised classification system, with the increase of the training samples number, the system needs to be continually updated. As the size of samples set is increasing, many unreliable samples will also be increased. In this paper, we use fuzzy c-means （FCM） clustering to take out some samples that are useless, and extract the intersection between the original training set and the cluster after using FCM clustering. The intersection between every class and cluster is reliable samples which we are looking for. The experiment result demonstrates that the superiority of the proposed algorithm is remarkable.展开更多
文摘A novel model of fuzzy clustering, i.e. an allied fuzzy c means （AFCM） model is proposed based on the combination of advantages of fuzzy c means （FCM） and possibilistic c means （PCM） clustering. PCM is sensitive to initializations and often generates coincident clusters. AFCM overcomes this shortcoming and it is an ex tension of PCM. Membership and typicality values can be simultaneously produced in AFCM. Experimental re- suits show that noise data can be well processed, coincident clusters are avoided and clustering accuracy is better.
基金Supported by the National Natural Science Foundation of China(61139002)~~
文摘Partition-based clustering with weighted feature is developed in the framework of shadowed sets. The objects in the core and boundary regions, generated by shadowed sets-based clustering, have different impact on the prototype of each cluster. By integrating feature weights, a formula for weight calculation is introduced to the clustering algorithm. The selection of weight exponent is crucial for good result and the weights are updated iteratively with each partition of clusters. The convergence of the weighted algorithms is given, and the feasible cluster validity indices of data mining application are utilized. Experimental results on both synthetic and real-life numerical data with different feature weights demonstrate that the weighted algorithm is better than the other unweighted algorithms.
基金supported by the National Natural Science Youth Foundation of China(No.41501283)the Fundamental Research Funds for the Central Universities(2015ZCQGX-04)
文摘The complex geometry and topology of soil is widely recognised as the key driver in many ecological processes. X-ray computed tomography (CT) provides insight into the internal structure of soil pores automatically and accurately. Until recently, there have not been methods to identify soil pore structures. This has restricted the development of soil science, particularly regarding pore geometry and spatial distribution. Through the adoption of the fuzzy clustering theory and the establishment of pore identification rules, a novel pore identification method is described to extract pore structures from CT soil images. The robustness of the adaptive fuzzy C-means method (AFCM), the adaptive threshold method, and Image-Pro Plus tools were compared on soil specimens under different conditions, such as frozen, saturated, and dry situations. The results demonstrate that the AFCM method is suitable for identifying pore clusters, especially tiny pores, under various soil conditions. The method would provide an optional technique for the study of soil micromorphology.
文摘A fast and effective fuzzy clustering algorithm is proposed. The algorithm splits an image into n × n blocks, and uses block variance to judge whether the block region is homogeneous. Mean and center pixel of each homogeneous block are extracted for feature. Each inhomogeneous block is split into separate pixels and the mean of neighboring pixels within a window around each pixel and pixel value are extracted for feature. Then cluster of homogeneous blocks and cluster of separate pixels from inhomogeneous blocks are carried out respectively according to different membership functions. In fuzzy clustering stage, the center pixel and center number of the initial clustering are calculated based on histogram by using mean feature. Then different membership functions according to comparative result of block variance are computed. Finally, modified fuzzy c-means with spatial information to complete image segmentation axe used. Experimental results show that the proposed method can achieve better segmental results and has shorter executive time than many well-known methods.
基金supported by the Natural Science Foundation of China under contact(61233007)
文摘Wind farm power prediction is proposed based on adaptive feature weight entropy fuzzy clustering algorithm.According to the fuzzy clustering method,a large number of historical data of a wind farm in Inner Mongolia are analyzed and classified.Model of adaptive entropy weight for clustering is built.Wind power prediction model based on adaptive entropy fuzzy clustering feature weights is built.Simulation results show that the proposed method could distinguish the abnormal data and forecast more accurately and compute fastly.
基金supported by the Planning Special Project of Guangdong Power Grid Co.,Ltd.:“Study on load modeling based on total measurement and discrimination method suitable for system characteristic analysis and calculation during the implementation of target grid in Guangdong power grid”(0319002022030203JF00023).
文摘The premise and basis of load modeling are substation load composition inquiries and cluster analyses.However,the traditional kernel fuzzy C-means(KFCM)algorithm is limited by artificial clustering number selection and its convergence to local optimal solutions.To overcome these limitations,an improved KFCM algorithm with adaptive optimal clustering number selection is proposed in this paper.This algorithm optimizes the KFCM algorithm by combining the powerful global search ability of genetic algorithm and the robust local search ability of simulated annealing algorithm.The improved KFCM algorithm adaptively determines the ideal number of clusters using the clustering evaluation index ratio.Compared with the traditional KFCM algorithm,the enhanced KFCM algorithm has robust clustering and comprehensive abilities,enabling the efficient convergence to the global optimal solution.
基金supported by the National Natural Science Foundation of China under Grant No. 30525030,60701015, and 60736029
文摘In recent years, microarray technology has been widely applied in biological and clinical studies for simultaneous monitoring of gene expression in thousands of genes. Gene clustering analysis is found useful for discovering groups of correlated genes potentially co-regulated or associated to the disease or conditions under investigation. Many clustering methods including k-means, fuzzy c-means, and hierarchical clustering have been widely used in literatures. Yet no comprehensive comparative study has been performed to evaluate the effectiveness of these methods, specially, in yeast saccharomyces cerevisiae. In this paper, these three gene clustering methods are compared. Classification accuracy and CPU time cost are employed for measuring performance of these algorithms. Our results show that hierarchical clustering outperforms k-means and fuzzy c-means clustering. The analysis provides deep insight to the complicated gene clustering problem of expression profile and serves as a practical guideline for routine microarray cluster analysis of gene expression.
基金Supported by the Ministerial Level Advanced Research Foundation(40401060305)
文摘To guarantee the accuracy and real-time of the 3D reconstruction method for outdoor scene,an algorithm based on region segmentation and matching was proposed.Firstly,on the basis of morphological gradient information,obtained by comparing color weight gradient images and proposing a multi-threshold segmentation,scene contour features were extracted by a watershed algorithm and a fuzzy c-means clustering algorithm.Secondly,to reduce the search area,increase the correct matching ratio and accelerate the matching speed,the region constraint was established according to a region＇s local position,area and gray characteristics,the edge pixel constraint was established according to the epipolar constraint and the continuity constraint.Finally,by using the stereo matching edge pixel pairs,their 3D coordinates were estimated according to the binocular stereo vision imaging model.Experimental results show that the proposed method can yield a high stereo matching ratio and reconstruct a 3D scene quickly and efficiently.
基金supported by the National Natural Science Foundation under Grant No.61175055 and No.61105059support of research funds of Sichuan Key Laboratory of Intelligent Network Information Processing under Grant No.SGXZD1002-10Si chuan Key Technology Research and Development Program under Grant No.2012GZ0019 and No.2011FZ0051
文摘For a semi-supervised classification system, with the increase of the training samples number, the system needs to be continually updated. As the size of samples set is increasing, many unreliable samples will also be increased. In this paper, we use fuzzy c-means （FCM） clustering to take out some samples that are useless, and extract the intersection between the original training set and the cluster after using FCM clustering. The intersection between every class and cluster is reliable samples which we are looking for. The experiment result demonstrates that the superiority of the proposed algorithm is remarkable.
