Patents by Inventor Jignashu Parikh

Jignashu Parikh has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20070282785
    Abstract: A variety of techniques are described by which keyword sets and target audience profiles may be generalized in a systematic and effective way with reference to relationships between keywords, profiles, and the data of an underlying user population.
    Type: Application
    Filed: May 31, 2006
    Publication date: December 6, 2007
    Inventors: Usama M. Fayyad, Pavel Berkhin, Andrew Tomkins, Rajesh Girish Parekh, Jignashu Parikh, David Wellspring Sculley
  • Publication number: 20070233650
    Abstract: A system and method to facilitate automatic categorization of events in a network, wherein one or more keywords are retrieved from a keyword database, each retrieved keyword matching a corresponding event unit of an event input by a user over a network. A dominant keyword corresponding to a highest parameter value calculated for each retrieved keyword is then selected. Finally, the event is categorized based on one or more categories associated with the dominant keyword. The dominant keyword may be selected based on one or more keyword categories associated with each retrieved keyword and an ambiguity parameter value calculated for each keyword. Alternatively, the dominant keyword may be selected based on a highest-ranked output value calculated for each retrieved keyword. One or more categories associated with the dominant keyword are subsequently retrieved from the keyword database and the event is categorized based on the category associated with the dominant keyword.
    Type: Application
    Filed: March 29, 2006
    Publication date: October 4, 2007
    Inventors: Chad Brower, Shyam Kapur, Brian Coppola, Joshua M. Koran, Jignashu Parikh
  • Publication number: 20070078828
    Abstract: In a computerized search system, a document corpus is searched according to a query and results of the search are presentable as an ordered search result set comprising one or more search hits, a search hit being a document of the document corpus or reference thereto. Based on content of the search result set, a number of suggested queries and/or parameter options are presented to a querier, thereby allowing the querier to select a suggested query and/or provide values for the parameters and those selections can be used to reorder the hits of the search result set. The particular suggested queries and/or parameters presented depend on the page elements of the search result set's documents and their categorization. The categorization might be done using concept networks.
    Type: Application
    Filed: October 5, 2005
    Publication date: April 5, 2007
    Applicant: Yahoo! Inc.
    Inventors: Jignashu Parikh, J. Harish, Shyam Kapur
  • Publication number: 20060206476
    Abstract: Techniques are provided for reranking and increasing the relevance of the results Internet searches. A search query is initially parsed into individual units. Each unit corresponds to one or more words that represents a natural concept. A concept network is analyzed to locate concepts that are related to the units in the search query. Particular concepts are selected from the concept network. Independent Internet searches are performed for each of the selected concepts. The search results from these searches are then compared to units in the original search query and ranked according to their relevance to the original search query.
    Type: Application
    Filed: March 10, 2005
    Publication date: September 14, 2006
    Applicant: Yahoo!, Inc.
    Inventors: Shyam Kapur, Jignashu Parikh
  • Publication number: 20060167896
    Abstract: Multiple concept networks are generated from subsets of received queries. These concept networks can be used in various ways to enhance response to subsequent queries. In one embodiment, concept networks can be merged into a larger concept network that can be used to infer a user's likely intent given a query. In another embodiment, suggestions for related searches obtained using different concept networks can be merged or aggregated. Other users for concept networks in query processing, including assisted search, are also described.
    Type: Application
    Filed: December 5, 2005
    Publication date: July 27, 2006
    Inventors: Shyam Kapur, Jignashu Parikh, Deepa Joshi
  • Publication number: 20060122994
    Abstract: Systems and methods for processing search requests are provided, including automatic generation of taxonomies and query processing using those taxonomies.
    Type: Application
    Filed: December 6, 2004
    Publication date: June 8, 2006
    Applicant: Yahoo! Inc.
    Inventors: Shyam Kapur, Jignashu Parikh, Deepa Joshi
  • Publication number: 20060122979
    Abstract: Search results are processed using search requests, including analyzing received queries in order to provide a more sophisticated understanding of the information being sought. A concept network is generated from a set of queries by parsing the queries into units and defining various relationships between the units. From these concept networks, queries can be automatically categorized into categories, or more generally, can be associated with one or more nodes of a taxonomy. The categorization can be used to alter the search results or the presentation of the results to the user. As an example of alterations of search results or presentation, the presentation might include a list of “suggestions” for related search query terms. As other examples, the corpus searched might vary depending on the category or the ordering or selection of the results to present to the user might vary depending on the category.
    Type: Application
    Filed: December 6, 2004
    Publication date: June 8, 2006
    Inventors: Shyam Kapur, Jignashu Parikh, Deepa Joshi
  • Publication number: 20050080795
    Abstract: In a search processing system, a concept network is generated from a set of queries by parsing the queries into units and defining various relationships between the units based in part on patterns of units that appear together in queries. Units in the concept network that have some similar characteristic(s) are grouped into superunits. For each superunit, there is a corresponding signature that defines the similar characteristic of the group. A query is processed by identifying constituent units, determining the superunit membership of some or all of the constituent units, and using that information to formulate a response to the query.
    Type: Application
    Filed: March 9, 2004
    Publication date: April 14, 2005
    Applicant: Yahoo! Inc.
    Inventors: Shyam Kapur, Jignashu Parikh, Deepa Joshi