Global Optimization Method Using SLE and Adaptive RBF Based on Fuzzy Clustering

High fidelity analysis models,which are beneficial to improving the design quality,have been more and more widely utilized in the modern engineering design optimization problems.However,the high fidelity analysis models are so computationally expensive that the time required in design optimization is usually unacceptable.In order to improve the efficiency of optimization involving high fidelity analysis models,the optimization efficiency can be upgraded through applying surrogates to approximate the computationally expensive models,which can greately reduce the computation time.An efficient heuristic global optimization method using adaptive radial basis function（RBF） based on fuzzy clustering（ARFC） is proposed.In this method,a novel algorithm of maximin Latin hypercube design using successive local enumeration（SLE） is employed to obtain sample points with good performance in both space-filling and projective uniformity properties,which does a great deal of good to metamodels accuracy.RBF method is adopted for constructing the metamodels,and with the increasing the number of sample points the approximation accuracy of RBF is gradually enhanced.The fuzzy c-means clustering method is applied to identify the reduced attractive regions in the original design space.The numerical benchmark examples are used for validating the performance of ARFC.The results demonstrates that for most application examples the global optima are effectively obtained and comparison with adaptive response surface method（ARSM） proves that the proposed method can intuitively capture promising design regions and can efficiently identify the global or near-global design optimum.This method improves the efficiency and global convergence of the optimization problems,and gives a new optimization strategy for engineering design optimization problems involving computationally expensive models.

Geochemical and Geostatistical Studies for Estimating Gold Grade in Tarq Prospect Area by K-Means Clustering Method

Tarq geochemical 1:100,000 Sheet is located in Isfahan province which is investigated by Iran’s Geological and Explorations Organization using stream sediment analyzes. This area has stratigraphy of Precambrian to Quaternary rocks and is located in the Central Iran zone. According to the presence of signs of gold mineralization in this area, it is necessary to identify important mineral areas in this area. Therefore, finding information is necessary about the relationship and monitoring the elements of gold, arsenic, and antimony relative to each other in this area to determine the extent of geochemical halos and to estimate the grade. Therefore, a well-known and useful K-means method is used for monitoring the elements in the present study, this is a clustering method based on minimizing the total Euclidean distances of each sample from the center of the classes which are assigned to them. In this research, the clustering quality function and the utility rate of the sample have been used in the desired cluster (S(i)) to determine the optimum number of clusters. Finally, with regard to the cluster centers and the results, the equations were used to predict the amount of the gold element based on four parameters of arsenic and antimony grade, length and width of sampling points.

Kernel method-based fuzzy clustering algorithm

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.

Refracturing candidate selection for MFHWs in tight oil and gas reservoirs using hybrid method with data analysis techniques and fuzzy clustering

The selection of refracturing candidate is one of the most important jobs faced by oilfield engineers. However, due to the complicated multi-parameter relationships and their comprehensive influence, the selection of refracturing candidate is often very difficult. In this paper, a novel approach combining data analysis techniques and fuzzy clustering was proposed to select refracturing candidate. First, the analysis techniques were used to quantitatively calculate the weight coefficient and determine the key factors. Then, the idealized refracturing well was established by considering the main factors. Fuzzy clustering was applied to evaluate refracturing potential. Finally, reservoirs numerical simulation was used to further evaluate reservoirs energy and material basis of the optimum refracturing candidates. The hybrid method has been successfully applied to a tight oil reservoir in China. The average steady production was 15.8 t/d after refracturing treatment, increasing significantly compared with previous status. The research results can guide the development of tight oil and gas reservoirs effectively.

3D Model Retrieval Method Based on Affinity Propagation Clustering

In order to improve the accuracy and efficiency of 3D model retrieval,the method based on affinity propagation clustering algorithm is proposed. Firstly,projection ray-based method is proposed to improve the feature extraction efficiency of 3D models. Based on the relationship between model and its projection,the intersection in 3D space is transformed into intersection in 2D space,which reduces the number of intersection and improves the efficiency of the extraction algorithm. In feature extraction,multi-layer spheres method is analyzed. The two-layer spheres method makes the feature vector more accurate and improves retrieval precision. Secondly,Semi-supervised Affinity Propagation ( S-AP) clustering is utilized because it can be applied to different cluster structures. The S-AP algorithm is adopted to find the center models and then the center model collection is built. During retrieval process,the collection is utilized to classify the query model into corresponding model base and then the most similar model is retrieved in the model base. Finally,75 sample models from Princeton library are selected to do the experiment and then 36 models are used for retrieval test. The results validate that the proposed method outperforms the original method and the retrieval precision and recall ratios are improved effectively.

