-
公开(公告)号：US20200036598A1
公开(公告)日：2020-01-30
申请号：US16043946
申请日：2018-07-24
IPC分类号： H04L12/24 , G06F11/34 , G06F3/0484
摘要： A method, computer system, and a computer program product for entity selection in a visualization of a network graph is provided. The present invention may include receiving as input a selection interaction. The present invention may then include generating a profile based on one or more entity characteristics of one or more entities selected in the selection interaction. The present invention may then include generating a weighting for one or more entities based on the generated profile, wherein the generated weighting is a sum of weights of one or more entity characteristics. The present invention may lastly include partitioning the user interface into one or more selectable areas, wherein a size of the selectable area is based on the generated weighting for a displayed entity.
-
公开(公告)号：US11012319B2
公开(公告)日：2021-05-18
申请号：US16043946
申请日：2018-07-24
IPC分类号： H04L12/24 , G06F3/0484 , G06F11/34 , G06F16/35 , H04L29/08
摘要： A method, computer system, and a computer program product for entity selection in a visualization of a network graph is provided. The present invention may include receiving as input a selection interaction. The present invention may then include generating a profile based on one or more entity characteristics of one or more entities selected in the selection interaction. The present invention may then include generating a weighting for one or more entities based on the generated profile, wherein the generated weighting is a sum of weights of one or more entity characteristics. The present invention may lastly include partitioning the user interface into one or more selectable areas, wherein a size of the selectable area is based on the generated weighting for a displayed entity.
-
公开(公告)号：US11093514B2
公开(公告)日：2021-08-17
申请号：US16042067
申请日：2018-07-23
IPC分类号： G06F16/00 , G06F16/2457 , G06F16/901
摘要： A query comprising a graph pattern comprising a plurality of graph triples of node-edge-node is received. A graph database comprising a plurality of graph patterns is accessed and a plurality of graph patterns in the graph database that match the received query are identified. An inverse frequency for each graph triple of the received query in the accessed graph database is calculated and from this a score for each graph pattern in the graph database that matches the received query is also calculated, the score comprising a sum of the inverse frequencies for each graph triple contained within the respective graph pattern. The plurality of graph patterns in the graph database that match the received query are then ranked according to their respective calculated scores.
-
-
搜索结果
3 条记录 (耗时 0.015 秒)
