Patent Document ID: 8499022
Application ID: 13476100

Base Claim:
1. A method of determining a consensus clustering and correspondence matrices from a plurality of membership matrices, comprising: iteratively computing, with an automated processor, from r membership matrices M (1) ∈ n×k1 , . . . , M (r) ∈ n×kr , k∈ + , the consensus clustering represented by M∈ n×k and the r correspondence matrices S (1) ∈ k×k , . . . , S (h) ∈ kh×k , by minimization of an objective function comprising a consensus function f, updating S (h) using update rule: S ( h ) ← S ( h ) - Θ ⊙ ( ∂ f ∂ S ( h ) ) until predetermined convergence conditions are achieved, wherein ⊙ denotes the Hadamard product of two matrices, Θ is a matrix of step size parameters, and updating M using update rule: M ← M = 1 r ⁢ ∑ h = 1 r ⁢ M ( h ) ⁢ S ( h ) until predetermined convergence conditions are achieved; and storing the computed consensus clustering and the correspondence matrices in a memory.

---

Claim 5:
5. The method according to claim 1 , wherein the objective function comprises a consensus function term, a matrix sparseness constraint enforcement term, and a penalty term in order to enforce an external ∑ j ⁢ S ij ( h ) = 1 constraint.