Abstract: Systems and techniques that facilitate few-shot temporal action localization based on graph convolutional networks are provided. In one or more embodiments, a graph component can generate a graph that models a support set of temporal action classifications. Nodes of the graph can correspond to respective temporal action classifications in the support set. Edges of the graph can correspond to similarities between the respective temporal action classifications. In various embodiments, a convolution component can perform a convolution on the graph, such that the nodes of the graph output respective matching scores indicating levels of match between the respective temporal action classifications and an action to be classified. In various embodiments, an instantiation component can input into the nodes respective input vectors based on a proposed feature vector representing the action to be classified.

Abstract: A computer system identifies threads in a communication session. A feature vector is generated for a message in a communication session, wherein the feature vector includes elements for features and contextual information of the message. The message feature vector and feature vectors for a plurality of threads are processed using machine learning models each associated with a corresponding thread to determine a set of probability values for classifying the message into at least one thread, wherein the threads include one or more pre-existing threads and a new thread. A classification of the message into at least one of the threads is indicated based on the set of probability values. Classification of one or more prior messages is adjusted based on the message's classification. Embodiments of the present invention further include a method and program product for identifying threads in a communication session in substantially the same manner described above.

Abstract: Systems and methods provide for automated messaging summarization and ranking. The systems and methods may use an integrated machine learning model to perform thread detection, thread summarization, and summarization ranking. The messages may be received from a team chat application, organized, summarized and ranked by the machine learning model, and the results may be returned to the team chat application. In some cases, the ranking may be different for different users of the team chat application.

Abstract: Embodiments for providing automated machine learning visualization. Machine learning tasks, transformers, and estimators may be received into one or more machine learning composition modules. The machine learning composition modules generate one or more machine learning models. A machine learning model pipeline is a sequence of transformers and estimators and an ensemble of machine learning pipelines are an ensemble of machine learning pipelines. A machine learning model pipeline, an ensemble of a plurality of machine learning model pipelines, or a combination thereof, along with corresponding metadata, may be generated using the machine learning composition modules. Metadata may be extracted from the machine learning model pipeline, the ensemble of a plurality of machine learning model pipelines, or combination thereof.

Abstract: A deep learning module classifies messages received from a plurality of entities into one or more conversation threads. In response to receiving a subsequent message, the deep learning module determines which of the one or more conversation threads and a new conversation thread is contextually a best fit for the subsequent message. The subsequent message is added to the determined conversation thread.

Abstract: An artificial intelligence (AI) interaction method, system, and computer program product include selecting an artificial intelligence model to respond to a query to generating a response to the query using the selected artificial intelligence model, and receiving the response to the query from the selected artificial intelligence model.

Abstract: A method includes determining, based on an input data sample, a set of probabilities. Each probability of the set of probabilities is associated with a respective label of a set of labels. A particular probability associated with a particular label indicates an estimated likelihood that the input data sample is associated with the particular label. The method includes modifying the set of probabilities based on a set of adjustment factors to generate a modified set of probabilities. The set of adjustment factors is based on a first relative frequency distribution and a second relative frequency distribution. The first relative frequency distribution indicates for each label of the set of labels, a frequency of occurrence of the label among training data. The second relative frequency distribution indicates for each label of the set of labels, a frequency of occurrence of the label among post-training data provided to the trained classifier.

Abstract: A computer-implemented method includes using an embedding network to generate prototypical vectors. Each prototypical vector is based on a corresponding label associated with a first domain. The computer-implemented method also includes using the embedding network to generate an in-domain test vector based on at least one data sample from a particular label associated with the first domain and using the embedding network to generate an out-of-domain test vector based on at least one other data sample associated with a different domain. The computer-implemented method also includes comparing the prototypical vectors to the in-domain test vector to generate in-domain comparison values and comparing the prototypical vectors to the out-of-domain test vector to generate out-of-domain comparison values. The computer-implemented method also includes modifying, based on the in-domain comparison values and the out-of-domain comparison values, one or more parameters of the embedding network.

Abstract: A computing device receives a video feed. The video feed is divided into a sequence of video segments. For each video segment, visual features of the video segment are extracted. A predicted spectrogram is generated based on the extracted visual features. A synthetic audio waveform is generated from the predicted spectrogram. All synthetic audio waveforms of the video feed are concatenated to generate a synthetic soundtrack that is synchronized with the video feed.

Abstract: Techniques facilitating detection of conversation threads in unstructured channels are provided. A system can comprise a memory that stores computer executable components and a processor that executes the computer executable components stored in the memory. The computer executable components can comprise an extraction component that employs a model to detect conversation messages based on a defined confidence level and assigns the conversation messages to respective conversation thread categories. The computer executable components also can comprise a model component that trains the model on conversation messages that comprise respective text data, wherein the model is trained to detect the respective text data to the defined confidence level.

Abstract: Systems, computer-implemented methods, and computer program products that can facilitate calculating an online social network distance between entities of an organization are provided. According to an embodiment, a system can comprise a memory that stores computer executable components and a processor that executes the computer executable components stored in the memory. The computer executable components can comprise a weighted organizational distance component that calculates a weighted organizational distance score of one or more links between entities of an organization hierarchy based on directionality of the one or more links relative to the organization hierarchy. The computer executable components can further comprise a learner component that employs an artificial intelligence model to generate information based on the weighted organizational distance score.

Abstract: Embodiments of the present invention are directed to a computer-implemented method for action localization. A non-limiting example of the computer-implemented method includes receiving, by a processor, a video and segmenting, by the processor, the video into a set of video segments. The computer-implemented method classifies, by the processor, each video segment into a class and calculates, by the processor, importance scores for each video segment of a class within the set of video segments. The computer-implemented method determines, by the processor, a winning video segment of the class within the set of video segments based on the importance scores for each video segment within the class, stores, by the processor, the winning video segment from the set of video segments, and removes the winning video segment from the set of video segments.

Abstract: Mechanisms are provided for generating an adversarial perturbation attack sensitivity (APAS) visualization. The mechanisms receive a natural input dataset and a corresponding adversarial attack input dataset, where the adversarial attack input dataset comprises perturbations intended to cause a misclassification by a computer model. The mechanisms determine a sensitivity measure of the computer model to the perturbations in the adversarial attack input dataset based on a processing of the natural input dataset and corresponding adversarial attack input dataset by the computer model. The mechanisms generate a classification activation map (CAM) for the computer model based on results of the processing and a sensitivity overlay based on the sensitivity measure. The sensitivity overlay graphically represents different classifications of perturbation sensitivities.

Abstract: A method (and structure and computer product) of temporal action localization in video data includes receiving a stream of video data and determining all proposals in the video data stream, the proposals being candidate regions for temporal action in the video data stream. Values for a pair-wise relation function are calculated for relating the proposals, wherein the pair-wise relation function calculates a scalar value representing a pair-wise relation weight for pairs of the proposals.