Patent ID: 7461073

Claim:
A computing system with a processor and memory for co-clustering objects of heterogeneous types, comprising: a component that represents relationships between objects of a first type and objects of a third type as a first bipartite graph; a component that represents relationships between objects of a second type and objects of the third type as a second bipartite graph; a component that provides a cut-based objective function representing relationships across cuts for both the first bipartite graph and the second bipartite graph; a component that finds a solution to the cut-based objective function; and a component that identifies clusters of objects from the solution to the objective function where the cut-based objective function is represented as: min ⁡ [ β ⁢ ⁢ q T ⁢ L ( 1 ) ⁢ q q T ⁢ D ( 1 ) ⁢ q + ( 1 - β ) ⁢ p T ⁢ L ( 2 ) ⁢ p p T ⁢ D ( 2 ) ⁢ p ] s . t . ⁢ ( i ) ⁢ ⁢ q T ⁢ D ( 1 ) ⁢ e = 0 , q ≠ 0 ( ii ) ⁢ ⁢ p T ⁢ D ( 2 ) ⁢ e = 0 , p ≠ 0 ( iii ) ⁢ ⁢ 0 < β < 1 where A is a matrix representing the first bipartite graph and a ij is element i and j of A, B is a matrix representing the second bipartite graph and b ij is element i and j of B, D (1) is a diagonal matrix represented as D (1) ii =Σ k a ik , D (2) is a diagonal matrix represented as D (2) ii =Σ k b ik , L (1) is a Laplacian matrix represented as L (1) =D−A, L (2) is a Laplacian matrix represented as L (2) =D−B, e is a column vector with all its elements equal to 1, q is a column vector with q i =c 1 when i is an object in one cluster and q i =−c 2 when i is an object in a secoid cluster, p i =c 1 when i is an object in one cluster and p i =−c 2 when i is an: object in a second cluster, and β represents a weight of the relationships of the first bipartite graph and the second bipartite graph.