Abstract: A system and method to identify target node graphs from predetermined seed node subsets are described. A one-sided constrained spectral embedding of a graph using a predetermined set of seed nodes within the graph is computed. Next, a threshold boundary is identified to define a target area for a target subgraph within the embedded graph using predetermined network-flow calculations, the target subgraph including the predetermined set of seed nodes. Finally, the target subgraph is identified based on the calculated threshold boundary.

Abstract: An improved system and method for clustering text or content described by text is provided. Each text in a set of texts may be represented as a dimensional vector of words. Singleton texts that may not be similar to another text may be excluded from the set of texts for clustering. Texts identified as good nearest neighbors may then be grouped in the same cluster. In addition, metadata describing content may be used for clustering items of aggregated content from content feeds. Metadata describing items of content from content feeds may be converted into a set of texts and texts identified as good nearest neighbors may then be clustered. Items of content feeds described by the clustered texts may then be similarly clustered. Any types of items of content that may be described by text may be clustered, including audio, images, video, multimedia content, and so forth.

Abstract: A system and method to identify target node graphs from predetermined seed node subsets are described. A one-sided constrained spectral embedding of a graph using a predetermined set of seed nodes within the graph is computed. Next, a threshold boundary is identified to define a target area for a target subgraph within the embedded graph using predetermined network-flow calculations, the target subgraph including the predetermined set of seed nodes. Finally, the target subgraph is identified based on the calculated threshold boundary.