Classification methods based on bipartite graph

Bipartite graph is a kind of special graph. Generally, it is used for solving matching problems such as assignment problem, fault diagnosis problem and so on. But from the definition, bipartite graph has intrinsic classification implication. The paper overviews some related studies on classifications based on bipartite graph, and then presents a new classification method based on bipartite graph for homogeneous objects. It shows that objects can be classified according to the relations among them. For the relations are decided by the attributes of the objects directly or indirectly. The classification can also reveal the dependence between the relations and the attributes. The correspondent classification algorithm called Big-C is also given in the paper.