Parallel Nearest Neighbor Models for Data Partitioning

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Computer services, such as nearest neighbor algorithms, face challenges in handling exponentially increasing volumes and frequencies of data transfer, leading to inaccurate or delayed results due to lack of parallelism and inadequate utilization of computing resources.

Innovation Solution

Implementing a set of parallel models that partition data into subsets, each trained on a different feature space, allowing for concurrent processing and aggregation of outputs without losing data quality, and determining the optimal number of models based on computational resources and dataset size.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If a single nearest neighbor model is used to process data, then the model structure is simple, but the response time is excessive and accuracy deteriorates with increasing data volume

Engineering Contradiction:
ImproveaccuracyVSAvoidresponse time
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The patent divides the training dataset into multiple training subsets, each corresponding to a different feature space. Multiple nearest neighbor models are trained in parallel on these subsets, and their outputs are aggregated to produce the final result. This segmentation allows the system to handle large data volumes efficiently while maintaining accuracy, as each model processes a manageable portion of the data independently.

Inventive Principle:
Principle #1Segmentation

2Quantity of substance

If data volume increases exponentially, then more data can be processed, but the computer services return incorrect results or results after excessive time

Engineering Contradiction:
Improvedata volumeVSAvoidresult accuracy
Core Design Contradiction:
Quantity of substanceVSReliability

Solution Approach 1:

The training dataset is segmented into multiple training subsets, each associated with a specific feature space. Multiple nearest neighbor models are trained on these subsets in parallel, enabling the system to process exponentially increasing data volumes while maintaining reliability through distributed computation and result aggregation.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent transforms the input data into different feature spaces using various projection techniques. By changing the parameter representation of the data across multiple feature spaces and training separate models on each, the system can process large volumes of data while maintaining accuracy through multi-perspective analysis.

Inventive Principle:
Principle #35Parameter changes

3Speed

If more computational resources are allocated to improve processing speed, then response time decreases, but the system complexity increases

Engineering Contradiction:
Improveprocessing speedVSAvoidsystem complexity
Core Design Contradiction:
SpeedVSDevice complexity

Solution Approach 1:

The system segments the computational workload into multiple independent nearest neighbor models that can be trained and executed in parallel. This segmentation enables efficient utilization of computational resources while managing system complexity through modular architecture, where each model operates independently on its assigned feature space.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces the dimension of parallel processing by training multiple models simultaneously on different feature spaces. This dimensional approach to computation allows the system to leverage additional computational resources effectively, achieving faster processing speeds without proportionally increasing the complexity of individual model components.

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

4Productivity

If multiple parallel models are implemented to improve processing capability, then productivity increases, but the device complexity increases

Engineering Contradiction:
Improveprocessing capabilityVSAvoidmodel architecture complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The training dataset is divided into multiple training subsets, each corresponding to a specific feature space. Multiple nearest neighbor models are trained on these subsets in parallel, with each model processing a distinct portion of the data. This segmentation increases productivity by enabling concurrent processing while managing complexity through clear separation of computational tasks.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent employs multiple nearest neighbor models that share the same underlying algorithmic structure but operate on different feature spaces. This universal approach allows the system to increase processing capability through parallelism while maintaining consistency in the base model design, thereby managing architectural complexity through repetition of a proven template rather than invention of multiple different algorithms.

Inventive Principle:
Principle #6Universality (Multi-functionality)

Data Source

PatentUS20240378489A1Enhancing nearest neighbor algorithm using a set of parallel models
Publication Date: 2024.11.14 ORACLE INT CORP
  • US20240378489A1 patent drawing
  • US20240378489A1 patent drawing
  • US20240378489A1 patent drawing

AI summary

The present disclosure relates to systems and methods for enhancing computer services with parallel models. A training dataset can be generated. Computer models can be trained using the training dataset. Second data can be partitioned into a set of data subsets. Each data subset can be allocated to a different computer model. Projections of data points can be generated by executing each computer model using a corresponding data subset. Relative differences between the projections can be determined. An output of the computer models can be provided by aggregating the projections of data points.