Lexicographical Decision Tree Classifier¶
Abstract of LexicoDecisionTreeClassifier
Extracted from Ribeiro & Freitas (2024), "Lexicographical random forests for longitudinal data classification".
Standard supervised machine learning methods often ignore the temporal information represented in longitudinal data, but that information can lead to more precise predictions in classification tasks. Data preprocessing techniques and classification algorithms can be adapted to cope directly with longitudinal data inputs, making use of temporal information such as the time-index of features and previous measurements of the class variable. In this article, we propose two changes to the classification task of predicting age-related diseases in a real-world dataset created from the English Longitudinal Study of Ageing. First, we explore the addition of previous measurements of the class variable, and estimating the missing data in those added features using intermediate classifiers. Second, we propose a new split-feature selection procedure for a random forest's decision trees, which considers the candidate features' time-indexes, in addition to the information gain ratio. Our experiments compared the proposed approaches to baseline approaches, in 3 prediction scenarios, varying the "time gap" for the prediction - how many years in advance the class (occurrence of an age-related disease) is predicted. The experiments were performed on 10 datasets varying the class variable, and showed that the proposed approaches increased the random forest's predictive accuracy.
Adapted to a single decision tree, this estimator implements the lexicographic split-selection procedure above directly inside DecisionTreeClassifier's splitter, yielding a longitudinal-aware tree that prefers more recent waves whenever competing splits have comparable gain ratios.
What are features_group and non_longitudinal_features?
Two key attributes, features_group and non_longitudinal_features, enable algorithms to interpret the
temporal structure of longitudinal data.
- features_group: A list of lists where each sublist contains indices of a longitudinal attribute's waves, ordered from oldest to most recent. This captures temporal dependencies.
- non_longitudinal_features: A list of indices for static, non-temporal features excluded from the temporal matrix.
Proper setup of these attributes is critical for leveraging temporal patterns effectively.
LexicoDecisionTreeClassifier ¶
Bases: DecisionTreeClassifier
Lexico Decision Tree Classifier for longitudinal data classification.
This classifier extends scikit-learn's DecisionTreeClassifier for longitudinal data by integrating a
lexicographic optimisation approach that prioritises more recent waves during split selection, based on the
premise that recent measurements are more predictive and relevant. Splits are evaluated with a bi-objective
rule: the primary objective maximises the information-gain ratio (entropy criterion), and the secondary
objective favours features from more recent waves whenever competing gain ratios are within threshold_gain.
Parameters:
| Name | Type | Description | Default |
|---|---|---|---|
threshold_gain
|
float, default=0.0015
|
The threshold value for comparing gain ratios of features during tree construction. A lower value makes the algorithm more selective in choosing recent features, requiring gain ratios to be closer for recency to take precedence. A higher value allows larger differences in gain ratios while still considering recency. |
0.0015
|
features_group
|
List[List[int]]
|
A list of lists where each inner list contains indices of features corresponding to a specific longitudinal
attribute across different waves. The order within each inner list reflects the temporal sequence, with the
first element being the oldest wave and the last being the most recent. For example, |
None
|
criterion
|
str, default="entropy"
|
The function to measure the quality of a split. Fixed to "entropy" for this algorithm; do not change. |
'entropy'
|
splitter
|
str, default="lexicoRF"
|
The strategy used to choose the split at each node. Fixed to "lexicoRF" for this algorithm; do not change. |
'lexicoRF'
|
max_depth
|
Optional[int], default=None
|
The maximum depth of the tree. If None, nodes are expanded until all leaves are pure or meet other constraints. |
None
|
min_samples_split
|
int, default=2
|
The minimum number of samples required to split an internal node. |
2
|
min_samples_leaf
|
int, default=1
|
The minimum number of samples required to be at a leaf node. |
1
|
min_weight_fraction_leaf
|
float, default=0.0
|
The minimum weighted fraction of the sum total of weights required to be at a leaf node. |
0.0
|
max_features
|
Optional[Union[int, str]], default=None
|
The number of features to consider when looking for the best split. Can be int, float, "auto", "sqrt", or "log2". |
None
|
random_state
|
Optional[int], default=None
|
The seed used by the random number generator for reproducibility. |
None
|
max_leaf_nodes
|
Optional[int], default=None
|
The maximum number of leaf nodes in the tree. If None, unlimited. |
None
|
min_impurity_decrease
|
float, default=0.0
|
The minimum impurity decrease required for a node to be split. |
0.0
|
class_weight
|
Optional[Union[dict, List[dict], str]], default=None
|
Weights associated with classes in the form |
None
|
ccp_alpha
|
float, default=0.0
|
Complexity parameter used for Minimal Cost-Complexity Pruning. Must be non-negative. |
0.0
|
store_leaf_values
|
bool, default=False
|
Whether to store leaf values during tree construction. |
False
|
monotonic_cst
|
Optional[List[int]], default=None
|
Monotonic constraints for features (1 for increasing, -1 for decreasing, 0 for no constraint). |
None
|
Attributes:
| Name | Type | Description |
|---|---|---|
classes_ |
ndarray of shape (n_classes,
|
The class labels. |
n_classes_ |
int
|
The number of classes. |
n_features_ |
int
|
The number of features when fit is performed. |
n_outputs_ |
int
|
The number of outputs when fit is performed (fixed to 1 for this classifier). |
feature_importances_ |
ndarray of shape (n_features,
|
The impurity-based feature importances. |
max_features_ |
int
|
The inferred value of max_features after fitting. |
tree_ |
Tree object
|
The underlying Tree object representing the decision tree. |
Examples:
Below are examples demonstrating the usage of the LexicoDecisionTreeClassifier class.
Basic Usage
Please note that the Iris is not longitudinal data, but this example is for demonstration purposes only. We could not publicly use the dataset we use for our various papers without user registering to the ELSA project.
If you find public longitudinal datasets, or if you have also more public-yet-registration-required datasets / private datasets, please adapt the examples to your usecase.
from sklearn.datasets import load_iris
from sklearn.model_selection import train_test_split
from sklearn.metrics import accuracy_score
from scikit_longitudinal.estimators.trees import LexicoDecisionTreeClassifier
# Load dataset
X, y = load_iris(return_X_y=True)
X_train, X_test, y_train, y_test = train_test_split(X, y, test_size=0.2, random_state=42)
# Define features_group (example for illustration; adjust based on actual longitudinal structure)
features_group = [[0, 1], [2, 3]]
# Initialize and fit the classifier
clf = LexicoDecisionTreeClassifier(threshold_gain=0.1, features_group=features_group)
clf.fit(X_train, y_train)
# Predict and evaluate
y_pred = clf.predict(X_test)
accuracy = accuracy_score(y_test, y_pred)
print(f"Accuracy: {accuracy}")
Advanced: using with LongitudinalPipeline
from scikit_longitudinal.pipeline import LongitudinalPipeline
from scikit_longitudinal.data_preparation import LongitudinalDataset
from scikit_longitudinal.estimators.trees import LexicoDecisionTreeClassifier
from scikit_longitudinal.data_preparation import LongitudinalDataset
from scikit_longitudinal.data_preparation import MerWavTimePlus
# Load dataset
dataset = LongitudinalDataset('./stroke_longitudinal.csv')
dataset.load_data()
dataset.load_target(target_column="stroke_w2")
dataset.setup_features_group("elsa")
dataset.load_train_test_split(test_size=0.2, random_state=42)
# Define pipeline steps with LexicoDecisionTreeClassifier
steps = [
('MerWavTime Plus', MerWavTimePlus()), # Recall, a pipeline is at least two steps and the first one being a Data Transformation step. Here as we use a Longitudinal classifier, we need to use MerWavTimePlus, retaining the temporal dependency.
('classifier', LexicoDecisionTreeClassifier(features_group=dataset.feature_groups()))
]
# Initialize pipeline
pipeline = LongitudinalPipeline(
steps=steps,
features_group=dataset.feature_groups(),
non_longitudinal_features=dataset.non_longitudinal_features(),
feature_list_names=dataset.data.columns.tolist(),
update_feature_groups_callback="default"
)
# Fit and predict
pipeline.fit(dataset.X_train, dataset.y_train)
y_pred = pipeline.predict(dataset.X_test)
print(f"Predictions: {y_pred}")
Source code in scikit_longitudinal/estimators/trees/lexicographical/lexico_decision_tree.py
8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 | |
fit(X, y, sample_weight=None, *args, **kwargs)
¶
Fit the Lexico Decision Tree Classifier to the training data.
This method trains the classifier using the provided training data and labels. It requires the features_group
parameter to be set, as it is essential for handling longitudinal data.
Parameters:
| Name | Type | Description | Default |
|---|---|---|---|
X
|
array-like of shape (n_samples, n_features)
|
The training input samples. |
required |
y
|
array-like of shape (n_samples,)
|
The target values (class labels). |
required |
*args
|
Additional positional arguments passed to the superclass |
()
|
|
**kwargs
|
Additional keyword arguments passed to the superclass |
{}
|
Returns:
| Name | Type | Description |
|---|---|---|
LexicoDecisionTreeClassifier |
The fitted classifier instance. |
Raises:
| Type | Description |
|---|---|
ValueError
|
If |
Source code in scikit_longitudinal/estimators/trees/lexicographical/lexico_decision_tree.py
predict(X, check_input=True)
¶
Predict class labels for the input samples.
Inherited from scikit-learn's DecisionTreeClassifier. The Lexico tree only customises
split selection at fit time; prediction is the standard tree-traversal routine.
Parameters:
| Name | Type | Description | Default |
|---|---|---|---|
X
|
array-like of shape (n_samples, n_features)
|
Input samples. |
required |
check_input
|
bool, default=True
|
Allow to bypass input validation. Forwarded to scikit-learn. |
True
|
Returns:
| Type | Description |
|---|---|
|
np.ndarray: Predicted class labels of shape |
Source code in scikit_longitudinal/estimators/trees/lexicographical/lexico_decision_tree.py
predict_proba(X, check_input=True)
¶
Predict class probabilities for the input samples.
Inherited from scikit-learn's DecisionTreeClassifier. Probabilities are the fraction of
training samples of each class in the leaf reached by each input sample.
Parameters:
| Name | Type | Description | Default |
|---|---|---|---|
X
|
array-like of shape (n_samples, n_features)
|
Input samples. |
required |
check_input
|
bool, default=True
|
Allow to bypass input validation. Forwarded to scikit-learn. |
True
|
Returns:
| Type | Description |
|---|---|
|
np.ndarray: Class probabilities of shape |
|
|
as in |