The typical task of unsupervised learning is to organize data, for example into clusters, typically disjoint clusters (eg. the K-means algorithm). One would expect (for example) a...
Mark K. Goldberg, Mykola Hayvanovych, Malik Magdon...
Background: Comparison of data produced on different microarray platforms often shows surprising discordance. It is not clear whether this discrepancy is caused by noisy data or b...
Scott L. Carter, Aron C. Eklund, Brigham H. Mecham...
In this paper we present an efficient, scalable and general algorithm for performing set joins on predicates involving various similarity measures like intersect size, Jaccard-coe...
We observed that for multimedia data – especially music - collaborative similarity measures perform much better than similarity measures derived from content-based sound feature...
We present an algorithm name cSAT+ for learning the causal structure in a domain from datasets measuring different variable sets. The algorithm outputs a graph with edges correspo...
Sofia Triantafilou, Ioannis Tsamardinos, Ioannis G...