Lifecycle Thread Clustering via Distance Maps
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Complex projects like aircraft development face challenges in scheduling and coordination due to profuse and inconsistent data sets, making it difficult to detect and utilize 'threaded lifecycle patterns' effectively, which are crucial for resource management and project efficiency.
Innovation Solution
A system and method that customize clustering to identify lifecycle threads by using distance maps to reduce computational intensity and storage requirements, allowing for interactive processing and maintaining a manifest of grouping information to associate tasks with clusters based on attributes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Extent of automation
If conventional clustering techniques with standardized criteria are used, then clustering can be performed automatically, but the clusters cannot be customized to collect necessary network elements for lifecycle threads
Solution Approach 1:
The system dynamically adjusts clustering criteria and weights based on user input and project context. The clustering algorithm transitions from static standardized criteria to dynamic customizable criteria, allowing the same system to serve both automated and tailored clustering needs across different project scenarios.
Solution Approach 2:
The system changes the parameters of clustering by allowing users to select from multiple attributes (cost, time, resources, risk) and assign different weights to each attribute. This parameter flexibility enables the system to adapt clustering behavior to specific project requirements while maintaining automated operation.
2Loss of information
If large multi-dimensional matrices are used for interactive handling of large data sets, then complete data analysis is possible, but processing requirements become computationally intensive and interactive interrogation becomes infeasible
Solution Approach 1:
The system extracts only the necessary attributes and data elements required for clustering lifecycle thread tasks, rather than processing complete multi-dimensional matrices. By selecting relevant attributes (cost, time, resources, risk) and their weights, the system reduces data volume while maintaining analysis completeness for the specific clustering objective.
Solution Approach 2:
The system performs partial processing by focusing computational effort only on the attributes and tasks relevant to lifecycle thread identification, rather than exhaustively analyzing all possible data dimensions. This selective approach maintains sufficient analytical depth while dramatically reducing computational burden.
3Measurement precision
If distance computations involving multiple attributes are performed for each comparison, then accurate similarity measurement is achieved, but computational complexity increases significantly
Solution Approach 1:
The system performs distance computations only for the selected attributes relevant to the clustering task, rather than computing distances across all possible attributes. By limiting computations to the essential dimensions (cost, time, resources, risk) with assigned weights, the system maintains measurement precision while reducing computational complexity from O(N² × all_attributes) to O(N² × selected_attributes).
Data Source
AI summary
A method is provided for processing data to replicate lifecycle threads in the development of a structural product. The method includes defining a source lifecycle thread from process-related information for development of the structural product, and defining and matching a target lifecycle thread to the source lifecycle thread. The process, and source and target lifecycle thread are expressible as respectively a network and sub-networks of tasks described by a plurality of attributes. Defining and matching the target lifecycle thread includes selecting a plurality of candidate target tasks from the plurality of tasks; matching a candidate target task to a particular source task using a distance map for an attribute of the plurality of attributes, with the distance map including only unique values of the attribute and distances between the unique values; and back-chaining through the source lifecycle thread to match candidate target tasks with respective source tasks.