|
|
 |
| |
|
|
|
Mining Maximal Cliques through an Intuitionistic Fuzzy Graph |
|
|
|
PP: 1193-1198 |
|
|
|
doi:10.18576/amis/110426
|
|
|
|
Author(s) |
|
|
|
S. Venkatesh,
S. Sujatha,
|
|
|
|
Abstract |
|
|
| This paper deals with an inspiring and real-world problem of mining maximal cliques in an intuitionistic fuzzy graph G where the edges are weighted by the degrees of membership together with non-membership values. By using fuzzy cuts ( α , β ) such that 0 ≤ αβ ≤ 1, a modified concept of C αβ maximal clique is proposed in an intuitionistic fuzzy graph. To find C αβ maximal cliques in an intuitionistic fuzzy graph, we present an effective mining algorithm based on this C αβ is introduced. |
|
|
|
|
|
|
|
