Categorical Data Clustering with Block Partitioning and Cluster Tracking

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing clustering methods for large volumes of data, particularly categorical data, are inefficient and resource-intensive, leading to inaccurate threat classification in cyber security systems, and lack scalability and adaptability to evolving data streams.

Innovation Solution

A clustering process that partitions data into subsets, maps data points onto multi-dimensional categorical vectors, iteratively clusters within blocks, and updates clusters over time using hyperspherical shapes, allowing parallel processing and efficient management of large datasets.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If traditional clustering methods are used to process large volumes of categorical data, then clustering accuracy can be maintained, but computational resources and processing time increase substantially

Engineering Contradiction:
Improveclustering accuracyVSAvoidprocessing efficiency
Core Design Contradiction:
Measurement precisionVSProductivity

Solution Approach 1:

The patent divides the large dataset into multiple blocks or partitions, processing each block separately through distributed computing nodes. This segmentation allows the system to handle large volumes of categorical data efficiently while maintaining clustering accuracy through coordinated processing across multiple segments.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent transforms categorical data into a different dimensional representation using dimensionality reduction techniques and mapping to continuous vector spaces. This dimensional transformation enables efficient distance-based clustering algorithms to work with categorical data while reducing computational complexity.

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

2Measurement precision

If manual review processes are used to assess threat levels, then classification accuracy can be maintained, but human resources and processing time are substantially consumed

Engineering Contradiction:
Improvethreat classification accuracyVSAvoidreview time
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The patent implements automated clustering algorithms that self-organize and classify data without human intervention. The system automatically assesses threat levels by analyzing clustered patterns, eliminating the need for manual review while maintaining high classification accuracy through intelligent algorithmic processing.

Inventive Principle:
Principle #25Self-service

Solution Approach 2:

The patent replaces manual human review processes with automated computational clustering systems. The mechanical action of human analysts examining and classifying threats is substituted with algorithmic clustering operations that automatically identify patterns and assess threat levels based on data similarity.

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

3Productivity

If automated AI processing is used to handle large volumes of emails, then processing speed increases, but classification accuracy may deteriorate

Engineering Contradiction:
Improveprocessing speedVSAvoidthreat classification accuracy
Core Design Contradiction:
ProductivityVSMeasurement precision

Solution Approach 1:

The patent incorporates feedback mechanisms where clustering results are continuously refined based on identified patterns and anomalies. The system learns from processing outcomes and adjusts clustering parameters to improve accuracy over time, ensuring that automated processing maintains high classification precision while operating at high speed.

Inventive Principle:
Principle #23Feedback

Solution Approach 2:

The patent implements dynamic clustering algorithms that adapt to changing data characteristics and threat patterns in real-time. The system dynamically adjusts clustering parameters, thresholds, and groupings based on the evolving nature of the data stream, maintaining high accuracy despite the high-speed automated processing of large volumes of emails.

Inventive Principle:
Principle #15Dynamics

4Reliability

If clustering is performed on the entire dataset at once, then comprehensive clustering can be achieved, but computational resources and processing time increase substantially

Engineering Contradiction:
Improveclustering completenessVSAvoidcomputational resources
Core Design Contradiction:
ReliabilityVSUse of energy by stationary object

Solution Approach 1:

The patent divides the comprehensive clustering task into smaller sub-tasks processed in parallel across distributed computing nodes. Each node processes a specific block of data using less computational resources, while the overall system achieves complete clustering through coordinated aggregation of results from all segments.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent performs preliminary data preprocessing, filtering, and blocking operations before the main clustering process. Data is pre-organized into manageable blocks with relevant features extracted in advance, reducing the computational burden during the actual clustering operation while ensuring comprehensive coverage of the entire dataset.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS20250378161A1Clustering and cluster tracking of categorical data
Publication Date: 2025.12.11 MICROSOFT TECHNOLOGY LICENSING LLC
  • US20250378161A1 patent drawing
  • US20250378161A1 patent drawing
  • US20250378161A1 patent drawing

AI summary

An approach for clustering large sets of categorical data involves iteratively ordering the data points, partitioning the data into blocks based on the ordering, and clustering the data points within each block, where different iterations use different orderings and, thus, different partitionings. In some embodiments, the data points are represented by multi-dimensional categorical vectors, and the orderings are based on permutations of the categorical dimensions. The iterative clustering may be repeated for multiple successive time windows to track the clusters. Various applications of the disclosed clustering approach, including for cyber security, are also described.