Methods and systems for association rule mining

Inventors

Kumar, Anshul • Hookom, Jacob • Tran, Duy

Assignees

McKesson Corp

Interested in licensing this patent?

MTEC can help explore whether this patent might be available for licensing for your application.

Publication Number

US-12190269-B2

Patent

Publication Date

2025-01-07

Expiration Date


Abstract

Provided are methods, systems, and apparatuses for improving supply chain management interfaces and functionality. A frequency of occurrence for each unique combination of a use attribute and a product attribute for various supplies may be determined. A frequency table containing each unique combination may be generated as well as one or more association rules. A level of confidence and a level of lift may be determined for each of the one or more association rules, both of which may be used to generate a score for each unique combination that may be used to rank each unique combination. The ranked unique combinations may then be provided to a supply chain management interface and a database.

Core Innovation

The invention provides a system and method focused on association-rule mining in a supply chain management (SCM) system using database records that include a medical diagnosis attribute and a product attribute. A frequent pattern tree (FP-tree) is generated comprising a plurality of nodes, where each node is associated with one of the plurality of database records. Links between nodes that share a common medical diagnosis attribute and a common product attribute are determined, and links for each product attribute are determined, where each link is indicative of a path to a root node of the FP-tree.

An FP-growth algorithm is recursively invoked to determine, based on the first plurality of links and the second plurality of links in the FP-tree and the corresponding paths to the root node of the FP-tree, a frequency of occurrence for each unique combination of medical diagnosis attribute and product attribute. Based on the frequency of occurrence for each unique combination, a preliminary association rule set is determined, where each association rule comprises a level of confidence and one or more of the product attributes within the plurality of database records. A final association rule set is generated by removing, based on the level of confidence, a first association rule whose level of confidence is less than or equal to the level of confidence of a second association rule.

Based on the final association rule set and a query comprising a first medical diagnosis attribute, the invention provides at least one product identifier and a suggested quantity associated with the first medical diagnosis attribute. The medical diagnosis attribute is linked to symptom attributes, and a diagnosis code included in the medical diagnosis attribute is used as the basis for deriving the symptom attributes. Suggested quantity is determined using symptom attributes, including relationships between product attributes and symptom attributes, as part of SCM/e-commerce search and retrieval using the query and a user interface.

Claims Coverage

The partial content includes three independent claims. Each independent claim covers FP-tree construction from records with a medical diagnosis attribute and product attribute, recursive FP-growth to compute frequencies for unique diagnosis–product combinations, confidence-based association rules, and providing product identifiers and suggested quantity for a query diagnosis attribute.

FP-tree generation from medical diagnosis and product records

Generating a frequent pattern tree (FP-tree) comprising a plurality of nodes that are each associated with one of a plurality of database records, wherein each database record comprises a medical diagnosis attribute and a product attribute; determining links between nodes sharing a common medical diagnosis attribute and a common product attribute, and links for each product attribute, each indicative of a path to a root node of the FP-tree.

FP-growth frequency for unique diagnosis-product combinations

Recursively invoking an FP-growth algorithm to determine, based on the links in the FP-tree and the corresponding paths to the root node of the FP-tree, a frequency of occurrence for each unique combination of medical diagnosis attribute and product attribute.

Confidence-based preliminary and final association rule sets

Determining a preliminary association rule set based on the frequency of occurrence for each unique combination, wherein each association rule comprises a level of confidence and one or more product attributes; removing a first association rule whose level of confidence is less than or equal to the level of confidence of a second association rule to generate a final association rule set.

Query-based providing product identifiers and suggested quantity

Providing, based on the final association rule set and a query comprising a first medical diagnosis attribute, at least one product identifier and a suggested quantity associated with the first medical diagnosis attribute.

The inventive coverage centers on FP-tree construction from medical diagnosis and product attributes, FP-growth-based computation of frequency of occurrence for unique combinations, confidence-based pruning of association rules, and query-based provision of product identifiers and suggested quantity.

Stated Advantages

Not explicitly described in patent.

Documented Applications

Not explicitly described in patent.

JOIN OUR MAILING LIST

Stay Connected with MTEC

Keep up with active and upcoming solicitations, MTEC news and other valuable information.