Abstract: An example method comprises receiving historical information of episodes, constructing event sets from the historical information, categorizing each event with general labels and synthetic labels, learning an event metric on the events by using the general and synthetic labels to perform dimensionality reduction to associate a vector with each event and to determine an angle between every two vectors, determining an event set metric using distances between each pair of event sets, deriving a sequence metric on the episodes, the sequence metric obtaining a preferred match between two episodes, deriving a subsequence metric on the episodes, the subsequence metric is a function of the event set metric on subsequences of each episode, grouping episodes into subgroups based on distances, for at least one subgroup, generating a consensus sequence by finding a preferred sequence of events, and the episodes of the subgroup, and generating a report indicating the consensus sequence.

Abstract: An exemplary method may comprise receiving a matrix for a set of documents, each cell of the matrix including a frequency value indicating a number of instances of a corresponding text segment in a corresponding document, receiving an indication of a relationship between two text segments, each of the two text segments associated with a first column and a second column, respectively, of the matrix, adjusting, for each document, a frequency value of the second column based on the frequency value of the first column, projecting each frequency value into a reference space to generate a set of projection values, identifying a plurality of subsets of the reference space, clustering, for each subset of the plurality of subsets, at least some documents that correspond to projection values, and generating a graph of nodes, each of the nodes identifying one or more of the documents corresponding to each cluster.

Abstract: Exemplary systems and methods to improve capture of relationships within information are provided. In various embodiments, a system comprises a landmark module configured to choose a set of landmarks from data in a finite metric space, the set of landmarks being a subset of points in the finite metric space, a nearest neighbor module configured to compute, for each landmark, a predetermined number of nearest neighbor landmarks in the set of landmarks, a graph construction module configured to identify at least one pair of landmarks that are nearest neighbors to each other, an edge generator module configured to add an edge between the at least one pair of landmarks, and a non-landmark projection module configured to project non-landmark points based on the landmarks and one or more edges thereby enabling at least one shape to indicate relationships in the data.

Abstract: An example method comprises receiving a multidimensional data set, receiving a predetermined number of features for a set of landmark features, when a current number of features of the set is less than the predetermined number: for each landmark feature of the set of landmark features, calculate a distance between that particular landmark feature and each non-selected feature that is not within the set, identify a closest non-selected feature to that particular landmark feature, identify a particular closest non-selected feature related to a largest distance among the distances, and adding the particular non-selected feature to the set of landmark features, and if the current number of features of the set of landmark features is equal to or greater than the predetermined number of features for the set of landmark features, then providing identification of at least a subset of features of the set of landmark features.

Abstract: An example method comprises receiving a protocol associated with a particular medical condition, selecting a subset of the events of the protocol to be adherence objects of an adherence path, determine a time frame predicate for each adherence object, determine an object predicate for each adherence object, retrieving patient information from medical records of patients of the medical entity, determining for each adherence object if each particular adherence object was performed as a part of that patient's treatment related to the medical condition including determining if the time frame predicate and object predicate are satisfied, and generating patient adherence object score for each adherence object of the adherence path, generating a medical entity adherence score based on the patient adherence object scores, the medical entity adherence score indicating that medical entity's compliance with the adherence path, and generating a report indicating the medical entity adherence score.

Abstract: An exemplary method may comprise receiving a matrix for a set of documents, each cell of the matrix including a frequency value indicating a number of instances of a corresponding text segment in a corresponding document, receiving an indication of a relationship between two text segments, each of the two text segments associated with a first column and a second column, respectively, of the matrix, adjusting, for each document, a frequency value of the second column based on the frequency value of the first column, projecting each frequency value into a reference space to generate a set of projection values, identifying a plurality of subsets of the reference space, clustering, for each subset of the plurality of subsets, at least some documents that correspond to projection values, and generating a graph of nodes, each of the nodes identifying one or more of the documents corresponding to each cluster.

