Clustering is an essential data mining task with various types of applications. Traditional clustering algorithms are based on a vector space model representation. A relational dat...
Matrix multiplication is an important kernel in linear algebra algorithms, and the performance of both serial and parallel implementations is highly dependent on the memory system...
Siddhartha Chatterjee, Alvin R. Lebeck, Praveen K....
Multiple observation improves the performance of 3D object classification. However, since the distribution of feature vectors obtained from multiple view points have strong nonlin...
Traditional clustering algorithms work on "flat" data, making the assumption that the data instances can only be represented by a set of homogeneous and uniform features...
Levent Bolelli, Seyda Ertekin, Ding Zhou, C. Lee G...
In high dimensional data, clusters often only exist in arbitrarily oriented subspaces of the feature space. In addition, these so-called correlation clusters may have complex rela...