Yeogirl G Yun

7668822, Feb 23, 2010

Sep 18, 2006

11/523361

Rohit Kaul - Palo Alto CA, US
Yeogirl Yun - Mountain View CA, US
Seong-Gon Kim - Starkville MS, US

Become, Inc. - Mountain View CA

G06F 7/00
G06F 17/30

707 5, 709217, 709218

Exemplary methods for assigning relative rank values to a plurality of linked documents are provided. In one embodiment, the method comprises constructing or modeling a nodal network according to a connectivity graph of a linked database and determining conductance of inter-nodal links based on a link structure of the nodal network and rank values of end-nodes. The method may further comprise computing rank values of nodes in the nodal network through an iterative process, and obtaining quality scores for documents from the rank values of the nodes. The method may also include obtaining the quality scores for groups of documents.

7797344, Sep 14, 2010

Dec 23, 2005

11/318193

Rohit Kaul - Palo Alto CA, US
Marcin Kadluczka - San Jose CA, US
Yeogirl Yun - Mountain View CA, US
Seong-Gon Kim - Mississippi State MS, US

Become, Inc. - Sunnyvale CA

G06F 7/00

707791, 707899

A method for assigning relative quality scores to a collection of linked documents is presented. The method includes constructing a spring network according to a connectivity graph of a linked database and determining the strength of inter-nodal springs based on the link structure of the network and the displacements on end-nodes. The method may further include computing the displacements of the nodes in a spring network through an iterative process and obtaining the quality scores for documents from the converged displacements of nodes. The method may also include obtaining the relative quality scores for groups of documents. The method may further include assigning topic-specific quality scores to documents in a linked database.

8285594, Oct 9, 2012

Aug 31, 2009

12/550987

Yeogirl Yun - Sunnyvale CA, US
Brad Park - Sunnyvale CA, US

CBS Interactive Inc. - Wilmington DE

G06Q 40/00

705 26, 705 1446, 705 2662, 707711, 707748, 709201, 709205, 725116

Some embodiments of the invention include tools for extracting data of interest from the world wide web (WWW). The extraction is accomplished using descriptions of data of interest. The descriptions of data of interest can include computer programs comprising a sequence of instructions and extractor patterns. The extractor patterns can be developed interactively using a web browser integrated into the graphical development environment for creating the descriptions of data of interest. The instructions can be selected from a predetermined list of instructions designed for extracting information from the WWW. The descriptions of data of interest can be grouped into categories sharing common query elements. Multiple descriptions of data of interest in the same category can executed simultaneously using the same query. The descriptions of data of interest can be accessed by a client computer using a web browser to initiate a query.

20020129014, Sep 12, 2002

Jan 10, 2001

09/757435

Brian Kim - San Jose CA, US
Sudong Chung - San Jose CA, US
Anurag Dod - Santa Clara CA, US
Michael Kim - Sunnyvale CA, US
Yeogirl Yun - Fremont CA, US

G06F017/30
G06F007/00

707/005000

The present invention provides systems and methods of retrieving the pages according to the quality of the individual pages. The rank of a page for a keyword is a combination of intrinsic and extrinsic ranks. Intrinsic rank is the measure of the relevancy of a page to a given keyword as claimed by the author of the page while extrinsic rank is a measure of the relevancy of a page on a given keyword as indicated by other pages. The former is obtained from the analysis of the keyword matching in various parts of the page while the latter is obtained from the context-sensitive connectivity analysis of the links connecting the entire Web. The present invention also provides the methods to solve the self-consistent equation satisfied by the page weights iteratively in a very efficient way. The ranking mechanism for multi-word query is also described. Finally, the present invention provides a method to obtain the more relevant page weights by dividing the entire hypertext pages into distinct number of groups.

20030208482, Nov 6, 2003

Jun 3, 2003

10/454452

Brian Kim - San Jose CA, US
Sudong Chung - San Jose CA, US
Anurag Dod - Santa Clara CA, US
Michael Kim - Sunnyvale CA, US
Yeogirl Yun - Fremont CA, US

