Abstract: In an approach for automatically identifying one or more updates in a Scientific Drug Label (SL) relevant to a patient and incorporating the one or more updates into a Patient Drug Label (PL), a processor receives a pair of documents, wherein the pair of documents include the SL and the PL. A processor converts a complex medical language of the SL into a simplified patient friendly language. A processor identifies one or more words, one or more phrases, or one or more sentences that have been modified, inserted, or deleted. A processor searches for a location in the PL that closely maps to the one or more words, the one or more phrases, or the one or more sentences to the SL. A processor incorporates the one or more words, the one or more phrases, or the one or more sentences in a mapped location of the PL.

Abstract: A method and related system determine a localness measure that represents accessibility of a node connectiveness within a signed network. The method comprises, with a computer processor, receiving focus node (FN) information related to an FN of a graph representing the signed network, receiving neighbor node (NN) information related to a plurality of NNs in the signed network, and determining the localness measure based on the NN information and the FN information. The method and system also determine a harmony measure that represents importance of a node connectiveness within a signed network. The method comprises, with a computer processor, receiving source node (SN) information related to an SN of a graph representing the signed network, receiving destination node (DN) information related to a DN in the signed network, and determining the harmony measure based on the SN information and the DN information.

Abstract: A system and method for modeling preferences of customers to drive personalized contextual recommendations using cognitive deep constrained filtering includes receiving a user query on an online retail platform, in response to receiving the user query, performing a first online matrix manipulation and a second online matrix manipulation, and sending a list of ranked recommended products.

Abstract: One or more computer processors creating a plurality of k-hop neighborhood contextual subgraphs utilizing extracted labelled nodes from an input graph; compute an eigenvector centrality score for each node contained in each created subgraph in the plurality of k-hop neighborhood contextual subgraphs; propagate a label for each node in each subgraph in the plurality of k-hop neighborhood contextual subgraphs leveraging an aggregated mathematical decay function, preserving a topical context of the label; calculate an attributable prestige vector for each node in each subgraph in the plurality of k-hop neighborhood contextual subgraphs based on the propagated label and the computed eigenvector centrality score associated with each node in each subgraph in the plurality of k-hop neighborhood contextual subgraph; and unsupervised predict a subsequent label for one or more subsequent nodes, subgraphs, or graphs utilizing the calculated attributable prestige vectors for each node in each subgraph.

Abstract: Systems and methods are described for generating learning roadmaps from unstructured information. The systems and methods may provide for extracting a plurality of named entities from one or more corpora of information, constructing a graph based on the named entities, inducing a subgraph from the graph based on a target named entity, wherein the subgraph includes a subset of the named entities, ordering the subset of the named entities based on the subgraph, and generating a learning roadmap for the target named entity based on the ordering.

Abstract: A method and related system determine a localness measure that represents accessibility of a node connectiveness within a signed network. The method comprises, with a computer processor, receiving focus node (FN) information related to an FN of a graph representing the signed network, receiving neighbor node (NN) information related to a plurality of NNs in the signed network, and determining the localness measure based on the NN information and the FN information. The method and system also determine a harmony measure that represents importance of a node connectiveness within a signed network. The method comprises, with a computer processor, receiving source node (SN) information related to an SN of a graph representing the signed network, receiving destination node (DN) information related to a DN in the signed network, and determining the harmony measure based on the SN information and the DN information.

Abstract: Systems and methods are described for generating learning roadmaps from unstructured information. The systems and methods may provide for extracting a plurality of named entities from one or more corpora of information, constructing a graph based on the named entities, inducing a subgraph from the graph based on a target named entity, wherein the subgraph includes a subset of the named entities, ordering the subset of the named entities based on the subgraph, and generating a learning roadmap for the target named entity based on the ordering.

Abstract: One or more computer processors creating a plurality of k-hop neighborhood contextual subgraphs utilizing extracted labelled nodes from an input graph; compute an eigenvector centrality score for each node contained in each created subgraph in the plurality of k-hop neighborhood contextual subgraphs; propagate a label for each node in each subgraph in the plurality of k-hop neighborhood contextual subgraphs leveraging an aggregated mathematical decay function, preserving a topical context of the label; calculate an attributable prestige vector for each node in each subgraph in the plurality of k-hop neighborhood contextual subgraphs based on the propagated label and the computed eigenvector centrality score associated with each node in each subgraph in the plurality of k-hop neighborhood contextual subgraph; and unsupervised predict a subsequent label for one or more subsequent nodes, subgraphs, or graphs utilizing the calculated attributable prestige vectors for each node in each subgraph.

Abstract: An approach is provided for evaluating a recommender system. A user's purchase date of an item and attributes of the item are extracted from a test set. Drop probabilities are assigned to the attributes. Using bootstrapping with aggregation, queries for the user and the item are generated by omitting one or more attributes from each of the queries according to the drop probabilities. Data that became available to the recommender system after the purchase date is identified. Without using the identified data and using data that became available to the recommender system before the purchase date, ranked item recommendation sets for the queries are generated. Similarity at rank K (SIM@K) values for the recommendation sets are calculated. Average SIM@K values are calculated over multiple users specified in the test set. Based on the average SIM@K values, the performance of the recommender system is evaluated.

Abstract: A system and method for modeling preferences of customers to drive personalized contextual recommendations using cognitive deep constrained filtering includes receiving a user query on an online retail platform, in response to receiving the user query, performing a first online matrix manipulation and a second online matrix manipulation, and sending a list of ranked recommended products.

Abstract: Systems and methods are described for generating learning roadmaps from unstructured information. The systems and methods may provide for extracting a plurality of named entities from one or more corpora of information, constructing a graph based on the named entities, inducing a subgraph from the graph based on a target named entity, wherein the subgraph includes a subset of the named entities, ordering the subset of the named entities based on the subgraph, and generating a learning roadmap for the target named entity based on the ordering.