LGOFMART¶
- class kgpy.ctis.inversion.mart.lgof_mart.LGOFMART(track_cube_history=False, anti_aliasing=None, rotation_kwargs=<factory>, verbose=False)¶
Bases:
SimpleMART- Parameters:
- __init__(track_cube_history=False, anti_aliasing=None, rotation_kwargs=<factory>, verbose=False)¶
Attributes
SimpleMART is the basic unit of mart, and encompasses a single "filtering iteration".
Methods
__init__([track_cube_history, ...])channel_is_not_converged(goodness_of_fit)- rtype:
chisq(goodness_of_fit)- rtype:
correction_exponent(goodness_of_fit)- rtype:
Inheritance Diagram
digraph inheritance708345c546 { bgcolor=transparent; rankdir=TB; size="8.0, 12.0"; "kgpy.ctis.inversion.mart.lgof_mart.LGOFMART" [URL="kgpy.ctis.inversion.mart.lgof_mart.LGOFMART.html#kgpy.ctis.inversion.mart.lgof_mart.LGOFMART",fillcolor=white,fontname="Vera Sans, DejaVu Sans, Liberation Sans, Arial, Helvetica, sans",fontsize=10,height=0.25,shape=box,style="setlinewidth(0.5),filled",target="_top"]; "kgpy.ctis.inversion.mart.simple_mart.SimpleMART" -> "kgpy.ctis.inversion.mart.lgof_mart.LGOFMART" [arrowsize=0.5,style="setlinewidth(0.5)"]; "kgpy.ctis.inversion.mart.simple_mart.SimpleMART" [URL="kgpy.ctis.inversion.mart.simple_mart.SimpleMART.html#kgpy.ctis.inversion.mart.simple_mart.SimpleMART",fillcolor=white,fontname="Vera Sans, DejaVu Sans, Liberation Sans, Arial, Helvetica, sans",fontsize=10,height=0.25,shape=box,style="setlinewidth(0.5),filled",target="_top",tooltip="SimpleMART(track_cube_history: bool = False, anti_aliasing: str = None, rotation_kwargs: Dict[str, Any] = <factory>, verbose: bool = False)"]; }- static channel_is_not_converged(goodness_of_fit)¶
-
rotation_kwargs:
typing.Dict[str,typing.Any]¶
-
type_int:
typing.ClassVar[int] = 1¶
-
verbose:
bool= False¶ SimpleMART is the basic unit of mart, and encompasses a single “filtering iteration”.
- Parameters:
track_cube_history – if ‘multiplicative’, a copy of the cube after each multiplicative iteration will be stored. Very memory intensive. if ‘filter’, a copy is saved each time MART converges (or exceeds max multiplicative iterations)