This paper builds upon our previous paper that has introduced a new hierarchical clustering algorithm. In this paper we attempted to solve algorithmic defects and use more validation measures to show the strength of o...
详细信息
ISBN:
(纸本)9781538650028
This paper builds upon our previous paper that has introduced a new hierarchical clustering algorithm. In this paper we attempted to solve algorithmic defects and use more validation measures to show the strength of our proposed algorithm. The main purpose of this clustering algorithm is to provide a better clustering quality and higher accuracy utilizing intersection points. To validate our clustering algorithm, we have performed several experiments with benchmark datasets. Besides our proposed algorithm, five well-known agglomerative clustering algorithms are also used. Purity as an external criterion is used to evaluate the performance of clustering algorithms. Compactness of each cluster derived by clustering algorithms is also calculated to evaluate the validity of clustering algorithms. Eventually, the results of experiments show that in most cases the error rate of our proposed algorithm is lower than other clustering algorithms which are used in this study.
In order to solve the problem of endurance of high-speed mobile multi-UAV in Ad Hoc networks with frequent network topology changing, this paper proposes a weighted clustering algorithm based on node energy (EWCA). In...
详细信息
ISBN:
(纸本)9781510625808
In order to solve the problem of endurance of high-speed mobile multi-UAV in Ad Hoc networks with frequent network topology changing, this paper proposes a weighted clustering algorithm based on node energy (EWCA). In this algorithm, we use a multi-parameter weighted clustering algorithm, which improve the node degree difference and node residual energy calculation methods, and study the similarity between the adjacent nodes in terms of speed, direction, etc. The simulation studies the inter-cluster switching rate, the number of nodes and the performance of the minimum lifetime of network node. The results show that, compared with the highest node degree algorithm(HIGHD), adaptive security clustering algorithm(SWCA) and weighted clustering algorithm(WCA), the proposed algorithm can reduce the number of clusters, improve the stability of clustering, and the survival time of drones, and improve the network's endurance.
On-load tap changer(OLTC) is an important component in power transformer for voltage regulation, and mechanical fault is the main problem during its switch-over process. Vibration signals resulted from the operation o...
详细信息
ISBN:
(纸本)9781538656860
On-load tap changer(OLTC) is an important component in power transformer for voltage regulation, and mechanical fault is the main problem during its switch-over process. Vibration signals resulted from the operation of OLTC are closely related to its mechanical condition. To better recognize the incipient mechanical faults of OLTC with high accuracy, two kinds of typical mechanical faults of storage spring and static contact are simulated in an CM type OLTC with the measured vibration signals, which are always chaotic. Then the one-dimension vibration signal time series is reconstructed into high dimension phase space with the calculated delay time and embedding dimension. The improved K-means clustering algorithm is applied to classify the large amount of phase points into different clustering. The curve of weighted distribution information entropy of each clustering is calculated. Calculated results have shown that the defined information entropy curve is capable of identify the different mechanical fault of OLTC.
This paper discusses the key problem of the application of DBSCAN clustering algorithm in the detection of abnormal data, that is the configuration problem for two threshold values of Eps and Minpts. A method has been...
详细信息
ISBN:
(纸本)9781728101200
This paper discusses the key problem of the application of DBSCAN clustering algorithm in the detection of abnormal data, that is the configuration problem for two threshold values of Eps and Minpts. A method has been proposed, which is based on a visual display of the statistical characteristic of the dataset itself. Using the MATLAB tool, we implement the DBSCAN algorithm and show statistical characteristic of the dataset. The standard dataset is used to verify the proposed method. The experiment results show that the proposed method can make DBSCAN algorithm get better clustering result.
This paper is a study of parallel clustering algorithm K-means. Firstly, the design idea of K-means clustering algorithm on a single computer is introduced. Secondly, the design idea of K-means clustering algorithm in...
详细信息
This paper is a study of parallel clustering algorithm K-means. Firstly, the design idea of K-means clustering algorithm on a single computer is introduced. Secondly, the design idea of K-means clustering algorithm in cluster environment is elaborated in detail. When K-means clustering algorithm is faced with massive data, the complexity of time and space has become the bottleneck of K-means clustering algorithm. On the basis of fully studying the traditional K-Means clustering algorithm, this paper presents the design idea of parallel K-Means clustering algorithm, and gives the estimation formula of its acceleration ratio. The correctness and validity of the algorithm are proved by experiments.
The intension is to provide the contrast between clustering algorithm and Gaussian Mixture Model using Perceptual Linear Prediction features to assess the singer identification structure using two phases, phase 1 as t...
详细信息
ISBN:
(纸本)9781538622384
The intension is to provide the contrast between clustering algorithm and Gaussian Mixture Model using Perceptual Linear Prediction features to assess the singer identification structure using two phases, phase 1 as training and phase 2 as testing over the film tracks(vocal with background music). The intent of assessing of singer is to categorize different singers impartial of data that is trained in phase 1. The aspects for two phases are executed for downright tracks from films for 20 different singers. In phase 1 aspects, for individual singer 15 tracks are loaded as input data. Now loaded datas are shaped to go through a deck of pre-handling steps. The pre-handling steps includes three more internal stages with stage1 as Pre-emphasis, stage2 as Frame Blocking and stage3 as Windowing. From individual context of pre-handled signal PLP features are evolved. Using the K-Means clustering algorithm and GMM the phase1 output is developed for individual singers. In clustering algorithm the singer is categorized deployed with choice of the model that gives mean value as minimum. In GMM, by using Maximum Likelihood (ML) algorithm singers are categorized deployed with choice of the model that gives maximum likelihood. Depending on identity of accuracy the singer identification structure is performed.
Vehicular Ad Hoc Network (VANET) is a promising technology that still faces many challenges such as scalability and the highly dynamic topology. An effective VANET clustering algorithm significantly relieves the effec...
详细信息
ISBN:
(纸本)9781538692301
Vehicular Ad Hoc Network (VANET) is a promising technology that still faces many challenges such as scalability and the highly dynamic topology. An effective VANET clustering algorithm significantly relieves the effect of these challenges. In this paper, we propose a double-head clustering (DHC) algorithm for VANETs. Our proposed approach is a mobility-based clustering algorithm that exploits the most relevant mobility metrics such as vehicles' speed, position and direction, in addition to other metrics related to the communication link quality in order to achieve stable clusters. We compare the proposed algorithm against existing clustering algorithms using different evaluation metrics under dynamic and static mobility scenarios. The proposed algorithm proves its stability and efficiency under different mobility scenarios.
clustering is one of the most basic unsupervised learning problems in the field of machine learning and its main goal is to separate data into clusters with similar data points. Because of various redundant and comple...
详细信息
ISBN:
(纸本)9783319959573;9783319959566
clustering is one of the most basic unsupervised learning problems in the field of machine learning and its main goal is to separate data into clusters with similar data points. Because of various redundant and complex structures for the raw data, the general algorithm usually is difficult to separate different clusters from the data and the effect is not obvious. Deep learning is a technology that automatically learns nonlinear and more conducive clustering features from complex data structures. This paper presents a deep clustering algorithm based on self-organizing map neural network. This method combines the feature learning ability of stacked auto-encoder from the raw data and feature clustering with unsupervised learning of self-organizing map neural network. It is aim to achieve the greatest separability for the data space. Through the experimental analysis and comparison, the proposed algorithm has better recognition rate, and improves the clustering performance on low and high dimension data.
Categorization of network traffic according to application is an element that determines important task in management network such as flow prioritization according;consist on the importance of the application to deter...
详细信息
ISBN:
(纸本)9783319952048;9783319952031
Categorization of network traffic according to application is an element that determines important task in management network such as flow prioritization according;consist on the importance of the application to determine which flows get the most resources or which flows get resources first, traffic policing consists in drops traffic and diagnostic monitoring. In the other hand, categorize applications can be employed for resolve engineering problems such as workload categorization for identify the amount of work assigned or done by a client, capacity planning and route provisioning. In this paper, we show the results of the research project "Implementation of the RAIN algorithm for the clustering of network users". It describes the problem, and mentions some related researches. Then, the selected gravitation algorithm is itemized;it also submits the tests analysis and results, and finally shows the reached conclusions from the research.
In recent years, with the development of mobile location services and cloud computing technology, the collection and processing of mobile location information has become a reality. The mass database which is composed ...
详细信息
ISBN:
(纸本)9781538671504
In recent years, with the development of mobile location services and cloud computing technology, the collection and processing of mobile location information has become a reality. The mass database which is composed of mobile location data has promoted the development of the research on mobile location data. It is very important for us to understand the spatial distribution and temporal characteristics of moving patterns and identify the mechanism of motion formation, predict the future development of sports through trajectory clustering analysis. At present, trajectory clustering research mainly focuses on the spatial position changes of moving objects. Temporal constraints in spatial and temporal clustering are generally auxiliary information, but do not really participate in clustering. In this paper, a clustering algorithm for trajectory data based on spatiotemporal pattern is proposed. First, the curve edge detection method is used to extract the trajectory feature points. Then the trajectory is divided into sub track segments according to the trajectory feature points. Finally, the density based clustering algorithm is applied to cluster according to the temporal and spatial similarity between sub trajectories. The Hot spot analysis experimental based on Chengdu taxi GPS track data results show that the similarity measurement based on spatiotemporal features can get better clustering results because of both the spatial and temporal characteristics of the trajectory.
暂无评论