seqtrees 0.1.0__tar.gz

seqtrees-0.1.0/LICENSE

@@ -0,0 +1,190 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        https://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   Copyright 2026 SeqTrees contributors
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       https://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

seqtrees-0.1.0/PKG-INFO

@@ -0,0 +1,199 @@
+Metadata-Version: 2.4
+Name: seqtrees
+Version: 0.1.0
+Summary: Sequential tree models for tabular synthetic data generation
+Author: SeqTrees contributors
+License: Apache-2.0
+Project-URL: Homepage, https://github.com/EulerLettersAI/seqtrees
+Project-URL: Documentation, https://eulerlettersai.github.io/seqtrees/
+Project-URL: Issues, https://github.com/EulerLettersAI/seqtrees/issues
+Keywords: synthetic-data,tabular-data,decision-tree,privacy,sequential-model
+Classifier: Development Status :: 3 - Alpha
+Classifier: Intended Audience :: Developers
+Classifier: Intended Audience :: Science/Research
+Classifier: License :: OSI Approved :: Apache Software License
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3 :: Only
+Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
+Requires-Python: >=3.9
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Provides-Extra: dev
+Requires-Dist: pytest>=8; extra == "dev"
+Provides-Extra: docs
+Requires-Dist: mkdocs<2,>=1.6; extra == "docs"
+Requires-Dist: mkdocstrings[python]<1,>=0.25; extra == "docs"
+Requires-Dist: mkdocs-bibtex<3,>=2; extra == "docs"
+Requires-Dist: pymdown-extensions<11,>=10; extra == "docs"
+Provides-Extra: examples
+Requires-Dist: jupyterlab>=4; extra == "examples"
+Requires-Dist: pandas>=2; extra == "examples"
+Requires-Dist: ifcfill>=0.1; extra == "examples"
+Provides-Extra: pandas
+Requires-Dist: pandas>=2; extra == "pandas"
+Provides-Extra: sklearn
+Requires-Dist: scikit-learn>=1.3; extra == "sklearn"
+Provides-Extra: lightgbm
+Requires-Dist: lightgbm>=4.0; extra == "lightgbm"
+Provides-Extra: fast
+Requires-Dist: pandas>=2; extra == "fast"
+Requires-Dist: scikit-learn>=1.3; extra == "fast"
+Requires-Dist: lightgbm>=4.0; extra == "fast"
+Dynamic: license-file
+
+# seqtrees
+
+Sequential tree models for tabular synthetic data generation.
+
+`seqtrees` is a small open source Python library for generating synthetic tabular
+data with a sequential tree model. Its API follows familiar estimator naming
+conventions:
+
+```python
+from seqtrees import SequentialTreeSynthesizer
+
+data = [
+    {"age": 24.5, "sex_code": 0, "income_bin": 1, "risk_code": 0},
+    {"age": 31.2, "sex_code": 1, "income_bin": 1, "risk_code": 0},
+    {"age": 67.4, "sex_code": 0, "income_bin": 3, "risk_code": 2},
+    {"age": 73.0, "sex_code": 1, "income_bin": 3, "risk_code": 2},
+]
+
+model = SequentialTreeSynthesizer(
+    variable_order=["age", "sex_code", "income_bin", "risk_code"],
+    tree_backend="auto",
+    continuous_strategy="empirical",
+    continuous_columns=["age"],
+    discrete_columns=["sex_code", "income_bin", "risk_code"],
+    n_jobs=-1,
+    random_state=7,
+)
+model.fit(data)
+
+synthetic = model.sample(10)
+```
+
+The model factorizes a table into a sequence of conditional distributions:
+
+```text
+P(X1, X2, ..., Xd) = P(X1) P(X2 | X1) ... P(Xd | X1, ..., Xd-1)
+```
+
+The first variable is sampled from its empirical marginal distribution. Each
+later variable is sampled from a conditional decision tree trained on the
+previous variables in the sequence. This mirrors the sequential data synthesis
+workflow shown in Figure 1 of the attached paper (`ocaa249.pdf`).
+
+SeqTrees expects model-ready, preprocessed data with no null values. It accepts
+only:
+
+- continuous variables as floats;
+- discrete variables as integer category codes, including binary 0/1 variables.
+
+It does not encode raw categorical columns, and it is not intended for one-hot
+encoded inputs. Categorical variables should be mapped before `fit`, for
+example by your preprocessing library, and passed as stable integer codes or
+bins such as `sex_code`, `income_bin`, and `risk_code`.
+
+By default, all generated values are sampled from observed training values.
+For continuous float columns, you can opt into within-leaf interpolation:
+
+```python
+model = SequentialTreeSynthesizer(
+    continuous_strategy="interpolate",
+    continuous_columns=["age", "bmi"],
+    discrete_columns=["sex_code", "income_bin", "risk_code"],
+)
+```
+
+When type lists are supplied, `continuous_columns` and `discrete_columns` must
+classify every input column exactly once.
+
+## Features
+
+- `fit`, `sample`, and `fit_sample` methods.
+- User-specified variable ordering with `variable_order`.
+- Greedy learned ordering with `optimize_order=True`.
+- Parallel fitting and order-search candidates with `n_jobs`.
+- Parallel row synthesis with `sample(..., n_jobs=...)`.
+- Optional LightGBM and scikit-learn backends with `tree_backend="lightgbm"`,
+  `tree_backend="sklearn"`, or `tree_backend="auto"`.
+- Optional within-leaf interpolation for continuous float variables.
+- Supports any number of preprocessed variables.
+- Accepts lists of dictionaries, lists of row sequences, and pandas DataFrames
+  when pandas is installed.
+- Does not provide encoders, imputers, scalers, or category mapping utilities.
+- Pure-Python core with no mandatory runtime dependencies.
+- PlantUML diagrams in `docs/diagrams`.
+
+## Install For Development
+
+```bash
+python -m venv .venv
+source .venv/bin/activate
+python -m pip install -e ".[dev]"
+```
+
+For faster compiled tree fitting:
+
+```bash
+python -m pip install -e ".[fast]"
+```
+
+For LightGBM only:
+
+```bash
+python -m pip install -e ".[lightgbm]"
+```
+
+To run the notebooks in `examples/`:
+
+```bash
+python -m pip install -e ".[examples]"
+jupyter lab examples
+```
+
+Use all available cores:
+
+```python
+model = SequentialTreeSynthesizer(tree_backend="lightgbm", n_jobs=-1)
+```
+
+## Documentation
+
+Start with [docs/index.md](docs/index.md). The package includes PlantUML source
+files for the training and sampling flow:
+
+- [docs/diagrams/sequential_synthesis.puml](docs/diagrams/sequential_synthesis.puml)
+- [docs/diagrams/class_overview.puml](docs/diagrams/class_overview.puml)
+
+Build the documentation locally with MkDocs:
+
+```bash
+python -m venv .venv
+source .venv/bin/activate
+python -m pip install -e ".[docs]"
+mkdocs serve
+```
+
+GitHub Pages documentation is published by `.github/workflows/docs.yml` when
+changes land on `main`.
+
+## Release
+
+Releases are published to PyPI by `.github/workflows/publish.yml` when a GitHub
+Release is published. The workflow uses PyPI Trusted Publishing, so the PyPI
+project needs a trusted publisher configured for:
+
+- repository: `EulerLettersAI/seqtrees`
+- workflow: `.github/workflows/publish.yml`
+- environment: `pypi`
+
+## References
+
+- The implementation is based on the sequential synthetic data workflow
+  described in the attached paper (`ocaa249.pdf`), especially the Figure 1
+  sequential data synthesis process.
+- Breiman, Friedman, Olshen, and Stone. *Classification and Regression Trees*.
+  Wadsworth, 1984.
+- Quinlan. "Induction of Decision Trees." *Machine Learning*, 1986.

