Small-World-Like Structured MST-Based Clustering Algorithm
نویسندگان
چکیده
منابع مشابه
A Novel MST based Multi-Prototype Clustering Algorithm
Clustering is the process of partitioning the data objects such that the degree of similarity among the objects in the same partition is more than the degree of dissimilarity between the objects of different classes. There are many applications of clustering like medicine, marketing, insurance, image analysis etc. The squared-error clustering algorithm uses single prototype to represent a clust...
متن کاملA Survivability Clustering Algorithm for Ad Hoc Network Based on a Small-World Model
In Ad hoc network, nodes have the characteristics of limited energy, selforganizing and multi-hop. For the purpose of improving the survivability of Ad hoc network effectively, this paper proposes a new algorithm named EMDWCA (Based on Energy, Mobility and Degrees of the nodes on-demand Weighted Clustering Algorithm). The LEACH algorithm is used to cluster the Ad hoc network in the first electi...
متن کاملA P2P-based Flocking Algorithm for Distributed Clustering using Small World Structure
Clustering has become an increasingly important task in modern application domains such as electronic commerce, multimedia, surveillance using sensor networks as well as many others. In many of these areas, the data are originally collected at different sites and their transmission to a central site is almost impossible. This requires to develop novel distributed clustering algorithms to handle...
متن کاملClustering using Small World Structure
Small world topology has been receiving much attention recent years. Many real-world graphs actually have a small world topology. In a small world graph, a shortcut plays an important role to make the world small; if shortcuts are eliminated, the graph is separated into clusters. In this paper, I propose a new clustering algorithm by eliminating “shortcuts,” which helps a user understand the gr...
متن کاملStructured information in small-world neural networks.
The retrieval abilities of spatially uniform attractor networks can be measured by the global overlap between patterns and neural states. However, we found that nonuniform networks, for instance, small-world networks, can retrieve fragments of patterns (blocks) without performing global retrieval. We propose a way to measure the local retrieval using a parameter that is related to the fluctuati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Machine Learning and Computing
سال: 2019
ISSN: 2010-3700
DOI: 10.18178/ijmlc.2019.9.4.829