https://pizza.rs/tags/adjacency_matrix/Recent content in Adjacency_matrix on INFINI PizzaHugoenhttps://pizza.rs/docs/references/aggregation/bucket/adjacency-matrix/Mon, 01 Jan 0001 00:00:00 +0000https://pizza.rs/docs/references/aggregation/bucket/adjacency-matrix/<h1 id="adjacency-matrix-aggregation"> Adjacency matrix aggregation <a class="anchor" href="#adjacency-matrix-aggregation">#</a> </h1> <p>A multi-bucket aggregation returning every named filter&rsquo;s document set plus their pairwise INTERSECTIONS — the cross product view of several filters. Where <a href="https://pizza.rs/docs/references/aggregation/bucket/filters/"><code>filters</code></a> answers each filter separately, this one also tells you how much they overlap, which is exactly what co-occurrence analysis needs.</p> <h2 id="how-it-works"> How it works <a class="anchor" href="#how-it-works">#</a> </h2> <p>Each named filter is evaluated against every candidate document, so a document can carry several filter flags at once. The engine then emits one bucket per non-empty filter (keyed by its name) and one bucket per non-empty pair, keyed <code>a&amp;b</code> with the two names in alphabetical order. Intersections beyond pairs — no <code>a&amp;b&amp;c</code> triples — are not computed, and empty buckets are skipped entirely, so the bucket count tops out at <code>n·(n−1)/2 + n</code>.</p>