seqtrees-0.1.0/README.md

@@ -0,0 +1,156 @@
+# seqtrees
+
+Sequential tree models for tabular synthetic data generation.
+
+`seqtrees` is a small open source Python library for generating synthetic tabular
+data with a sequential tree model. Its API follows familiar estimator naming
+conventions:
+
+```python
+from seqtrees import SequentialTreeSynthesizer
+
+data = [
+    {"age": 24.5, "sex_code": 0, "income_bin": 1, "risk_code": 0},
+    {"age": 31.2, "sex_code": 1, "income_bin": 1, "risk_code": 0},
+    {"age": 67.4, "sex_code": 0, "income_bin": 3, "risk_code": 2},
+    {"age": 73.0, "sex_code": 1, "income_bin": 3, "risk_code": 2},
+]
+
+model = SequentialTreeSynthesizer(
+    variable_order=["age", "sex_code", "income_bin", "risk_code"],
+    tree_backend="auto",
+    continuous_strategy="empirical",
+    continuous_columns=["age"],
+    discrete_columns=["sex_code", "income_bin", "risk_code"],
+    n_jobs=-1,
+    random_state=7,
+)
+model.fit(data)
+
+synthetic = model.sample(10)
+```
+
+The model factorizes a table into a sequence of conditional distributions:
+
+```text
+P(X1, X2, ..., Xd) = P(X1) P(X2 | X1) ... P(Xd | X1, ..., Xd-1)
+```
+
+The first variable is sampled from its empirical marginal distribution. Each
+later variable is sampled from a conditional decision tree trained on the
+previous variables in the sequence. This mirrors the sequential data synthesis
+workflow shown in Figure 1 of the attached paper (`ocaa249.pdf`).
+
+SeqTrees expects model-ready, preprocessed data with no null values. It accepts
+only:
+
+- continuous variables as floats;
+- discrete variables as integer category codes, including binary 0/1 variables.
+
+It does not encode raw categorical columns, and it is not intended for one-hot
+encoded inputs. Categorical variables should be mapped before `fit`, for
+example by your preprocessing library, and passed as stable integer codes or
+bins such as `sex_code`, `income_bin`, and `risk_code`.
+
+By default, all generated values are sampled from observed training values.
+For continuous float columns, you can opt into within-leaf interpolation:
+
+```python
+model = SequentialTreeSynthesizer(
+    continuous_strategy="interpolate",
+    continuous_columns=["age", "bmi"],
+    discrete_columns=["sex_code", "income_bin", "risk_code"],
+)
+```
+
+When type lists are supplied, `continuous_columns` and `discrete_columns` must
+classify every input column exactly once.
+
+## Features
+
+- `fit`, `sample`, and `fit_sample` methods.
+- User-specified variable ordering with `variable_order`.
+- Greedy learned ordering with `optimize_order=True`.
+- Parallel fitting and order-search candidates with `n_jobs`.
+- Parallel row synthesis with `sample(..., n_jobs=...)`.
+- Optional LightGBM and scikit-learn backends with `tree_backend="lightgbm"`,
+  `tree_backend="sklearn"`, or `tree_backend="auto"`.
+- Optional within-leaf interpolation for continuous float variables.
+- Supports any number of preprocessed variables.
+- Accepts lists of dictionaries, lists of row sequences, and pandas DataFrames
+  when pandas is installed.
+- Does not provide encoders, imputers, scalers, or category mapping utilities.
+- Pure-Python core with no mandatory runtime dependencies.
+- PlantUML diagrams in `docs/diagrams`.
+
+## Install For Development
+
+```bash
+python -m venv .venv
+source .venv/bin/activate
+python -m pip install -e ".[dev]"
+```
+
+For faster compiled tree fitting:
+
+```bash
+python -m pip install -e ".[fast]"
+```
+
+For LightGBM only:
+
+```bash
+python -m pip install -e ".[lightgbm]"
+```
+
+To run the notebooks in `examples/`:
+
+```bash
+python -m pip install -e ".[examples]"
+jupyter lab examples
+```
+
+Use all available cores:
+
+```python
+model = SequentialTreeSynthesizer(tree_backend="lightgbm", n_jobs=-1)
+```
+
+## Documentation
+
+Start with [docs/index.md](docs/index.md). The package includes PlantUML source
+files for the training and sampling flow:
+
+- [docs/diagrams/sequential_synthesis.puml](docs/diagrams/sequential_synthesis.puml)
+- [docs/diagrams/class_overview.puml](docs/diagrams/class_overview.puml)
+
+Build the documentation locally with MkDocs:
+
+```bash
+python -m venv .venv
+source .venv/bin/activate
+python -m pip install -e ".[docs]"
+mkdocs serve
+```
+
+GitHub Pages documentation is published by `.github/workflows/docs.yml` when
+changes land on `main`.
+
+## Release
+
+Releases are published to PyPI by `.github/workflows/publish.yml` when a GitHub
+Release is published. The workflow uses PyPI Trusted Publishing, so the PyPI
+project needs a trusted publisher configured for:
+
+- repository: `EulerLettersAI/seqtrees`
+- workflow: `.github/workflows/publish.yml`
+- environment: `pypi`
+
+## References
+
+- The implementation is based on the sequential synthetic data workflow
+  described in the attached paper (`ocaa249.pdf`), especially the Figure 1
+  sequential data synthesis process.
+- Breiman, Friedman, Olshen, and Stone. *Classification and Regression Trees*.
+  Wadsworth, 1984.
+- Quinlan. "Induction of Decision Trees." *Machine Learning*, 1986.