G06F007/00

707/003000

The present invention provides systems and methods of retrieving the pages according to the quality of the individual pages. The rank of a page for a keyword is a combination of intrinsic and extrinsic ranks. Intrinsic rank is the measure of the relevancy of a page to a given keyword as claimed by the author of the page while extrinsic rank is a measure of the relevancy of a page on a given keyword as indicated by other pages. The former is obtained from the analysis of the keyword matching in various pads of the page while the latter is obtained from the context-sensitive connectivity analysis of the links connecting the entire Web. The present invention also provides the methods to solve the self-consistent equation satisfied by the page weights iteratively in a very efficient way. The ranking mechanism for multi-word query is also described. Finally, the present invention provides a method to obtain the more relevant page weights by dividing the entire hypertext pages into distinct number of groups.

20060074905, Apr 6, 2006

Sep 16, 2005

11/229097

Yeogirl Yun - Mountain View CA, US
Seong-Gon Kim - Mountain View CA, US
Robit Kaul - Mountain View CA, US
Marcin Kadluczka - Mountain View CA, US

G06F 17/30

707005000

The present invention provides systems and methods of searching web pages relevant to a specific topic based on quality of individual pages. The rank of a page for a keyword may be a combination of analytic rank and editorial rank. The analytic rank of a page may be calculated by combining intrinsic and extrinsic ranks. Intrinsic rank is a measure of relevancy of a page to a given keyword as claimed by an author of the page, while extrinsic rank is a measure of the relevancy of a page on a given keyword as indicated by other pages. The former may be obtained from an analysis of keyword matching in various parts of the page while the latter is obtained from context-sensitive connectivity analysis of the link structure of the entire Internet. Methods are described to solve the self-consistent equation satisfied by the page-weights and site-weights in a very efficient iterative way. The ranking mechanism for multi-word query is also described.

20060074910, Apr 6, 2006

Sep 16, 2005

11/229090

Yeogirl Yun - Mountain View CA, US
Seong-Gon Kim - Mountain View CA, US
Rohit Kaul - Palo Alto CA, US
Marcin Kadluczka - San Jose CA, US

G06F 7/00

707007000

The present invention provides systems and methods of searching web pages relevant to a specific topic based on quality of individual pages. The rank of a page for a keyword may be a combination of analytic rank and editorial rank. The analytic rank of a page may be calculated by combining intrinsic and extrinsic ranks. Intrinsic rank is a measure of relevancy of a page to a given keyword as claimed by an author of the page, while extrinsic rank is a measure of the relevancy of a page on a given keyword as indicated by other pages. The former may be obtained from an analysis of keyword matching in various parts of the page while the latter is obtained from context-sensitive connectivity analysis of the link structure of the entire Internet. Methods are described to solve the self-consistent equation satisfied by the page-weights and site-weights in a very efficient iterative way. The ranking mechanism for multi-word query is also described.

20080147649, Jun 19, 2008

Feb 14, 2008

12/031553

Brian S. Kim - San Jose CA, US
Sudong Chung - San Jose CA, US
Anurag Dod - Santa Clara CA, US
Michael Kim - Sunnyvale CA, US
Yeogirl Yun - Fremont CA, US

G06F 17/30

707 5, 707100, 707E17108

The present invention provides systems and methods of retrieving the pages according to the quality of the individual pages. The rank of a page for a keyword is a combination of intrinsic and extrinsic ranks. Intrinsic rank is the measure of the relevancy of a page to a given keyword as claimed by the author of the page while extrinsic rank is a measure of the relevancy of a page on a given keyword as indicated by other pages. The former is obtained from the analysis of the keyword matching in various parts of the page while the latter is obtained from the context-sensitive connectivity analysis of the links connecting the entire Web. The present invention also provides the methods to solve the self-consistent equation satisfied by the page weights iteratively in a very efficient way. The ranking mechanism for multi-word query is also described. Finally, the present invention provides a method to obtain the more relevant page weights by dividing the entire hypertext pages into distinct number of groups.