Tri-Point Data Arbitration for Clustering

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Traditional data clustering methods rely on subjective analyst bias for similarity analysis, leading to overfitting and uncertain results due to the use of two-point distance metrics, which fail to accurately capture relationships between data points with diverse attributes.

Innovation Solution

The implementation of tri-point arbitration, which uses an internal arbiter data point to determine similarity by calculating tri-point arbitration coefficients based on distances between data points and an arbiter, reducing analyst bias and uncovering intrinsic data structures.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If traditional two-point distance metrics are used for similarity analysis, then the process is simple and fast, but the results are biased by subjective analyst judgment and fail to capture intrinsic data relationships

Engineering Contradiction:
Improvesimilarity measurement accuracyVSAvoidsimilarity calculation complexity
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The patent introduces a third data point as an intermediary arbiter to mediate the similarity determination between two data points. Instead of directly comparing two points with subjective analyst input, the third point serves as an objective reference frame to determine whether the two points are close relative to the arbiter, eliminating analyst bias and capturing intrinsic geometric relationships in the data

Inventive Principle:
Principle #24Intermediary (Mediator)

Solution Approach 2:

The patent transitions from two-point distance metrics to tri-point arbitration by adding an additional dimension of comparison. Rather than measuring distance between two points in isolation, the method evaluates the geometric relationship among three points, effectively moving from 2-point space to 3-point configuration space to capture more comprehensive spatial relationships

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

2Reliability

If analyst-selected clustering parameters are used, then the clustering process is straightforward to implement, but the results are overfit to existing data and produce uncertain predictions on new data

Engineering Contradiction:
Improveclustering prediction reliabilityVSAvoidclustering algorithm complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent enables the data to determine its own structure by allowing data points to serve as mutual arbiters. Each data point participates in determining the similarity of other pairs, creating a self-organizing system where the data collectively defines its own clustering structure without external analyst intervention, thereby improving generalization to new data

Inventive Principle:
Principle #25Self-service

Solution Approach 2:

The tri-point arbitration mechanism creates a feedback loop where the similarity determination of any pair of points is influenced by their relationship to other points in the dataset. This mutual reference system allows the clustering structure to emerge from collective data relationships rather than analyst-imposed parameters, reducing overfitting

Inventive Principle:
Principle #23Feedback

Data Source

PatentUS9514213B2Per-attribute data clustering using tri-point data arbitration
Publication Date: 2016.12.06 ORACLE INT CORP
  • US9514213B2 patent drawing
  • US9514213B2 patent drawing
  • US9514213B2 patent drawing

AI summary

Systems, methods, and other embodiments associated with clustering using tri-point arbitration are described. In one embodiment, a method includes selecting a data point pair and a set of arbiter points. A tri-point arbitration similarity is calculated for data point pairs based, at least in part, on a distance between the first and second data points and the arbiter points. In one embodiment, similar data points are clustered.