In this article we investigate a problem within Dempster±Shafer theory where 2 q À 1 pieces of evidence are clustered into q clusters by minimizing a metacon¯ict function, or equivalently, by minimizing the sum of weight of con¯ict over all clusters. Previously one of us developed a method based on a Hop®eld and Tank model. However, for very large problems we need a method with lower computatio...

We applied a mean-field approach to study clustering coefficients in Barabási-Albert (BA) networks. We found that the local clustering in BA networks depends on the node degree. Analytic results have been compared to extensive numerical simulations finding a very good agreement for nodes with low degrees. Clustering coefficient of a whole network calculated from our approach perfectly fits nume...

In this paper we study the fuzzy c-mean clustering algorithm combined with principal components method. Demonstratively analysis indicate that the new clustering method is well rather than some clustering algorithms. We also consider the validity of clustering method. Keywords—FCM algorithm, Principal Components Analysis, ClusI. FUZZY SET THEORETIC SIMILARITY MEASURES ONE of the most important ...

BACKGROUND Colour image segmentation is fundamental and critical for quantitative histological image analysis. The complexity of the microstructure and the approach to make histological images results in variable staining and illumination variations. And ultra-high resolution of histological images makes it is hard for image segmentation methods to achieve high-quality segmentation results and ...

Due to fast growth of the internet technology there is need to establish security mechanism. So for achieving this objective NIDS is used. Datamining is one of the most effective techniques used for intrusion detection. This work evaluates the performance of unsupervised learning techniques over benchmark intrusion detection datasets. The model generation is computation intensive, hence to redu...

A natural way to characterize the cluster structure of a dataset is by finding regions containing a high density of data. This can be done in a nonparametric way with a kernel density estimate, whose modes and hence clusters can be found using mean-shift algorithms. We describe the theory and practice behind clustering based on kernel density estimates and mean-shift algorithms. We discuss the ...