seqtrees-0.1.0/pyproject.toml

@@ -0,0 +1,50 @@
+[build-system]
+requires = ["setuptools>=68"]
+build-backend = "setuptools.build_meta"
+
+[project]
+name = "seqtrees"
+version = "0.1.0"
+description = "Sequential tree models for tabular synthetic data generation"
+readme = "README.md"
+requires-python = ">=3.9"
+license = { text = "Apache-2.0" }
+authors = [
+  { name = "SeqTrees contributors" }
+]
+keywords = ["synthetic-data", "tabular-data", "decision-tree", "privacy", "sequential-model"]
+classifiers = [
+  "Development Status :: 3 - Alpha",
+  "Intended Audience :: Developers",
+  "Intended Audience :: Science/Research",
+  "License :: OSI Approved :: Apache Software License",
+  "Programming Language :: Python :: 3",
+  "Programming Language :: Python :: 3 :: Only",
+  "Topic :: Scientific/Engineering :: Artificial Intelligence",
+]
+dependencies = []
+
+[project.optional-dependencies]
+dev = ["pytest>=8"]
+docs = [
+  "mkdocs>=1.6,<2",
+  "mkdocstrings[python]>=0.25,<1",
+  "mkdocs-bibtex>=2,<3",
+  "pymdown-extensions>=10,<11",
+]
+examples = ["jupyterlab>=4", "pandas>=2", "ifcfill>=0.1"]
+pandas = ["pandas>=2"]
+sklearn = ["scikit-learn>=1.3"]
+lightgbm = ["lightgbm>=4.0"]
+fast = ["pandas>=2", "scikit-learn>=1.3", "lightgbm>=4.0"]
+
+[project.urls]
+Homepage = "https://github.com/EulerLettersAI/seqtrees"
+Documentation = "https://eulerlettersai.github.io/seqtrees/"
+Issues = "https://github.com/EulerLettersAI/seqtrees/issues"
+
+[tool.setuptools.packages.find]
+where = ["src"]
+
+[tool.pytest.ini_options]
+testpaths = ["tests"]

