This document relates generally to time series analysis, and more particularly to structuring unstructured time series data into a hierarchical structure.
Many organizations collect large amounts of transactional and time series data related to activities, such as time stamped data associated with physical processes, such as product manufacturing or product sales. These large data sets may come in a variety of forms and often originate in an unstructured form that may include only a collection of data records having data values and accompanying time stamps.
Organizations often wish to perform different types of time series analysis on their collected data sets. However, certain time series analysis operators (e.g., a predictive data model for forecasting product demand) may be configured to operate on hierarchically organized time series data. Because an organization's unstructured time stamped data sets are not properly configured, the desired time series analysis operators are not able to properly operate on the organization's unstructured data sets.
In accordance with the teachings herein, systems and methods are provided for analyzing unstructured time stamped data of a physical process in order to generate structured hierarchical data for a hierarchical time series analysis application. A plurality of time series analysis functions are selected from a functions repository. Distributions of time stamped unstructured data are analyzed to identify a plurality of potential hierarchical structures for the unstructured data with respect to the selected time series analysis functions. Different recommendations for the potential hierarchical structures for each of the selected time series analysis functions are provided, where the selected time series analysis functions affect what types of recommendations are to be provided, and the unstructured data is structured into a hierarchical structure according to one or more of the recommended hierarchical structures, where the structured hierarchical data is provided to an application for analysis using one or more of the selected time series analysis functions.
As another example, a system for analyzing unstructured time stamped data of a physical process in order to generate structured hierarchical data for a hierarchical time series analysis application includes one or more processors and one or more computer-readable storage mediums containing instructions configured to cause the one or more processors to perform operations. In those operations, a plurality of time series analysis functions are selected from a functions repository. Distributions of time stamped unstructured data are analyzed to identify a plurality of potential hierarchical structures for the unstructured data with respect to the selected time series analysis functions. Different recommendations for the potential hierarchical structures for each of the selected time series analysis functions are provided, where the selected time series analysis functions affect what types of recommendations are to be provided, and the unstructured data is structured into a hierarchical structure according to one or more of the recommended hierarchical structures, where the structured hierarchical data is provided to an application.
As a further example, a computer program product for analyzing unstructured time stamped data of a physical process in order to generate structured hierarchical data for a hierarchical time series analysis application, tangibly embodied in a machine-readable non-transitory storage medium, includes instructions configured to cause a data processing system to perform a method. In the method, a plurality of time series analysis functions are selected from a functions repository. Distributions of time stamped unstructured data are analyzed to identify a plurality of potential hierarchical structures for the unstructured data with respect to the selected time series analysis functions. Different recommendations for the potential hierarchical structures for each of the selected time series analysis functions are provided, where the selected time series analysis functions affect what types of recommendations are to be provided, and the unstructured data is structured into a hierarchical structure according to one or more of the recommended hierarchical structures, where the structured hierarchical data is provided to an application.
The time series exploration system 102 can facilitate interactive exploration of unstructured time series data. The system 102 can enable interactive structuring of the time series data from multiple hierarchical and frequency perspectives. The unstructured data can be interactively queried or subset using hierarchical queries, graphical queries, filtering queries, or manual selection. Given a target series, the unstructured data can be interactively searched for similar series or cluster panels of series. After acquiring time series data of interest from the unstructured data, the time series data can be analyzed using statistical time series analysis techniques for univariate (e.g., autocorrelation operations, decomposition analysis operations), panel, and multivariate time series data. After determining patterns in selected time series data, the time series data can be exported for subsequent analysis, such as forecasting, econometric analysis, pricing analysis, risk analysis, time series mining, as well as others.
Users 104 can interact with a time series exploration system 102 in a variety of ways. For example,
Based on the recommendations made by the data structuring recommendations functionality, the unstructured time stamped data 304 is structured to form structured time series data 312. For example, the recommendation for a particular time series analysis function and set of unstructured time stamped data may dictate that the unstructured time stamped data be divided into a number of levels along multiple dimensions (e.g., unstructured time stamped data representing sales of products for a company may be structured into a product level and a region level). The recommendation may identify a segmentation of the time series data, where such a segmentation recommendations provides one or more options for dividing the data based on a criteria, such as a user defined criteria or a criteria based upon statistical analysis results. The recommendation may further identify an aggregation frequency (e.g., unstructured time stamped data may be aggregated at a monthly time period). The structured time series data 312 is then provided to a hierarchical time series analysis application 314, where a selected time series analysis 306 function is applied to the structured time series data 312 to generate analysis results 316 (e.g., a time slice analysis display of the structured data or analysis results).
Upon selection of a hierarchical structure and an aggregation frequency for a particular time series analysis function, the time series exploration system 402 structures the unstructured time stamped data 404 accordingly, to generate structured time series data 412. The structured time series data 412 is provided to a hierarchical time series analysis application 414 that applies the particular time series analysis function to the structured time series data 412 to generate analysis results 416.
The data sufficiency metric 510 that is associated with the selected optimal frequency is used to determine a data sufficiency metric the potential hierarchical structure at 514. Thus, the data sufficiency metric of the best candidate frequency may be imputed to the potential hierarchical structure or otherwise used to calculate a sufficiency metric for the potential hierarchical structure, as the potential hierarchical structure will utilize the optimal frequency in downstream processing and comparison. The performing of the hierarchical analysis 502 to identify an optimal frequency for subsequent potential hierarchical structures is repeated, as indicated at 516. Once all of the potential hierarchical structures have been analyzed, a data structure includes an identification of the potential hierarchical structures, an optimal frequency associated with each of the potential hierarchical structures, and a data sufficiency metric associated with each of the potential hierarchical structures.
At 518, one of the potential hierarchical structures is selected as the selected hierarchical structure for the particular time series analysis function based on the data sufficiency metrics for the potential hierarchical structures. The selected hierarchical structure 520 and the associated selected aggregation frequency 522 can then be used to structure the unstructured data for use with the particular time series analysis function.
The structured time series data can be utilized by a time series analysis function in a variety of ways. For example, all or a portion of the structured time series data may be provided as an input to a predictive data model of the time series analysis function to generate forecasts of future events (e.g., sales of a product, profits for a company, costs for a project, the likelihood that an account has been compromised by fraudulent activity). In other examples, more advanced procedures may be performed. For example, the time series analysis may be used to segment the time series data. For instance, the structured hierarchical data may be compared to a sample time series of interest to identify a portion of the structured hierarchical data that is similar to the time series of interest. That identified similar portion of the structured hierarchical data may be extracted, and the time series analysis function operates on the extracted similar portion.
In another example, the structured hierarchical data is analyzed to identify a characteristic of the structured hierarchical data (e.g., a seasonal pattern, a trend pattern, a growth pattern, a delay pattern). A data model is selected for a selected time series analysis function based on the identified characteristic. The selected time series analysis function may then be performed using the selected data model. In a different example, the selected time series analysis function may perform a transformation or reduction on the structured hierarchical data and provide a visualization of the transformed or reduced data. In a further example, analyzing the distributions of the time-stamped unstructured data may include applying a user defined test or a business objective test to the unstructured time stamped data.
Structuring unstructured time series data can be performed automatically (e.g., a computer system determines a hierarchical structure and aggregation frequency based on a set of unstructured time series data and an identified time series analysis function). Additionally, the process of structuring of the unstructured time series data may incorporate human judgment (e.g., structured judgment) at certain points or throughout.
The data structuring GUI 710 may be formatted in a variety of ways. For example, the data structuring GUI 710 may be provided to a user in a wizard form, where the user is provided options for selection in a stepwise fashion 718. In one example, a user is provided a number of potential hierarchical structures for the unstructured time stamped data 704 from which to choose as a first step. In a second step 722, the user may be provided with a number of options for a data aggregation time period for the hierarchical structure selected at 720. Other steps 724 may provide displays for selecting additional options for generating the structured time series data 712.
In the example of
As an example, a computer-implemented method of using graphical user interfaces to analyze unstructured time stamped data of a physical process in order to generate structured hierarchical data for a hierarchical forecasting application may include a step of providing a first series of user display screens that are displayed through one or more graphical user interfaces, where the first series of user display screens are configured to be displayed in a step-wise manner so that a user can specify a first approach through a series of predetermined steps on how the unstructured data is to be structured. The information the user has specified in the first series of screens and where in the first series of user display screens the user is located is storing in a tracking data structure. A second series of user display screens are provided that are displayed through one or more graphical user interfaces, where the second series of user display screens are configured to be displayed in a step-wise manner so that the user can specify a second approach through the series of predetermined steps on how the unstructured data is to be structured. The information the user has specified in the second series of screens and where in the second series of user display screens the user is located is storing in the tracking data structure. Tracking data that is stored in the tracking data structure is used to facilitate the user going back and forth between the first and second series of user display screens without losing information or place in either the first or second user display screens, and the unstructured data is structured into a hierarchical structure based upon information provided by the user through the first or second series of user display screens, where the structured hierarchical data is provided to an application for analysis using one or more time series analysis functions.
Functionality for operating on the unstructured data in a single pass 918 can provide the capability to perform all structuring, desired computations, output, and visualizations in a single pass through the data. Each candidate structure runs in a separate thread. Such functionality 918 can be advantageous, because multiple read accesses to a database, memory, or other storage device can be costly and inefficient. In one example, a computer-implemented method of analyzing unstructured time stamped data of a physical process through one-pass includes a step of analyzing a distribution of time-stamped unstructured data to identify a plurality of potential hierarchical structures for the unstructured data. A hierarchical analysis of the potential hierarchical structures is performed to determine an optimal frequency and a data sufficiency metric for the potential hierarchical structures. One of the potential hierarchical structures is selected as a selected hierarchical structure based on the data sufficiency metrics. The unstructured data is structured according to the selected hierarchical structure and the optimal frequency associated with the selected hierarchical structure, where the structuring of the unstructured data is performed via a single pass though the unstructured data. The identified statistical analysis of the physical process is then performed using the structured data.
Given an unstructured time-stamped data set 1004, a data specification 1006 applies both a hierarchical and time frequency structure to form a structured time series data set. The TSXENGINE 1002 forms a hierarchical time series data set at particular time frequency. Multiple structures can be applied for desired comparisons, each running in a separate thread.
The data specification 1006 can be specified in SAS code (batch). The data specification API 1008 processes the interactively provided user information and generates the SAS code to structure the time series data 1004. The data specification API 1008 also allows the user to manage the various structures interactively.
Because there are many ways to analyze time series data, user-defined time series functions can be created using the FCMP procedure 1010 (PROC FCMP or the FCMP Function Editor) and stored in the function repository 1012. A function specification 1014 is used to describe the contents of the function repository 1012 and maps the functions to the input data set 1004 variables which allow for re-use. These functions allow for the transformation or the reduction of time series data. Transformations are useful for discovery patterns in the time series data by transforming the original time series 1004 into a more coherent form. Reductions summarize the time series data (dimension reductions) to a smaller number of statistics which are useful for parametric queries and time series ranking Additionally, functions (transformations, reductions, etc.) can receive multiple inputs and provide multiple outputs.
The function specification 1014 can be specified in SAS code (batch). The function specification API 1016 processes the interactively provided user information and generates the SAS code to create and map the user-defined functions. The function specification API 1016 allows the user to manage the functions interactively.
Because there are many possible computational details that may be useful for time series exploration, the output specification 1018 describes the requested output and form for persistent storage. The output specification 1018 can be specified in SAS code (batch). The output specification API 1020 processes the interactively provided user information and generates the need SAS code to produce the requested output. The output specification API 1020 allows the user to manage the outputs interactively.
Because there are many possible visualizations that may be useful for time series exploration, the results specification 1022 describes the requested tabular and graphical output for visualization. The results specification 1022 can be specified in SAS code (batch). The results specification API 1024 processes the interactively provided user information and generates the need SAS code to produce the requested output. The results specification API 1024 allows the user to manage the outputs interactively.
Given the data specification 1006, the function specification 1012, the output specification 1018, and the results specification 1022, the TSXENGINE 1002 reads the unstructured time-stamped data set 1004, structures the data set with respect to the specified hierarchy and time frequency to form a hierarchical time series, computes the transformations and reductions with respect user-specified functions, outputs the desired information in files, and visualizes the desire information in tabular and graphical form.
The entire process can be specified in SAS code (batch). The time series exploration API processes the interactively provided user information and generates the need SAS code to execute the entire process. The system depicted in
Structured time series data and analysis results, as well as unstructured time stamped data, can be displayed and manipulated by a user in many ways.
Certain algorithms can be utilized in implementing a time series exploration system. The following description provides certain notations related to an example time series exploration system.
Series Index
Let N represents the number of series recorded in the time series data set (or sample of the time series data set) and let i=1, . . . , N represent the series index. Typically, the series index is implicitly defined by the by groups associated with the data set under investigation.
Time Index
Let tε{tib, (tib+1), . . . , (tie−1), tie} represent the time index where tib and tie represent the beginning and ending time index for the ith series, respectively. The time index is an ordered set of contiguous integers representing time periods associated with equally spaced time intervals. In some cases, the beginning and/or ending time index coincide, sometimes they do not. The time index may be implicitly defined by the time ID variable values associated with the data set under investigation.
Season Index
Let s□{sib, . . . , sie} represent the season index where sib band sie represent the beginning and ending season index for the ith series, respectively. The season index may have a particular range of values, sε{1, . . . , S}, where S is the seasonality or length of the seasonal cycle. In some cases, the beginning and/or ending season index coincide, sometimes they do not. The season index may be implicitly defined by the time ID variable values and the Time Interval.
Cycle Index
Let l=1, . . . , Li represent the cycle index (or life-cycle index) and Li=(tie+1−tib) represent the cycle length for the ith series. The cycle index maps to the time index as follows: l=(t+1−tib) and Li=(tie+1−tib)). The cycle index represents the number of periods since introduction and ignores timing other than order. The cycle index may be implicitly defined by the starting and ending time ID variable values for each series.
Let LP≦maxi (Li) be the panel cycle length under investigation. Sometimes the panel cycle length is important, sometimes it is not. The analysts may limit the panel cycle length, LP, under consideration, that is subset the data; or the analyst may choose products whose panel cycle length lies within a certain range.
Time Series
Let yi,t represent the dependent time series values (or the series to be analyzed) where tε{tib, . . . , tie} to is the time index for the ith dependent series and where i=1, . . . , N. Let
represent the dependent time series vector for ith dependent series. Let {right arrow over (Y)}(i)={{right arrow over (y)}i}i=1N represent the vector time series for all of the dependent time series.
Let {right arrow over (x)}i,t represent the independent time series vector that can help analyze the dependent series, yi,t. Let {right arrow over (x)}i,t={xi,k,t}k=1K where k=1, . . . , K indexes the independent variables and K represents the number of independent variables. Let
represent the independent time series matrix for ith dependent series. Let X(t)={{right arrow over (X)}i}i=1N represent matrix time series for all of the independent time series.
Together, (yi,t,{right arrow over (x)}i,t) represent the multiple time series data for the ith dependent series. Together, (Y(t),X(t)) represent the panel time series data for all series (or a vector of multiple time series data).
Cycle Series
Each historical dependent time series, yi,t, can be viewed as a cycle series (or life-cycle series) when the time and cycle indices are mapped: yi,t=yi,l where l=(t+1−tib). Let {right arrow over (y)}i={yi,l}l=1L
Each independent time series vector can be indexed by the cycle index: {right arrow over (x)}i,t={right arrow over (x)}i,l where l=(t+1−tib). Similarly {right arrow over (X)}i={{right arrow over (x)}i,l}l=1L
Together, (yi,l,{right arrow over (x)}i,l) represent the multiple cycle series data for the ith dependent series. Together, (Y(l), X(l)) represent the panel cycle series data for all series (or a vector of multiple cycle series data).
Reduced Data
Given the panel time series data, (Y(t),X(t), reduce each multiple time series, (yi,t,{right arrow over (x)}i,t); to a reduced vector, {right arrow over (r)}i={ri,m}m=1M, of uniform length, M. Alternatively, given the panel cycle series data, (Y(l),X(l)), reduce each multiple cycle series, (yi,l,{right arrow over (x)}i,l), to a reduced data vector, {right arrow over (r)}i={ri,m}m=1M, of uniform length, M.
For example, {right arrow over (r)}i features extracted from the ith multiple time series, (yi,t,{right arrow over (x)}i,t). The features may be the seasonal indices where M is the seasonality, or the features may be the cross-correlation analysis results where M is the number of time lags.
The resulting reduced data matrix, R={{right arrow over (r)}i}i=1N has uniform dimension (N×M). Uniform dimensions (coordinate form) are needed for many data mining techniques, such as computing distance measures and clustering data.
Similarity Matrix
Given the panel time series data, (Y(t),X(t)), compare each multiple time series, (yi,t,{right arrow over (x)}i,t), using similarity measures. Alternatively, given the panel cycle series data, (Y(l),X(l)); compare each multiple cycle series, (yi,l,{right arrow over (x)}i,l), using a similarity measures.
Let si,j=Sim({right arrow over (y)}i,{right arrow over (y)}j) represent the similarity measure between the ith and jth series. Let {right arrow over (s)}i={si,j}j=1N represent the similarity vector of uniform length, N, for the ith series.
The resulting similarity matrix, S={{right arrow over (s)}i}i=1N has uniform dimension (N×N). Uniform dimensions (coordinate form) are needed for many data mining techniques, such as computing distance measures and clustering data.
Panel Properties Matrix
Given the panel time series data, (Y(t),X(t)) compute the reduce data matrix, R={{right arrow over (r)}i}i=1N, and/or the similarity matrix, S={{right arrow over (s)}i}i=1N. Alternatively, given the panel cycle series data, (Y(l),X(l)) compute the reduce data matrix, R={{right arrow over (r)}i}i=1N, and/or the similarity matrix, S={{right arrow over (s)}i}i=1N.
A panel properties matrix can be formed by merging the rows of the reduce data matrix and the similarity matrix.
Let P=, S) represent the panel properties matrix of uniform dimension (N×(M+N)). Let {right arrow over (p)}i=({right arrow over (r)}i,{right arrow over (s)}i) represent the panel properties vector for the ith series of uniform dimension (1×(M+N)).
Distance Measures
Given the panel properties vectors, {right arrow over (p)}i{pi,j}j=1M+N, of uniform length, M+N, let di,j=D({right arrow over (p)}i,{right arrow over (p)}j) represent the distance between the panel properties vectors associated with ith and jth series where D( ) represents the distance measure. Let {right arrow over (d)}i={di,j}j=1N be the distance vector associated with the ith series. Let D={{right arrow over (d)}i}i=1N be the distance matrix associated with all of the series.
Distance measures do not depend on time/season/cycle index nor do they depend on the reduction dimension, M. The dimensions of the distance matrix are (N×N).
If the distance between the Panel Properties Vectors is known, {right arrow over (p)}i these distances can be used as a surrogate for the distances between the Panel Series Vectors, (yi,t). In other words, {right arrow over (p)}i is close {right arrow over (p)}j to; then (yi,t) is close to (yj,t).
Attribute Index
Let K represents the number of attributes recorded in the attribute data and let k=1, . . . , K represent the attribute index.
For example, K could represent the number of attributes associated with the products for sale in the marketplace and k could represent the kth attribute of the products.
There may be many attributes associated with a given time series. Some or all of the attributes may be useful in the analysis. In the following discussion, the attributes index, k=1, . . . , K, may represent all of the attributes or those attributes that are deemed important by the analyst.
Typically, the number of attribute variables is implicitly defined by the number of selected attributes.
Attribute Data
Let ai,k represent the attribute data value for kth attribute associated with ith series. The attribute data values are categorical (ordinal, nominal) and continuous (interval, ratio). Let {right arrow over (a)}i={ai,k}k=1K represent the attribute data vector for the ith series where i=1, . . . , N. Let A={{right arrow over (a)}i}i=1N be the set of all possible attribute data vectors. Let Ak={ai,k}i=1N be the set of attribute values for the kth attribute for all the series.
For example, ai,k could represent consumer demographic, product distribution, price level, test market information, or other information for the ith product.
Analyzing the (discrete or continuous) distribution of an attribute variable values, Ak={ai,k}i=1N, can be useful for new product forecasting in determining the attribute values used to select the pool of candidate products to be used in the analysis. In general, a representative pool of candidate products that are similar to the new product is desired; however, a pool that is too large or too small is often undesirable. A large pool may be undesirable because the pool may not be homogeneous in nature. A small pool may be undesirable because it may not capture all of the potential properties and/or variation.
Let A={{right arrow over (a)}i}i=1N represent the attribute data set. In the following discussion, the attributes data set, A, may represent all of the attributes or those attributes that are deemed important to the analyses.
The attributes may not depend on the time/season/cycle index. In other words, they are time invariant. The analyst may choose from the set of the attributes and their attribute values for consideration. Sometimes the product attributes are textual in nature (product descriptions, sales brochures, and other textual formats). Text mining techniques may be used to extract the attribute information into formats usable for statistical analysis. Sometimes the product attributes are visual in nature (pictures, drawings, and other visual formats). This information may be difficult to use in statistical analysis but may be useful for judgmental analysis.
Derived Attribute Index
Let J represents the number of derived attributes computed from the time series data and let j=1, . . . , J represent the derived attribute index.
For example, J could represent the number of derived attributes associated with the historical time series data and j could represent the jth derived attribute.
There may be many derived attributes associated with the historical time series data set. Some or all of the derived attributes may be useful in the analysis. In the following discussion, the derived attributes index, j=1, . . . , J, may represent all of the derived attributes or those derived attributes that are deemed important by the analyst.
Typically, the number of derived attribute variables is implicitly defined by the number of selected derived attributes.
Derived Attribute Data
Let gi,j represent the derived attribute data value for jth derived attribute associated with ith series. The attribute data values are categorical (interval, ordinal, nominal). Let {right arrow over (g)}i={gi,j}j=1J represent the derived attribute data vector for the ith series where i=1, . . . , N. Let G={{right arrow over (g)}i}i=1N be the set of all possible derived attribute data vectors. Let Gj={gi,j}i=1N be the set of attribute values for the jth derived attribute for all the series.
For example, gi,j could represent a discrete-valued cluster assignment, continuous-valued price elasticity, continuous-valued similarity measure, or other information for the ith series.
Analyzing the (discrete or continuous) distribution of an derived attribute variable values, Gj={gi,j}i=1N, is useful for new product forecasting in determining the derived attribute values used to select the pool of candidate products to be used in the analysis. In general, a representative pool of candidate products that are similar to the new product is desired; however, a pool that is too large or too small is often undesirable. A large pool may be undesirable because the pool may not be homogeneous in nature. A small pool may be undesirable because it may not capture all of the potential properties and/or variation.
Let G={{right arrow over (g)}i}i=1N represent the derived attribute data set. In the following discussion, the derived attributes data set, G, may represent all of the derived attributes or those derived attributes that are deemed important to the analyses. The derived attributes may not depend on the time/season/cycle index. In other words, they may be time invariant. However, the means by which they are computed may depend on time. The analyst may choose from the set of the derived attributes and their derived attribute values for consideration.
Certain computations may be made by a time series exploration system. The following describes certain of those computations. For example, given a panel series data set, the series can be summarized to better understand the series global properties.
Univariate Time Series Descriptive Statistics
Given a time series, yi,t, or cycle series, yi,l, summarizes the time series using descriptive statistics. Typically, the descriptive statistics are vector-to-scalar data reductions and have the form: αi=UnivariateDescrtiveStatistic({right arrow over (y)}i)
For example:
missing values are ignored in the summation
missing values are ignored in the summation
missing values are ignored in the minimization
Maximum,
missing values are ignored in the maximization
Time series descriptive statistics can be computed for each independent time series vector.
Vector Series Descriptive Statistics
Given a panel time series, Y(t), or panel cycle series, Y(t)=Y(l), summarize the panel series using descriptive statistics. Essentially, the vector series descriptive statistics summarize the univariate descriptive statistics. Typically, the vector descriptive statistics are matrix-to-scalar data reductions and have the form: α=VectorDescriptiveStatistic(Y(t))
Following are some examples:
missing values are ignored in the minimization
missing values are ignored in the maximization
Likewise, vector series descriptive statistics can be computed for each independent time series vector.
Certain transformations may be performed by a time series exploration system. The following describes certain example time series transformations.
Given a panel series data set, the series can be transformed to another series which permits a greater understanding of the series properties over time.
Univariate Time Series Transformations
Given a time series, yi,t or cycle series, yi,l, univariately transform the time series using a univariate time series transformation. Typically, univariate transformations are vector-to-vector (or series-to-series) operations and have the form: {right arrow over (z)}i=UnivariateTransform({right arrow over (y)}i)
Following are some examples:
Given a dependent time series, yi,t, or cycle series, yi,l, and an independent time series, xi,t, multivariately transform the time series using a multiple time series transformation. Typically, multiple time series transforms are matrix-to-vector operations and have the form: {right arrow over (z)}i=MultipleTransforms({right arrow over (y)}i,{right arrow over (x)}i)
For example:
Given a panel time series, yi,t, or panel cycle series, yi,t=yi,l, multivariately transform the panel series using a vector series transformation. Typically, the vector transformations are matrix-to-matrix (panel-to-panel) operations and have the form: Z=VectorTransform(Y)
Many vector transformations are just univariate transformations applied to each series individually. For each series index
{right arrow over (z)}i=UnivariateTransform({right arrow over (y)}i) i=1, . . . ,N
Some vector transformations are applied to a vector series jointly.
For example:
Certain time series data reduction operations may be performed by a time series exploration system. Data mining techniques include clustering, classification, decision trees, and others. These analytical techniques are applied to large data sets whose observation vectors are relatively small in dimension when compared to the length of a transaction series or time series. In order to effectively apply these data mining techniques to a large number of series, the dimension of each series can be reduced to a small number of statistics that capture their descriptive properties. Various transactional and time series analysis techniques (possibly in combination) can be used to capture these descriptive properties for each time series.
Many transactional and time series databases store the data in longitudinal form, whereas many data mining software packages utilize the data in coordinate form. Dimension reduction extracts important features of the longitudinal dimension of the series and stores the reduced sequence in coordinate form of fixed dimension. Assume that there are N series with lengths {T1, . . . , TN}.
In longitudinal form, each variable (or column) represents a single series, and each variable observation (or row) represents the series value recorded at a particular time. Notice that the length of each series, Ti, can vary.
{right arrow over (y)}i={yi,t}t=1T
where {right arrow over (y)}i is (Ti×1). This form is convenient for time series analysis but less desirable for data mining.
In coordinate form, each observation (or row) represents a single reduced sequence, and each variable (or column) represents the reduced sequence value. Notice that the length of each reduced sequence, M, is fixed.
{right arrow over (r)}i={ri,m}m=1M for i=1, . . . ,N
where {right arrow over (r)}i is (1×M). This form is convenient for data mining but less desirable for time series analysis.
To reduce a single series, a univariate reduction transformation maps the varying longitudinal dimension to the fixed coordinate dimension.
{right arrow over (r)}i=Reducei({right arrow over (y)}i) for i=1, . . . ,N
where {right arrow over (r)}i is (1×M), Yi is (Ti×1), and Reducei( ) is the reduction transformation (e.g., seasonal decomposition).
For multiple series reduction, more than one series is reduced to a single reduction sequence. The bivariate case is illustrated.
{right arrow over (r)}i=Reducei({right arrow over (y)}i,{right arrow over (x)}i,k) for i=1, . . . ,N
where {right arrow over (r)}i is (1×M), {right arrow over (y)}i is (Ti×1), {right arrow over (x)}i,k is (Ti×1), and Reducei( ) is the reduction transformation (e.g., cross-correlations).
In the above discussion, the reduction transformation, Reducei( ), is indexed by the series index, i=1, . . . , N, but typically it does not vary and further discussion assumes it to be the same, that is, Reduce( )=Reducei( ).
Univariate Time Series Data Reductions
Given a time series, yi,t, or cycle series, yi,l, univariately reduce the time series using a time series data reduction. Typically, univariate reductions are vector-to-vector operations and have the form: {right arrow over (r)}i=UnivariateReduction({right arrow over (y)}i)
Following are some examples:
Many vector reductions include univariate reductions applied to each series individually. For each series index
{right arrow over (r)}i=UnivariateReduction({right arrow over (y)}i) i=1, . . . ,N
Some vector reductions are applied to a vector series jointly.
For example:
Given a time series, yi,t, or cycle series, yi,l, derive an attribute using a univariate time series computation. Typically, univariate attribute derivations are vector-to-scalar operations and have the form: gi,j=UnivariateDerivedAttribute({right arrow over (y)}i)
For example:
Given a dependent time series, yi,t, or cycle series, yi,l, and an independent time series, xi,t, derive an attribute using a multiple time series computation. Typically, multiple attribute derivations are matrix-to-scalar operations and have the form: gi,j=MultipleDerivedAttribute({right arrow over (y)}i,{right arrow over (x)}i)
Following are some examples:
Given a panel time series, Y(t), or panel cycle series, Y(t)=Y(l), compute a derived attribute values vector associated with the panel series. Essentially, the vector attribute derivation summarizes or groups the panel time series. Typically, the vector series attribute derivations are matrix-to-vector operations and have the form: Gj=VectorDerivedAttribute(Y(t))
Many vector series attribute derivations are just univariate or multiple attribute derivation applied to each series individually. For each series indices,
gi,j=UnivariateDerivedAttribute({right arrow over (y)}i) i=1, . . . ,N
OR
gi,j=MultipleDerivedAttribute({right arrow over (y)}i,{right arrow over (x)}i) i=1, . . . ,N
Some vector series attribute derivations are applied to a vector series jointly.
For example:
Data provided to, utilized by, and outputted by a time series exploration system may be structured in a variety of forms. The following describes concepts related to the storage and representation of the time series data.
Storage of Panel Series Data
Table 1 describes the storage of the Panel Series Data.
Table 1 represents a panel series. Different areas of the table (e.g., the empty boxes in rows 1-4, the empty boxes in rows 5-7, or the empty boxes in rows 8-11) represent a multiple time series. Each analysis variable column in each multiple time series of the table represents a univariate time series. Each analysis variable column represents a vector time series.
Internal Representation of Panel Series Data
The amount of data associated with a Panel Series may be quite large. The Panel Series may be represented efficiently in memory (e.g., only one copy of the data in memory is stored). The Panel Series, (Y(t), X(t)), contains several multiple series data, (yi,t, {right arrow over (x)}i,t), which contains a fixed number univariate series data, yi,t or {right arrow over (x)}i,t. The independent variables are the same for all dependent series though some may contain only missing values.
Reading and Writing the Panel Series Data
The data set associated with a Panel Series may be quite large. It may be desirable to read the data set only once. The user may be warned if the data set is to be reread. Reading/writing the Panel Series Data into/out of memory may be performed as follows:
For each Multiple Time Series (or by group), read/write all of the Univariate Time Series associated with the by group. Read/write ti,t or {right arrow over (x)}i,t to form (yi,t, {right arrow over (x)}i,t) for each by group. Read/write each by group (yi,t, {right arrow over (x)}i,t) to form (Y(t), X(t)).
A time series exploration may store and manipulate attribute data.
Storage of Attribute Data
Table 2 describes example storage of Attribute Data.
Table 2 represents an attribute data set, A={{right arrow over (a)}i}i=1N. The right half of each row of the table represents an attribute vector for single time series, {right arrow over (a)}i={ai,k}k=1K. Each attribute variable column represents an attribute value vector across all time series, Ak={ai,k}i=1N. Each table cell represents a single attribute value, ai,k.
Table 2 describes different areas (e.g., the empty boxes in rows 1-4, the empty boxes in rows 5-7, or the empty boxes in rows 8-11) of following Table 3 associated with the Panel Series.
Notice that the Panel Series has a time dimension but the Attributes do not. Typically, the attribute data set is much smaller than the panel series data set. Table 3 show that the series index, i=1, . . . , N, are a one-to-one mapping between the tables. The mapping is unique but there may be time series data with no associated attributes (missing attributes) and attribute data with no time series data (missing time series data).
Internal Representation of Attribute Data
The amount of data associated with the attributes may be quite large. The Attribute Data may be represented efficiently in memory (e.g., only one copy of the data in memory is stored). The attribute data, A={{right arrow over (a)}i}i=1N, contains several attribute value vectors, Ak={ai,k}i=1N, which contains a fixed number attribute values, ai,k, for discrete data and a range of values for continuous data. The attribute variables are the same for all time series.
Reading and Writing the Attribute Data
The data set associated with Attributes may be quite large. It may be desirable to only read data once if possible. The user may be warned if the data set is to be reread.
Reading/writing attribute data into/out of memory can be performed as follows:
For each attribute vector (or by group), read/write all of the attribute values associated with the by group.
In some implementations it may be desirable to limit or reduce an amount of data stored. The following discussion describes some practical concepts related to the storage and representation of the reduced data.
Storage of Reduced Data
Table 4 depicts storage of the Reduced Data.
Table 4 represents a reduced data set, R={{right arrow over (r)}i}i=1N. The right half of each row of the table represents a reduced data vector for single time series, {right arrow over (r)}i={ri,m}m=1M. Each reduced variable column represents a reduced value vector across all time series, Rm={ri,m}i=1N. Each table cell represents a single reduced value, ri,m.
Table 5 describes areas (e.g., the empty boxes in rows 1-4, the empty boxes in rows 5-7, or the empty boxes in rows 8-11) of the following table associated with the Panel Series.
Notice that the Panel Series has a time dimension but the Reduced Data do not. Sometimes, the reduced data set is much smaller than the panel series data set. Tables 4 and 5 show that the series index, i=1, . . . , N, are a one-to-one mapping between the tables. The mapping is unique but there may be time series data with no associated reduced data (missing attributes) and reduced data with no time series data (missing time series data).
Dimension reduction may transform the series table (T×N) to the reduced table (N×M) where T=max {T1, . . . , TN} and where typically M<T. The number of series, N, can be quite large; therefore, even a simple reduction transform may manipulate a large amount of data. Hence, it is important to get the data in the proper format to avoid the post-processing of large data sets.
Time series analysts may often desire to analyze the reduced table set in longitudinal form, whereas data miners often may desire analyze the reduced data set in coordinate form.
Transposing a large table from longitudinal form to coordinate form and vice-versa form can be computationally expensive.
In some implementations a time series exploration system may make certain distance computations. The following discussion describes some practical concepts related to the storage and representation of the distance.
Storage of Distance Matrix
Table 6 describes the storage of the Distance.
Table 6 represents a distance matrix data set, D={{right arrow over (d)}i}i=1N. The right half of each row of the table represents a distance vector for single time series, {right arrow over (d)}i={di,j}j=1N. Each distance variable column represents a distance measure vector across all time series, Dj={di,j}i=1N. Each table cell represents a single distance measure value, di,j.
Table 7 describes areas (e.g., the empty boxes in rows 1-4, the empty boxes in rows 5-7, or the empty boxes in rows 8-11) of the following table associated with the Panel Series.
Notice that the Panel Series has a time dimension but the Distance Matrix does not. Typically, the distance matrix data set is much smaller than the panel series data set.
Table 7 shows that the series index, i=1, . . . , N, are a one-to-one mapping between the tables. The mapping is unique but there may be time series data with no associated distance measures (missing measures) and distance measures without time series data (missing time series data).
In some implementations a time series exploration system may store derived data. The following discussion describes some practical concepts related to the storage and representation of the attribute data.
Storage of Derived Attribute Data
Table 8 describes storage of the derived attribute data.
Table 8 represents a derived attribute data set, G={{right arrow over (g)}i}i=1N. The right half of each row of the table represents a derived attribute vector for single time series, {right arrow over (g)}i={gi,j}j=1J. Each attribute variable column represents a derived attribute value vector across all time series, Gj={gi,j}i=1N. Each table cell represents a single derived attribute value, gi,j.
Internal Representation of Attribute Data
The amount of data associated with the derived attributes may be quite large. The derived attribute data may be represented efficiently in memory (e.g., only one copy of the data in memory is stored).
The derived attribute data, G={{right arrow over (g)}i}i=1N, contains several derived attribute value vectors, Gj={gi,j}i=1N, which contains a fixed number derived attribute values, gi,j, for discrete data and a range of values for continuous data. The derived attribute variables are the same for all time series.
Reading and Writing the Derived Attribute Data
The data set associated with Derived Attributes may be quite large. It may be desirable to only read data once if possible. The user may be warned if the data set is to be reread.
Reading/writing derived attribute data into/out of memory may be performed as follows:
For each Derived Attribute Vector (or by group), read/write all of the derived attribute values associated with the by group.
A disk controller 2660 interfaces one or more optional disk drives to the system bus 2652. These disk drives may be external or internal floppy disk drives such as 2662, external or internal CD-ROM, CD-R, CD-RW or DVD drives such as 2664, or external or internal hard drives 2666. As indicated previously, these various disk drives and disk controllers are optional devices.
Each of the element managers, real-time data buffer, conveyors, file input processor, database index shared access memory loader, reference data buffer and data managers may include a software application stored in one or more of the disk drives connected to the disk controller 2660, the ROM 2656 and/or the RAM 2658. Preferably, the processor 2654 may access each component as required.
A display interface 2668 may permit information from the bus 2652 to be displayed on a display 2670 in audio, graphic, or alphanumeric format. Communication with external devices may optionally occur using various communication ports 2672.
In addition to the standard computer-type components, the hardware may also include data input devices, such as a keyboard 2673, or other input device 2674, such as a microphone, remote control, pointer, mouse and/or joystick.
Additionally, the methods and systems described herein may be implemented on many different types of processing devices by program code comprising program instructions that are executable by the device processing subsystem. The software program instructions may include source code, object code, machine code, or any other stored data that is operable to cause a processing system to perform the methods and operations described herein and may be provided in any suitable language such as C, C++, JAVA, for example, or any other suitable programming language. Other implementations may also be used, however, such as firmware or even appropriately designed hardware configured to carry out the methods and systems described herein.
The systems' and methods' data (e.g., associations, mappings, data input, data output, intermediate data results, final data results, etc.) may be stored and implemented in one or more different types of computer-implemented data stores, such as different types of storage devices and programming constructs (e.g., RAM, ROM, Flash memory, flat files, databases, programming data structures, programming variables, IF-THEN (or similar type) statement constructs, etc.). It is noted that data structures describe formats for use in organizing and storing data in databases, programs, memory, or other computer-readable media for use by a computer program.
The computer components, software modules, functions, data stores and data structures described herein may be connected directly or indirectly to each other in order to allow the flow of data needed for their operations. It is also noted that a module or processor includes but is not limited to a unit of code that performs a software operation, and can be implemented for example as a subroutine unit of code, or as a software function unit of code, or as an object (as in an object-oriented paradigm), or as an applet, or in a computer script language, or as another type of computer code. The software components and/or functionality may be located on a single computer or distributed across multiple computers depending upon the situation at hand.
It should be understood that as used in the description herein and throughout the claims that follow, the meaning of “a,” “an,” and “the” includes plural reference unless the context clearly dictates otherwise. Also, as used in the description herein and throughout the claims that follow, the meaning of “in” includes “in” and “on” unless the context clearly dictates otherwise. Further, as used in the description herein and throughout the claims that follow, the meaning of “each” does not require “each and every” unless the context clearly dictates otherwise. Finally, as used in the description herein and throughout the claims that follow, the meanings of “and” and “or” include both the conjunctive and disjunctive and may be used interchangeably unless the context expressly dictates otherwise; the phrase “exclusive or” may be used to indicate situation where only the disjunctive meaning may apply.
This application is a Continuation of U.S. patent application Ser. No. 13/548,307, filed Jul. 13, 2012, entitled “COMPUTER-IMPLEMENTED SYSTEMS AND METHODS FOR TIME SERIES EXPLORATION”, which is incorporated herein by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
5461699 | Arbabi et al. | Oct 1995 | A |
5559895 | Lee et al. | Sep 1996 | A |
5615109 | Eder | Mar 1997 | A |
5870746 | Knutson et al. | Feb 1999 | A |
5918232 | Pouschine et al. | Jun 1999 | A |
5926822 | Garman | Jul 1999 | A |
5953707 | Huang et al. | Sep 1999 | A |
5991740 | Messer | Nov 1999 | A |
5995943 | Bull et al. | Nov 1999 | A |
6052481 | Grajski et al. | Apr 2000 | A |
6128624 | Papierniak et al. | Oct 2000 | A |
6151582 | Huang et al. | Nov 2000 | A |
6151584 | Papierniak et al. | Nov 2000 | A |
6169534 | Raffel et al. | Jan 2001 | B1 |
6189029 | Fuerst | Feb 2001 | B1 |
6208975 | Bull et al. | Mar 2001 | B1 |
6216129 | Eldering | Apr 2001 | B1 |
6223173 | Wakio et al. | Apr 2001 | B1 |
6230064 | Nakase et al. | May 2001 | B1 |
6286005 | Cannon | Sep 2001 | B1 |
6308162 | Ouimet et al. | Oct 2001 | B1 |
6317731 | Luciano | Nov 2001 | B1 |
6334110 | Walter et al. | Dec 2001 | B1 |
6356842 | Intriligator et al. | Mar 2002 | B1 |
6397166 | Leung et al. | May 2002 | B1 |
6400853 | Shiiyama | Jun 2002 | B1 |
6526405 | Mannila et al. | Feb 2003 | B1 |
6539392 | Rebane | Mar 2003 | B1 |
6542869 | Foote | Apr 2003 | B1 |
6564190 | Dubner | May 2003 | B1 |
6570592 | Sajdak | May 2003 | B1 |
6591255 | Tatum et al. | Jul 2003 | B1 |
6611726 | Crosswhite | Aug 2003 | B1 |
6640227 | Andreev | Oct 2003 | B1 |
6735738 | Kojima | May 2004 | B1 |
6775646 | Tufillaro et al. | Aug 2004 | B1 |
6792399 | Phillips et al. | Sep 2004 | B1 |
6850871 | Barford et al. | Feb 2005 | B1 |
6876988 | Helsper et al. | Apr 2005 | B2 |
6878891 | Josten et al. | Apr 2005 | B1 |
6928398 | Fang et al. | Aug 2005 | B1 |
6978249 | Beyer et al. | Dec 2005 | B1 |
7072863 | Phillips et al. | Jul 2006 | B1 |
7080026 | Singh et al. | Jul 2006 | B2 |
7103222 | Peker | Sep 2006 | B2 |
7130822 | Their et al. | Oct 2006 | B1 |
7130833 | Kashima et al. | Oct 2006 | B2 |
7171340 | Brocklebank | Jan 2007 | B2 |
7194434 | Piccioli | Mar 2007 | B2 |
7216088 | Chappel et al. | May 2007 | B1 |
7222082 | Adhikari et al. | May 2007 | B1 |
7236940 | Chappel | Jun 2007 | B2 |
7240019 | Delurgio et al. | Jul 2007 | B2 |
7251589 | Crowe et al. | Jul 2007 | B1 |
7260550 | Notani | Aug 2007 | B1 |
7280986 | Goldberg et al. | Oct 2007 | B2 |
7433834 | Joao | Oct 2008 | B2 |
7523048 | Dvorak | Apr 2009 | B1 |
7530025 | Ramarajan et al. | May 2009 | B2 |
7562062 | Ladde et al. | Jul 2009 | B2 |
7565417 | Rowady, Jr. | Jul 2009 | B2 |
7570262 | Landau et al. | Aug 2009 | B2 |
7610214 | Dwarakanath et al. | Oct 2009 | B1 |
7617167 | Griffis et al. | Nov 2009 | B2 |
7660734 | Neal et al. | Feb 2010 | B1 |
7689456 | Schroeder et al. | Mar 2010 | B2 |
7693737 | Their et al. | Apr 2010 | B2 |
7702482 | Graepel et al. | Apr 2010 | B2 |
7711734 | Leonard et al. | May 2010 | B2 |
7716022 | Park et al. | May 2010 | B1 |
7987106 | Aykin | Jul 2011 | B1 |
8005707 | Jackson et al. | Aug 2011 | B1 |
8010324 | Crowe et al. | Aug 2011 | B1 |
8010404 | Wu et al. | Aug 2011 | B1 |
8326677 | Fan et al. | Dec 2012 | B1 |
8631040 | Jackson et al. | Jan 2014 | B2 |
9037998 | Leonard et al. | May 2015 | B2 |
9087306 | Leonard et al. | Jul 2015 | B2 |
9147218 | Leonard et al. | Sep 2015 | B2 |
9244887 | Leonard et al. | Jan 2016 | B2 |
20010013008 | Waclawski | Aug 2001 | A1 |
20020052758 | Arthur et al. | May 2002 | A1 |
20020169657 | Singh et al. | Nov 2002 | A1 |
20030101009 | Seem | May 2003 | A1 |
20030105660 | Walsh et al. | Jun 2003 | A1 |
20030110016 | Stefek et al. | Jun 2003 | A1 |
20030154144 | Pokorny et al. | Aug 2003 | A1 |
20030187719 | Brocklebank | Oct 2003 | A1 |
20030200134 | Leonard et al. | Oct 2003 | A1 |
20030212590 | Klingler | Nov 2003 | A1 |
20040041727 | Ishii et al. | Mar 2004 | A1 |
20040172225 | Hochberg et al. | Sep 2004 | A1 |
20050055275 | Newman et al. | Mar 2005 | A1 |
20050102107 | Porikli | May 2005 | A1 |
20050114391 | Corcoran et al. | May 2005 | A1 |
20050159997 | John | Jul 2005 | A1 |
20050177351 | Goldberg et al. | Aug 2005 | A1 |
20050209732 | Audimoolam et al. | Sep 2005 | A1 |
20050249412 | Radhakrishnan et al. | Nov 2005 | A1 |
20050271156 | Nakano | Dec 2005 | A1 |
20060063156 | Willman et al. | Mar 2006 | A1 |
20060064181 | Kato | Mar 2006 | A1 |
20060085380 | Cote et al. | Apr 2006 | A1 |
20060112028 | Xiao et al. | May 2006 | A1 |
20060143081 | Argaiz | Jun 2006 | A1 |
20060164997 | Graepel et al. | Jul 2006 | A1 |
20060241923 | Xu et al. | Oct 2006 | A1 |
20060247859 | Ladde et al. | Nov 2006 | A1 |
20060247900 | Brocklebank | Nov 2006 | A1 |
20070011175 | Langseth | Jan 2007 | A1 |
20070094168 | Ayala et al. | Apr 2007 | A1 |
20070106550 | Umblijs et al. | May 2007 | A1 |
20070118491 | Baum et al. | May 2007 | A1 |
20070162301 | Sussman et al. | Jul 2007 | A1 |
20070203783 | Beltramo | Aug 2007 | A1 |
20070208492 | Downs et al. | Sep 2007 | A1 |
20070208608 | Amerasinghe | Sep 2007 | A1 |
20070291958 | Jehan | Dec 2007 | A1 |
20080097802 | Ladde et al. | Apr 2008 | A1 |
20080208832 | Friedlander et al. | Aug 2008 | A1 |
20080288537 | Golovchinsky et al. | Nov 2008 | A1 |
20080294651 | Masuyama et al. | Nov 2008 | A1 |
20090018996 | Hunt et al. | Jan 2009 | A1 |
20090172035 | Lessing et al. | Jul 2009 | A1 |
20090319310 | Little | Dec 2009 | A1 |
20100030521 | Akhrarov et al. | Feb 2010 | A1 |
20100063974 | Papadimitriou et al. | Mar 2010 | A1 |
20100114899 | Guha et al. | May 2010 | A1 |
20100257133 | Crowe et al. | Oct 2010 | A1 |
20110119374 | Ruhl et al. | May 2011 | A1 |
20110145223 | Cormode et al. | Jun 2011 | A1 |
20110208701 | Jackson et al. | Aug 2011 | A1 |
20110307503 | Dlugosch | Dec 2011 | A1 |
20120053989 | Richard | Mar 2012 | A1 |
20130024167 | Blair et al. | Jan 2013 | A1 |
20130024173 | Brzezicki et al. | Jan 2013 | A1 |
20130268318 | Richard | Oct 2013 | A1 |
20140019088 | Leonard et al. | Jan 2014 | A1 |
20140019448 | Leonard et al. | Jan 2014 | A1 |
20140019909 | Leonard et al. | Jan 2014 | A1 |
20140257778 | Leonard et al. | Sep 2014 | A1 |
20150120263 | Brzezicki et al. | Apr 2015 | A1 |
Number | Date | Country |
---|---|---|
2005124718 | Dec 2005 | WO |
Entry |
---|
Aiolfi, Marco et al., “Forecast Combinations,” CREATES Research Paper 2010-21, School of Economics and Management, Aarhus University, 35 pp. (May 6, 2010). |
Automatic Forecasting Systems Inc., Autobox 5.0 for Windows User's Guide, 82 pp. (1999). |
Choudhury, J. Paul et al., “Forecasting of Engineering Manpower Through Fuzzy Associative Memory Neural Network with ARIMA: A Comparative Study”, Neurocomputing, vol. 47, Iss. 1-4, pp. 241-257 (Aug. 2002). |
Costantini, Mauro et al., “Forecast Combination Based on Multiple Encompassing Tests in a Macroeconomic DSGE System,” Reihe Okonomie/ Economics Series 251, 24 pp. (May 2010). |
Crowe, Keith E. et al., U.S. Appl. No. 11/431,089, filed May 9, 2006 entitled “Computer-Implemented System and Method for Generating Forecasts”. |
Crowe, Keith E. et al., U.S. Appl. No. 11/431,123, filed May 9, 2006 entitled “Computer-Implemented Systems and Methods for Storing Data Analysis Models”. |
Data Mining Group, available at http://www.dmg.org, printed May 9, 2005, 3 pp. |
Funnel Web, Web site Analysis. Report, Funnel Web Demonstration, Authenticated Users History, http://www.quest.com/funnel.sub.--web/analyzer/sample/UserHist.html (1 pg.), Mar. 2002. |
Funnel Web, Web site Analysis Report, Funnel Web Demonstration, Clients History, http://www/quest.com/funnel.sub.--web/analyzer/sample.ClientHist- .html (2 pp.), Mar. 2002. |
Garavaglia, Susan et al., “A Smart Guide to Dummy Variables: Four Applications and a Macro,” accessed from: http://web.archive.org/web/20040728083413/http://www.ats.ucla.edu/stat/sa- s/library/nesug98/p046.pdf, (2004). |
Guerard John B. Jr., Automatic Time Series Modeling, Intervention Analysis, and Effective Forecasting. (1989) Journal of Statistical Computation and Simulation, 1563-5163, vol. 34, Issue 1, pp. 43-49. |
Guralnik, V. and Srivastava, J., Event Detection from Time Series Data (1999), Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 33-42. |
Harrison, H.C. et al., “An Intelligent Business Forecasting System”, ACM Annual Computer Science Conference, pp. 229-236 (1993). |
Harvey, Andrew, “Forecasting with Unobserved Components Time Series Models,” Faculty of Economics, University of Cambridge, Prepared for Handbook of Economic Forecasting, pp. 1-89 (Jul. 2004). |
Jackson, Wilma S. et al., U.S. Appl. No. 11/431,127, filed May 9, 2006 entitled “Computer-Implemented Systems and Methods for Defining Events”. |
Jacobsen, Erik et al., “Assigning Confidence to Conditional Branch Predictions”, IEEE, Proceedings of the 29th Annual International Symposium on Microarchitecture, 12 pp. (Dec. 2-4, 1996). |
Keogh, Eamonn J. et al., “Derivative Dynamic Time Warping”, In First SIAM International Conference on Data Mining (SDM'2001), Chicago, USA, pp. 1-11 (2001). |
Kobbacy, Khairy A.H., et al., Abstract, “Towards the development of an intelligent inventory management system,” Integrated Manufacturing Systems, vol. 10, Issue 6, (1999) 11 pp. |
Kumar, Mahesh, “Combining Forecasts Using Clustering”, Rutcor Research Report 40-2005, cover page and pp. 1-16 (Dec. 2005). |
Leonard, Michael et al., “Mining Transactional and Time Series Data”, abstract and presentation, International Symposium of Forecasting, 23 pp. (2003). |
Leonard, Michael et al., “Mining Transactional and Time Series Data”, abstract, presentation and paper, SUGI, 142 pp. (Apr. 10-13, 2005). |
Leonard, Michael James, U.S. Appl. No. 11/696,951, filed Apr. 5, 2007 entitled “Systems and Methods for Mining Transactional and Times Series Data”. |
Leonard, Michael, “Large-Scale Automatic Forecasting Using Inputs and Calendar Events”, abstract and presentation, International Symposium on Forecasting Conference, 56 pp. (Jul. 4-7, 2004). |
Leonard, Michael, “Large-Scale Automatic Forecasting Using Inputs and Calendar Events”, White Paper, pp. 1-27 (2005). |
Leonard, Michael, “Large-Scale Automatic Forecasting: Millions of Forecasts”, abstract and presentation, International Symposium of Forecasting, 156 pp. (2002). |
Leonard, Michael, “Predictive Modeling Markup Language for Time Series Models”, abstract and presentation, International Symposium on Forecasting Conference, 35 pp. (Jul. 4-7, 2004). |
Leonard, Michael, “Promotional Analysis and Forecasting for Demand Planning: A Practical Time Series Approach”, with exhibits 1 and 2, SAS Institute Inc., Cary, North Carolina, 50 pp. (2000). |
Lu, Sheng et al., “A New Algorithm for Linear and Nonlinear ARMA Model Parameter Estimation Using Affine Geometry”, IEEE Transactions on Biomedical Engineering, vol. 48, No. 10, pp. 1116-1124 (Oct. 2001). |
Malhotra, Manoj K. et al., “Decision making using multiple models”, European Journal of Operational Research, 114, pp. 1-14 (1999). |
McQuarrie, Allan D.R. et al., “Regression and Time Series Model Selection”, World Scientific Publishing Co. Pte. Ltd., 40 pp. (1998). |
Oates, Tim et al., “Clustering Time Series with Hidden Markov Models and Dynamic Time Warping”, Computer Science Department, LGRC University of Massachusetts, In Proceedings of the IJCAI-99, 5 pp. (1999). |
Park, Kwan Hee, Abstract “Development and evaluation of a prototype expert system for forecasting models”, Mississippi State University, 1990, 1 pg. |
Park, Youngjin et al., U.S. Appl. No. 11/431,116, filed May 9. 2006 entitled “Computer-Implemented Systems and Methods for Processing Time Series Data”. |
Product Brochure, Forecast PRO, 2000, 12 pp. |
Quest Software, “Funnel Web Analyzer: Analyzing the Way Visitors Interact with Your Web Site”, http://www.quest.com/funnel.sub.--web/analyzer (2 pp.), Mar. 2002. |
Safavi, Alex “Choosing the right forecasting software and system. ” The Journal of Business Forecasting Methods & Systems 19.3 (2000): 6-10. ABI/INFORM Global, ProQuest. |
SAS Institute Inc., SAS/ETS User's Guide, Version 8, Cary NC; SAS Institute Inc., (1999) 1543 pages. |
Seasonal Dummy Variables, Mar. 2004, http://shazam.econ.ubc.ca/intro/dumseas.htm, Accessed from: http://web.archive.org/web/20040321055948/http://shazam.econ.ubc.ca/intro- /dumseas.htm. |
Simoncelli, Eero, “Least Squares Optimization,” Center for Neural Science, and Courant Institute of Mathematical Sciences, pp. 1-8 (Mar. 9, 2005). |
Tashman, Leonard J. et al., Abstract “Automatic Forecasting Software: A Survey and Evaluation”, International Journal of Forecasting, vol. 7, Issue 2, Aug. 1991, 1 pg. |
Using Predictor Variables, (1999) SAS OnlineDoc: Version 8, pp. 1325-1349, Accessed from: http://www.okstate.edu/sas/v8/saspdf/ets/chap27.pdf. |
van Wijk, Jarke J. et al., “Cluster and Calendar based Visualization of Time Series Data”, IEEE Symposium on Information Visualization (INFOVIS '99), San Francisco, pp. 1-6 (Oct. 25-26, 1999). |
Vanderplaats, Garret N., “Numerical Optimization Techniques for Engineering Design”, Vanderplaats Research & Development (publisher), Third Edition, 18 pp. (1999). |
Wang, Liang et al., “An Expert System for Forecasting Model Selection”, IEEE, pp. 704-709 (1992). |
Atuk, Oguz et al., “Seasonal Adjustment in Economic Time Series,” Statistics Department, Discussion Paper No. 2002/1, Central Bank of the Republic of Turkey, Central Bank Review, 15 pp. (2002). |
Babu, G., “Clustering in non-stationary environments using a clan-based evolutionary approach,” Biological Cybernetics, Sep. 7, 1995, Springer Berlin I Heidelberg, pp. 367-374, vol. 73, Issue: 4. |
Bruno, Giancarlo et al., “The Choice of Time Intervals in Seasonal Adjustment: A Heuristic Approach,” Institute for Studies and Economic Analysis, Rome Italy, 14 pp. (2004). |
Bruno, Giancarlo et al., “The Choice of Time Intervals in Seasonal Adjustment: Characterization and Tools,” Institute for Studies and Economic Analysis, Rome, Italy, 21 pp. (Jul. 2001). |
Bradley, D.C. et al., “Quantitation of measurement error with Optimal Segments: basis for adaptive time course smoothing,” Am J Physiol Endocrinol Metab Jun. 1, 1993 264:(6) E902-E911. |
Huang, N. E. et al.,“Applications of Hilbert-Huang transform to non-stationary financial time series analysis.” Appl. Stochastic Models Bus. Ind., 19: 245-268 (2003). |
IBM, “IBM Systems, IBM PowerExecutive Installation and User's Guide,” Version 2.10, 62 pp. (Aug. 2007). |
Kalpakis, K. et al., “Distance measures for effective clustering of ARIMA time-series,”Data Mining, 2001. ICDM 2001, Proceedings IEEE International Conference on, vol., No., pp. 273-280, 2001. |
Keogh, E. et al., “An online algorithm for segmenting time series,” Data Mining, 2001. ICDM 2001, Proceedings IEEE International Conference on , vol., No., pp. 289-296, 2001. |
Keogh, Eamonn et al., “Segmenting Time Series: A Survey and Novel Approach,” Department of Information and Computer Science, University of California, Irvine, California 92697, 15 pp. (2004). |
Palpanas, T. et al., “Online amnesic approximation of streaming time series,” Data Engineering, 2004. Proceedings. 20th International Conference on , vol., No., pp. 339-349, Mar. 30-Apr. 2, 2004. |
Wang Xiao-Ye; Wang Zheng-Ou; “A structure-adaptive piece-wise linear segments representation for time series,” Information Reuse and Integration, 2004. IR I 2004. Proceedings of the 2004 IEEE International Conference on , vol., No., pp. 433-437, Nov. 8-10, 2004. |
Yu, Lean et al., “Time Series Forecasting with Multiple Candidate Models: Selecting or Combining?” Journal of System Science and Complexity, vol. 18, No. 1, pp. 1-18 (Jan. 2005). |
Non-Final Office Action dated Aug. 29, 2012 for U.S. Appl. No. 13/031,828, 18 pages. |
Non-Final Office Action dated Oct. 31, 2007 for U.S. Appl. No. 10/402,849, 14 pages. |
Final Office Action dated May 21, 2008 for U.S. Appl. No. 10/402,849, 19 pages. |
Non-Final Office Action dated Feb. 20, 2009 for U.S. Appl. No. 10/402,849, 21 pages. |
Final Office Action dated Jul. 1, 2010 for U.S. Appl. No. 10/402,849, 24 pages. |
Non-Final Office Action dated Aug. 30, 2013 for U.S. Appl. No. 10/402,849, 29 pages. |
Notice of Allowance dated Sep. 16, 2013 for U.S. Appl. No. 13/031,828 17 pages. |
Non-Final Office Action dated Oct. 25, 2013 for U.S. Appl. No. 13/189,131, 37 pages. |
Non-Final Office Action dated Jan. 16, 2014 for U.S. Appl. No. 13/440,045, 12 pages. |
Non-Final Office Action dated Mar. 26, 2014 for U.S. Appl. No. 13/548,282, 40 pages. |
Final Office Action dated Apr. 24, 2014 for U.S. Appl. No. 13/189,131, 30 pages. |
Non-Final Office Action dated Aug. 8, 2014 for U.S. Appl. No. 10/402,849, 29 pages. |
Notice of Allowance dated Aug. 29, 2014 for U.S. Appl. No. 13/440,045, 9 pages. |
Final Office Action dated Oct. 24, 2014 for U.S. Appl. No. 13/548,282, 30 pages. |
Notice of Allowance dated Jan. 14, 2015 for U.S. Appl. No. 13/551,647 8 pages. |
Notice of Allowance dated Mar. 13, 2015 for U.S. Appl. No. 13/548,307, 9 pages. |
Notice of Allowance dated May 8, 2015 for U.S. Appl. No. 13/786,838, 6 pagers. |
Non-Final Office Action dated May 22, 2015 for U.S. Appl. No. 10/402,849, 32 pages. |
Non-Final Office Action dated Aug. 17, 2015 for U.S. Appl. No. 13/189,131, 11 pages. |
Notice of Allowance dated Sep. 29, 2015 for U.S. Appl. No. 13/548,282, 10 pages. |
Final Office Action dated Nov. 17, 2015 for U.S. Appl. No. 10/402,849, 31 pages. |
Non-Final Office Action dated Mar. 1, 2016 for U.S. Appl. No. 13/189,131, 6 pages. |
Non-Final Office Action dated Sep. 7, 2016 for U.S. Appl. No. 13/189,131, 7 pages. |
Number | Date | Country | |
---|---|---|---|
20150278153 A1 | Oct 2015 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13548307 | Jul 2012 | US |
Child | 14736131 | US |