Co-Applicant Identification via Edge Graph Proximity
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing systems fail to assist users in selecting optimal co-applicants for completing applications by providing only crude means to transition information, lacking assistance in selecting suitable co-applicants based on user connections.
Innovation Solution
A co-application service system that uses an edge graph to identify potential co-applicants by determining their proximity and relationship to the applicant, generating selectable options for co-applicants within the same location, and pre-populating application information for selected co-applicants.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If existing systems provide an index of names for user selection, then users can manually select co-applicants, but the system cannot assist in selecting optimal co-applicants based on relationships or location
Solution Approach 1:
The system pre-computes and stores relationship data and location information in an edge graph structure before the application process. This preliminary organization of data enables the system to quickly identify and present optimal co-applicant candidates without requiring complex real-time computations during the application process.
Solution Approach 2:
The patent introduces an intermediary edge graph data structure that mediates between the user's application needs and the underlying relationship/location data. This intermediary layer processes and filters co-applicant candidates based on predefined criteria, presenting a refined selection to the user without exposing the complexity of the underlying data processing.
2Loss of information
If existing systems provide only crude means to transition information, then information transfer is simple, but sufficient information cannot be passed to complete the application
Solution Approach 1:
The system pre-populates application fields with relevant information from the co-applicant's profile and relationship data before the user submits the application. This preliminary information transfer ensures that critical data is already in place, reducing the need for redundant information entry and minimizing information loss.
Solution Approach 2:
The patent implements a copying mechanism where relevant information from the co-applicant's existing profile, application history, and relationship data is automatically copied and transferred to the current application form. This ensures information completeness while simplifying the user's input burden.
3Measurement precision
If the system identifies co-applicants based on location and relationship data, then optimal co-applicant selection is improved, but data processing complexity increases
Solution Approach 1:
The patent segments the co-applicant identification process into distinct modules: location-based filtering, relationship-based filtering, and suitability scoring. Each module processes specific aspects of the data independently, allowing for precise measurement of co-applicant suitability while managing data processing complexity through modular design.
Solution Approach 2:
The system changes parameters by weighting different factors (location proximity, relationship strength, application history) differently based on the specific application context. This allows the system to dynamically adjust the precision of co-applicant assessment without requiring a complete redesign of the data processing system.
Data Source
AI summary
A system and a method are disclosed for identifying a co-applicant based on proximity to an applicant. In an embodiment, a processor determines a location of the applicant, and identifies a plurality of potential co-applicants that are collocated with the location of the applicant. For each respective potential co-applicant of the plurality of potential co-applicants, the processor determines whether a respective edge exists on a graph that connects the applicant with the respective potential co-applicant, and, responsive to determining that the respective edge exists, identifies the respective potential co-applicant as a candidate co-applicant. The processor generates for display, on a device of the applicant, a selectable option that, when selected, indicates that the applicant would like to use the candidate co-applicant as a co-applicant for an application. Responsive to detecting a selection of the selectable option, the processor activates the application at a device of the candidate co-applicant.