Abstract: Disclosed is a scalable, graph-based approach to detecting anomalous accesses to resources in a computer network. Access events are represented as edges between resource nodes and accessing nodes (e.g., corresponding to users) in a bipartite graph, from which vector representations of the nodes that reflect the connections can be computed by graph embedding. For an access event of interest, an anomaly score may be computed based on dissimilarities, in terms of their embedding distances, between the associated accessing node and other accessing nodes that have accessed the same resource, and/or between the associated resource node and other resource nodes that have been accessed by the same accessing node.

Abstract: Systems and methods for managing content provenance are provided. A network system accesses a plurality of documents. The plurality of documents is then hashed to identify one or more content features within each of the documents. In one embodiment, the hash is a MinHash. The network system compares the content features of each of the plurality of documents to determine a similarity score between each of the plurality of documents. In one embodiment, the similarly score is a Jaccard score. The network system then clusters the plurality of documents into one or more clusters based on the similarity score of each of the plurality of documents. In one embodiment, the clustering is performed using DBSCAN. DBSCAN can be iteratively performed with decreasing epsilon values to derive clusters of related but relatively dissimilar documents. The clustering information associated with the clusters are stored for use during runtime.

Abstract: Disclosed is a scalable, graph-based approach to detecting anomalous accesses to resources in a computer network. Access events are represented as edges between resource nodes and accessing nodes (e.g., corresponding to users) in a bipartite graph, from which vector representations of the nodes that reflect the connections can be computed by graph embedding. For an access event of interest, an anomaly score may be computed based on dissimilarities, in terms of their embedding distances, between the associated accessing node and other accessing nodes that have accessed the same resource, and/or between the associated resource node and other resource nodes that have been accessed by the same accessing node.

Abstract: A set of unstructured data is analyzed to infer structural elements from the unstructured data, and quantized data quality levels, indicative of data quality in the structural elements, are assigned to the structural elements. A set of structured data is generated to include the structural elements inferred from the unstructured data and associations between respective ones of the structural elements in the set of structured data and the corresponding quantized quality levels assigned to the structural elements. The set of structured data, including the associations between respective ones of the structural elements and the corresponding quantized quality levels assigned to the structural elements, is provided to a user interface application to enable the user interface application to visually display varying data qualities in the set of structured data.

Abstract: Techniques for interaction based social distance quantification are discloses herein. In one example, a method includes generating an interaction graph having (i) multiple vertices individually corresponding to multiple users and (ii) multiple directional edges individually connecting pairs of the multiple vertices. The method can also include applying graph embedding to convert the multiple vertices in the generated graph into corresponding tensors in a vector space. The method can further includes determining and outputting a social distance value between the one of the multiple users and another of the multiple users by calculating a tensor distance in the vector space between tensors corresponding to the one of the multiple users and the another of the multiple users.

Abstract: Systems and methods for managing content provenance are provided. A network system accesses a document of a plurality of documents to be analyzed. The network system extracts text fragments from the document including a first fragment and a second fragment. A determination is made whether each of the text fragments match an entry in a hash table. Based on a first fragment not matching any entries in the hash table, the network system creates a new entry in the hash table, whereby the first fragment is used to generate a key in the hash table. Based on a second fragment matching an entry of the hash table, the network system associates the document with a key of the matching entry in the hash table, whereby the associating comprising updating the hash table with an identifier of the document.

Abstract: Systems and methods for managing content provenance are provided. A network system accesses a plurality of documents. The plurality of documents is then hashed to identify one or more content features within each of the documents. In one embodiment, the hash is a MinHash. The network system compares the content features of each of the plurality of documents to determine a similarity score between each of the plurality of documents. In one embodiment, the similarly score is a Jaccard score. The network system then clusters the plurality of documents into one or more clusters based on the similarity score of each of the plurality of documents. In one embodiment, the clustering is performed using DBSCAN. DBSCAN can be iteratively performed with decreasing epsilon values to derive clusters of related but relatively dissimilar documents. The clustering information associated with the clusters are stored for use during runtime.

Abstract: Systems and methods for managing content provenance are provided. A network system accesses a document of a plurality of documents to be analyzed. The network system extracts text fragments from the document including a first fragment and a second fragment. A determination is made whether each of the text fragments match an entry in a hash table. Based on a first fragment not matching any entries in the hash table, the network system creates a new entry in the hash table, whereby the first fragment is used to generate a key in the hash table. Based on a second fragment matching an entry of the hash table, the network system associates the document with a key of the matching entry in the hash table, whereby the associating comprising updating the hash table with an identifier of the document.

Abstract: A set of unstructured data is analyzed to infer structural elements from the unstructured data, and quantized data quality levels, indicative of data quality in the structural elements, are assigned to the structural elements. A set of structured data is generated to include the structural elements inferred from the unstructured data and associations between respective ones of the structural elements in the set of structured data and the corresponding quantized quality levels assigned to the structural elements. The set of structured data, including the associations between respective ones of the structural elements and the corresponding quantized quality levels assigned to the structural elements, is provided to a user interface application to enable the user interface application to visually display varying data qualities in the set of structured data.