Nishith J Parikh

US Patent:

8086620, Dec 27, 2011

Filed:

Aug 29, 2008

Appl. No.:

12/202176

Inventors:

Nishith Parikh - San Jose CA, US
Neelakantan Sundaresan - Mountain View CA, US

Assignee:

eBay Inc. - San Jose CA

International Classification:

G06F 17/30

US Classification:

707765, 707767

Abstract:

Various example embodiments are provided for inferring relationships between queries. In an example, queries are related based on the identification of common terms between the queries. Another example is to relate queries based on the identification that the queries are associated with a single search session.

US Patent:

8145662, Mar 27, 2012

Filed:

Dec 31, 2008

Appl. No.:

12/347938

Inventors:

Yan Chen - Fremont CA, US
Joe Anthony Beynon - Mountain View CA, US
Baruch Perlov - Sunnyvale CA, US
Sanjay Pundlkrao Ghatare - San Jose CA, US
Alvaro Bolivar - San Francisco CA, US
Nishith Parikh - San Jose CA, US
Karin Mauge - Los Altos CA, US
Guanglei Song - San Jose CA, US

Assignee:

eBay Inc. - San Jose CA

International Classification:

G06F 17/30
G06F 7/00

US Classification:

707767, 707770, 707771

Abstract:

There is provided a method and system generate a data dictionary for searching data items stored in an information resource. In one embodiment, the system generates a list of synonyms for keywords entered in search queries to the system. A keyword and synonym form a token pair. Token pairs are evaluated according to a bidirectional divergence value calculated for distributions of search results, wherein the searches are based on the token pairs. Token pairs are then selected based on the divergence value. The selected token pairs are compiled into a data dictionary. In one embodiment, the data dictionary is a synonym dictionary used for user search query expansion to find matching items.

US Patent:

8370333, Feb 5, 2013

Filed:

May 31, 2011

Appl. No.:

13/149151

Inventors:

Neelakantan Sundaresan - Mountain View CA, US
Nishith Parikh - San Jose CA, US

Assignee:

eBay Inc. - San Jose CA

International Classification:

G06F 17/00

US Classification:

707722, 707729, 707779

Abstract:

Query utilization in which a rate of a plurality of queries to a data source may be determined for a plurality of time periods. A cost may be associated with a query state transition. A query state may be assigned to a particular query on a particular time period of the plurality of time periods based on the rate of queries for the particular time period and the cost of the query state transition. A query burst may be identified during the plurality of time periods based on assignment of a query state to the plurality of queries. The query may exhibit a normal query state, a normal-to-deviated query state transition, and a deviated query state. A query burst identification module may identify a query burst during the plurality of time periods, a burst conversion module may convert the query burst to a wavelet using a wavelet transform, a clustering module may apply a clustering technique to the wavelet, and a query classification module may classify the query burst based on applying the clustering technique.

US Patent:

20090070299, Mar 12, 2009

Filed:

Aug 29, 2008

Appl. No.:

12/202185

Inventors:

Nishith Parikh - San Jose CA, US
Neelakantan Sundaresan - Mountain View CA, US

International Classification:

G06F 17/30
G06Q 30/00

US Classification:

707 3, 705 26, 707 5, 707E17014, 707E17017

Abstract:

Various example embodiments are provided for inferring relationships between queries. In an example, queries are related based on the identification of common terms between the queries. Another example is to relate queries based on the identification that the queries are associated with a single search session. Yet another example is to infer relationships based on the identification of relationships between item attributes retrieved from the submission of the queries.

US Patent:

20090119248, May 7, 2009

Filed:

Oct 31, 2008

Appl. No.:

12/263396

Inventors:

Neelakantan Sundaresan - Mountain View CA, US
Nishith Parikh - San Jose CA, US

International Classification:

G06F 17/30

US Classification:

707 2, 707E17017

Abstract:

An example method of expanding a search is provided. In this example, a query used in the search is initially accessed. Other queries associated with the accessed query are identified, and these other queries include query terms. A diversity of the query terms is measured and the accessed query may be expanded with the query terms based on the measured diversity. Another example method is also provided for expanding a search. In this alternate example, a result set resulting from the search is accessed and a diversity of the result set is measured. The query used in the search may then be expanded based on this measured diversity.

US Patent:

20090119285, May 7, 2009

Filed:

Aug 12, 2008

Appl. No.:

12/190517

Inventors:

Neelakantan Sundaresan - Mountain View CA, US
Nishith Parikh - San Jose CA, US

International Classification:

G06F 17/30
G06Q 10/00

US Classification:

707 5, 707 3, 705 10, 707E17014, 707E17017

Abstract:

Methods and system for query utilization are described. A rate of a plurality of queries to a data source may be determined for a plurality of time periods. The plurality of queries may be associated with a term. A cost may be associated with a normal-to-deviated query state transition and a deviated-to-normal query state transition. A normal query state or a deviated query state may be assigned to a particular query on a particular time period of the plurality of time periods based on the rate of queries for the particular time period and the cost of the normal-to-deviated query state transition and the deviated-to-normal query state transition. A query burst may be identified during the plurality of time periods based on assignment of the normal query state or the deviated query state to the plurality of queries. The query burst may have the normal query state, the normal-to-deviated query state transition, and the deviated query state during a time period.

US Patent:

20090287691, Nov 19, 2009

Filed:

May 14, 2009

Appl. No.:

12/466216

Inventors:

Neelakantan Sundaresan - Mountain View CA, US
Nishith Parikh - San Jose CA, US

International Classification:

G06F 17/30

US Classification:

707 5, 707E17014, 707E17108, 707 3

Abstract:

In an embodiment, a method is provided for presenting a query directed at an information resource. In this method, a number of queries is accessed over a time period. A burst of the number of queries is detected within the time period. It should be noted that a burst is a determinable increase in the number of queries received within the time period relative to a historical number of queries received in a preceding time interval. Event-related information that is associated with the burst in the time is searched, and the query in conjunction with the event-related information is displayed at a display unit.

US Patent:

20100281029, Nov 4, 2010

Filed:

Feb 17, 2010

Appl. No.:

12/707618

Inventors:

Nishith Parikh - San Jose CA, US
Neelakantan Sundaresan - Mountain View CA, US

International Classification:

G06F 17/30

US Classification:

707741, 707751, 707769, 707748, 707E17002, 707E17014

Abstract:

A method and a system for providing recommendations based on branding are disclosed. For example, a brand preference corresponding to a first brand and a first category may be identified based on user activity. A recommendation is provided to the user based on the brand preference. The recommendation may be provided based on a predetermined brand relationship comprising the first brand associated with the first category, a second brand associated with a second category, and a recommendation score between the first and second categories and brands. The recommendation may provided by accessing a relationships database to determine at least one brand relationship of the brand relationships corresponding to the brand preference.