Packages

  • package root
    Definition Classes
    root
  • package org
    Definition Classes
    root
  • package apache
    Definition Classes
    org
  • package spark

    Core Spark functionality.

    Core Spark functionality. org.apache.spark.SparkContext serves as the main entry point to Spark, while org.apache.spark.rdd.RDD is the data type representing a distributed collection, and provides most parallel operations.

    In addition, org.apache.spark.rdd.PairRDDFunctions contains operations available only on RDDs of key-value pairs, such as groupByKey and join; org.apache.spark.rdd.DoubleRDDFunctions contains operations available only on RDDs of Doubles; and org.apache.spark.rdd.SequenceFileRDDFunctions contains operations available on RDDs that can be saved as SequenceFiles. These operations are automatically available on any RDD of the right type (e.g. RDD[(Int, Int)] through implicit conversions.

    Java programmers should reference the org.apache.spark.api.java package for Spark programming APIs in Java.

    Classes and methods marked with Experimental are user-facing features which have not been officially adopted by the Spark project. These are subject to change or removal in minor releases.

    Classes and methods marked with Developer API are intended for advanced users want to extend Spark through lower level interfaces. These are subject to changes or removal in minor releases.

    Definition Classes
    apache
  • package mllib

    RDD-based machine learning APIs (in maintenance mode).

    RDD-based machine learning APIs (in maintenance mode).

    The spark.mllib package is in maintenance mode as of the Spark 2.0.0 release to encourage migration to the DataFrame-based APIs under the org.apache.spark.ml package. While in maintenance mode,

    • no new features in the RDD-based spark.mllib package will be accepted, unless they block implementing new features in the DataFrame-based spark.ml package;
    • bug fixes in the RDD-based APIs will still be accepted.

    The developers will continue adding more features to the DataFrame-based APIs in the 2.x series to reach feature parity with the RDD-based APIs. And once we reach feature parity, this package will be deprecated.

    Definition Classes
    spark
    See also

    SPARK-4591 to track the progress of feature parity

  • package recommendation
    Definition Classes
    mllib
  • ALS
  • MatrixFactorizationModel
  • Rating

object ALS extends Serializable

Top-level methods for calling Alternating Least Squares (ALS) matrix factorization.

Annotations
@Since( "0.8.0" )
Source
ALS.scala
Linear Supertypes
Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ALS
  2. Serializable
  3. Serializable
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  6. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  7. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  9. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  10. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  11. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  12. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  13. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  14. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  15. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  16. def toString(): String
    Definition Classes
    AnyRef → Any
  17. def train(ratings: RDD[Rating], rank: Int, iterations: Int): MatrixFactorizationModel

    Train 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" )
  18. def train(ratings: RDD[Rating], rank: Int, iterations: Int, lambda: Double): MatrixFactorizationModel

    Train 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" )
  19. def train(ratings: RDD[Rating], rank: Int, iterations: Int, lambda: Double, blocks: Int): MatrixFactorizationModel

    Train 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" )
  20. def train(ratings: RDD[Rating], rank: Int, iterations: Int, lambda: Double, blocks: Int, seed: Long): MatrixFactorizationModel

    Train 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" )
  21. def trainImplicit(ratings: RDD[Rating], rank: Int, iterations: Int): MatrixFactorizationModel

    Train 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" )
  22. def trainImplicit(ratings: RDD[Rating], rank: Int, iterations: Int, lambda: Double, alpha: Double): MatrixFactorizationModel

    Train 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" )
  23. def trainImplicit(ratings: RDD[Rating], rank: Int, iterations: Int, lambda: Double, blocks: Int, alpha: Double): MatrixFactorizationModel

    Train 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" )
  24. def trainImplicit(ratings: RDD[Rating], rank: Int, iterations: Int, lambda: Double, blocks: Int, alpha: Double, seed: Long): MatrixFactorizationModel

    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.

    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" )
  25. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  26. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  27. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped