HEURISTIC SEARCH FOR OPTIMAL NODE IN A GENERALIZATION LATTICE
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
N/A
Issued Date -
Oct 17, 2024
app pub date -
Jun 27, 2024
filing date -
Jun 27, 2024
priority date (Note) -
Published
status (Latency Note)
Importance
Abstract
An approach is disclosed that determines a path through multiple levels of a generalization lattice. The path includes multiple nodes corresponding to the multiple levels, and each of the nodes is determined from a scoring function that utilizes a corresponding parent node that was previously added to the path. The approach then selects an optimal node from the nodes in the path.
First Claim
Family
International Classification(s)
- [Classification Symbol]
- [Patents Count]
Cited Art Landscape
Patent Citation Ranking
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully