Parallel Matrix and Clique Search for Compatible Portfolio Identification
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for identifying compatible portfolios are inefficient due to the need for manual trial and error among vast possible combinations, especially when constrained by complex compatibility rules, and fail to utilize compatibility matrices for automatic arrangement and maximization of product usability.
Innovation Solution
A computer-implemented method and system that generates a relational matrix or graph based on compatibility rules to find valid groupings of items that meet objective criteria, using parallel matrix and clique searching methods to reduce the search space and improve efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If manual trial and error methods are used to identify compatible portfolios, then flexibility in handling complex compatibility rules is maintained, but the search time and computational cost increase exponentially
Solution Approach 1:
The patent replaces manual trial-and-error mechanical searching with automated computer-implemented algorithms. The system uses processors to execute compatibility checking algorithms that automatically evaluate portfolios against compatibility rules, substituting human manual operations with computational automation to dramatically reduce search time while maintaining rule handling capability
Solution Approach 2:
The patent performs preliminary actions by pre-processing compatibility data into structured formats (compatibility matrices, graphs, or tables) before the actual portfolio identification process. This pre-organization of compatibility information allows the system to quickly reference and evaluate compatibility during the search process, avoiding the need to re-evaluate compatibility rules from scratch for each portfolio candidate
2Reliability
If all possible portfolio combinations are manually evaluated, then complete compatibility verification is achieved, but the complexity of the search process becomes unmanageable
Solution Approach 1:
The patent segments the complex search process into distinct modular components: (1) data reception module to input portfolio data and compatibility rules, (2) compatibility assessment module to evaluate compatibility using structured representations, and (3) identification module to determine compatible portfolios. This segmentation reduces overall process complexity by breaking down the monolithic search task into manageable, independently executable modules
Solution Approach 2:
The patent introduces compatibility matrices, graphs, or tables as intermediary data structures that mediate between the raw compatibility rules and the portfolio evaluation process. These intermediaries pre-organize compatibility information in a format that simplifies the assessment logic, acting as a bridge that transforms complex rule sets into easily queryable structures for the identification algorithm
3Loss of information
If compatibility matrices are published and updated manually, then current compatibility information is maintained, but automatic arrangement and maximization of product usability is not achieved
Solution Approach 1:
The patent implements self-service by enabling the system to automatically update and maintain compatibility matrices, graphs, or tables without manual intervention. The computer-implemented system continuously processes incoming compatibility data, automatically re-evaluates portfolio compatibility, and updates its internal representations, allowing the compatibility information to maintain itself through automated data processing rather than manual publication and updating
Data Source
AI summary
This invention relates to methods and systems for searching. It is particularly applicable to methods of searching which enable efficient identification of compatible portfolios. Embodiments of the invention propose methods of searching which address the huge search space issue associated with identifying compatible portfolios. In particular, embodiments of the invention start their search operations simultaneously from both sides by both trying to form valid portfolios from candidate products until a valid solution is found and trying to find conflicts from the defined compatibility rules until a conflict is found which leads to the conclusion that no valid solution exists. A conclusion from either process will stop the whole searching process which can significantly reduce blind and unnecessary searching in the whole search space. In embodiments of the invention, the two sides of the search process are also connected in a way which permits two-way communications between the processes to share information about invalid search branches during the execution of the search. The shared information is then used to direct the current and later stage of search execution. Such exchange of information can also significantly reduce the search space and create more efficient searching systems and methods, particularly by stopping search agents from carrying out invalid future searches in branches that another agent has already identified as invalid.