Hydraulic metal structure health diagnosis based on data mining technology

In conjunction with association rules for data mining, the connections between testing indices and strong and weak association rules were determined, and new derivative rules were obtained by further reasoning. Association rules were used to analyze correlation and check consistency between indices. This study shows that the judgment obtained by weak association rules or non-association rules is more accurate and more credible than that obtained by strong association rules. When the testing grades of two indices in the weak association rules are inconsistent, the testing grades of indices are more likely to be erroneous, and the mistakes are often caused by human factors. Clustering data mining technology was used to analyze the reliability of a diagnosis, or to perform health diagnosis directly. Analysis showed that the clustering results are related to the indices selected, and that if the indices selected are more significant, the characteristics of clustering results are also more significant, and the analysis or diagnosis is more credible. The indices and diagnosis analysis function produced by this study provide a necessary theoretical foundation and new ideas for the development of hydraulic metal structure health diagnosis technology.

COOPERATIVE CLUSTERING BASED ON GRID AND DENSITY

Based on the analysis of features of the grid-based clustering method-clustering in quest （CLIQUE） and density-based clustering method-density-based spatial clustering of applications with noise （DBSCAN）, a new clustering algorithm named cooperative clustering based on grid and density （CLGRID） is presented. The new algorithm adopts an equivalent rule of regional inquiry and density unit identification. The central region of one class is calculated by the grid-based method and the margin region by a density-based method. By clustering in two phases and using only a small number of seed objects in representative units to expand the cluster, the frequency of region query can be decreased, and consequently the cost of time is reduced. The new algorithm retains positive features of both grid-based and density-based methods and avoids the difficulty of parameter searching. It can discover clusters of arbitrary shape with high efficiency and is not sensitive to noise. The application of CLGRID on test data sets demonstrates its validity and higher efficiency, which contrast with tradi- tional DBSCAN with R tree.

A New Method for Clustering Based on Development of Imperialist Competitive Algorithm

Clustering is one of the most widely used data mining techniques that can be used to create homogeneous clusters.K-means is one of the popular clustering algorithms that,despite its inherent simplicity,has also some major problems.One way to resolve these problems and improve the k-means algorithm is the use of evolutionary algorithms in clustering.In this study,the Imperialist Competitive Algorithm(ICA) is developed and then used in the clustering process.Clustering of IRIS,Wine and CMC datasets using developed ICA and comparing them with the results of clustering by the original ICA,GA and PSO algorithms,demonstrate the improvement of Imperialist competitive algorithm.

Modeling and Mining the Temporal Patterns of Service in Cellular Network

Recent emergence of diverse services have led to explosive traffic growth in cellular data networks. Understanding the service dynamics in large cellular networks is important for network design, trouble shooting, quality of service(Qo E) support, and resource allocation. In this paper, we present our study to reveal the distributions and temporal patterns of different services in cellular data network from two different perspectives, namely service request times and service duration. Our study is based on big traffic data, which is parsed to readable records by our Hadoop-based packet parsing platform, captured over a week-long period from a tier-1 mobile operator's network in China. We propose a Zipf's ranked model to characterize the distributions of traffic volume, packet, request times and duration of cellular services. Two-stage method(Self-Organizing Map combined with kmeans) is first used to cluster time series of service into four request patterns and three duration patterns. These seven patterns are combined together to better understand the fine-grained temporal patterns of service in cellular network. Results of our distribution models and temporal patterns present cellular network operators with a better understanding of the request and duration characteristics of service, which of great importance in network design, service generation and resource allocation.