Clustering Algorithms for Scale-free Networks and Applications to Cloud Resource Management

In this paper we introduce algorithms for the construction of scale-free networks and for clustering around the nerve centers, nodes with a high connectivity in a scale-free networks. We argue that such overlay networks could support self-organization in a complex system like a cloud computing infrastructure and allow the implementation of optimal resource management policies.Comment: 14 pages, 8 Figurs, Journa

Ancient Lowland Maya neighborhoods: Average Nearest Neighbor analysis and kernel density models, environments, and urban scale

Many humans live in large, complex political centers, composed of multi-scalar communities including neighborhoods and districts. Both today and in the past, neighborhoods form a fundamental part of cities and are defined by their spatial, architectural, and material elements. Neighborhoods existed in ancient centers of various scales, and multiple methods have been employed to identify ancient neighborhoods in archaeological contexts. However, the use of different methods for neighborhood identification within the same spatiotemporal setting results in challenges for comparisons within and between ancient societies. Here, we focus on using a single method—combining Average Nearest Neighbor (ANN) and Kernel Density (KD) analyses of household groups—to identify potential neighborhoods based on clusters of households at 23 ancient centers across the Maya Lowlands. While a one-size-fits all model does not work for neighborhood identification everywhere, the ANN/KD method provides quantifiable data on the clustering of ancient households, which can be linked to environmental zones and urban scale. We found that centers in river valleys exhibited greater household clustering compared to centers in upland and escarpment environments. Settlement patterns on flat plains were more dispersed, with little discrete spatial clustering of households. Furthermore, we categorized the ancient Maya centers into discrete urban scales, finding that larger centers had greater variation in household spacing compared to medium-sized and smaller centers. Many larger political centers possess heterogeneity in household clustering between their civic-ceremonial cores, immediate hinterlands, and far peripheries. Smaller centers exhibit greater household clustering compared to larger ones. This paper quantitatively assesses household clustering among nearly two dozen centers across the Maya Lowlands, linking environment and urban scale to settlement patterns. The findings are applicable to ancient societies and modern cities alike; understanding how humans form multi-scalar social groupings, such as neighborhoods, is fundamental to human experience and social organization

Ancient Lowland Maya neighborhoods: Average Nearest Neighbor analysis and kernel density models, environments, and urban scale

Many humans live in large, complex political centers, composed of multi-scalar communities including neighborhoods and districts. Both today and in the past, neighborhoods form a fundamental part of cities and are defined by their spatial, architectural, and material elements. Neighborhoods existed in ancient centers of various scales, and multiple methods have been employed to identify ancient neighborhoods in archaeological contexts. However, the use of different methods for neighborhood identification within the same spatiotemporal setting results in challenges for comparisons within and between ancient societies. Here, we focus on using a single method—combining Average Nearest Neighbor (ANN) and Kernel Density (KD) analyses of household groups—to identify potential neighborhoods based on clusters of households at 23 ancient centers across the Maya Lowlands. While a one-size-fits all model does not work for neighborhood identification everywhere, the ANN/KD method provides quantifiable data on the clustering of ancient households, which can be linked to environmental zones and urban scale. We found that centers in river valleys exhibited greater household clustering compared to centers in upland and escarpment environments. Settlement patterns on flat plains were more dispersed, with little discrete spatial clustering of households. Furthermore, we categorized the ancient Maya centers into discrete urban scales, finding that larger centers had greater variation in household spacing compared to medium-sized and smaller centers. Many larger political centers possess heterogeneity in household clustering between their civic-ceremonial cores, immediate hinterlands, and far peripheries. Smaller centers exhibit greater household clustering compared to larger ones. This paper quantitatively assesses household clustering among nearly two dozen centers across the Maya Lowlands, linking environment and urban scale to settlement patterns. The findings are applicable to ancient societies and modern cities alike; understanding how humans form multi-scalar social groupings, such as neighborhoods, is fundamental to human experience and social organization

Optimized location-allocation of earthquake relief centers using PSO and ACO, complemented by GIS, clustering, and TOPSIS

© 2018 by the authors. After an earthquake, it is required to establish temporary relief centers in order to help the victims. Selection of proper sites for these centers has a significant effect on the processes of urban disaster management. In this paper, the location and allocation of relief centers in district 1 of Tehran are carried out using Geospatial Information System (GIS), the Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) decision model, a simple clustering method and the two meta-heuristic algorithms of Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO). First, using TOPSIS, the proposed clustering method and GIS analysis tools, sites satisfying initial conditions with adequate distribution in the area are chosen. Then, the selection of proper centers and the allocation of parcels to them are modelled as a location/allocation problem, which is solved using the meta-heuristic optimization algorithms. Also, in this research, PSO and ACO are compared using different criteria. The implementation results show the general adequacy of TOPSIS, the clustering method, and the optimization algorithms. This is an appropriate approach to solve such complex site selection and allocation problems. In view of the assessment results, the PSO finds better answers, converges faster, and shows higher consistency than the ACO

