Package | Description |
---|---|
com.google.api.services.bigquery.model |
Modifier and Type | Method and Description |
---|---|
IntHparamSearchSpace |
IntHparamSearchSpace.clone() |
IntHparamSearchSpace |
HparamSearchSpaces.getBatchSize()
Mini batch sample size.
|
IntHparamSearchSpace |
HparamSearchSpaces.getMaxTreeDepth()
Maximum depth of a tree for boosted tree models.
|
IntHparamSearchSpace |
HparamSearchSpaces.getMinTreeChildWeight()
Minimum sum of instance weight needed in a child for boosted tree models.
|
IntHparamSearchSpace |
HparamSearchSpaces.getNumClusters()
Number of clusters for k-means.
|
IntHparamSearchSpace |
HparamSearchSpaces.getNumFactors()
Number of latent factors to train on.
|
IntHparamSearchSpace |
HparamSearchSpaces.getNumParallelTree()
Number of parallel trees for boosted tree models.
|
IntHparamSearchSpace |
IntHparamSearchSpace.set(String fieldName,
Object value) |
IntHparamSearchSpace |
IntHparamSearchSpace.setCandidates(IntCandidates candidates)
Candidates of the int hyperparameter.
|
IntHparamSearchSpace |
IntHparamSearchSpace.setRange(IntRange range)
Range of the int hyperparameter.
|
Modifier and Type | Method and Description |
---|---|
HparamSearchSpaces |
HparamSearchSpaces.setBatchSize(IntHparamSearchSpace batchSize)
Mini batch sample size.
|
HparamSearchSpaces |
HparamSearchSpaces.setMaxTreeDepth(IntHparamSearchSpace maxTreeDepth)
Maximum depth of a tree for boosted tree models.
|
HparamSearchSpaces |
HparamSearchSpaces.setMinTreeChildWeight(IntHparamSearchSpace minTreeChildWeight)
Minimum sum of instance weight needed in a child for boosted tree models.
|
HparamSearchSpaces |
HparamSearchSpaces.setNumClusters(IntHparamSearchSpace numClusters)
Number of clusters for k-means.
|
HparamSearchSpaces |
HparamSearchSpaces.setNumFactors(IntHparamSearchSpace numFactors)
Number of latent factors to train on.
|
HparamSearchSpaces |
HparamSearchSpaces.setNumParallelTree(IntHparamSearchSpace numParallelTree)
Number of parallel trees for boosted tree models.
|
Copyright © 2011–2022 Google. All rights reserved.