Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....
In this paper we propose a method to derive OCL invariants from declarative model-to-model transformations in order to enable their verification and analysis. For this purpose we ...
Abstract. Collaborative filtering is a popular method for personalizing product recommendations. Maximum Margin Matrix Factorization (MMMF) has been proposed as one successful lear...
Markus Weimer, Alexandros Karatzoglou, Alex J. Smo...
We present a randomized algorithm for finding maximum matchings in planar graphs in time O(nω/2 ), where ω is the exponent of the best known matrix multiplication algorithm. Sin...
The natural metric of a weighted graph is the length of the shortest paths between all pairs of vertices. The investigated problem consists in a representation of a given metric b...