Efficient solutions of cardiac membrane models using novel unsupervised clustering algorithm

We present a method to efficiently solve cardiac membrane models using a novel unsupervised clustering algorithm. The unsupervised clustering algorithm was designed to handle repeated clustering of multidimensional objects with rapidly changing properties. A Modified Trie datastructure that allowed efficient search, scalable and distributed assembly of the result was designed. The method was applied to solve monodomain models of cardiac tissue with highly non-linear reaction elements. We demonstrate the versatility and advantages of using the method by subjecting the tissue to various spatial excitation patterns.