Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Jignashu Parikh is active.

Publication


Featured researches published by Jignashu Parikh.


knowledge discovery and data mining | 2004

Document preprocessing for naive Bayes classification and clustering with mixture of multinomials

Dmitry Pavlov; Ramnath Balasubramanyan; Byron Dom; Shyam Kapur; Jignashu Parikh

Naive Bayes classifier has long been used for text categorization tasks. Its sibling from the unsupervised world, the probabilistic mixture of multinomial models, has likewise been successfully applied to text clustering problems. Despite the strong independence assumptions that these models make, their attractiveness come from low computational cost, relatively low memory consumption, ability to handle heterogeneous features and multiple classes, and often competitiveness with the top of the line models. Recently, there has been several attempts to alleviate the problems of Naive Bayes by performing heuristic feature transformations, such as IDF, normalization by the length of the documents and taking the logarithms of the counts. We justify the use of these techniques and apply them to two problems: classification of products in Yahoo! Shopping and clustering the vectors of collocated terms in user queries to Yahoo! Search. The experimental evaluation allows us to draw conclusions about the promise that these transformations carry with regard to alleviating the strong assumptions of the multinomial model.


international acm sigir conference on research and development in information retrieval | 2006

Unity: relevance feedback using user query logs

Jignashu Parikh; Shyam Kapur

The exponential growth of the Web and the increasing ability of web search engines to index data have led to a problem of plenty. The number of results returned per query is typically in the order of millions of documents for many common queries. Although there is the benefit of added coverage for every query, the problem of ranking these documents and giving the best results gets worse. The problem is even more difficult in case of temporal and ambiguous queries. We try to address this problem using feedback from user query logs. We leverage a technology called Units for generating query refinements which are shown as Also try queries on Yahoo! Search. We consider these refinements as sub-concepts which help define user intent and use them to improve search relevance. The results obtained via live testing on Yahoo! Search are encouraging.


Archive | 2004

Search processing with automatic categorization of queries

Shyam Kapur; Jignashu Parikh; Deepa Joshi


Archive | 2005

Systems and methods for managing and using multiple concept networks for assisted search processing

Shyam Kapur; Jignashu Parikh; Deepa Joshi


Archive | 2008

Discovery of friends using social network graph properties

Sunil Jagadish; Jignashu Parikh


Archive | 2004

Systems and methods for search processing using superunits

Shyam Kapur; Jignashu Parikh; Deepa Joshi


Archive | 2006

Keyword set and target audience profile generalization techniques

Usama M. Fayyad; Pavel Berkhin; Andrew Tomkins; Rajesh Parekh; Jignashu Parikh; Wellspring Sculley Ii David


Archive | 2005

Reranking and increasing the relevance of the results of Internet searches

Shyam Kapur; Jignashu Parikh


Archive | 2005

Customizable ordering of search results and predictive query generation

Jignashu Parikh; Jaiprakash Harish; Shyam Kapur


Archive | 2004

Automatic generation of taxonomies for categorizing queries and search query processing using taxonomies

Shyam Kapur; Jignashu Parikh; Deepa Joshi

Collaboration


Dive into the Jignashu Parikh's collaboration.

Researchain Logo
Decentralizing Knowledge