Adaptive fuzzy system for 3-D vision

An adaptive fuzzy system using the concept of the Adaptive Resonance Theory (ART) type neural network architecture and incorporating fuzzy c-means (FCM) system equations for reclassification of cluster centers was developed. The Adaptive Fuzzy Leader Clustering (AFLC) architecture is a hybrid neural-fuzzy system which learns on-line in a stable and efficient manner. The system uses a control structure similar to that found in the Adaptive Resonance Theory (ART-1) network to identify the cluster centers initially. The initial classification of an input takes place in a two stage process; a simple competitive stage and a distance metric comparison stage. The cluster prototypes are then incrementally updated by relocating the centroid positions from Fuzzy c-Means (FCM) system equations for the centroids and the membership values. The operational characteristics of AFLC and the critical parameters involved in its operation are discussed. The performance of the AFLC algorithm is presented through application of the algorithm to the Anderson Iris data, and laser-luminescent fingerprint image data. The AFLC algorithm successfully classifies features extracted from real data, discrete or continuous, indicating the potential strength of this new clustering algorithm in analyzing complex data sets. The hybrid neuro-fuzzy AFLC algorithm will enhance analysis of a number of difficult recognition and control problems involved with Tethered Satellite Systems and on-orbit space shuttle attitude controller

A Comparative Study of Fuzzy C-Means Algorithm and Entropy-Based Fuzzy Clustering Algorithms

Fuzzy clustering is useful to mine complex and multi-dimensional data sets, where the members have partial or fuzzy relations. Among the various developed techniques, fuzzy-C-means (FCM) algorithm is the most popular one, where a piece of data has partial membership with each of the pre-defined cluster centers. Moreover, in FCM, the cluster centers are virtual, that is, they are chosen at random and thus might be out of the data set. The cluster centers and membership values of the data points with them are updated through some iterations. On the other hand, entropy-based fuzzy clustering (EFC) algorithm works based on a similarity-threshold value. Contrary to FCM, in EFC, the cluster centers are real, that is, they are chosen from the data points. In the present paper, the performances of these algorithms have been compared on four data sets, such as IRIS, WINES, OLITOS and psychosis (collected with the help of forty doctors), in terms of the quality of the clusters (that is, discrepancy factor, compactness, distinctness) obtained and their computational time. Moreover, the best set of clusters has been mapped into 2-D for visualization using a self-organizing map (SOM)

A Dimensionality Reduction-Based Multi-Step Clustering Method for Robust Vessel Trajectory Analysis

The Shipboard Automatic Identification System (AIS) is crucial for navigation safety and maritime surveillance, data mining and pattern analysis of AIS information have attracted considerable attention in terms of both basic research and practical applications. Clustering of spatio-temporal AIS trajectories can be used to identify abnormal patterns and mine customary route data for transportation safety. Thus, the capacities of navigation safety and maritime traffic monitoring could be enhanced correspondingly. However, trajectory clustering is often sensitive to undesirable outliers and is essentially more complex compared with traditional point clustering. To overcome this limitation, a multi-step trajectory clustering method is proposed in this paper for robust AIS trajectory clustering. In particular, the Dynamic Time Warping (DTW), a similarity measurement method, is introduced in the first step to measure the distances between different trajectories. The calculated distances, inversely proportional to the similarities, constitute a distance matrix in the second step. Furthermore, as a widely-used dimensional reduction method, Principal Component Analysis (PCA) is exploited to decompose the obtained distance matrix. In particular, the top k principal components with above 95% accumulative contribution rate are extracted by PCA, and the number of the centers k is chosen. The k centers are found by the improved center automatically selection algorithm. In the last step, the improved center clustering algorithm with k clusters is implemented on the distance matrix to achieve the final AIS trajectory clustering results. In order to improve the accuracy of the proposed multi-step clustering algorithm, an automatic algorithm for choosing the k clusters is developed according to the similarity distance. Numerous experiments on realistic AIS trajectory datasets in the bridge area waterway and Mississippi River have been implemented to compare our proposed method with traditional spectral clustering and fast affinity propagation clustering. Experimental results have illustrated its superior performance in terms of quantitative and qualitative evaluation

Color image segmentation using a spatial k-means clustering algorithm

This paper details the implementation of a new adaptive technique for color-texture segmentation that is a generalization of the standard K-Means algorithm. The standard K-Means algorithm produces accurate segmentation results only when applied to images defined by homogenous regions with respect to texture and color since no local constraints are applied to impose spatial continuity. In addition, the initialization of the K-Means algorithm is problematic and usually the initial cluster centers are randomly picked. In this paper we detail the implementation of a novel technique to select the dominant colors from the input image using the information from the color histograms. The main contribution of this work is the generalization of the K-Means algorithm that includes the primary features that describe the color smoothness and texture complexity in the process of pixel assignment. The resulting color segmentation scheme has been applied to a large number of natural images and the experimental data indicates the robustness of the new developed segmentation algorithm