Patents by Inventor Seung-Taek Park
Seung-Taek Park 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).
-
Patent number: 9600581Abstract: This disclosure describes systems and methods for selecting and/or ranking web-based content predicted to have the greatest interest to individual users. In particular, articles are ranked in terms of predicted interest for different users. This is done by optimizing an interest model and in particular through a method of bilinear regression and Bayesian optimization. The interest model is populated with data regarding users, the articles, and historical interest trends that types of users have expressed towards types of articles.Type: GrantFiled: February 19, 2009Date of Patent: March 21, 2017Assignee: YAHOO! INC.Inventors: Wei Chu, Seung-Taek Park
-
Patent number: 9465863Abstract: A content-providing method and system, including identifying a representative type cluster by clustering content related to behavioral data which represents a use history of a user, according to type of the content, mapping the representative type cluster to a time interval, and storing the representative type cluster and the time interval.Type: GrantFiled: November 25, 2011Date of Patent: October 11, 2016Assignee: Samsung Electronics Co., Ltd.Inventors: Hyung-dong Lee, Seung-taek Park, Hee-seon Park, Hae-dong Yeo
-
Patent number: 8909626Abstract: A set of item-item affinities for a plurality of items is determined based on collaborative-filtering techniques. A set of an item's nearest neighbor items based on the set of item-item affinities is determined. A set of user feature-item affinities for the plurality of items and a set of user features is determined based on least squared regression. A set of a user feature's nearest neighbor items is determined based in part on the set of user feature-item affinities. Compatible affinity weights for nearest neighbor items of each item and each user feature are determined. Based on user features of a user and items a user has consumed, a set of nearest neighbor items are identified as a set of candidate items, and affinity scores of candidate items are determined. Based on the affinity scores, a candidate item from the set of candidate items is recommended to the user.Type: GrantFiled: October 25, 2012Date of Patent: December 9, 2014Assignee: Yahoo! Inc.Inventors: Seung-Taek Park, Wei Chu, Todd Beaupre, Deepak K. Agarwal, Scott Roy, Raghu Ramakrishnan
-
Patent number: 8504558Abstract: Content display policies are evaluated using two kinds of methods. In the first kind of method, using information, collected in a “controlled” manner about user characteristics and content characteristics, truth models are generated. A simulator replays users' visits to the portal web page and simulates their interactions with content items on the page based on the truth models. Various metrics are used to compare different content item-selecting algorithms. In the second kind of method, no explicit truth models are built. Events from the controlled serving scheme are replayed in part or whole; content item-selection algorithms learn using the observed user activities. Metrics that measure the overall predictive error are used to compare different content-item selection algorithms. The data collected in a controlled fashion plays a key role in both the methods.Type: GrantFiled: July 31, 2008Date of Patent: August 6, 2013Assignee: Yahoo! Inc.Inventors: Deepak Agarwal, Pradheep Elango, Raghu Ramakrishnan, Seung-Taek Park, Bee-Chung Chen
-
Patent number: 8442929Abstract: Two items are determined to be similar to each not only based on previous actual user behavior, but also based on the observed relatedness of the characteristics of those two items. A first characteristic and a second characteristic are determined to have some affinity for each other if a high proportion of users who select items having the first characteristics also select items that have the second characteristic, and vice-versa. Two items having characteristics with high affinity for each other are determined to have some similarity to each other, even if very few or no users who selected one of those items ever selected the other of those items. A first item that is determined to be sufficiently similar to second item in this manner may be recommended to a user who has selected the second item as potentially also being of interest to that user.Type: GrantFiled: November 5, 2009Date of Patent: May 14, 2013Assignee: Yahoo! Inc.Inventors: Seung-Taek Park, Wei Chu, Wei Du, Uminder Singh, Jessi Dong
-
Patent number: 8301624Abstract: A set of item-item affinities for a plurality of items is determined based on collaborative-filtering techniques. A set of an item's nearest neighbor items based on the set of item-item affinities is determined. A set of user feature-item affinities for the plurality of items and a set of user features is determined based on least squared regression. A set of a user feature's nearest neighbor items is determined based in part on the set of user feature-item affinities. Compatible affinity weights for nearest neighbor items of each item and each user feature are determined and stored. Based on user features of a particular user and items a particular user has consumed, a set of nearest neighbor items comprising nearest neighbor items for user features of the user and items the user has consumed are identified as a set of candidate items, and affinity scores of candidate items are determined.Type: GrantFiled: March 31, 2009Date of Patent: October 30, 2012Assignee: Yahoo! Inc.Inventors: Seung-Taek Park, Wei Chu, Todd Beaupre, Deepak K. Agarwal, Scott Roy, Raghu Ramakrishnan
-
Publication number: 20120136861Abstract: A content-providing method and system, including identifying a representative type cluster by clustering content related to behavioral data which represents a use history of a user, according to type of the content, mapping the representative type cluster to a time interval, and storing the representative type cluster and the time interval.Type: ApplicationFiled: November 25, 2011Publication date: May 31, 2012Applicant: Samsung Electronics Co., Ltd.Inventors: Hyung-dong LEE, Seung-taek Park, Hee-seon Park, Hae-dong Yeo
-
Patent number: 8166029Abstract: A method comprising receiving a search query to generate a search result of one or more media items and providing a personalized search rank of the one or more media items on the basis of a user profile and an item relevance for a given media item with regard to the query metadata associated with the search result is identified and used to identify at least one related media item. The at least one related media item is ranked on the basis of the user profile and the metadata.Type: GrantFiled: September 7, 2006Date of Patent: April 24, 2012Assignee: Yahoo! Inc.Inventors: Seung-Taek Park, David Myer Pennock
-
Publication number: 20110112981Abstract: A method and a system are provided for recommending an ad (e.g., item) for a user. In one example, the system constructs one or more user profiles. Each user profile is represented by a user feature set including user attributes. The system constructs one or more item profiles. Each item profile is represented by an item feature set including item attributes. The system receives historical item ratings given by one or more users. The system then generates one or more preference scores by modeling at least one relationship among the user profiles, the item profiles and the historical item ratings.Type: ApplicationFiled: November 9, 2009Publication date: May 12, 2011Inventors: Seung-Taek Park, Wei Chu
-
Publication number: 20110107260Abstract: Two items are determined to be similar to each not only based on previous actual user behavior, but also based on the observed relatedness of the characteristics of those two items. A first characteristic and a second characteristic are determined to have some affinity for each other if a high proportion of users who select items having the first characteristics also select items that have the second characteristic, and vice-versa. Two items having characteristics with high affinity for each other are determined to have some similarity to each other, even if very few or no users who selected one of those items ever selected the other of those items. A first item that is determined to be sufficiently similar to second item in this manner may be recommended to a user who has selected the second item as potentially also being of interest to that user.Type: ApplicationFiled: November 5, 2009Publication date: May 5, 2011Inventors: Seung-Taek Park, Wei Chu, Wei Du, Uminder Singh, Jessi Dong
-
Publication number: 20100250556Abstract: A set of item-item affinities for a plurality of items is determined based on collaborative-filtering techniques. A set of an item's nearest neighbor items based on the set of item-item affinities is determined. A set of user feature-item affinities for the plurality of items and a set of user features is determined based on least squared regression. A set of a user feature's nearest neighbor items is determined based in part on the set of user feature-item affinities. Compatible affinity weights for nearest neighbor items of each item and each user feature are determined and stored. Based on user features of a particular user and items a particular user has consumed, a set of nearest neighbor items comprising nearest neighbor items for user features of the user and items the user has consumed are identified as a set of candidate items, and affinity scores of candidate items are determined.Type: ApplicationFiled: March 31, 2009Publication date: September 30, 2010Inventors: Seung-Taek Park, Wei Chu, Todd Beaupre, Deepak K. Agarwal, Scott Roy, Raghu Ramakrishnan
-
Publication number: 20100211568Abstract: This disclosure describes systems and methods for selecting and/or ranking web-based content predicted to have the greatest interest to individual users. In particular, articles are ranked in terms of predicted interest for different users. This is done by optimizing an interest model and in particular through a method of bilinear regression and Bayesian optimization. The interest model is populated with data regarding users, the articles, and historical interest trends that types of users have expressed towards types of articles.Type: ApplicationFiled: February 19, 2009Publication date: August 19, 2010Inventors: Wei Chu, Seung-Taek Park
-
Publication number: 20100125585Abstract: Information with respect to users, items, and interactions between the users and items is collected. Each user is associated with a set of user features. Each item is associated with a set of item features. An expected score function is defined for each user-item pair, which represents an expected score a user assigns an item. An objective represents the difference between the expected score and the actual score a user assigns an item. The expected score function and the objective function share at least one common variable. The objective function is minimized to find best fit for some of the at least one common variable. Subsequently, the expected score function is used to calculate expected scores for individual users or clusters of users with respect to a set of items that have not received actual scores from the users. The set of items are ranked based on their expected scores.Type: ApplicationFiled: November 17, 2008Publication date: May 20, 2010Applicant: Yahoo! Inc.Inventors: Wei Chu, Seung-Taek Park, Raghu Ramakrishnan, Bee-Chung Chen, Deepak K. Agarwal, Pradheep Elango, Scott Roy, Todd Beaupre
-
Publication number: 20100030717Abstract: Content display policies are evaluated using two kinds of methods. In the first kind of method, using information, collected in a “controlled” manner about user characteristics and content characteristics, truth models are generated. A simulator replays users' visits to the portal web page and simulates their interactions with content items on the page based on the truth models. Various metrics are used to compare different content item-selecting algorithms. In the second kind of method, no explicit truth models are built. Events from the controlled serving scheme are replayed in part or whole; content item-selection algorithms learn using the observed user activities. Metrics that measure the overall predictive error are used to compare different content-item selection algorithms. The data collected in a controlled fashion plays a key role in both the methods.Type: ApplicationFiled: July 31, 2008Publication date: February 4, 2010Inventors: Deepak Agarwal, Pradheep Elango, Raghu Ramakrishnan, Seung-Taek Park, Bee-Chung Chen
-
Publication number: 20080126303Abstract: A method comprising receiving a search query to generate a search result of one or more media items and providing a personalized search rank of the one or more media items on the basis of a user profile and an item relevance for a given media item with regard to the query metadata associated with the search result is identified and used to identify at least one related media item. The at least one related media item is ranked on the basis of the user profile and the metadata.Type: ApplicationFiled: September 7, 2006Publication date: May 29, 2008Inventors: Seung-Taek Park, David Myer Pennock