基于主成分和类聚算法的决策支持系统研究

紧密合当前助学贷款实施现状,将数据挖掘技术应用于国家助学贷款决策支持和国家助学贷款的风险管理。在充分调研分析基础上选取能衡量申请助学贷款学生贫困程度的指标体系,首选用主成分分析法对指标体系进行降维处理以便于助学贷款决策支持;其次采用近邻扩展聚类法构建贷款信用风险评级模型,用于贷款风险控制。并在此基础之上初步实现助学贷款决策支持系统设计和实现为相关部门提供决策支持。

Improved k-means clustering algorithm

In allusion to the disadvantage of having to obtain the number of clusters of data sets in advance and the sensitivity to selecting initial clustering centers in the k-means algorithm, an improved k-means clustering algorithm is proposed. First, the concept of a silhouette coefficient is introduced, and the optimal clustering number Kopt of a data set with unknown class information is confirmed by calculating the silhouette coefficient of objects in clusters under different K values. Then the distribution of the data set is obtained through hierarchical clustering and the initial clustering-centers are confirmed. Finally, the clustering is completed by the traditional k-means clustering. By the theoretical analysis, it is proved that the improved k-means clustering algorithm has proper computational complexity. The experimental results of IRIS testing data set show that the algorithm can distinguish different clusters reasonably and recognize the outliers efficiently, and the entropy generated by the algorithm is lower.

精益快递之百世快递网点运营布局与流程优化设计

针对百世快递网点运营成本居高不下、缺乏精细化管理、人员效率低下、包裹分拣错误率高的问题,从内部运营流程及客户服务流程两个方面进行分析研究,设计出了一种大数据背景下的快递派送路径优化算法,进行路径优化;应用8S标准化管理、ECRS分析法、聚类算法及IE七大手法对百世快递网点的设施、人员、片区布局和作业动作进行优化;利用FlexSim软件对快递分拣中心进行仿真模拟后进而重新规划与设计。将IE精益思想与方法应用于实践,建立了一套完整的网点内部运营体系,设计的解决方案通过与百世快递网点进行合作实践,证明了方案的可行性,得出的实施效果与实施前进行对比分析,有明显的经济效益。

STRUCTURE OPTIMIZATION STRATEGY OF NORMALIZED RBF NETWORKS

Aimed at studying normali zed radial basis function network (NRBFN), this paper introduces the subtractiv e clustering based on a mountain function to construct the initial structure of NR BFN, adopts singular value decomposition (SVD) to analyze the relationship betwe en neural nodes of the hidden layer and singular values, cumulative contribution ratio, index vector, and optimizes the structure of NRBFN. Finally, simulation and performance comparison show that the algorithm is feasible and effective.

Clustering analysis algorithm for security supervising data based on semantic description in coal mines

In order to mine production and security information from security supervising data and to ensure security and safety involved in production and decision-making,a clustering analysis algorithm for security supervising data based on a semantic description in coal mines is studied.First,the semantic and numerical-based hybrid description method of security supervising data in coal mines is described.Secondly,the similarity measurement method of semantic and numerical data are separately given and a weight-based hybrid similarity measurement method for the security supervising data based on a semantic description in coal mines is presented.Thirdly,taking the hybrid similarity measurement method as the distance criteria and using a grid methodology for reference,an improved CURE clustering algorithm based on the grid is presented.Finally,the simulation results of a security supervising data set in coal mines validate the efficiency of the algorithm.

C-means-based ant colony algorithm for TSP

To solve the traveling salesman problem with the characteristics of clustering,a novel hybrid algorithm,the ant colony algorithm combined with the C-means algorithm,is presented.In order to improve the speed of convergence,the traveling salesman problem(TSP)data is specially clustered by the C-means algorithm,then,the result is processed by the ant colony algorithm to solve the problem.The proposed algorithm treats the C-means algorithm as a new search operator and adopts a kind of local searching strategy—2-opt,so as to improve the searching performance.Given the cluster number,the algorithm can obtain the preferable solving result.Compared with the three other algorithms—the ant colony algorithm,the genetic algorithm and the simulated annealing algorithm,the proposed algorithm can make the results converge to the global optimum faster and it has higher accuracy.The algorithm can also be extended to solve other correlative clustering combination optimization problems.Experimental results indicate the validity of the proposed algorithm.

