We use a clustering signature, based on a recently introduced generalization of the clustering coefficient to directed networks, to analyze 16 directed real-world networks of five different types: social networks, genetic transcription networks, word adjacency networks, food webs, and electric circuits. We show that these five classes of networks are cleanly separated in the space of clustering...

Predicting linkages among data objects is a fundamental data mining task in various application domains, including recommender systems, information retrieval, automatic Web hyperlink generation, record linkage, and communication surveillance. In many contexts link prediction is entirely based on the linkage information itself (a prominent example is the collaborative filtering recommendation). ...

Clustering network is one of which complex network attracting plenty of scholars to discuss and study the structures and cascading process. We primarily analyzed the effect of clustering coefficient to other various of the single clustering network under localized attack. These network models including double clustering network and star-like NON with clustering and random regular (RR) NON of ER...

We discuss the limiting behavior of the serial correlation coefficient in mildly explosive autoregression, where the error sequence is in the domain of attraction of an α–stable law, α ∈ (0, 2]. Therein, the autoregressive coefficient ρ = ρn > 1 is assumed to satisfy the condition ρn → 1 such that n(ρn − 1) → ∞ as n → ∞. In contrast to the vast majority of existing literature in the area, no sp...

a r t i c l e i n f o Keywords: 2-norm Cophenetic correlation coefficient Beta diversity Dendrogram UPGMA Ward's algorithm Investigation of patterns in beta diversity has received increased attention over the last years particularly in light of new ecological theories such as the metapopulation paradigm and metacommunity theory. Traditionally , beta diversity patterns can be described by cluste...

In the recent past Kernelized Fuzzy C-Means clustering technique has earned popularity especially in the machine learning community. This technique has been derived from the conventional Fuzzy C-Means clustering technique of Bezdek by defining the vector norm with the Gaussian Radial Basic Function instead of a Euclidean distance. Subsequently the fuzzy cluster centroids and the partition matri...

Bone structure in mammals involves a complex network of channels (Havers and Volkmann channels) required to nourish the bone marrow cells. This work describes how three-dimensional reconstructions of such systems can be obtained and represented in terms of complex networks. Three important findings are reported: (i) the fact that the channel branching density resembles a power law implies the e...

The recent high level of interest in weighted complex networks gives rise to a need to develop new measures and to generalize existing ones to take the weights of links into account. Here we focus on various generalizations of the clustering coefficient, which is one of the central characteristics in the complex network theory. We present a comparative study of the several suggestions introduce...

We propose a novel method to generate scale-free networks with discretely tunable clustering coefficient in order to model real social networks. Recently several methods were introduced to generate networks with power law degree distribution. Most of them are based on preferential attachment, but in these networks the average clustering coefficient is low opposite to the real social networks. B...

Feature selection is usually a separate procedure which can not benefit from result of the data exploration. In this paper, we propose a unsupervised feature selection method which could reuse a specific data exploration result. Furthermore, our algorithm follows the idea of clustering attributes and combines two state-of-the-art data analyzing methods, that’s maximal information coefficient an...