seqtrees-0.1.0/setup.cfg

@@ -0,0 +1,4 @@
+[egg_info]
+tag_build = 
+tag_date = 0
+

seqtrees-0.1.0/src/seqtrees/__init__.py

@@ -0,0 +1,6 @@
+"""Sequential tree models for tabular synthetic data generation."""
+
+from .synthesizer import SequentialTreeSynthesizer
+
+__all__ = ["SequentialTreeSynthesizer"]
+__version__ = "0.1.0"

seqtrees-0.1.0/src/seqtrees/_backends.py

@@ -0,0 +1,81 @@
+from __future__ import annotations
+
+from typing import Any
+
+from ._tree import ConditionalTree
+
+
+SUPPORTED_TREE_BACKENDS = {"native", "sklearn", "lightgbm", "auto"}
+
+
+def create_tree_backend(
+    backend: str,
+    *,
+    max_depth: int,
+    min_samples_leaf: int,
+    min_impurity_decrease: float,
+    max_thresholds: int,
+    random_state: int | None = None,
+    n_jobs: int | None = None,
+) -> Any:
+    if backend not in SUPPORTED_TREE_BACKENDS:
+        raise ValueError(f"tree_backend must be one of {sorted(SUPPORTED_TREE_BACKENDS)}.")
+
+    if backend == "sklearn":
+        from ._sklearn_tree import SklearnConditionalTree
+
+        return SklearnConditionalTree(
+            max_depth=max_depth,
+            min_samples_leaf=min_samples_leaf,
+            min_impurity_decrease=min_impurity_decrease,
+            max_thresholds=max_thresholds,
+            random_state=random_state,
+        )
+
+    if backend == "lightgbm":
+        from ._lightgbm_tree import LightGBMConditionalTree
+
+        return LightGBMConditionalTree(
+            max_depth=max_depth,
+            min_samples_leaf=min_samples_leaf,
+            min_impurity_decrease=min_impurity_decrease,
+            max_thresholds=max_thresholds,
+            random_state=random_state,
+            n_jobs=n_jobs,
+        )
+
+    if backend == "auto":
+        try:
+            from ._lightgbm_tree import LightGBMConditionalTree
+            import lightgbm  # noqa: F401
+
+            return LightGBMConditionalTree(
+                max_depth=max_depth,
+                min_samples_leaf=min_samples_leaf,
+                min_impurity_decrease=min_impurity_decrease,
+                max_thresholds=max_thresholds,
+                random_state=random_state,
+                n_jobs=n_jobs,
+            )
+        except ImportError:
+            pass
+        try:
+            from ._sklearn_tree import SklearnConditionalTree
+            import sklearn  # noqa: F401
+
+            return SklearnConditionalTree(
+                max_depth=max_depth,
+                min_samples_leaf=min_samples_leaf,
+                min_impurity_decrease=min_impurity_decrease,
+                max_thresholds=max_thresholds,
+                random_state=random_state,
+            )
+        except ImportError:
+            pass
+
+    return ConditionalTree(
+        max_depth=max_depth,
+        min_samples_leaf=min_samples_leaf,
+        min_impurity_decrease=min_impurity_decrease,
+        max_thresholds=max_thresholds,
+    )