An efficient enhanced k-means clustering algorithm

In k-means clustering, we are given a set of n data points in d-dimensional space R^d and an integer k and the problem is to determine a set of k points in R^d, called centers, so as to minimize the mean squared distance from each data point to its nearest center. In this paper, we present a simple and efficient clustering algorithm based on the k-means algorithm, which we call enhanced k-means algorithm. This algorithm is easy to implement, requiring a simple data structure to keep some information in each iteration to be used in the next iteration. Our experimental results demonstrated that our scheme can improve the computational speed of the k-means algorithm by the magnitude in the total number of distance calculations and the overall time of computation.

Radio-map Establishment based on Fuzzy Clustering for WLAN Hybrid KNN/ANN Indoor Positioning

A novel radio-map establishment based on fuzzy clustering for hybrid K-Nearest Neighbor (KNN) and Artifi cial Neural Network (ANN) position algorithm in WLAN indoor environment is proposed. First of all, the Principal Component Analysis (PCA) is utilized for the purpose of simplifying input dimensions of position estimation algorithm and saving storage cost for the establishment of radio-map. Then, reference points (RPs) calibrated in the off-line phase are divided into separate clusters by Fuzzy C-means clustering (FCM), and membership degrees (MDs) for different clusters are also allocated to each RPs. However, the singular RPs cased by the multi-path effect signifi cantly decreases the clustering performance. Therefore, a novel radio-map establishment method is presented based on the modifi cation of signal samples recorded at singular RPs by surface fitting. In the on-line phase, the region which the mobile terminal (MT) belongs to is estimated according to the MDs firstly. Then, in estimated small dimensional regions, MT's coordinates are calculated byKNN positioning method for efficiency purpose. However, for the regions including singular RPs, ANN method is utilized because ofits great pattern matching ability. Furthermore, compared with other typical indoor positioning methods, feasibility and effectiveness of this hybrid KNN/ANN method are also verified by the experimental results in static and tracking situations.

DCAD:a Dual Clustering Algorithm for Distributed Spatial Databases

Spatial objects have two types of attributes： geometrical attributes and non-geometrical attributes, which belong to two different attribute domains （geometrical and non-geometrical domains）. Although geometrically scattered in a geometrical domain, spatial objects may be similar to each other in a non-geometrical domain. Most existing clustering algorithms group spatial datasets into different compact regions in a geometrical domain without considering the aspect of a non-geometrical domain. However, many application scenarios require clustering results in which a cluster has not only high proximity in a geometrical domain, but also high similarity in a non-geometrical domain. This means constraints are imposed on the clustering goal from both geometrical and non-geometrical domains simultaneously. Such a clustering problem is called dual clustering. As distributed clustering applications become more and more popular, it is necessary to tackle the dual clustering problem in distributed databases. The DCAD algorithm is proposed to solve this problem. DCAD consists of two levels of clustering： local clustering and global clustering. First, clustering is conducted at each local site with a local clustering algorithm, and the features of local clusters are extracted clustering is obtained based on those features fective and efficient. Second, local features from each site are sent to a central site where global Experiments on both artificial and real spatial datasets show that DCAD is effective and efficient.

Ant colony ATTA clustering algorithm of rock mass structural plane in groups