Abstract: An example method comprises receiving historical information of episodes, constructing event sets from the historical information, categorizing each event with general labels and synthetic labels, learning an event metric on the events by using the general and synthetic labels to perform dimensionality reduction to associate a vector with each event and to determine an angle between every two vectors, determining an event set metric using distances between each pair of event sets, deriving a sequence metric on the episodes, the sequence metric obtaining a preferred match between two episodes, deriving a subsequence metric on the episodes, the subsequence metric is a function of the event set metric on subsequences of each episode, grouping episodes into subgroups based on distances, for at least one subgroup, generating a consensus sequence by finding a preferred sequence of events, and the episodes of the subgroup, and generating a report indicating the consensus sequence.

Abstract: Exemplary systems and methods to improve capture of relationships within information are provided. In various embodiments, a system comprises a landmark module configured to choose a set of landmarks from data in a finite metric space, the set of landmarks being a subset of points in the finite metric space, a nearest neighbor module configured to compute, for each landmark, a predetermined number of nearest neighbor landmarks in the set of landmarks, a graph construction module configured to identify at least one pair of landmarks that are nearest neighbors to each other, an edge generator module configured to add an edge between the at least one pair of landmarks, and a non-landmark projection module configured to project non-landmark points based on the landmarks and one or more edges thereby enabling at least one shape to indicate relationships in the data.

Abstract: An example method includes receiving text from a plurality of documents, segmenting text received text of the plurality of documents, calculating a frequency statistic for each segment of each document, determining segments of potential interest of each document based on calculated frequency statistic, calculating distances between each document of the plurality of documents based on a text metric, and storing segments of potential interest of each document and the distances in a search database. The method may further include receiving a search query and performing a search of information contained in the search database, partitioning documents of search results using the distances, for each partition, determining labels of segments of potential interest for documents of that particular partition, the labels being determined based on a plurality of frequency statistics, and providing determined labels of segments of potential interest for documents of each partition.

Abstract: An exemplary method comprises receiving data points, selecting a first subset of the data points to generate an initial set of landmarks, each data point of the first subset defining a landmark point and for each non-landmark data point: calculating first data point distances between a respective non-landmark data point and each landmark point of the initial set of landmarks, identifying a first shortest data point distance from among the first data point distances between the respective non-landmark data point and each landmark point of the initial set of landmarks, and storing the first shortest data point distance as a first landmark distance for the respective non-landmark data point. The method further comprising identifying a non-landmark data point with a longest first landmark distance in comparison with other first landmark distances and adding the identified non-landmark data point associated as a first landmark point to the initial set of landmarks.

Abstract: An example method comprises receiving a protocol associated with a particular medical condition, selecting a subset of the events of the protocol to be adherence objects of an adherence path, determine a time frame predicate for each adherence object, determine an object predicate for each adherence object, retrieving patient information from medical records of patients of the medical entity, determining for each adherence object if each particular adherence object was performed as a part of that patient's treatment related to the medical condition including determining if the time frame predicate and object predicate are satisfied, and generating patient adherence object score for each adherence object of the adherence path, generating a medical entity adherence score based on the patient adherence object scores, the medical entity adherence score indicating that medical entity's compliance with the adherence path, and generating a report indicating the medical entity adherence score.

Abstract: An example method includes receiving text from a plurality of documents, segmenting text received text of the plurality of documents, calculating a frequency statistic for each segment of each document, determining segments of potential interest of each document based on calculated frequency statistic, calculating distances between each document of the plurality of documents based on a text metric, and storing segments of potential interest of each document and the distances in a search database. The method may further include receiving a search query and performing a search of information contained in the search database, partitioning documents of search results using the distances, for each partition, determining labels of segments of potential interest for documents of that particular partition, the labels being determined based on a plurality of frequency statistics, and providing determined labels of segments of potential interest for documents of each partition.

Abstract: An example method includes determining a point from a data set closest to a particular data point using a particular metric and scoring a particular data point based on whether the closest point shares a similar characteristic, selecting a subset of metrics based on the metric score to generate a subset of metrics, evaluating a metric-lens combination by calculating a metric-lens score based on entropy of shared characteristics across subspaces of a reference map generated by the metric-lens combination, selecting a metric-lens combination based on the metric-lens score, generating topological representations using the received data set, associating each node with at least one shared characteristic based on member data points of that particular node sharing the shared characteristic, scoring groups within each topological representation based on entropy, scoring topological representation based on the group scores, and providing a visualization of at least one topological representation based on the graph sco

