【EP3540609A1】ARTIFICIALINTELLIGENCETECHNIQUESFORIN

edges and to connect to one or more other nodes. An
incorporated by reference in its entirety for all purposes.
extension of any trajectory through a traversed edge and
(22) Date of filing: 13.03.2019
(51) Int Cl.: G06F 16/903 (2019.01)
G06F 16/901 (2019.01)
(84) Designated Contracting States: AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR Designated Extension States: BA ME Designated Validation States: KH MA MD TN
tribute. A set of graph-structure trajectories can be gen-
erated based on the set of attributes. Each graph-struc-
[0001] This application claims the benefit of and the 5 ture trajectory of the set of graph-structure trajectories
• CORRELL, Mickey Alan Nashville, TX 37203 (US)
• McGILL, Kathryn Hopkins Nashville, TX 37203 (US)
• CONNORS, Luke Nashville, TX 37203 (US)
• SCHLAUCH, Daniel Nashville, TX 37203 (US)
(57) Methods and systems disclosed herein relate generally to constructing graph models to represent constraints corresponding to various investigatory events
(72) Inventors: • O’CONNOR, Niall Nashville, TX 37203 (US)
(54) ARTIFICIAL-INTELLIGENCE TECHNIQUES FOR INVESTIGATORY-EVENT POPULATION SELECTION USING GRAPH MODELS
trajectory in the subset can extend to an end node of the
straints corresponding to various investigatory events
plurality of end nodes. Event data can be generated that
priority to U.S. Provisional Application Number
can extend from the starting node through one or more
62/642,420, filed on March 13, 2018, which is hereby
and navigating the graph models to identify populations for the investigatory events.
EP 3 540 609 A1
Printed by Jouve, 75001 PARIS (FR)
1
EP 3 540 609 A1
to connect an edge-contacted node can depend on a
FIELD
10 processing of a criteria group of the edge-contacted node
using at least part of the set of attributes. A subset of the
[0002] Methods and systems disclosed herein relate
set of graph-structure trajectories can be identified. Each
generally to constructing graph models to represent covestigatory event. A starting node can be identified from
amongst the set of nodes based on the particular at-
CROSS-REFERENCE TO RELATED APPLICATIONS
(30) Priority: 13.03.2018 US 201862642420 P
(71) Applicant: HCA Holdings, Inc. Nashville, TN 37203 (US)
(74) Representative: Mewburn Ellis LLP City Tower 40 Basinghall Street London EC2V 5DE (GB)
(19)
TEPZZ¥54Z6Z9A_T
(11)
EP 3 540 609 A1
(12)
EUROPEAN PATENT APPLICATION
(43) Date of publication: 18.09.2019 Bulletin 2019/38
(21) Application number: 19162631.6