SEMI-SUPERVISED FRAMEWORK FOR EFFICIENT TIME-SERIES ORDINAL CLASSIFICATION

    公开(公告)号:US20240135188A1

    公开(公告)日:2024-04-25

    申请号:US18545055

    申请日:2023-12-19

    CPC classification number: G06N3/0895 G06N3/0442

    Abstract: A computer-implemented method for ordinal prediction is provided. The method includes encoding time series data with a temporal encoder to obtain latent space representations. The method includes optimizing the temporal encoder using semi-supervised learning to distinguish different classes in the labeled space using labeled data, and augment the latent space representations using unlabeled training data, to obtain semi-supervised representations. The method further includes discarding a linear layer after the temporal encoder and fixing the temporal encoder. The method also includes training k-1 binary classifiers on top of the semi-supervised representations to obtain k-1 binary predictions. The method additionally includes identifying and correcting inconsistent ones of the k-1 binary predictions by matching the inconsistent ones to consistent ones of the k-1 binary predictions. The method further includes aggregating the k-1 binary predictions to obtain an ordinal prediction.

    SEMI-SUPERVISED FRAMEWORK FOR EFFICIENT TIME-SERIES ORDINAL CLASSIFICATION

    公开(公告)号:US20240127072A1

    公开(公告)日:2024-04-18

    申请号:US18545025

    申请日:2023-12-19

    CPC classification number: G06N3/0895 G06N3/0442

    Abstract: A computer-implemented method for ordinal prediction is provided. The method includes encoding time series data with a temporal encoder to obtain latent space representations. The method includes optimizing the temporal encoder using semi-supervised learning to distinguish different classes in the labeled space using labeled data, and augment the latent space representations using unlabeled training data, to obtain semi-supervised representations. The method further includes discarding a linear layer after the temporal encoder and fixing the temporal encoder. The method also includes training k−1 binary classifiers on top of the semi-supervised representations to obtain k−1 binary predictions. The method additionally includes identifying and correcting inconsistent ones of the k−1 binary predictions by matching the inconsistent ones to consistent ones of the k−1 binary predictions. The method further includes aggregating the k−1 binary predictions to obtain an ordinal prediction.

    Flexible edge-empowered graph convolutional networks with node-edge enhancement

    公开(公告)号:US11620492B2

    公开(公告)日:2023-04-04

    申请号:US16998280

    申请日:2020-08-20

    Abstract: Systems and methods for predicting road conditions and traffic volume is provided. The method includes generating a graph of one or more road regions including a plurality of road intersections and a plurality of road segments, wherein the road intersections are represented as nodes and the road segments are represented as edges. The method can also include embedding the nodes from the graph into a node space, translating the edges of the graph into nodes of a line graph, and embedding the nodes of the line graph into the node space. The method can also include aligning the nodes from the line graph with the nodes from the graph, and optimizing the alignment, outputting a set of node and edge representations that predicts the traffic flow for each of the road segments and road intersections based on the optimized alignment of the nodes.

    INTERDEPENDENT CAUSAL NETWORKS FOR ROOT CAUSE LOCALIZATION

    公开(公告)号:US20230069074A1

    公开(公告)日:2023-03-02

    申请号:US17888819

    申请日:2022-08-16

    Abstract: A method is provided for training a hierarchical graph neural network. The method includes using a time series generated by each of a plurality of nodes to train a graph neural network to generate a causal graph, and identifying interdependent causal networks that depict hierarchical causal links from low-level nodes to high-level nodes to the system key performance indicator (KPI). The method further includes simulating causal relations between entities by aggregating embeddings from neighbors in each layer, and generating output embeddings for entity metrics prediction and between-level aggregation.

Patent Agency Ranking