The present invention generally relates to predictive analytics models, and more particularly, to a time-aware predictive analytics model for predicting the occurrence, time and type of key events and milestones within an ongoing project to assist in monitoring the progress of the project.
A project may have interim milestones and/or key events that must occur to achieve a desired final outcome at the conclusion of the project. Projects may have different final outcomes. For example, a project concludes as a success if the final outcome of the project is a successful outcome; by contrast, a project concludes as a failure if the final outcome of the project is an unsuccessful outcome. Monitoring the status of ongoing projects is important to improve the success rate of projects. During a project, numerous interim milestones and/or key events may occur whose occurrence, and monitoring the status of the project is important in achieving a desired final outcome. Existing predictive analytics models are focused on predicting the final outcome of a project (e.g., success or failure) based on a snapshot of data relating to the project. While predicting the final outcome of a project indirectly advises on the status of the project, existing approaches offer limited guidance and insights.
For example, providers (e.g., IT service providers) sell services and/or products by pursuing opportunity engagements (e.g., sales opportunities in IT service engagements) with potential clients. A large IT outsourcing deal may be a time-consuming and elaborate process that requires multiple time-sensitive goals and milestones (e.g., proposal presentation, agreement on price and service delivery, etc.) to be achieved during the lifecycle of the deal to steer the deal toward success. These interim goals and milestones may occur at different time intervals during the lifecycle of the deal, depending on the size of the deal and other parameters. Existing predictive analytics models do not consider interim goals and milestones, and do not predict the outcome and timeline of the interim goals and milestones. Further, existing predictive analytics models do not provide estimates of when key events (e.g., a win or loss) may occur. As existing predictive analytics models do not provide guidance and insights with regards to these interim goals and milestones, there is a need to provide analytical insights about interim goals and milestones as well as the timeframe within which these interim goals and milestones may happen.
One embodiment provides a method comprising mapping project attributes for past projects to a first parameter set associated with a first model that models distribution of event types of project events, and a second parameter set associated with a second model that models distribution of the time intervals of project events. Specifically, machine learning is applied to a set of historical data for the past projects to obtain a first set of learned weights and a second set of learned weights. The first set of learned weights is a result of the mapping of the project attributes to the first parameter set. The second set of learned weights is a result of the mapping of the project attributes to the second parameter set. The method further comprises predicting information relating to a next project event for an ongoing project by generating a first probability distribution for a set of possible event types for the next project event utilizing the first model, and, for each possible event type, generating a corresponding probability distribution for time intervals of occurrence of the possible event type utilizing the first model and the second model in a pipelined fashion.
These and other aspects, features and advantages of the invention will be understood with reference to the drawing figures, and detailed description herein, and will be realized by means of the various elements and combinations particularly pointed out in the appended claims. It is to be understood that both the foregoing general description and the following brief description of the drawings and detailed description of the invention are exemplary and explanatory of preferred embodiments of the invention, and are not restrictive of the invention, as claimed.
The subject matter which is regarded as the invention is particularly pointed out and distinctly claimed in the claims at the conclusion of the specification. The foregoing and other objects, features, and advantages of the invention are apparent from the following detailed description taken in conjunction with the accompanying drawings in which:
The detailed description explains the preferred embodiments of the invention, together with advantages and features, by way of example with reference to the drawings.
The present invention generally relates to predictive models, and more particularly, to a predictive model for predicting the occurrence, time and type of key events and milestones within an ongoing project to assist in monitoring the progress of the project. One embodiment provides a method comprising mapping project attributes for past projects to a first parameter set associated with a first model that models distribution of event types of project events, and a second parameter set associated with a second model that models distribution of the time intervals of project events. Specifically, machine learning is applied to a set of historical data for the past projects to obtain a first set of learned weights and a second set of learned weights. The first set of learned weights is a result of the mapping of the project attributes to the first parameter set. The second set of learned weights is a result of the mapping of the project attributes to the second parameter set. The method further comprises predicting information relating to a next project event for an ongoing project by generating a first probability distribution for a set of possible event types for the next project event utilizing the first model, and, for each possible event type, generating a corresponding probability distribution for time intervals of occurrence of the possible event type utilizing the first model and the second model in a pipelined fashion.
Embodiments of the invention provide a time-aware predictive analytics model that enables prediction of timeline and status of one or more next project events in a project based on current history of milestone activity in a lifecycle of the project. The time-aware predictive analytics model may also be used to monitor the progress/status of a project. In one embodiment, the time-aware predictive analytics model may automatically learn a reasonable plan from historical data by determining a normal speed of attaining a successful outcome and identifying patterns representing progress, and predict a reasonable time interval and interim milestones, without pre-defined plans or pre-defined check routines. By providing analytical insights about interim goals and milestones as well as the timeframe within which these interim goals and milestones may happen, team members of the project (e.g., sales teams) may have a higher chance of success by knowing of upcoming events, and preparing to counter undesired events.
Embodiments of the invention are applicable to different projects in different areas, such as business revenue forecasting that requires identifying deals that will close with a successful outcome (i.e., win) before quarter-end, project progress monitoring, online dating advisor, etc. For example, one embodiment provides a time-aware predictive analytics model that enables prediction of timeline and status of one or more next project events in an IT outsourcing deal based on current history of milestone activity in a lifecycle of the deal.
A user client 30 (e.g., a member of a sales team for an ongoing deal) may access the system 200 using an electronic user client device 50, such as a personal computer, or a mobile device (e.g., a laptop computer, a tablet, a mobile phone, etc.). In one embodiment, each user client device 50 exchanges data with the system 200 over a connection (e.g., a wireless connection, a wired connection, or a combination of the two).
In one embodiment, the system 200 is implemented based on the following observations from the observed data for past projects: (1) the distribution/frequency of time intervals for the occurrence of key events and milestones decays/decreases exponentially with elapsed time, suggesting that a Geometric distribution may be used to model distribution of such time intervals, (2) the probability of an unsuccessful final outcome (i.e., a loss) is positively correlated with elapsed time, and (3) as different project attributes (e.g., client, size of deal, etc.) differ in progress speed as well as loss probability, the corresponding model parameters should be differentiated as such.
In this specification, let the term “project event” denote an event occurring during a lifecycle of a project. A project event may be one of the following: (1) a final outcome that occurs at the end of a lifecycle of the project, or (2) a key event or milestone occurring before the final outcome of the project.
The time-aware event prediction system 200 further comprises a temporal module 420 configured to model distribution of time intervals for the occurrence of project events. In one embodiment, the temporal module 420 utilizes a Geometric distribution for predicting time intervals for the occurrence of project events, the Geometric distribution representing repeated Bernoulli trials until success. For each unit of time (e.g., day, week, etc.), the temporal module 420 assumes that the occurrence of a project event for a project is a random process controlled by a Bernoulli parameter that is based on one or more project attributes for the project. As described in detail later herein, the temporal module 420 identifies the probability of the occurrence of a particular project event, thereby providing insight into the progress speed of a project (e.g., number of milestones achieved, number of meetings held with potential client, etc.).
In one embodiment, each project event is one of the following event types: (1) a win event representing a successful final outcome for a project (e.g., an IT service provider wins an IT service deal for a particular client), (2) a loss event representing an unsuccessful final outcome for the project (e.g., an IT service provider loses an IT service deal for a particular client), or (3) an update event representing an intermediate key event or milestone that is necessary for the project to progress and that occurs before the final outcome of the project.
Embodiments of the invention are not limited to the event types described above. While different types of individual key events or milestones may be generally classified as update events in one embodiment, other embodiments of the invention may support different types of intermediate key events or milestones given sufficient data.
The time-aware event prediction system 200 further comprises an event prediction module 450 configured to model distribution of event types for project events. In one embodiment, the event prediction module 450 utilizes a Dirichlet process with Dirichlet process parameters for different event types to predict the probability of occurrence of different event types. The Dirichlet process parameters are based on a current status of a project. Furthermore, Dirichlet process parameter for a loss event is positively correlated with elapsed time.
In one embodiment, the time-aware event prediction system 200 further comprises a learning unit 480 configured to map project attributes for past projects to Dirichlet process parameters of a Dirichlet process that models distribution of event types for project events, and a best parameter of a Geometric distribution that models distribution of time intervals for the occurrence of project events. Specifically, the learning unit 480 applies machine learning to the observed data for past projects to learn each of the following: (1) weights of project attributes that are used to compute a best parameter of a Geometric distribution that models distribution of time intervals for the occurrence of project events, and (2) weights of project attributes that are used to compute Dirichlet process parameters of a Dirichlet process that models distribution of event types for project events.
Table 1 below provides a listing identifying different parameters referenced in this specification.
In one embodiment, each log entry 610 is denoted by a trinary tuple t, X, s.
Table 2 below provides example process implemented by the system 200 in determining a time interval t and an event type s for a next project event.
As illustrated by lines 3-5 in Table 2, the temporal module 420 implements a while loop to determine the time interval t. The while loop simulates a repeated Bernoulli trial with a failure probability p. For each failed Bernoulli trial, the time interval t is incremented by 1, suggesting that there are no project events occurring during the time interval t. When the while loop ends, the event prediction module 450 applies the Dirichlet process with the estimated Dirichlet process parameters wu, wv, and wl to estimate the event type s of the next project event.
As described in detail later herein, in one embodiment, the learning unit 480 randomly assigns a value to the parameter wp, and applies machine learning to the observed data for past projects to learn weights of project attributes that are used to compute the optimal parameter wp. The temporal module 420 computes the Bernoulli parameter p based on the vector X and the parameter wp.
In one embodiment, the temporal module 420 comprises a unit 430 (
wherein wpT denotes the transpose of the parameter wp, wherein sig(⋅) denotes the sigmoid function, wherein Φ(⋅) denotes a feature transformation process, and wherein the Bernoulli parameter p∈[0,1].
For a Bernoulli parameter p, a probability P(t|p) of time interval t may be computed in accordance with equation (2) provided below:
P(t|p)=pt-1(1−p) (2),
wherein each trial within the time interval t is a failed Bernoulli trial with exception of the last trial.
Using the Bernoulli parameter p, the temporal module 420 comprises a unit 440 (
In one embodiment, a log probability log P(D|wp) of time intervals in the collection of log entries D may be represented as in equation (3) provided below:
As described in detail later herein, in one embodiment, the learning unit 480 assigns initial values to the Dirichlet process parameters wu, wv, and wl, and applies machine learning to the observed data for past projects to learn weights of project attributes that are used to compute the optimal Dirichlet process parameters wu, wv, and wl. The event prediction module 450 applies the Dirichlet process with the Dirichlet process parameters wu, wv, and wl and the attributes vector X to estimate, for each event type (e.g., win, loss and update), a probability that the event type is the next project event to occur.
In one embodiment, the appearance of an event type is random and is determined by a probability vector α. The probability vector α is a k-dimensional vector, wherein k is equal to the total number of different event types. For example, if there are three different event types in total (e.g., win event, loss event and update event), then k=3.
Let α(j) generally denote an element of the probability vector α. Each element α(j) has a corresponding event type. Each element α(j) represents a probability that a corresponding event type is a next project event to occur, wherein α(j)∈[0,1]. The higher the value of α(j), the higher the probability that a corresponding event type is a next project event to occur. As two different event types cannot occur at the same time, the total sum of each element of the probability vector α is 1 (i.e., Σjα(j)=1).
In one embodiment, the Dirichlet process defines a probability density function for any probability vector. The event prediction module 450 applies a Dirichlet process to model exclusive event types. For a k-dimensional probability vector α, there are k Dirichlet non-negative parameters. For example, for a 3-dimensional probability vector α comprising probabilities of occurrence for a win event, a loss event and an update event, there are three Dirichlet non-negative parameters: (1) wu for an update event, (2) wv for a win event, and (3) wl for a loss event.
In one embodiment, for a 3-dimensional probability vector α comprising probabilities of occurrence for a win event, a loss event and an update event, the probability vector α may be represented as in equation (4) provided below:
wherein B(⋅) denotes a Beta function that provides a normalization constant. The Beta function B(⋅) may be defined in accordance with equation (5) provided below:
The event prediction module 450 comprises a unit 470 (
In one embodiment, an update event U is defined in accordance with equation (8) provided below:
U=ew
wherein U is a non-negative value.
In one embodiment, a win event V is defined in accordance with equation (9) provided below:
V=ew
wherein V is a non-negative value.
As stated above, the probability of an unsuccessful final outcome (i.e., a loss event) is positively correlated with elapsed time. Therefore, a loss event is affected by the time interval t and the Dirichlet process parameters wl. In one embodiment, a loss event L is defined in accordance with equation (10) provided below:
L=t·ew
wherein L is a non-negative value.
Given the collection of log entries D, a log-likelihood may be represented in accordance with equation (11) provided below:
Let P(s,t|X,w) denote a probability that an event type may occur at a specific time t. In one embodiment, the probability P(s,t|X,w) may be computed in accordance with equation (12) provided below:
P(s,t|X,w)=P(t|p=sig(wpTX))·P(s|U=ew
wherein the right-hand side (RHS) of equation (12) comprises two parts: the Geometric distribution as computed in equations (1) and (2), and the Dirichlet distribution as computed in equation (6).
Let P(s,t≤T|X,w) denote a probability that an event type may occur within a time interval T. In one embodiment, the probability P(s,t≤T|X,w) may be computed in accordance with equation (13) provided below:
In one embodiment, a time t* is selected that maximizes the probability P(s,t|X,w).
In another embodiment, a probability threshold is learned to determine whether there would be an event or not. For a specific threshold δ∈[0,1], if the Bernoulli failure trial probability (i.e., failure event probability) is smaller than the threshold pt≤δ, we may consider that something should happen. That is, the time threshold
Given the collection of log entries D, log entries with update events and win events are selected, and an objective function representing the squared difference between the time threshold t* and the real time ti is defined in accordance with equation (14) provided below:
wherein pi=sig(wpTX).
Let δ* denote an optimal probability threshold. In one embodiment, the optimal probability threshold δ* is computed by minimizing equation (14), as computed in accordance with equation (15) provided below:
Let η denote another probability threshold that distinguishes a loss event from others. Given a probability threshold η∈[0,1], the corresponding time threshold t for a loss event may be computed in accordance with equation (16) provided below:
After selecting log entries with loss events from the collection of log entries D, an objective function representing the squared difference between the probability threshold η and the real time ti for a loss event is defined in accordance with equation (17) provided below:
Let η* denote an optimal probability threshold. In one embodiment, the optimal probability threshold η* is computed by minimizing equation (17), as computed in accordance with equation (18) provided below:
Let {circumflex over (t)}i denote an estimated time interval. In one embodiment, the estimated time interval {circumflex over (t)}i is defined in accordance with equation (19) provided below:
The graph 500 also provides temporal estimations that may be used as a guide for maintaining progress of the project. For example, as shown in
Process blocks 602-605 relate to predicting information relating to a next project event for an ongoing project. Specifically, in process block 602, compute the first parameter set based on project attributes for the ongoing project and the first set of learned weights. In process block 603, based on the first model and the first parameter set, predict an event type of the next project event as a probability distribution for a set of possible event types for the next project event. In process block 604, compute the second parameter set based on the project attributes for the ongoing project and the second set of learned weights. In process block 605, based on the second model and the second parameter set, estimate a time interval of occurrence of the next project event as probability distributions for time intervals of occurrence of the set of possible event types.
In one embodiment, process blocks 601-605 may be performed by one or more components of the time-aware event prediction system 200.
The computer system can include a display interface 306 that forwards graphics, text, and other data from the communication infrastructure 304 (or from a frame buffer not shown) for display on a display unit 308. The computer system also includes a main memory 310, preferably random access memory (RAM), and may also include a secondary memory 312. The secondary memory 312 may include, for example, a hard disk drive 314 and/or a removable storage drive 316, representing, for example, a floppy disk drive, a magnetic tape drive, or an optical disk drive. The removable storage drive 316 reads from and/or writes to a removable storage unit 318 in a manner well known to those having ordinary skill in the art. Removable storage unit 318 represents, for example, a floppy disk, a compact disc, a magnetic tape, or an optical disk, etc. which is read by and written to by removable storage drive 316. As will be appreciated, the removable storage unit 318 includes a computer readable medium having stored therein computer software and/or data.
In alternative embodiments, the secondary memory 312 may include other similar means for allowing computer programs or other instructions to be loaded into the computer system. Such means may include, for example, a removable storage unit 320 and an interface 322. Examples of such means may include a program package and package interface (such as that found in video game devices), a removable memory chip (such as an EPROM, or PROM) and associated socket, and other removable storage units 320 and interfaces 322, which allows software and data to be transferred from the removable storage unit 320 to the computer system.
The computer system may also include a communication interface 324. Communication interface 324 allows software and data to be transferred between the computer system and external devices. Examples of communication interface 324 may include a modem, a network interface (such as an Ethernet card), a communication port, or a PCMCIA slot and card, etc. Software and data transferred via communication interface 324 are in the form of signals which may be, for example, electronic, electromagnetic, optical, or other signals capable of being received by communication interface 324. These signals are provided to communication interface 324 via a communication path (i.e., channel) 326. This communication path 326 carries signals and may be implemented using wire or cable, fiber optics, a phone line, a cellular phone link, an RF link, and/or other communication channels.
The present invention may be a system, a method, and/or a computer program product. The computer program product may include a computer readable storage medium (or media) having computer readable program instructions thereon for causing a processor to carry out aspects of the present invention. The computer readable storage medium can be a tangible device that can retain and store instructions for use by an instruction execution device. The computer readable storage medium may be, for example, but is not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of the computer readable storage medium includes the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, and any suitable combination of the foregoing. A computer readable storage medium, as used herein, is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire.
Computer readable program instructions described herein can be downloaded to respective computing/processing devices from a computer readable storage medium or to an external computer or external storage device via a network, for example, the Internet, a local area network, a wide area network and/or a wireless network. The network may comprise copper transmission cables, optical transmission fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. A network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device.
Computer readable program instructions for carrying out operations of the present invention may be assembler instructions, instruction-set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, or either source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C++ or the like, and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The computer readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider). In some embodiments, electronic circuitry including, for example, programmable logic circuitry, field-programmable gate arrays (FPGA), or programmable logic arrays (PLA) may execute the computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects of the present invention.
Aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer readable program instructions.
These computer readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, a programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable storage medium having instructions stored therein comprises an article of manufacture including instructions which implement aspects of the function/act specified in the flowchart and/or block diagram block or blocks.
The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer implemented process, such that the instructions which execute on the computer, other programmable apparatus, or other device implement the functions/acts specified in the flowchart and/or block diagram block or blocks.
The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts or carry out combinations of special purpose hardware and computer instructions.
From the above description, it can be seen that the present invention provides a system, computer program product, and method for implementing the embodiments of the invention. The present invention further provides a non-transitory computer-useable storage medium for implementing the embodiments of the invention. The non-transitory computer-useable storage medium has a computer-readable program, wherein the program upon being processed on a computer causes the computer to implement the steps of the present invention according to the embodiments described herein. References in the claims to an element in the singular is not intended to mean “one and only” unless explicitly so stated, but rather “one or more.” All structural and functional equivalents to the elements of the above-described exemplary embodiment that are currently known or later come to be known to those of ordinary skill in the art are intended to be encompassed by the present claims. No claim element herein is to be construed under the provisions of 35 U.S.C. section 112, sixth paragraph, unless the element is expressly recited using the phrase “means for” or “step for.”
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
The corresponding structures, materials, acts, and equivalents of all means or step plus function elements in the claims below are intended to include any structure, material, or act for performing the function in combination with other claimed elements as specifically claimed. The description of the present invention has been presented for purposes of illustration and description, but is not intended to be exhaustive or limited to the invention in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the invention. The embodiment was chosen and described in order to best explain the principles of the invention and the practical application, and to enable others of ordinary skill in the art to understand the invention for various embodiments with various modifications as are suited to the particular use contemplated.
Number | Name | Date | Kind |
---|---|---|---|
6195646 | Grosh et al. | Feb 2001 | B1 |
6963854 | Boyd et al. | Nov 2005 | B1 |
7010494 | Etzioni et al. | Mar 2006 | B2 |
7039559 | Froehlich et al. | May 2006 | B2 |
7139733 | Cao et al. | Nov 2006 | B2 |
7324969 | Pallister et al. | Jan 2008 | B2 |
7571120 | Fellenstein et al. | Aug 2009 | B2 |
7610233 | Leong et al. | Oct 2009 | B1 |
7711747 | Renders et al. | May 2010 | B2 |
7853473 | Davis et al. | Dec 2010 | B2 |
7865384 | Anderson et al. | Jan 2011 | B2 |
7870047 | Mojsilovic et al. | Jan 2011 | B2 |
7877293 | Biebesheimer et al. | Jan 2011 | B2 |
7937304 | Melnicoff et al. | May 2011 | B2 |
7953646 | Pallister et al. | May 2011 | B2 |
8055530 | Cao et al. | Nov 2011 | B2 |
8352355 | Ettl et al. | Jan 2013 | B2 |
8584135 | Boss et al. | Nov 2013 | B2 |
8676981 | Hackett et al. | Mar 2014 | B2 |
8781989 | Duchon | Jul 2014 | B2 |
8892625 | Liang et al. | Nov 2014 | B2 |
9041797 | Shaffer et al. | May 2015 | B2 |
9124601 | Stoica et al. | Sep 2015 | B2 |
9129299 | Donohue et al. | Sep 2015 | B1 |
9286391 | Dykstra | Mar 2016 | B1 |
9619583 | Lau et al. | Apr 2017 | B2 |
9646066 | Olsen et al. | May 2017 | B2 |
9652776 | Olsen et al. | May 2017 | B2 |
9659317 | Naghmouchi et al. | May 2017 | B2 |
9672074 | Gaurav et al. | Jun 2017 | B2 |
9755988 | Arnette et al. | Sep 2017 | B2 |
9779407 | Adjaoute | Oct 2017 | B2 |
10095990 | Farooq et al. | Oct 2018 | B2 |
20030130861 | Seitz | Jul 2003 | A1 |
20030220773 | Haas et al. | Nov 2003 | A1 |
20040167789 | Roberts et al. | Aug 2004 | A1 |
20040267676 | Feng et al. | Dec 2004 | A1 |
20050071182 | Aikens et al. | Mar 2005 | A1 |
20050131754 | Chapman et al. | Jun 2005 | A1 |
20050189415 | Fano et al. | Sep 2005 | A1 |
20050278202 | Broomhall et al. | Dec 2005 | A1 |
20060089866 | Cheng et al. | Apr 2006 | A1 |
20060111973 | Brown et al. | May 2006 | A1 |
20060129879 | Alznauer et al. | Jun 2006 | A1 |
20070143171 | Boyd et al. | Jun 2007 | A1 |
20080167928 | Cao et al. | Jul 2008 | A1 |
20080313596 | Kreamer | Dec 2008 | A1 |
20090012800 | Devarakonda et al. | Jan 2009 | A1 |
20090030829 | Chatter et al. | Jan 2009 | A1 |
20090240517 | Pelter et al. | Sep 2009 | A1 |
20100235294 | Raghupathy et al. | Sep 2010 | A1 |
20100250296 | Channabasavaiah et al. | Sep 2010 | A1 |
20100262509 | Delia et al. | Oct 2010 | A1 |
20100262548 | Herbst et al. | Oct 2010 | A1 |
20110004509 | Wu et al. | Jan 2011 | A1 |
20110066466 | Narayanan | Mar 2011 | A1 |
20110218865 | Muthukrishnan et al. | Sep 2011 | A1 |
20110238477 | Urbankski | Sep 2011 | A1 |
20120029974 | Councill et al. | Feb 2012 | A1 |
20120030199 | Mohajer | Feb 2012 | A1 |
20120059680 | Guthrie et al. | Mar 2012 | A1 |
20120059707 | Goenka et al. | Mar 2012 | A1 |
20120072251 | Mircean | Mar 2012 | A1 |
20120232948 | Wolf et al. | Sep 2012 | A1 |
20120290347 | Elazouni et al. | Nov 2012 | A1 |
20120303491 | Hill et al. | Nov 2012 | A1 |
20120317050 | Bermuth | Dec 2012 | A1 |
20130054296 | Gajakosh et al. | Feb 2013 | A1 |
20130166355 | Mohanty et al. | Jun 2013 | A1 |
20130197993 | Gao et al. | Aug 2013 | A1 |
20130218625 | Duquette et al. | Aug 2013 | A1 |
20130246213 | Lee et al. | Sep 2013 | A1 |
20130275085 | Cheng et al. | Oct 2013 | A1 |
20130275181 | DiGioacchino et al. | Oct 2013 | A1 |
20130297412 | Batra et al. | Nov 2013 | A1 |
20130332243 | Gifford et al. | Dec 2013 | A1 |
20140006044 | Pradhan et al. | Jan 2014 | A1 |
20140052492 | Boss et al. | Feb 2014 | A1 |
20140096140 | Aquino et al. | Apr 2014 | A1 |
20140096249 | Dupont et al. | Apr 2014 | A1 |
20140200999 | Canny et al. | Jul 2014 | A1 |
20140222473 | Patel et al. | Aug 2014 | A1 |
20140278808 | Iyoob et al. | Sep 2014 | A1 |
20140310065 | Chowdhary et al. | Oct 2014 | A1 |
20140337264 | Bart | Nov 2014 | A1 |
20150066598 | Branch et al. | Mar 2015 | A1 |
20150100384 | Ettl et al. | Apr 2015 | A1 |
20150193709 | Ramesh Babu | Jul 2015 | A1 |
20160140789 | Wickersham, III et al. | May 2016 | A1 |
20160148227 | Choe et al. | May 2016 | A1 |
20160203506 | Butler, IV et al. | Jul 2016 | A1 |
20160217384 | Leonard | Jul 2016 | A1 |
20160321331 | Uchiumi et al. | Nov 2016 | A1 |
20170004408 | Edelen et al. | Jan 2017 | A1 |
20170103451 | Alipov et al. | Apr 2017 | A1 |
20180144314 | Miller | May 2018 | A1 |
20190019148 | Kumar et al. | Jan 2019 | A1 |
Number | Date | Country |
---|---|---|
2012016439 | Feb 2012 | WO |
2014014470 | Jan 2014 | WO |
2014060226 | Apr 2014 | WO |
Entry |
---|
Matthew Malensek, et al. Using Distributed Analytics to Enable Real-Time Exploration of Discrete Event Simulations, 2014, IEEE/ACM 7th International Conference on Utility and Cloud Computing (Year: 2014). |
Suri, P.K. et al., “Estimating the Probability of Project Completion by SIM_DEL Estimator”, Proceedings of the International Journal of Computer Science and Information Technologies (IJCSIT), Aug. 2012, pp. 4938-4945, vol. 3(4), ISSN: 0975-9646, United States. |
Carman, S. et al., “Predictive Value of Comments in the Service Engagement Process”, Proceedings of the American Society for Information Science and Technology (ASIST), 2012, pp. 1-12, vol. 49, United States. |
Greenia, D.B. et al., “A Win Prediction Model for IT Outsourcing Bids”, Proceedings of the SRII Global Conference, Apr. 2014, pp. 1-5, ResearchGate, United States. |
Motahari Nezhad, H.R. et al., “Health identification and outcome prediction for outsourcing services based on textual comments”, Proceedings of 2014 IEEE International Conference on Services Computing (SCC), Jun. 27, 2014-Jul. 2, 2014, pp. 155-162, IEEE, United States. |
Yan, J. et al., “On Machine Learning towards Predictive Sales Pipeline Analytics”, Proceedings of the 29th AAAI Conference on Artificial Intelligence, 2015, pp. 1945-1951, United States. |
Anonymous, “Method and System for Providing a Proactive Backup for Value-Added Information Technology (IT) Service Delivery Requirements”, Dec. 2, 2014, pp. 1-5, IP.com, United States. |
Anonymous, “Methods and Systems for Adaptive Management and Dynamic Pricing of Information Technology Services”, Feb. 25, 2013, pp. 1-4, IP.com, United States. |
Anonymous, “Dynamic pricing of web services”, Jun. 18, 2012, pp. 1-4, IP.com, United States. |
Greenia, D.B. et al., “A Win Prediction Model for IT Outsourcing Bids”, Service Research and Innovation Institute Global Conference, Apr. 2014, pp. 1-5, ResearchGate, United States. |
Akkiraju, R. et al., “On Pricing Complex IT Service Solutions”, Proceedings of the 2014 Annual SRII Global Conference (SRII '14), Apr. 23, 2014, pp. 55-64, IEEE Computer Society, United States. |
Agarwal, D. et al., “fLDA: Matrix Factorization through Latent Dirichlet Allocation”, Proceedings of the 3rd ACM International Conference on Web Search and Data Mining (WSDM'10), Feb. 4, 2010, pp. 91-100, ACM, United States. |
Lee, H. et al., “Enterprise Architecture Content Model Applied to Complexity Management while Delivering IT Services”, Proceedings of the 2014 IEEE International Conference on Services Computing (SCC), Jun. 27, 2014-Jul. 2, 2014, pp. 408-415, IEEE, United States. |
Megahed, A. et al., “Pricing IT Services Deals: A More Agile Top-Down Approach”, for publication in Nov. 2015 at 2015 ICSOC Conference, pp. 1-4, Goa, India. |
List of IBM Patents or Patent Applications Treated as Related Form. |
IBM, “Auto-Configuring Clusters Through Presence Based Discovery,” ip.com, Feb. 6, 2007, pp. 1-3, United States. |
Mell, P., et al., “The NIST Definition of Cloud Computing”, National Institute of Standards and Technology Special Publication 800-145, Sep. 2011, pp. 1-7, U.S. Department of Commerce, United States. |
PR Newswire, “EDS Signs Contract With United AirHnes to Upgrade Computer Systems and Service to Reduce IT Costs,” Jan. 17, 2006, pp. 1-2, Electronic Data Systems Corporation, United States. |
Business Wire, “DataDirect Technologies Helps Subaru Reduce IT Support Costs and Improve Customer Service,” Nov. 2001, pp. 1-2, Rockville, United States. |
Rai, V.K., et al., “A Systemic and Relational Approach to Pricing Services,” Service Science, Mar. 2016, pp. 37-58, vol. 8, No. 1, Institute for Operations Research and the Management Sciences (INFORMS), Maryland, United States. |
Gaivoronski, A.A., et al., “Risk-Balanced Dimensioning and Pricing of End-to-End Differentiated Services,” European Journal of Operational Research, 2016, pp. 644-655, vol. 254, No. 2, Elsevier B.V., Netherlands. |
Gajananan, K., et al., “A Method for Estimating Annual Unit Cost Reduction of IT Service Deals”, Submitted for Publication at the 50th Hawaii International Conference on System Sciences (HICCS), 2017, pp. 1-9, United States. |
Megahed, A., et al., “Top-Down Pricing of IT Services Deals with Recommendation for Missing Values of Historical and Market Data”, Submitted for Publication at the 14th International Conference on Service Oriented Computing (ICSOS), 2016, pp. 1-15, United States. |
Gajananan, K., et al., “A Top-Down Pricing Algorithm for IT Service Contracts Using Lower Level Service Data”, In Proceedings of the 13th IEEE International Conference on Services Computing (SCC), Jun. 2016, pp. 720-727, IEEE, United States. |
Megahed, A., et al., “Modeling Business Insights into Predictive Analytics for the Outcome of IT Service Contracts”, In Proceedings of the 12th IEEE International Conference on Services Computing (SCC), Jun. 2015, pp. 515-521, IEEE, United States [Abstract Only]. |
Anonymous, “Method for Cloud and Cloud-Service Selection”, ip.com, May 13, 2011, pp. 1-8, United States. |
EIC 3600 Search Report dated Jul. 16, 2018 for U.S. Appl. No. 15/192,892 from Scientific and Technical Center, pp. 1-21, United States. |
EIC 3600 Search Report dated Jul. 24, 2018 for U.S. Appl. No. 15/192,892 from Scientific and Technical Information Center, pp. 1-10, United States. |
Bussey, P. et al., “Bid Pricing—Calculating the Possiblity of Winning”, IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation, Oct. 12, 1997, vol. 4, pp. 3615-3620, IEEE, United Kingdom. |
List of IBM Patents or Patent Applications Treated as Related Form; Firth, M.K., U.S. Appl. No. 16/224,595, filed Dec. 18, 2018. |
Lakoff, G., et al. “Metaphors We Live By,” 1980, pp. ix-55, University of Chicago Press, Chicago, United States. |
Edelman, S., “Computing the Mind,” 2008, pp. xi-36, Oxford University Press, New York, United States. |
Murphy, K.P., “Machine Learning, A Probabilistic Perspective,” 2012, pp. 947-956, MIT Press, United States [Abstract Only]. |
Goffman, E., “Frame Analysis: An Essay on the Organization of Experience,” 1974, pp. 1-39, 301-344, Northeastern Univesity Press, United States [Abstract Only]. |
Soni, A. et al., “Pricing schemes in cloud computing: a review”, International Journal of Advanced Computer Research, Mar. 1, 2017, vol. 7, No. 29, pp. 60-70, United States. |
Bardsiri, V.K. et al., “Increasing the accuracy of software development effort estimation using projects clustering”, IET softward, vol. 6, No. 6, Dec. 1, 2012, pp. 461-473. |
EIC 3600 Search Report dated Mar. 31, 2020 for U.S. Appl. No. 16/224,595 from Scientific and Technical Information Center, pp. 1-38, United States. |
Van Dam, K.H. et al., eds. “Agent-based modelling of socio technical systems”, Science & Business Media, Oct. 8, 2012, vol. 9, Springer. |
Grier, D.A., “When computers were human”, Princeton University Press, Nov. 1, 2013. |
Hayles, N.K., “My mother was a computer: Digital subjects and literary texts” University of Chicago Press, Mar. 15, 2010. |
Treffert, D.A. et al., “Islands of genius”, Scientific American, vol. 286, No. 6, pp. 76-85, Jun. 1, 2002. |
Mindell, D.A. et al., “Our robots, ourselves: Robotics and the muths of autonomy”, Viking Adult, 2015. |
List of IBM Patents or Patent Applications Treated as Related Form; Fukuda, M. U.S. Appl. No. 15/192,875, filed Jun. 24, 2016; Firth, M.K., U.S. Appl. No. 15/192,892, filed Jun. 24, 2016; Firth, M.K., U.S. Appl. No. 16/224,595, filed Dec. 18, 2018; Fukuda, M.A., U.S. Appl. No. 17/153,076, filed Jan. 20, 2021; Fukuda, M., U.S. Appl. No. 14/977,383, filed Dec. 21, 2015 List of IBM Patents or Patent Application Treated as Related From; Fukuda, M., U.S. Appl. No. 15/192,884, filed Jun. 24, 2016; Asthana, S., U.S. Appl. No. 15/860,192, filed Jan. 2, 2018, Asthana, S., U.S. Appl. No. 15/860,213, filed: Jan. 2, 2018. |
Akkiraju, R. et al., “On the Role of Analytics in Estimating the Cost of Delivering Complex Information Technology (IT) Outsourcing Services Projects”, 2021 Annual SRII Global Conference, Jul. 2012, pp. 705-714, United States. |
Kansal et al., “Pricing Models in Cloud Computing”, Proceedings of the 2014 International Conference on Information and Communication Technology for Competitive Strategies, Oct. 2014, Art. No. 33, pp. 1-5, United States. |
Ming, W. et al., “Dynamic Instance Provisioning Strategy in an Iass Cloud”, Proceedings of the 32nd Chinese Contol Conference, Jul. 26-28, 2013, pp. 6670-6675, IEEE. |
Number | Date | Country | |
---|---|---|---|
20170161660 A1 | Jun 2017 | US |