PHP - APRIORI -如何显示满足支持值的组合？

<?php
// 数据集
$transactions = array(
    array('A', 'B', 'C'),
    array('A', 'B'),
    array('A', 'C', 'D'),
    array('B', 'C'),
    array('B', 'D'),
    array('C', 'D')
);

// 计算支持值
function calculateSupport($transactions, $itemset) {
    $count = 0;
    foreach ($transactions as $transaction) {
        if (array_intersect($itemset, $transaction) == $itemset) {
            $count++;
        }
    }
    return $count;
}

// 显示满足支持值的组合
function displayCombinations($transactions, $minSupport) {
    $items = array_unique(call_user_func_array('array_merge', $transactions));
    $combinations = array();

    // 生成所有可能的组合
    for ($i = 1; $i <= count($items); $i++) {
        $combinations = array_merge($combinations, combinations($items, $i));
    }

    // 过滤满足支持值的组合
    foreach ($combinations as $combination) {
        $support = calculateSupport($transactions, $combination);
        if ($support >= $minSupport) {
            echo implode(', ', $combination) . ' - 支持值: ' . $support . '<br>';
        }
    }
}

// 生成组合
function combinations($items, $k) {
    $combinations = array();
    $n = count($items);

    if ($k > $n) {
        return $combinations;
    }

    $indices = range(0, $k - 1);
    $combinations[] = array_intersect_key($items, array_flip($indices));

    while (true) {
        $i = $k - 1;
        while ($i >= 0 && $indices[$i] == $n - $k + $i) {
            $i--;
        }

        if ($i < 0) {
            break;
        }

        $indices[$i]++;
        for ($j = $i + 1; $j < $k; $j++) {
            $indices[$j] = $indices[$j - 1] + 1;
        }

        $combinations[] = array_intersect_key($items, array_flip($indices));
    }

    return $combinations;
}

// 调用函数显示满足支持值的组合
displayCombinations($transactions, 2);
?>