-
公开(公告)号:US20180039661A1
公开(公告)日:2018-02-08
申请号:US15555417
申请日:2015-03-12
Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP
Inventor: Evan Kirshenbaum , George Forman
CPC classification number: G06F16/2246 , G06F1/03 , G06F16/24539 , G06F16/24553 , G06F16/9014 , G06F16/90344
Abstract: Example implementations relate to database records associated with a trie. For example, a computing device may include at least one processor to receive a query string and determine, based on the query string, a lookup string associated with a plurality of words in an order. The at least one processor may identify, based on the lookup string and a trie associated with the lookup string, a set of records from a database of records, each record in the set being associated with a score that is associated with a degree to which each record matches the query string, wherein the set is identified based on a penalty value calculated for each record based on a hypothesized collection of typing errors sufficient to transform a prefix of a string associated with each record into the lookup string. The at least one processor may provide a result based on the set.
-
公开(公告)号:US10552398B2
公开(公告)日:2020-02-04
申请号:US15555417
申请日:2015-03-12
Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP
Inventor: Evan Kirshenbaum , George Forman
IPC: G06F16/22 , G06F16/2455 , G06F16/903 , G06F16/2453 , G06F1/03 , G06F16/901
Abstract: Example implementations relate to database records associated with a trie. For example, a computing device may include at least one processor to receive a query string and determine, based on the query string, a lookup string associated with a plurality of words in an order. The at least one processor may identify, based on the lookup string and a trie associated with the lookup string, a set of records from a database of records, each record in the set being associated with a score that is associated with a degree to which each record matches the query string, wherein the set is identified based on a penalty value calculated for each record based on a hypothesized collection of typing errors sufficient to transform a prefix of a string associated with each record into the lookup string. The at least one processor may provide a result based on the set.
-
公开(公告)号:US10534800B2
公开(公告)日:2020-01-14
申请号:US15564573
申请日:2015-04-30
Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP
Inventor: Hila Nachlieli , George Forman , Renato Keshet
Abstract: An example method is provided in according with one implementation of the present disclosure. The method comprises generating a group of most frequent elements in a dataset, calculating features of each of the most frequent elements in the dataset, applying a trained model to the features of each of the most frequent elements, and generating a list of predicted relevant elements from the list of most frequent elements. The method further comprises determining at least one element-chain group for each predicted relevant element and a group score for the element-chain-group, ordering a plurality of element-chain groups for the dataset based on the group score for each of the element-chain groups, and identifying a predetermined number of element-chain groups to be outputted to a user.
-
公开(公告)号:US20180052589A1
公开(公告)日:2018-02-22
申请号:US15238073
申请日:2016-08-16
Applicant: Hewlett Packard Enterprise Development LP
Inventor: George Forman , Olga Shain , Hila Nachlieli
IPC: G06F3/0484 , G06F3/0481 , G06F3/0482
CPC classification number: G06F3/04842 , G06F3/04812 , G06F3/04817 , G06F3/0482 , G06F2203/04801
Abstract: A tag is set as a tag in focus in response to detecting a user selection of the tag. An item in an item view of a user interface is associated with the tag in focus in response to the user selecting the item.
-
公开(公告)号:US20170053024A1
公开(公告)日:2017-02-23
申请号:US15306803
申请日:2014-04-28
Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP
Inventor: George Forman , Renato Keshet , Hila Nachlieli
CPC classification number: G06F16/35 , G06F16/3344 , G06N20/00
Abstract: According to an example, term chain clustering may include receiving a set of training cases from a known category, and receiving a set of unlabeled cases that are to be analyzed with respect to the known category. A plurality of terms of the set of training cases from the known category, and the set of unlabeled cases that are to be analyzed, may be analyzed using a term scoring function to generate a score for each of the plurality of terms. A highest scoring term may be selected from the analyzed terms based on the score for each of the plurality of terms. A selected set that includes cases from the set of unlabeled cases that include the highest scoring term may be generated.
Abstract translation: 根据一个示例,术语链聚类可以包括从已知类别接收一组训练情况,以及接收关于已知类别进行分析的一组未标记的病例。 可以使用术语评分函数来分析来自已知类别的一组训练情况的多个术语,以及将要分析的一组未标记的病例,以生成多个术语中的每一个的得分。 可以基于多个术语中的每一个的分数从所分析的术语中选择最高得分项。 可以生成包括来自包括最高得分项的未标记案例集的案例的选定集合。
-
公开(公告)号:US10068365B2
公开(公告)日:2018-09-04
申请号:US15223928
申请日:2016-07-29
Applicant: Hewlett Packard Enterprise Development LP
Inventor: George Forman , Olga Shain , Hila Nachlieli
Abstract: Examples herein involve generating a spiral visualization of items of a dataset. Dimensions of item indicators corresponding to items of a dataset are analyzed. Starting coordinates for a spiral path for a spiral visualization of the items are determined based on the dimensions of the item indicators and a display area of a display device. A spiral path may be calculated based on the starting coordinates and the dimensions of the item indicators. The spiral visualization may be generated by rendering the item indicators on the spiral path to present a first item indicator of the item indicators from a corresponding first item of the list at the starting coordinates and a last item indicator of the item indicators of a corresponding last item on the list on the spiral path toward the center of the spiral.
-
公开(公告)号:US20180081961A1
公开(公告)日:2018-03-22
申请号:US15564573
申请日:2015-04-30
Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP
Inventor: Hila Nachlieli , George Forman , Renato Keshet
CPC classification number: G06F16/285 , G06F5/01 , G06K9/6218 , G06N5/04 , G06N99/00
Abstract: An example method is provided in according with one implementation of the present disclosure. The method comprises generating a group of most frequent elements in a dataset, calculating features of each of the most frequent elements in the dataset, applying a trained model to the features of each of the most frequent elements, and generating a list of predicted relevant elements from the list of most frequent elements. The method further comprises determining at least one element-chain group for each predicted relevant element and a group score for the element-chain-group, ordering a plurality of element-chain groups for the dataset based on the group score for each of the element-chain groups, and identifying a predetermined number of element-chain groups to be outputted to a user.
-
公开(公告)号:US20180033182A1
公开(公告)日:2018-02-01
申请号:US15223928
申请日:2016-07-29
Applicant: Hewlett Packard Enterprise Development LP
Inventor: George Forman , Olga Shain , Hila Nachlieli
CPC classification number: G06T13/80 , G06F3/048 , G06T3/40 , G06T11/206
Abstract: Examples herein involve generating a spiral visualization of items of a dataset. Dimensions of item indicators corresponding to items of a dataset are analyzed. Starting coordinates for a spiral path for a spiral visualization of the items are determined based on the dimensions of the item indicators and a display area of a display device. A spiral path may be calculated based on the starting coordinates and the dimensions of the item indicators. The spiral visualization may be generated by rendering the item indicators on the spiral path to present a first item indicator of the item indicators from a corresponding first item of the list at the starting coordinates and a last item indicator of the item indicators of a corresponding last item on the list on the spiral path toward the center of the spiral.
-
-
-
-
-
-
-