object ALS extends Serializable
Top-level methods for calling Alternating Least Squares (ALS) matrix factorization.
- Annotations
- @Since("0.8.0")
- Source
- ALS.scala
- Alphabetic
- By Inheritance
- ALS
- Serializable
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Value Members
-   final  def !=(arg0: Any): Boolean- Definition Classes
- AnyRef → Any
 
-   final  def ##: Int- Definition Classes
- AnyRef → Any
 
-   final  def ==(arg0: Any): Boolean- Definition Classes
- AnyRef → Any
 
-   final  def asInstanceOf[T0]: T0- Definition Classes
- Any
 
-    def clone(): AnyRef- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @IntrinsicCandidate() @native()
 
-   final  def eq(arg0: AnyRef): Boolean- Definition Classes
- AnyRef
 
-    def equals(arg0: AnyRef): Boolean- Definition Classes
- AnyRef → Any
 
-   final  def getClass(): Class[_ <: AnyRef]- Definition Classes
- AnyRef → Any
- Annotations
- @IntrinsicCandidate() @native()
 
-    def hashCode(): Int- Definition Classes
- AnyRef → Any
- Annotations
- @IntrinsicCandidate() @native()
 
-   final  def isInstanceOf[T0]: Boolean- Definition Classes
- Any
 
-   final  def ne(arg0: AnyRef): Boolean- Definition Classes
- AnyRef
 
-   final  def notify(): Unit- Definition Classes
- AnyRef
- Annotations
- @IntrinsicCandidate() @native()
 
-   final  def notifyAll(): Unit- Definition Classes
- AnyRef
- Annotations
- @IntrinsicCandidate() @native()
 
-   final  def synchronized[T0](arg0: => T0): T0- Definition Classes
- AnyRef
 
-    def toString(): String- Definition Classes
- AnyRef → Any
 
-    def train(ratings: RDD[Rating], rank: Int, iterations: Int): MatrixFactorizationModelTrain a matrix factorization model given an RDD of ratings by users for a subset of products. Train a matrix factorization model given an RDD of ratings by users for a subset of products. The ratings matrix is approximated as the product of two lower-rank matrices of a given rank (number of features). To solve for these features, ALS is run iteratively with a level of parallelism automatically based on the number of partitions in ratings.- ratings
- RDD of Rating objects with userID, productID, and rating 
- rank
- number of features to use (also referred to as the number of latent factors) 
- iterations
- number of iterations of ALS 
 - Annotations
- @Since("0.8.0")
 
-    def train(ratings: RDD[Rating], rank: Int, iterations: Int, lambda: Double): MatrixFactorizationModelTrain a matrix factorization model given an RDD of ratings by users for a subset of products. Train a matrix factorization model given an RDD of ratings by users for a subset of products. The ratings matrix is approximated as the product of two lower-rank matrices of a given rank (number of features). To solve for these features, ALS is run iteratively with a level of parallelism automatically based on the number of partitions in ratings.- ratings
- RDD of Rating objects with userID, productID, and rating 
- rank
- number of features to use (also referred to as the number of latent factors) 
- iterations
- number of iterations of ALS 
- lambda
- regularization parameter 
 - Annotations
- @Since("0.8.0")
 
-    def train(ratings: RDD[Rating], rank: Int, iterations: Int, lambda: Double, blocks: Int): MatrixFactorizationModelTrain a matrix factorization model given an RDD of ratings by users for a subset of products. Train a matrix factorization model given an RDD of ratings by users for a subset of products. The ratings matrix is approximated as the product of two lower-rank matrices of a given rank (number of features). To solve for these features, ALS is run iteratively with a configurable level of parallelism. - ratings
- RDD of Rating objects with userID, productID, and rating 
- rank
- number of features to use (also referred to as the number of latent factors) 
- iterations
- number of iterations of ALS 
- lambda
- regularization parameter 
- blocks
- level of parallelism to split computation into 
 - Annotations
- @Since("0.8.0")
 
