发明名称 Producing Clustered Top-K Plans
摘要 A mechanism is provided for identifying a set of top-in clusters from a set of top-k plans. A planning problem and an integer value k indicating a number of top plans to be identified are received. A set of top-k plans are generated with at most size k, where the set of top-k plans is with respect to a given measure of plan quality. Each plan in the set of top-k plans is clustered based on a similarity between plans such that each cluster contains similar plans and each plan is grouped only into one cluster thereby forming the set of top-m clusters. A representative plan from each top-m cluster is presented to the user.
申请公布号 US2016117602(A1) 申请公布日期 2016.04.28
申请号 US201514745899 申请日期 2015.06.22
申请人 International Business Machines Corporation 发明人 Hassanzadeh Oktie;Riabov Anton V.;Sohrabi Araghi Shirin;Udrea Octavian
分类号 G06N99/00;G06F17/30 主分类号 G06N99/00
代理机构 代理人
主权项 1. A method, in a data processing system, for identifying a set of top-m clusters from a set of top-k plans, the method comprising: receiving, by a processor in the data processing system, a planning problem and an integer value k indicating a number of top plans to be identified; generating, by the processor, the set of top-k plans with at most size k, wherein the set of top-k plans is with respect to a given measure of plan quality; clustering, by the processor, each plan in the set of top-k plans based on a similarity between plans such that each cluster contains similar plans and each plan is grouped only into one cluster thereby forming the set of top-m clusters; and presenting, by the processor, a representative plan from each top-m cluster to the user.
地址 Armonk NY US