This file describes the vertex program for the alternating least squares (ALS) matrix factorization algorithm. See als_vertex_program for description of the ALS Algorithm. More...
#include <Eigen/Dense>
Go to the source code of this file.
Classes | |
struct | vertex_data |
the vertex data type which contains the latent factor. More... | |
struct | edge_data |
The edge data stores the entry in the matrix. More... | |
class | gather_type |
The graph loader function is a line parser used for distributed graph construction. More... | |
class | als_vertex_program |
struct | error_aggregator |
struct | prediction_saver |
Typedefs | |
typedef Eigen::VectorXd | vec_type |
typedef Eigen::MatrixXd | mat_type |
typedef graphlab::distributed_graph < vertex_data, edge_data > | graph_type |
The graph type is defined in terms of the vertex and edge data. |
Functions | |
graph_type::vertex_type | get_other_vertex (graph_type::edge_type &edge, const graph_type::vertex_type &vertex) |
Given a vertex and an edge return the other vertex in the edge. | |
double | extract_l2_error (const graph_type::edge_type &edge) |
Given an edge compute the error associated with that edge. |
This file describes the vertex program for the alternating least squares (ALS) matrix factorization algorithm. See als_vertex_program for description of the ALS Algorithm.
Copyright (c) 2009 Carnegie Mellon University. All rights reserved.
Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.
For more about this software visit:
http://www.graphlab.ml.cmu.edu