Research on entropy weight variation evaluation method for wind power clusters based on dynamic layered sorting

This paper presents an evaluation method for the entropy-weighting of wind power clusters that comprehensively evaluates the allocation problems of wind power clusters by considering the correlation between indicators and the dynamic performance of weight changes.A dynamic layered sorting allocation method is also proposed.The proposed evaluation method considers the power-limiting degree of the last cycle,the adjustment margin,and volatility.It uses the theory of weight variation to update the entropy weight coefficients of each indicator in real time,and then performs a fuzzy evaluation based on the membership function to obtain intuitive comprehensive evaluation results.A case study of a large-scale wind power base in Northwest China was conducted.The proposed evaluation method is compared with fixed-weight entropy and principal component analysis methods.The results show that the three scoring trends are the same,and that the proposed evaluation method is closer to the average level of the latter two,demonstrating higher accuracy.The proposed allocation method can reduce the number of adjustments made to wind farms,which is significant for the allocation and evaluation of wind power clusters.

Reconstructing bubble profiles from gas-liquid two-phase flow data using agglomerative hierarchical clustering method

The knowledge of bubble profiles in gas-liquid two-phase flows is crucial for analyzing the kinetic processes such as heat and mass transfer, and this knowledge is contained in field data obtained by surface-resolved computational fluid dynamics (CFD) simulations. To obtain this information, an efficient bubble profile reconstruction method based on an improved agglomerative hierarchical clustering (AHC) algorithm is proposed in this paper. The reconstruction method is featured by the implementations of a binary space division preprocessing, which aims to reduce the computational complexity, an adaptive linkage criterion, which guarantees the applicability of the AHC algorithm when dealing with datasets involving either non-uniform or distorted grids, and a stepwise execution strategy, which enables the separation of attached bubbles. To illustrate and verify this method, it was applied to dealing with 3 datasets, 2 of them with pre-specified spherical bubbles and the other obtained by a surface-resolved CFD simulation. Application results indicate that the proposed method is effective even when the data include some non-uniform and distortion.

An unsupervised clustering method for nuclear magnetic resonance transverse relaxation spectrums based on the Gaussian mixture model and its application

To make the quantitative results of nuclear magnetic resonance(NMR) transverse relaxation(T;) spectrums reflect the type and pore structure of reservoir more directly, an unsupervised clustering method was developed to obtain the quantitative pore structure information from the NMR T;spectrums based on the Gaussian mixture model(GMM). Firstly, We conducted the principal component analysis on T;spectrums in order to reduce the dimension data and the dependence of the original variables. Secondly, the dimension-reduced data was fitted using the GMM probability density function, and the model parameters and optimal clustering numbers were obtained according to the expectation-maximization algorithm and the change of the Akaike information criterion. Finally, the T;spectrum features and pore structure types of different clustering groups were analyzed and compared with T;geometric mean and T;arithmetic mean. The effectiveness of the algorithm has been verified by numerical simulation and field NMR logging data. The research shows that the clustering results based on GMM method have good correlations with the shape and distribution of the T;spectrum, pore structure, and petroleum productivity, providing a new means for quantitative identification of pore structure, reservoir grading, and oil and gas productivity evaluation.

APPLICATION OF THE CLUSTERING METHOD IN ANALYSING SHALLOW WATER MASSES AND MODIFIED WATER MASSES IN THE HUANGHAI SEA AND EAST CHINA SEA

The idea of modified water masses is introduced and a cluster analysis is used for determining the boundary of modified water masses and its variety in the shallow water area of the Huanghai Sea (Yellow Sea) and the East China Sea. According to the specified standards to make the cluster, we have determined the number and boundary of the water masses and the mixed zones.The results obtained by the cluster method show that there are eight modified water masses in this area. According to the relative index of temperature and salinity,the modified water masses are divided into nine different characteristic parts. The water, masses may also be divided into three salinity types. On the TS-Diagram, the points concerning temperature and safinity of different modified mater masses are distributed around a curve, from which the characteristics of gradual modification may be embodied. The variation ranges of different modified water masses are all large, explaining the intensive modification of water masses in

Modified possibilistic clustering model based on kernel methods

A novel model of fuzzy clustering using kernel methods is proposed. This model is called kernel modified possibilistic c-means （KMPCM） model. The proposed model is an extension of the modified possibilistic c-means （MPCM） algorithm by using kernel methods. Different from MPCM and fuzzy c-means （FCM） model which are based on Euclidean distance, the proposed model is based on kernel-induced distance. Furthermore, with kernel methods the input data can be mapped implicitly into a high-dimensional feature space where the nonlinear pattern now appears linear. It is unnecessary to do calculation in the high-dimensional feature space because the kernel function can do it. Numerical experiments show that KMPCM outperforms FCM and MPCM.

