A neuro-GA approach for the maximum fuzzy clique problem

Authors:
Sanghamitra Bandyopadhyay;Malay Bhattacharyya
Affiliations:
Machine Intelligence Unit, Indian Statistical Institute, Kolkata, India;Machine Intelligence Unit, Indian Statistical Institute, Kolkata, India
Venue:
ICONIP'08 Proceedings of the 15th international conference on Advances in neuro-information processing - Volume Part I
Year:
2008

Citing 3
Cited 1

Silhouettes: a graphical aid to the interpretation and validation of cluster analysis

Journal of Computational and Applied Mathematics
Experiments in quadratic 0-1 programming

Mathematical Programming: Series A and B
Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993

Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993

An improved competitive Hopfield network with inhibitive competitive activation mechanism for maximum clique problem

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The maximum clique problem, into which many problems have been mapped effectively, is of great importance in graph theory. A natural extension to this problem, emerging very recently in many reallife networks, is its fuzzification. The problem of finding the maximum clique in a fuzzy graph has been addressed in this paper. It has been shown here, that this problem reduces to an unconstrained quadratic 0-1 programming problem. Using a maximum neural network, along with, chaotic mutation capability of genetic algorithms, the reduced problem has been solved. Empirical studies have been done by applying the method on a gene co-expression network and on some benchmark graphs.