Sciweavers

654 search results - page 22 / 131
» Matrix Graph Grammars
Sort
View
ICDM
2008
IEEE
122views Data Mining» more  ICDM 2008»
14 years 3 months ago
Nonnegative Matrix Factorization for Combinatorial Optimization: Spectral Clustering, Graph Matching, and Clique Finding
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....
Chris H. Q. Ding, Tao Li, Michael I. Jordan
JSS
2010
89views more  JSS 2010»
13 years 3 months ago
Verification and validation of declarative model-to-model transformations through invariants
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 ...
Jordi Cabot, Robert Clarisó, Esther Guerra,...
ML
2008
ACM
146views Machine Learning» more  ML 2008»
13 years 8 months ago
Improving maximum margin matrix factorization
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...
ESA
2004
Springer
120views Algorithms» more  ESA 2004»
14 years 2 months ago
Maximum Matchings in Planar Graphs via Gaussian Elimination
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...
Marcin Mucha, Piotr Sankowski
EOR
2006
110views more  EOR 2006»
13 years 8 months ago
A constructive algorithm for realizing a distance matrix
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...
Sacha C. Varone