NeAT - RNSC

RNSC - Restricted Neighbourhood Search Cluster Algorithm
The RNSC program was developed by Andrew King.
RNSC is an efficient cost-based local search clustering algorithm that explores the solution space to minimize a cost function, calculated according to the numbers of intracluster and inter-cluster edges. (King, 2004, M.Sc. thesis; King et al, 2004)
The stand-alone version of RNSC is available upon request.

   Input format  tab-delimited format Adjacency matrix GML format

Graph

Upload graph from file :

   
Column specification (only relevant for tab-delimited input)

Source node
Target node

Maximum number of cluster
Tabu length	1 10 50 100
Tabu list tolerance	1 3 5
Naive stopping tolerance	1 5 15
Scaled stopping tolerance	1 5 15
Diversification frequency	10 20 50
Shuffling diversification length	1 3 9
Number of experiments	1 3 5 10

RESET

DEMO

MANUAL

TUTORIAL

MAIL