A bottom-up method for module-based product platform development through mapping,clustering and matching analysis

Designing product platform could be an effective and efficient solution for manufacturing firms. Product platforms enable firms to provide increased product variety for the marketplace with as little variety between products as possible. Developed consumer products and modules within a firm can further be investigated to find out the possibility of product platform creation. A bottom-up method is proposed for module-based product platform through mapping, clustering and matching analysis. The framework and the parametric model of the method are presented, which consist of three steps:(1) mapping parameters from existing product families to functional modules,(2) clustering the modules within existing module families based on their parameters so as to generate module clusters, and selecting the satisfactory module clusters based on commonality, and(3) matching the parameters of the module clusters to the functional modules in order to capture platform elements. In addition, the parameter matching criterion and mismatching treatment are put forward to ensure the effectiveness of the platform process, while standardization and serialization of the platform element are presented. A design case of the belt conveyor is studied to demonstrate the feasibility of the proposed method.

A Research on Competitiveness of Guangxi City——Based on System Clustering Method and Principal Component Analysis Method

A total of 10 indices of regional economic development in Guangxi are selected.According to the relevant economic data,regional economic development in Guangxi is analyzed by using System Clustering Method and Principal Component Analysis Method.Result shows that System Clustering Method and Principal Component Analysis Method have revealed similar results analysis of economic development level.Overall economic strength of Guangxi is weak and Nanning has relatively high scores of factors due to its advantage of the political,economic and cultural center.Comprehensive scores of other regions are all lower than 1,which has big gap with the development of Nanning.Overall development strategy points out that Guangxi should accelerate the construction of the Ring Northern Bay Economic Zone,create a strong logistics system having strategic significance to national development,use the unique location advantage and rely on the modern transportation system to establish a logistics center and business center connecting the hinterland and the Asean Market.Based on the problems of unbalanced regional economic development in Guangxi,we should speed up the development of service industry in Nanning,construct the circular economy system of industrial city,and accelerate the industrialization process of tourism city in order to realize balanced development of regional economy in Guangxi,China.

Coarse-Graining Method Based on Hierarchical Clustering on Complex Networks

With the rapid development of big data, the scale of realistic networks is increasing continually. In order to reduce the network scale, some coarse-graining methods are proposed to transform large-scale networks into mesoscale networks. In this paper, a new coarse-graining method based on hierarchical clustering (HCCG) on complex networks is proposed. The network nodes are grouped by using the hierarchical clustering method, then updating the weights of edges between clusters extract the coarse-grained networks. A large number of simulation experiments on several typical complex networks show that the HCCG method can effectively reduce the network scale, meanwhile maintaining the synchronizability of the original network well. Furthermore, this method is more suitable for these networks with obvious clustering structure, and we can choose freely the size of the coarse-grained networks in the proposed method.

A multi-view K-multiple-means clustering method

The K-multiple-means(KMM)retains the simple and efficient advantages of the K-means algorithm by setting multiple subclasses,and improves its effect on non-convex data sets.And aiming at the problem that it cannot be applied to the Internet on a multi-view data set,a multi-view K-multiple-means(MKMM)clustering method is proposed in this paper.The new algorithm introduces view weight parameter,reserves the design of setting multiple subclasses,makes the number of clusters as constraint and obtains clusters by solving optimization problem.The new algorithm is compared with some popular multi-view clustering algorithms.The effectiveness of the new algorithm is proved through the analysis of the experimental results.

Application of Systematic Clustering Method in the Classification and Changes of Atmospheric Ozone in Hunan Province

The cluster analysis method needs continuous improvement and perfection in the research and application of the spatial differentiation and change of pollutants.In this paper,the date of monthly highest concentration of ozone(O_(3))and the concentration value of that day were selected as the similarity coefficient between classes.Single-factor cluster analysis was performed on O_(3)during 2016-2019 and the COVID-19 outbreak of 2020 in Hunan Province using the Ward method.The clustering results showed that the spatial distribution of atmospheric O_(3)in the 14 regions of Hunan Province was most suitable to be classified according to class III clustering areas.That is,the Changsha-Zhuzhou-Xiangtan urban agglomeration was the center,and the high-value area was in northern Hunan.The transition area was in central and southern Hunan,while the low-value area was centered in western Hunan.The partition results were in good agreement with the homogeneous subset of one-way ANOVA and the distribution of monitoring values during the same period.The comparison showed that the inter-class plates in the two periods corresponded well,and the intra-class area showed a continuous geographical distribution,and there were dynamic changes in the spatial differentiation of the O_(3)plates in different periods.In 2020,the center of the O_(3)high-value area plate in Hunan Province moved eastward and extended southward,focusing on the middle and lower reaches of the Xiangjiang River basin,and extending to the upstream area;the regional plate in the transition area expanded significantly;the low-value area plate shrank to the two cities in western Hunan.The abnormal emissions and abnormal climate during the COVID-19 epidemic had an impact on the spatial differentiation of O_(3)in Hunan Province.