Based on structural surface normal vector spherical distance and the pole stereographic projection Euclidean distance,two distance functions were established.The cluster analysis of structure surface was conducted by the use of ATTA clustering methods based on ant colony piles,and Silhouette index was introduced to evaluate the clustering effect.The clustering analysis of the measured data of Sanshandao Gold Mine shows that ant colony ATTA-based clustering method does better than K-mean clustering analysis.Meanwhile,clustering results of ATTA method based on pole Euclidean distance and ATTA method based on normal vector spherical distance have a great consistence.The clustering results are most close to the pole isopycnic graph.It can efficiently realize grouping of structural plane and determination of the dominant structural surface direction.It is made up for the defects of subjectivity and inaccuracy in icon measurement approach and has great engineering value.

Color image segmentation using mean shift and improved ant clustering

To improve the segmentation quality and efficiency of color image,a novel approach which combines the advantages of the mean shift(MS) segmentation and improved ant clustering method is proposed.The regions which can preserve the discontinuity characteristics of an image are segmented by MS algorithm,and then they are represented by a graph in which every region is represented by a node.In order to solve the graph partition problem,an improved ant clustering algorithm,called similarity carrying ant model(SCAM-ant),is proposed,in which a new similarity calculation method is given.Using SCAM-ant,the maximum number of items that each ant can carry will increase,the clustering time will be effectively reduced,and globally optimized clustering can also be realized.Because the graph is not based on the pixels of original image but on the segmentation result of MS algorithm,the computational complexity is greatly reduced.Experiments show that the proposed method can realize color image segmentation efficiently,and compared with the conventional methods based on the image pixels,it improves the image segmentation quality and the anti-interference ability.

Recognition of Spontaneous Combustion in Coal Mines Based on Genetic Clustering

Spontaneous combustion is one of the greatest disasters in coal mines. Early recognition is important because it may be a potential inducement for other coalmine accidents. However, early recognition is difficult because of the complexity of different coal mines. Fuzzy clustering has been proposed to incorporate the uncertainty of spontaneous combustion in coal mines and it can give a clear degree of classification of combustion. Because FCM clustering tends to become trapped in local minima, a new approach of fuzzy c-means clustering based on a genetic algorithm is there- fore proposed. Genetic algorithm is capable of locating optimal or near optimal solutions to difficult problems. It can be applied in many fields without first obtaining detailed knowledge about correlation. It is helpful in improving the effec- tiveness of fuzzy clustering in detecting spontaneous combustion. The effectiveness of the method is demonstrated by means of an experiment.

Scheduling algorithm of dual-armed cluster tools with residency time and reentrant constraints

To solve the scheduling problem of dual-armed cluster tools for wafer fabrications with residency time and reentrant constraints,a heuristic scheduling algorithm was developed.Firstly,on the basis of formulating scheduling problems domain of dual-armed cluster tools,a non-integer programming model was set up with a minimizing objective function of the makespan.Combining characteristics of residency time and reentrant constraints,a scheduling algorithm of searching the optimal operation path of dual-armed transport module was presented under many kinds of robotic scheduling paths for dual-armed cluster tools.Finally,the experiments were designed to evaluate the proposed algorithm.The results show that the proposed algorithm is feasible and efficient for obtaining an optimal scheduling solution of dual-armed cluster tools with residency time and reentrant constraints.

A Multi-model Approach for Soft Sensor Development Based on Feature Extraction Using Weighted Kernel Fisher Criterion

Multi-model approach can significantly improve the prediction performance of soft sensors in the process with multiple operational conditions.However,traditional clustering algorithms may result in overlapping phenomenon in subclasses,so that edge classes and outliers cannot be effectively dealt with and the modeling result is not satisfactory.In order to solve these problems,a new feature extraction method based on weighted kernel Fisher criterion is presented to improve the clustering accuracy,in which feature mapping is adopted to bring the edge classes and outliers closer to other normal subclasses.Furthermore,the classified data are used to develop a multiple model based on support vector machine.The proposed method is applied to a bisphenol A production process for prediction of the quality index.The simulation results demonstrate its ability in improving the data classification and the prediction performance of the soft sensor.

A new clustering algorithm for large datasets

