sparsereg.util package

Submodules

sparsereg.util.net module

sparsereg.util.net.complexity(estimator)[source]
sparsereg.util.net.net(estimator, x, y, attr='alpha', max_coarsity=2, filter=True, r_max=1000.0, **kw)[source]

sparsereg.util.pipeline module

class sparsereg.util.pipeline.ColumnSelector(index=slice(None, None, None))[source]

Bases: sklearn.base.TransformerMixin, sklearn.base.BaseEstimator

fit(x, y=None)[source]
transform(x, y=None)[source]
get_feature_names(input_features=None)[source]

Module contents

sparsereg.util.dominates(a, b)[source]
sparsereg.util.pareto_front(models, *attrs, all=False)[source]

Simple cull. Can recursively determine all fronts.

sparsereg.util.crowding_distance(models, *attrs)[source]

Assumes models in lexicographical sorted.

sparsereg.util.sort_non_dominated(models, *attrs, index=False)[source]

NSGA2 based sorting

sparsereg.util.normalize(x, order=2)[source]
sparsereg.util.cardinality(x, null=1e-09)[source]
sparsereg.util.rmse(x)[source]
sparsereg.util.nrmse(x, y)[source]
class sparsereg.util.ReducedLinearModel(mask, lm)[source]

Bases: sklearn.linear_model.base.LinearModel

fit(x, y)[source]

Fit model.

predict(x)[source]

Predict using the linear model

Parameters:X (array_like or sparse matrix, shape (n_samples, n_features)) – Samples.
Returns:C – Returns predicted values.
Return type:array, shape (n_samples,)
scores(x, y)[source]
sparsereg.util.aic(residuals, k, correct=False)[source]

Akaike information criterion