Skip to content

Main content

Random Affinity Propagation Preference Benchmark Generator

Generate one labeled Gaussian mixture and compare the existing affinity-propagation demonstrator's minimum/median preferences and damping settings on uniformly normalized coordinates; return exemplars, memberships and actual iteration budgets while explicitly reporting that the core does not assess convergence.

Loading tool…

Description

Generate one labeled Gaussian mixture and compare the existing affinity-propagation demonstrator's minimum/median preferences and damping settings on uniformly normalized coordinates; return exemplars, memberships and actual iteration budgets while explicitly reporting that the core does not assess convergence.

Synthetic statistical data separates a specified generating model from the values observed in a finite draw. A model parameter, a sample summary, and the result of a fitted analysis answer different questions; retaining them separately makes numerical and statistical checks easier to interpret.

Generate one labeled Gaussian mixture and compare the existing affinity-propagation demonstrator's minimum/median preferences and damping settings on uniformly normalized coordinates; return exemplars, memberships and actual iteration budgets while explicitly reporting that the core does not assess convergence.

When to use this tool

Use this generator to create reproducible affinity propagation preference benchmark cases from the supplied model or bank. Inspect the returned evidence before using cases in a test or exercise.

How to use the tool and how it works

  1. Supply clusters, settings, maximumIterations in the field shapes below. Set seed when you need an explicit replay.
  2. Run the tool and correct any input error. For generated controls, distinguish a successful fixture containing an invalid case from failure to generate the fixture.
  3. Read points, sourceLabels, distanceScale, runs. Use the conventions below. Keep answer-bearing fields separate when presenting an exercise.

Generate and normalize labeled Gaussian points, then run affinity propagation for every supplied preference/damping setting. Return exemplar/cluster evidence, aligned labels, and an explicit convergenceAssessed false marker.1

Delegated operations used for this result: affinity propagation. Their calculation or parsing conventions apply to the corresponding result fields.2

Input fieldMeaning and unitsAccepted input
clustersClustersRequired. Array of Object; no unknown keys.; minimum items 1; maximum items 8.
clusters[].centerCenterRequired. Array of Finite number.; minimum items 1; maximum items 8.
clusters[].standardDeviationStandard DeviationRequired. Finite number; minimum 0.
clusters[].pointCountPoint CountRequired. Safe integer; minimum 1; maximum 128.
settingsSettingsRequired. Array of Object; no unknown keys.; minimum items 1; maximum items 8.
settings[].preferencePreferenceRequired. Text; one of "median", "minimum".
settings[].dampingDampingRequired. Finite number; minimum 0.5; maximum 0.99.
maximumIterationsMaximum IterationsRequired. Safe integer; minimum 1; maximum 1000.
seedOptional numeric seed; takes precedence over context randomness. Without either, use the fixed tool.io default seed.Optional. Safe integer.
Output fieldInterpretationReturned shape
pointsPointsRequired. Array of Array of Finite number.; minimum items 1; maximum items 8.; minimum items 1; maximum items 128.
sourceLabelsSource LabelsRequired. Array of Safe integer; minimum -1; maximum 7.; minimum items 1; maximum items 128.
distanceScaleDistance ScaleRequired. Finite number; strictly above 0.
runsRunsRequired. Array of Object; no unknown keys.; minimum items 1; maximum items 8.
runs[].preferencePreferenceRequired. Text; one of "median", "minimum".
runs[].dampingDampingRequired. Finite number; minimum 0.5; maximum 0.99.
runs[].resultResultRequired. Object; no unknown keys.
runs[].result.clustersClustersRequired. Array of Object; no unknown keys.; minimum items 1; maximum items 128.
runs[].result.clusters[].exemplarExemplarRequired. Safe integer; minimum 0; maximum 127.
runs[].result.clusters[].membersMembersRequired. Array of Safe integer; minimum 0; maximum 127.; maximum items 128.
runs[].result.iterationsIterationsRequired. Safe integer; minimum 1; maximum 1000.
runs[].labelsLabelsRequired. Array of Safe integer; minimum 0; maximum 127.; minimum items 2; maximum items 128.
runs[].convergenceAssessedConvergence AssessedRequired. Boolean; exactly false.
randomnessReplay source and normalized 32-bit seed, or null seed for an advancing context source.Required. Object; no unknown keys.
randomness.seedOptional safe-integer replay seed; normalization and precedence are explained below.Required. Safe integer. or Null.
randomness.sourceSourceRequired. Text; one of "context", "seed".

