NETSEER, INC. Patent applications |
Patent application number | Title | Published |
20130046842 | METHODS AND APPARATUS FOR DISTRIBUTED COMMUNITY FINDING - Methods and apparatus for a new approach to the problem of finding communities in complex networks relating to a social definition of communities and percolation are disclosed. Instead of partitioning the graph into separate subgraphs from top to bottom a local algorithm (communities of each vertex) allows overlapping of communities. The performance of an algorithm on synthetic, randomly-generated graphs and real-world networks is used to benchmark this method against others. An heuristic is provided to generate a list of communities for networks using a local community finding algorithm. Unlike diffusion based algorithms, The provided algorithm finds overlapping communities and provides a means to measure confidence in community structure. It features locality and low complexity for exploring the communities for a subset of network nodes, without the need for exploring the whole graph. | 02-21-2013 |
20130046797 | METHODS AND APPARATUS FOR DISTRIBUTED COMMUNITY FINDING - Methods and apparatus for a new approach to the problem of finding communities in complex networks relating to a social definition of communities and percolation are disclosed. Instead of partitioning the graph into separate subgraphs from top to bottom a local algorithm (communities of each vertex) allows overlapping of communities. The performance of an algorithm on synthetic, randomly-generated graphs and real-world networks is used to benchmark this method against others. An heuristic is provided to generate a list of communities for networks using a local community finding algorithm. Unlike diffusion based algorithms, The provided algorithm finds overlapping communities and provides a means to measure confidence in community structure. It features locality and low complexity for exploring the communities for a subset of network nodes, without the need for exploring the whole graph. | 02-21-2013 |
20120084358 | METHODS AND APPARATUS FOR DISTRIBUTED COMMUNITY FINDING - Methods and apparatus for a new approach to the problem of finding communities in complex networks relating to a social definition of communities and percolation are disclosed. Instead of partitioning the graph into separate subgraphs from top to bottom a local algorithm (communities of each vertex) allows overlapping of communities. The performance of an algorithm on synthetic, randomly-generated graphs and real-world networks is used to benchmark this method against others. An heuristic is provided to generate a list of communities for networks using a local community finding algorithm. Unlike diffusion based algorithms, The provided algorithm finds overlapping communities and provides a means to measure confidence in community structure. It features locality and low complexity for exploring the communities for a subset of network nodes, without the need for exploring the whole graph. | 04-05-2012 |
20100114879 | IDENTIFYING RELATED CONCEPTS OF URLS AND DOMAIN NAMES - A solution for identifying related concepts of URLs and domain names includes using structural parsing to extract information from user input comprising a URL or domain name. The information includes one or more of a protocol, a location, and a subdirectory. Semantic parsing of the information is used to identify a first one or more concepts represented by one or more tokens within the extracted information. A content association map is queried to retrieve a second one or more concepts related to the first one or more concepts. Each of the concepts represents a unit of thought, expressed by a term, letter, or symbol. The concept association map includes a representation of concepts, concept metadata, and relationships between the concepts. The first one or more concepts and the second one or more concepts are ranked, and the ranked concepts are stored for displaying to one or more users of the computer platform. | 05-06-2010 |
20090300009 | Behavioral Targeting For Tracking, Aggregating, And Predicting Online Behavior - A pre-computed concept map represents concepts, concept metadata, and relationships between the plurality of concepts. Online user behavior may be predicted by correlating one or more online events of a user with one or more features of the concept map, aggregating a concept map history of the user to obtain online behavior over time, aggregating online behavior of the user and one or more other users to obtain aggregated online user behavior, and predicting future online behavior of the user based at least in part on the online behavior of the user and the aggregated online user behavior. The predicted behavior may be used to target ads that the user is likely to find relevant. | 12-03-2009 |
20090281900 | Discovering Relevant Concept And Context For Content Node - Discovering relevant concepts and context for content nodes to determine a user's intent includes identifying one or more concept candidates in a content node based at least in part on one or more statistical measures, and matching concepts in a concept association map against text in the content node. The concept association map represents concepts, concept metadata, and relationships between the concepts. The one or more concept candidates are ranked to create a ranked one or more concept candidates based at least in part on a measure of relevance. The ranked one or more concept candidates is expanded according to one or more cost functions. The expanded set of concepts is stored in association with the content node. | 11-12-2009 |
20080301033 | METHOD AND APPARATUS FOR OPTIMIZING LONG TERM REVENUES IN ONLINE AUCTIONS - A method and apparatus for optimizing long-term revenues in online auctions of distinguishable units of an item. For example, the item might be a specific keyword in sponsored search where the distinguishable units could be different slots for putting ads. The system can estimate parameters such as relevance and value by using a notion of fairness and can optimize the revenue by effecting the users' incentives and by improving the bidding language. In general, the method and the system can also be used for equivalent offline auctions. | 12-04-2008 |