Patents by Inventor Taiyeong Lee

Taiyeong Lee 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: 11321954
    Abstract: Some examples herein describe time-series recognition and analysis techniques with computer vision. In one example, a system can access an image depicting data lines representing time series datasets. The system can execute a clustering process to assign pixels in the image to pixel clusters. The system can generate image masks based on attributes of the pixel clusters, and identify a respective set of line segments defining the respective data line associated with each image mask. The system can determine pixel sets associated with the time series datasets based on the respective set of line segments associated with each image mask, and provide one or more pixel sets as input for a computing operation that processes the pixel sets and returns a processing result. The system may then display the processing result on a display device or perform another task based on the processing result.
    Type: Grant
    Filed: November 3, 2021
    Date of Patent: May 3, 2022
    Assignee: SAS INSTITUTE INC.
    Inventors: Taiyeong Lee, Michael James Leonard
  • Patent number: 9940343
    Abstract: A method of converting data to tree data is provided. A first node memory structure that includes a first value indicator, a first counter value, and a first observation indicator is initialized for a first variable. The first value indicator is initialized with a first value of the first variable selected from first observation data, and the first observation indicator is initialized with a first indicator that indicates the first observation data. The first value of the first variable is compared to a second value of the first variable. The first counter value included in the first node memory structure is incremented when the first value of the first variable matches the second value of the first variable. Corresponding values of second observation data are compared to the identified values from first observation data when the first value of the first variable matches the second value of the first variable. A next observation is read from the data when the identified values match the corresponding values.
    Type: Grant
    Filed: December 16, 2014
    Date of Patent: April 10, 2018
    Assignee: SAS Institute Inc.
    Inventors: Yongqiao Xiao, Taiyeong Lee, Jared Langford Dean, Ruiwen Zhang
  • Patent number: 9734179
    Abstract: A method of creating a contingency table is provided. Whether or not a variable level list exists for a second variable in tree data is determined. When the variable level list exists for the second variable in the tree data, a first node memory structure is determined for the second variable from the variable level list, a first value of a first variable is determined using a first observation indicator and the tree data, and a first counter value is added to the contingency table in association with the first value of the first variable and a first value of the second variable. The first node memory structure includes the first value indicator, the first counter value, and the first observation indicator. The first value indicator indicates a first value of the second variable.
    Type: Grant
    Filed: December 16, 2014
    Date of Patent: August 15, 2017
    Assignee: SAS Institute Inc.
    Inventors: Yongqiao Xiao, Taiyeong Lee, Jared Langford Dean, Ruiwen Zhang
  • Patent number: 9336493
    Abstract: In accordance with the teachings described herein, systems and methods are provided for clustering time series based on forecast distributions. A method for clustering time series based on forecast distributions may include: receiving time series data relating to one or more aspects of a physical process; applying a forecasting model to the time series data to generate forecasted values and confidence intervals associated with the forecasted values, the confidence intervals being generated based on distribution information relating to the forecasted values; generating a distance matrix that identifies divergence in the forecasted values, the distance matrix being generated based the distribution information relating to the forecasted values; and performing a clustering operation on the plurality of forecasted values based on the distance matrix. The distance matrix may be generated using a symmetric Kullback-Leibler divergence algorithm.
    Type: Grant
    Filed: June 6, 2011
    Date of Patent: May 10, 2016
    Assignee: SAS Institute Inc.
    Inventors: Taiyeong Lee, David Rawlins Duling
  • Publication number: 20150324398
    Abstract: A method of creating a contingency table is provided. Whether or not a variable level list exists for a second variable in tree data is determined. When the variable level list exists for the second variable in the tree data, a first node memory structure is determined for the second variable from the variable level list, a first value of a first variable is determined using a first observation indicator and the tree data, and a first counter value is added to the contingency table in association with the first value of the first variable and a first value of the second variable. The first node memory structure includes the first value indicator, the first counter value, and the first observation indicator. The first value indicator indicates a first value of the second variable.
    Type: Application
    Filed: December 16, 2014
    Publication date: November 12, 2015
    Inventors: Yongqiao Xiao, Taiyeong Lee, Jared Langford Dean, Ruiwen Zhang
  • Publication number: 20150324403
    Abstract: A method of converting data to tree data is provided. A first node memory structure that includes a first value indicator, a first counter value, and a first observation indicator is initialized for a first variable. The first value indicator is initialized with a first value of the first variable selected from first observation data, and the first observation indicator is initialized with a first indicator that indicates the first observation data. The first value of the first variable is compared to a second value of the first variable. The first counter value included in the first node memory structure is incremented when the first value of the first variable matches the second value of the first variable. Corresponding values of second observation data are compared to the identified values from first observation data when the first value of the first variable matches the second value of the first variable. A next observation is read from the data when the identified values match the corresponding values.
    Type: Application
    Filed: December 16, 2014
    Publication date: November 12, 2015
    Inventors: Yongqiao Xiao, Taiyeong Lee, Jared Langford Dean, Ruiwen Zhang
  • Publication number: 20150269241
    Abstract: A method of transforming time series data to cluster data is provided. Time series data including a plurality of time series is received. A distance between a first time series of the plurality of time series and each of a remaining set of time series of the plurality of time series is computed pairwise between each of the remaining set of time series of the plurality of time series and the first time series. The computed values of the distance are sorted in increasing value. Gap width values are computed as a difference between successive pairs of the sorted, computed values. Whether a cluster including the received time series data is uniform is determined based on the computed gap width values. Cluster data including the first time series and the remaining set of time series assigned to the cluster is output when the cluster is determined to be uniform.
    Type: Application
    Filed: September 10, 2014
    Publication date: September 24, 2015
    Inventors: Taiyeong Lee, Shunping Huang, Ruiwen Zhang, Jared Langford Dean
  • Publication number: 20140372090
    Abstract: A method of selecting a one-class support vector machine (SVM) model for incremental response modeling is provided. Exposure group data generated from first responses by an exposure group receiving a request to respond is received. Control group data generated from second responses by a control group not receiving the request to respond is received. A response is either positive or negative. A one-class SVM model is defined using the positive responses in the control group data and an upper bound parameter value. The defined one-class SVM model is executed with the identified positive responses from the exposure group data. An error value is determined based on execution of the defined one-class SVM model. A final one-class SVM model is selected by validating the defined one-class SVM model using the determined error value.
    Type: Application
    Filed: March 6, 2014
    Publication date: December 18, 2014
    Applicant: SAS Institute Inc.
    Inventors: Taiyeong Lee, Ruiwen Zhang, Yongqiao Xiao, Jared Langford Dean
  • Patent number: 8775338
    Abstract: Computer-implemented systems and methods are provided for generating a data model. A variable predictiveness determination is performed on the population of candidate variables. A plurality of variables from the population of candidate variables are selected as a selected set based on the variable predictiveness values. A plurality derived variables are generated based on variables in the rejected set without consideration of any variables in the selected set. One or more derived variables are selected as based on derived variable predictiveness values of the derived variables, and the selected set and the one or more selected derived variables are stored as the model input variables for the data model.
    Type: Grant
    Filed: December 24, 2009
    Date of Patent: July 8, 2014
    Assignee: SAS Institute Inc.
    Inventor: Taiyeong Lee
  • Publication number: 20120310939
    Abstract: In accordance with the teachings described herein, systems and methods are provided for clustering time series based on forecast distributions. A method for clustering time series based on forecast distributions may include: receiving time series data relating to one or more aspects of a physical process; applying a forecasting model to the time series data to generate forecasted values and confidence intervals associated with the forecasted values, the confidence intervals being generated based on distribution information relating to the forecasted values; generating a distance matrix that identifies divergence in the forecasted values, the distance matrix being generated based the distribution information relating to the forecasted values; and performing a clustering operation on the plurality of forecasted values based on the distance matrix. The distance matrix may be generated using a symmetric Kullback-Leibler divergence algorithm.
    Type: Application
    Filed: June 6, 2011
    Publication date: December 6, 2012
    Inventors: Taiyeong Lee, David Rawlins Duling
  • Patent number: 8190612
    Abstract: Computer-implemented systems and methods are provided for creating a cluster structure from a data set containing input variables. Global clusters are created within a first stage, by computing a similarity matrix from the data set. A global cluster structure and sub-cluster structure are created within a second stage, where the global cluster structure and the sub-cluster structure are created using a latent variable clustering technique and the cluster structure output is generated by combining the created global cluster structure and the created sub-cluster structure.
    Type: Grant
    Filed: December 17, 2008
    Date of Patent: May 29, 2012
    Assignee: SAS Institute Inc.
    Inventors: Taiyeong Lee, David Rawlins Duling, Dominique Joseph Latour
  • Publication number: 20110161263
    Abstract: Computer-implemented systems and methods are provided for generating a data model. A variable predictiveness determination is performed on the population of candidate variables. A plurality of variables from the population of candidate variables are selected as a selected set based on the variable predictiveness values. A plurality derived variables are generated based on variables in the rejected set without consideration of any variables in the selected set. One or more derived variables are selected as based on derived variable predictiveness values of the derived variables, and the selected set and the one or more selected derived variables are stored as the model input variables for the data model.
    Type: Application
    Filed: December 24, 2009
    Publication date: June 30, 2011
    Inventor: Taiyeong Lee
  • Publication number: 20100153456
    Abstract: Computer-implemented systems and methods are provided for creating a cluster structure from a data set containing input variables. Global clusters are created within a first stage, by computing a similarity matrix from the data set. A global cluster structure and sub-cluster structure are created within a second stage, where the global cluster structure and the sub-cluster structure are created using a latent variable clustering technique and the cluster structure output is generated by combining the created global cluster structure and the created sub-cluster structure.
    Type: Application
    Filed: December 17, 2008
    Publication date: June 17, 2010
    Inventors: Taiyeong Lee, David Rawlins Duling, Dominique Joseph Latour