An explicit safe-integer seed takes precedence over injected context randomness and is normalized to an unsigned 32-bit integer. With no seed and no context source, replay uses the fixed tool.io default seed. A context source must return finite values from zero inclusive to one exclusive; its advancing state must be retained separately. randomness records the source and normalized seed, or null for context. These generators are not cryptographic random sources.

json
{
  "input": {
    "clusters": [
      {
        "center": [
          0
        ],
        "standardDeviation": 0,
        "pointCount": 1
      },
      {
        "center": [
          2
        ],
        "standardDeviation": 0,
        "pointCount": 1
      },
      {
        "center": [
          10
        ],
        "standardDeviation": 0,
        "pointCount": 1
      }
    ],
    "settings": [
      {
        "preference": "median",
        "damping": 0.5
      },
      {
        "preference": "minimum",
        "damping": 0.5
      }
    ],
    "maximumIterations": 1,
    "seed": 42
  },
  "output": {
    "points": [
      [
        10
      ],
      [
        2
      ],
      [
        0
      ]
    ],
    "sourceLabels": [
      2,
      1,
      0
    ],
    "distanceScale": 10,
    "runs": [
      {
        "preference": "median",
        "damping": 0.5,
        "result": {
          "clusters": [
            {
              "exemplar": 0,
              "members": [
                0,
                1,
                2
              ]
            }
          ],
          "iterations": 1
        },
        "labels": [
          0,
          0,
          0
        ],
        "convergenceAssessed": false
      },
      {
        "preference": "minimum",
        "damping": 0.5,
        "result": {
          "clusters": [
            {
              "exemplar": 1,
              "members": [
                0,
                1,
                2
              ]
            }
          ],
          "iterations": 1
        },
        "labels": [
          0,
          0,
          0
        ],
        "convergenceAssessed": false
      }
    ],
    "randomness": {
      "seed": 42,
      "source": "seed"
    }
  }
}

Limitations and assumptions

  • Preference uses normalized similarity units. Bounded iteration output is not convergence evidence or recovered generating truth; source labels and inferred labels should be compared separately.
  • A replay requires the same complete input and implementation. The stated sampling convention applies within its eligible space. A finite draw does not exhaust all possible outputs; repeats remain possible unless a distinct-selection rule is explicit.
  • The field tables state structural bounds; cross-field constraints and bounded search or output budgets also apply. Unknown keys are rejected where the object contract disallows them. Input errors are distinct from null fields and deliberate invalid controls in a successful output.

Alternative or Complementary methods

For a supplied example, inspect the returned construction or delegated check directly. To evaluate a consumer, also test cases chosen for its own boundaries; a generated finite corpus does not establish exhaustive coverage.

References

  1. Tool behavior and example: Random Affinity Propagation Preference Benchmark Generator — tool.io

  2. Calculation or validation: clustering/affinity-propagation — tool.io

Similar or alternative tools

  • Random Cluster Initialization Sensitivity Benchmark Generator

    Generate one labeled Gaussian mixture and compare k-means++ starting-center coverage across explicit seeds using uniformly scaled squared distances; report initial centers and nearest-center costs, not iterative fits or an optimality guarantee.

  • Random Cluster Shape Comparison Benchmark Generator

    Generate caller-parameterized compact, elongated Gaussian and radially perturbed arc groups, then compare deterministic k-means and flat-kernel mean shift on the same uniformly normalized points; retain source labels separately from fitted labels, finite-budget failures and model parameters without claiming universal clustering quality.