A clustering algorithm based on graph connectivity
Information Processing Letters
IEEE Transactions on Pattern Analysis and Machine Intelligence
A new cluster algorithm for graphs
A new cluster algorithm for graphs
Spreading Activation Models for Trust Propagation
EEE '04 Proceedings of the 2004 IEEE International Conference on e-Technology, e-Commerce and e-Service (EEE'04)
A Distributed Approach to Node Clustering in Decentralized Peer-to-Peer Networks
IEEE Transactions on Parallel and Distributed Systems
Hi-index | 0.00 |
Connectivity based clustering has wide application in many networks like ad hoc networks, sensor networks and so on. But traditional research on this aspect is mainly based on graph theory, which needs global knowledge of the whole network. In this paper, we propose a intelligent approach called spreading activation models for connectivity based clustering (SAMCC) scheme that only local information is needed for clustering. The main feature of SAMCC scheme is applying the idea of spreading activation, which is an organization method for human long-term memory, to clustering and the whole network can be clustered in a decentralized automatic and parallel manner. The SAMCC scheme can be scaled to different networks and different level clustering. Experiment evaluations show the efficiency of our SAMCC scheme in clustering accuracy.