The Circle algorithm was proposed for large datasets.The idea of the algorithm is to find a set of vertices that are close to each other and far from other vertices.This algorithm makes use of the connection between clustering aggregation and the problem of correlation clustering.The best deterministic approximation algorithm was provided for the variation of the correlation of clustering problem,and showed how sampling can be used to scale the algorithms for large datasets.An extensive empirical evaluation was given for the usefulness of the problem and the solutions.The results show that this method achieves more than 50% reduction in the running time without sacrificing the quality of the clustering.

Power interconnected system clustering with advanced fuzzy C-mean algorithm

An advanced fuzzy C-mean （FCM） algorithm was proposed for the efficient regional clustering of multi-nodes interconnected systems. Due to various locational prices and regional coherencies for each node and point, modified similarity measure was considered to gather nodes having similar characteristics. The similarity measure was needed to contain locafi0nal prices as well as regional coherency. In order to consider the two properties simultaneously, distance measure of fuzzy C-mean algorithm had to be modified. Regional clustering algorithm for interconnected power systems was designed based on the modified fuzzy C-mean algorithm. The proposed algorithm produces proper classification for the interconnected power system and the results are demonstrated in the example of IEEE 39-bus interconnected electricity system.

Clustering in mobile ad hoc network based on neural network

An on-demand distributed clustering algorithm based on neural network was proposed. The system parameters and the combined weight for each node were computed, and cluster-heads were chosen using the weighted clustering algorithm, then a training set was created and a neural network was trained. In this algorithm, several system parameters were taken into account, such as the ideal node-degree, the transmission power, the mobility and the battery power of the nodes. The algorithm can be used directly to test whether a node is a cluster-head or not. Moreover, the clusters recreation can be speeded up.

Clustering method based on data division and partition

Many classical clustering algorithms do good jobs on their prerequisite but do not scale well when being applied to deal with very large data sets(VLDS).In this work,a novel division and partition clustering method(DP) was proposed to solve the problem.DP cut the source data set into data blocks,and extracted the eigenvector for each data block to form the local feature set.The local feature set was used in the second round of the characteristics polymerization process for the source data to find the global eigenvector.Ultimately according to the global eigenvector,the data set was assigned by criterion of minimum distance.The experimental results show that it is more robust than the conventional clusterings.Characteristics of not sensitive to data dimensions,distribution and number of nature clustering make it have a wide range of applications in clustering VLDS.

A New Fuzzy Clustering-Ranking Algorithm and Its Application in Process Alarm Management

Overmany alarms of modern chemical process give the operators many difficulties to decision and diag- nosis. In order to ensure safe production and process operating, management and optimization of alarm information are challenge work that must be confronted. A new process alarm management method based on fuzzy clustering- ranking algorithm is proposed. The fuzzy clustering algorithm is used to cluster rationally the process variables, and difference driving decision algorithm ranks different clusters and process parameters in every cluster. The alarm signal of higher rank is handled preferentially to manage effectively alarms and avoid blind operation. The validity of proposed algorithm and solution is verified by the practical application of ethylene cracking furnace system. It is an effective and dependable alarm management method to improve operating safety in industrial process.

Linear manifold clustering for high dimensional data based on line manifold searching and fusing

High dimensional data clustering,with the inherent sparsity of data and the existence of noise,is a serious challenge for clustering algorithms.A new linear manifold clustering method was proposed to address this problem.The basic idea was to search the line manifold clusters hidden in datasets,and then fuse some of the line manifold clusters to construct higher dimensional manifold clusters.The orthogonal distance and the tangent distance were considered together as the linear manifold distance metrics. Spatial neighbor information was fully utilized to construct the original line manifold and optimize line manifolds during the line manifold cluster searching procedure.The results obtained from experiments over real and synthetic data sets demonstrate the superiority of the proposed method over some competing clustering methods in terms of accuracy and computation time.The proposed method is able to obtain high clustering accuracy for various data sets with different sizes,manifold dimensions and noise ratios,which confirms the anti-noise capability and high clustering accuracy of the proposed method for high dimensional data.