Clustering Network Topology Control Method Based on Responsibility Transmission

The topology control is an effective approach which can improve the quality of wireless sensor network at all sides. Through studying the mechanism of sensor network data transmission, the nature of data transmission in wireless sensor network is concluded as a kind of responsibility transmission. By redefining the responsibility and availability of nodes, the strategy for cluster head selection is studied, the responsibility and availability is determined by the combination of the residual energy, location and current flow of nodes. Based on the above, new clustering network topology control algorithm based on responsibility transmission CNTCABRT and hierarchical multi-hop CNTCABRT is presented in this paper, whose algorithm structure is along the famous LEACH algorithm. Experimental result demonstrates its promising performance over the famous LEACH algorithm in the cluster head selection, the size of cluster, the deployment of nodes and the lifetime of nodes, and several innovative conclusions are proposed finally.

A Clustering Method Based on Brain Storm Optimization Algorithm

In the field of data mining and machine learning,clustering is a typical issue which has been widely studied by many researchers,and lots of effective algorithms have been proposed,including K-means,fuzzy c-means(FCM)and DBSCAN.However,the traditional clustering methods are easily trapped into local optimum.Thus,many evolutionary-based clustering methods have been investigated.Considering the effectiveness of brain storm optimization(BSO)in increasing the diversity while the diversity optimization is performed,in this paper,we propose a new clustering model based on BSO to use the global ability of BSO.In our experiment,we apply the novel binary model to solve the problem.During the period of processing data,BSO was mainly utilized for iteration.Also,in the process of K-means,we set the more appropriate parameters selected to match it greatly.Four datasets were used in our experiment.In our model,BSO was first introduced in solving the clustering problem.With the algorithm running on each dataset repeatedly,our experimental results have obtained good convergence and diversity.In addition,by comparing the results with other clustering models,the BSO clustering model also guarantees high accuracy.Therefore,from many aspects,the simulation results show that the model of this paper has good performance.

A Review on Clustering Methods for Climatology Analysis and Its Application over South America

South America’s climatic diversity is a product of its vast geographical expanse, encompassing tropical to subtropical latitudes. The variations in precipitation and temperature across the region stem from the influence of distinct atmospheric systems. While some studies have characterized the prevailing systems over South America, they often lacked the utilization of statistical techniques for homogenization. On the other hand, other research has employed multivariate statistical methods to identify homogeneous regions regarding temperature and precipitation, but their focus has been limited to specific areas, such as the south, southeast, and northeast. Surprisingly, there is a lack of work that compares various multivariate statistical techniques to determine homogeneous regions across the entirety of South America concerning temperature and precipitation. This paper aims to address this gap by comparing three such techniques: Cluster Analysis (K-means and Ward) and Self Organizing Maps, using data from different sources for temperature (ERA5, ERA5-Land, and CRU) and precipitation (ERA5, ERA5-Land, and CPC). Spatial patterns and time series were generated for each region over the period 1981-2010. The results from this analysis of spatially homogeneous regions concerning temperature and precipitation have the potential to significantly benefit climate analysis and forecasts. Moreover, they can offer valuable insights for various climatological studies, guiding decision-making processes in diverse fields that rely on climate information, such as agriculture, disaster management, and water resources planning.

TWO IMPROVED GRAPH-THEORETICAL CLUSTERING ALGORITHMS

Graph-theoretical approaches have been widely used for data clustering and image segmentation recently. The goal of data clustering is to discover the underlying distribution and structural information of the given data, while image segmentation is to partition an image into several non-overlapping regions. Therefore, two popular graph-theoretical clustering methods are analyzed, including the directed tree based data clustering and the minimum spanning tree based image segmentation. There are two contributions： （1） To improve the directed tree based data clustering for image segmentation, （2） To improve the minimum spanning tree based image segmentation for data clustering. The extensive experiments using artificial and real-world data indicate that the improved directed tree based image segmentation can partition images well by preserving enough details, and the improved minimum spanning tree based data clustering can well cluster data in manifold structure.