| CPC G16H 50/30 (2018.01) [G06F 16/1794 (2019.01); G06F 16/258 (2019.01); G16H 40/67 (2018.01)] | 13 Claims |
|
1. A processor implemented method comprising:
receiving, by one or more hardware processors, a raw data from a plurality of sensors associated with a user, wherein the plurality of sensors are heterogeneous;
transforming, by the one or more hardware processors, the raw data corresponding to each of the plurality of sensors into a sensor metadata format associated with a corresponding sensor among the plurality of sensors;
obtaining, by the one or more hardware processors, a temporally aligned data by performing a time based slotting on the transformed data;
obtaining, by the one or more hardware processors, the sensor metadata corresponding to the temporally aligned data from a database based on a mapping between the temporally aligned data and the sensor metadata;
selecting, by the one or more hardware processors, an algorithm pipeline corresponding to a disorder to be analyzed from a Directed Acyclic Graph (DAG), wherein the selection is based on the sensor metadata and a plurality of algorithm metadata corresponding to a plurality of algorithms stored in an algorithm database, wherein selecting the algorithm pipeline corresponding to the selected disorder to be analyzed from the DAG based on the sensor metadata and a plurality of algorithm metadata comprises:
receiving the DAG comprising a plurality of nodes and a plurality of edges, wherein each of the plurality of nodes associated with the DAG represents an algorithm from the plurality of algorithms and each of the plurality of edges connecting two nodes indicates a dependency between a preceding node and a succeeding node, wherein the DAG is associated with at least one entry point;
selecting an initial node corresponding to a first algorithm of the algorithm pipeline from the DAG based on a comparison between the corresponding sensor metadata and an algorithm metadata associated with each of the plurality of algorithms, wherein the initial node is assigned as a current node;
obtaining the algorithm metadata associated with a plurality of next nodes associated with the current node;
selecting a next node from the plurality of next nodes based on a comparison between an output associated with the current node and the algorithm schema associated with each of the plurality of next nodes, wherein the selected next node is assigned as the current node, and wherein the DAG is traversed until reaching a leaf node identified based on a next null pointer; and
obtaining the algorithm pipeline based on the traversal path from the initial node to the leaf node; and
analyzing, by the one or more hardware processors, the disorder associated with the user based on the selected algorithm pipeline.
|