-    def train(ratings: RDD[Rating], rank: Int, iterations: Int, lambda: Double, blocks: Int, seed: Long): MatrixFactorizationModelTrain a matrix factorization model given an RDD of ratings by users for a subset of products. Train a matrix factorization model given an RDD of ratings by users for a subset of products. The ratings matrix is approximated as the product of two lower-rank matrices of a given rank (number of features). To solve for these features, ALS is run iteratively with a configurable level of parallelism. - ratings
- RDD of Rating objects with userID, productID, and rating 
- rank
- number of features to use (also referred to as the number of latent factors) 
- iterations
- number of iterations of ALS 
- lambda
- regularization parameter 
- blocks
- level of parallelism to split computation into 
- seed
- random seed for initial matrix factorization model 
 - Annotations
- @Since("0.9.1")
 
-    def trainImplicit(ratings: RDD[Rating], rank: Int, iterations: Int): MatrixFactorizationModelTrain a matrix factorization model given an RDD of 'implicit preferences' of users for a subset of products. Train a matrix factorization model given an RDD of 'implicit preferences' of users for a subset of products. The ratings matrix is approximated as the product of two lower-rank matrices of a given rank (number of features). To solve for these features, ALS is run iteratively with a level of parallelism determined automatically based on the number of partitions in ratings.- ratings
- RDD of Rating objects with userID, productID, and rating 
- rank
- number of features to use (also referred to as the number of latent factors) 
- iterations
- number of iterations of ALS 
 - Annotations
- @Since("0.8.1")
 
-    def trainImplicit(ratings: RDD[Rating], rank: Int, iterations: Int, lambda: Double, alpha: Double): MatrixFactorizationModelTrain a matrix factorization model given an RDD of 'implicit preferences' of users for a subset of products. Train a matrix factorization model given an RDD of 'implicit preferences' of users for a subset of products. The ratings matrix is approximated as the product of two lower-rank matrices of a given rank (number of features). To solve for these features, ALS is run iteratively with a level of parallelism determined automatically based on the number of partitions in ratings.- ratings
- RDD of Rating objects with userID, productID, and rating 
- rank
- number of features to use (also referred to as the number of latent factors) 
- iterations
- number of iterations of ALS 
- lambda
- regularization parameter 
- alpha
- confidence parameter 
 - Annotations
- @Since("0.8.1")
 
-    def trainImplicit(ratings: RDD[Rating], rank: Int, iterations: Int, lambda: Double, blocks: Int, alpha: Double): MatrixFactorizationModelTrain a matrix factorization model given an RDD of 'implicit preferences' of users for a subset of products. Train a matrix factorization model given an RDD of 'implicit preferences' of users for a subset of products. The ratings matrix is approximated as the product of two lower-rank matrices of a given rank (number of features). To solve for these features, ALS is run iteratively with a configurable level of parallelism. - ratings
- RDD of Rating objects with userID, productID, and rating 
- rank
- number of features to use (also referred to as the number of latent factors) 
- iterations
- number of iterations of ALS 
- lambda
- regularization parameter 
- blocks
- level of parallelism to split computation into 
- alpha
- confidence parameter 
 - Annotations
- @Since("0.8.1")
 
-    def trainImplicit(ratings: RDD[Rating], rank: Int, iterations: Int, lambda: Double, blocks: Int, alpha: Double, seed: Long): MatrixFactorizationModelTrain a matrix factorization model given an RDD of 'implicit preferences' given by users to some products, in the form of (userID, productID, preference) pairs. Train a matrix factorization model given an RDD of 'implicit preferences' given by users to some products, in the form of (userID, productID, preference) pairs. We approximate the ratings matrix as the product of two lower-rank matrices of a given rank (number of features). To solve for these features, we run a given number of iterations of ALS. This is done using a level of parallelism given by blocks.- ratings
- RDD of (userID, productID, rating) pairs 
- rank
- number of features to use (also referred to as the number of latent factors) 
- iterations
- number of iterations of ALS 
- lambda
- regularization parameter 
- blocks
- level of parallelism to split computation into 
- alpha
- confidence parameter 
- seed
- random seed for initial matrix factorization model 
 - Annotations
- @Since("0.8.1")
 
-   final  def wait(arg0: Long, arg1: Int): Unit- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
 
-   final  def wait(arg0: Long): Unit- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
 
-   final  def wait(): Unit- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
 
Deprecated Value Members
-    def finalize(): Unit- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
- (Since version 9)