An Intelligent Technique to Find Bicliques and its Application to Optimum Matching Problem

Abstract

In this work, we model the problem of finding biclique from a weighted network of compatible couple as a finding biclique problem from fuzzy bipartite graph for identify perfect matching couple. In this work, we proposed an algorithm based on an intelligent technique that simultaneously optimizes the optimum match. The entire interaction information is realized as a bipartite graph. Moreover, the bicliques represent the strong interaction between the perfect match couple. The problem of finding perfect matching in regular bipartite graph has seen almost 100 years of algorithmic history. In this paper we have proposed an intelligent technique to find complete bipartite graph which denote the perfect match which share almost common properties, they are identified as the gateways of optimum match leading to matched couple.