Abstract: Autogrouping is described. An example method includes receiving a data set, building a first partition of subsets of the data set, computing a first subset score for each subset using a scoring function, generating a next partition including at least one subset that includes the elements of two or more subsets of the first partition, computing a second subset score for each subset of the next partition using the scoring function, defining a max score for each particular subset using a max score function, each max score being based on maximal subset scores of that particular subset and at least the subsets of the first partition related to that particular subset, selecting output subsets, selection of each of the output subsets being made using a maximum score of previously computed subset scores, and generating a report indicating an output partition, the output subsets being associated with the received data set.

Abstract: An exemplary method comprises receiving data points, selecting a first subset of the data points to generate an initial set of landmarks, each data point of the first subset defining a landmark point and for each non-landmark data point: calculating first data point distances between a respective non-landmark data point and each landmark point of the initial set of landmarks, identifying a first shortest data point distance from among the first data point distances between the respective non-landmark data point and each landmark point of the initial set of landmarks, and storing the first shortest data point distance as a first landmark distance for the respective non-landmark data point. The method further comprising identifying a non-landmark data point with a longest first landmark distance in comparison with other first landmark distances and adding the identified non-landmark data point associated as a first landmark point to the initial set of landmarks.

Abstract: Exemplary systems and methods to improve capture of relationships within information are provided. In various embodiments, a system comprises a landmark module configured to choose a set of landmarks from data in a finite metric space, the set of landmarks being a subset of points in the finite metric space, a nearest neighbor module configured to compute, for each landmark, a predetermined number of nearest neighbor landmarks in the set of landmarks, a graph construction module configured to identify at least one pair of landmarks that are nearest neighbors to each other, an edge generator module configured to add an edge between the at least one pair of landmarks, and a non-landmark projection module configured to project non-landmark points based on the landmarks and one or more edges thereby enabling at least one shape to indicate relationships in the data.

Abstract: In some embodiments, a method includes selecting a first and a second predetermined number of points of graphical data; determining an initial distance between each of the first predetermined number of points, generating a fast approximate distance oracle comprising identifiers of points and oracle distances between at least one point and another point, determining a graphical distance for each of the second predetermined number of points relative to other points of the first and second predetermined number of points, calculating a potential error between the determined graphical distance and a topologic distance between each of the second predetermined number of points, approximating a correction for at least one of the second predetermined number of points, adjusting a position of the at least one of the second predetermined number of points, and displaying the at least one of the second predetermined number of points.

Abstract: Exemplary systems and methods for visualization of data analysis are provided. In various embodiments, a method comprises accessing a database, analyzing the database to identify clusters of data, generating an interactive visualization comprising a plurality of nodes and a plurality of edges wherein a first node of the plurality of nodes represents a cluster and an edge of the plurality of edges represents an intersection of nodes of the plurality of nodes, selecting and dragging the first node in response to a user action, and reorienting the interactive visualization in response to the user action of selecting and dragging the first node.

Abstract: An exemplary method may comprise receiving a matrix for a set of documents, each cell of the matrix including a frequency value indicating a number of instances of a corresponding text segment in a corresponding document, receiving an indication of a relationship between two text segments, each of the two text segments associated with a first column and a second column, respectively, of the matrix, adjusting, for each document, a frequency value of the second column based on the frequency value of the first column, projecting each frequency value into a reference space to generate a set of projection values, identifying a plurality of subsets of the reference space, clustering, for each subset of the plurality of subsets, at least some documents that correspond to projection values, and generating a graph of nodes, each of the nodes identifying one or more of the documents corresponding to each cluster.

Abstract: An example method includes receiving text from a plurality of documents, segmenting text received text of the plurality of documents, calculating a frequency statistic for each segment of each document, determining segments of potential interest of each document based on calculated frequency statistic, calculating distances between each document of the plurality of documents based on a text metric, and storing segments of potential interest of each document and the distances in a search database. The method may further include receiving a search query and performing a search of information contained in the search database, partitioning documents of search results using the distances, for each partition, determining labels of segments of potential interest for documents of that particular partition, the labels being determined based on a plurality of frequency statistics, and providing determined labels of segments of potential interest for documents of each partition.