Inference model for traveler classification

Information

  • Patent Grant
  • 11138681
  • Patent Number
    11,138,681
  • Date Filed
    Friday, April 26, 2019
    5 years ago
  • Date Issued
    Tuesday, October 5, 2021
    3 years ago
Abstract
A method for classifying a prospective traveler based on statistical inference is described herein. The method comprises receiving an input associated with the prospective traveler. Encoded representation of preferences and goals may be extracted from the input and levels and may be assigned to the preferences and goals. Based on the levels assigned to the preferences and goals, the prospective traveler may be classified according to one or more traveler profiles. Based on the classification, one or more consumer choices may be offered to the prospective traveler.
Description
TECHNICAL FIELD

The present disclosure relates to data processing and, more particularly, to an inference model for traveler classification.


BACKGROUND

The ever increasing supply of goods and services provides prospective buyers with an infinite number of choices. However, it is often left to the prospective buyers to sift through these choices in order to find the ones that are most suitable. Oftentimes, this result in poor choices. To provide a more targeted approach, vendors may ask prospective buyers to provide preferences so that better fitting products may be presented. However, this requires additional effort on part of the prospective buyers. Additionally, the information provided by the prospective buyers may be subjective or intentionally misleading.


SUMMARY

This summary is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used as an aid in determining the scope of the claimed subject matter.


According to one example embodiment of the disclosure, a system for classifying a prospective traveler based on statistical inference is provided. The system for classifying a prospective traveler based on statistical inference can include at least one processor and a database in communication with the processor. The processor may be configured to receive input associated with the prospective traveler and extract encoded representation of preferences and goals from the input. The processor may assign levels to the preferences and goals, classify the prospective traveler according to one or more traveler profiles based on the levels assigned to the preferences and goals, and based on the classification, offer one or more consumer choices to the prospective traveler. The database may be configured to store at least the input, the preferences, and the goals with the assigned levels, and so forth.


Other example embodiments of the disclosure and aspects will become apparent from the following description taken in conjunction with the following drawings.





BRIEF DESCRIPTION OF THE DRAWINGS

Embodiments are illustrated by way of example and not limitation in the figures of the accompanying drawings, in which like references indicate similar elements.



FIG. 1 illustrates an environment within which systems and methods for classifying a prospective traveler based on statistical inference can be implemented.



FIG. 2 is a block diagram showing various modules of the system for classifying prospective traveler.



FIG. 3 is a process flow diagram showing a method for classifying a prospective traveler based on statistical inference.



FIG. 4 illustrates preference-level combinations that characterize example traveler profiles in airline markets.



FIG. 5 is a graphical representation of a probabilistic model that represents conditional dependencies for time sensitivity of a prospective traveler.



FIG. 6 shows a conditional probability table for a time sensitivity network.



FIG. 7 is a graphical representation of a probabilistic model that represents conditional dependencies for price sensitivity of a prospective traveler.



FIG. 8 shows a conditional probability table for a price sensitivity network.



FIG. 9 is a graphical representation of a probabilistic model that represents conditional dependencies for content affinity of a prospective traveler.



FIG. 10 shows a conditional probability table for a content affinity network.



FIG. 11 illustrates a definition of a linear function for characterizing time sensitivity.



FIG. 12 illustrates a numerical representation of a product ranking.



FIG. 13 illustrates an example representation of classifying a prospective traveler using a statistical inference model.



FIG. 14 shows a diagrammatic representation of a computing device for a machine in the exemplary electronic form of a computer system, within which a set of instructions for causing the machine to perform anyone or more of the methodologies discussed herein can be executed.





DETAILED DESCRIPTION

The following detailed description includes references to the accompanying drawings, which form a part of the detailed description. The drawings show illustrations in accordance with exemplary embodiments. These exemplary embodiments, which are also referred to herein as “examples,” are described in enough detail to enable those skilled in the art to practice the present subject matter. The embodiments can be combined, other embodiments can be utilized, or structural, logical, and electrical changes can be made without departing from the scope of what is claimed. The following detailed description is, therefore, not to be taken in a limiting sense, and the scope is defined by the appended claims and their equivalents.


Product definition and product positioning rank is one of the challenging problems encountered within the fields of marketing, innovation management, and other sales related areas. Within the travel sector, product positioning requires an understanding of key drivers of consumer choice and consumer value. The key drivers may include goals and preferences of a prospective traveler, willingness of the prospective traveler to pay to accomplish certain goals, and product choice sets that align with the goals and preferences. Determining specific products that the prospective traveler is most likely to purchase facilitates the product selection process for the prospective traveler and increases the probability of a purchase.


To identify goals and preferences of a prospective traveler, free text data may be analyzed. The free text data may include natural language input of the prospective traveler, such as text entered via a keyboard or voice data, oral exchange, social network data associated with the prospective traveler, and so forth. The identified goals and preferences may be assigned levels to define a preference structure of the prospective traveler. The preference structure may be matched with traveler profiles to classify the prospective traveler according to one of the traveler profiles.


The traveler profiles may characterize the choice of the prospective traveler along several dimensions (for example, time sensitivity, price sensitivity, and content affinity). In some cases, the traveler profiles may include a leisure traveler, a self-paying business traveler, a reimbursed traveler, a business class traveler, and so forth. To assign the prospective traveler to a traveler profile, the highest probability of the prospective traveler fitting the one or more traveler profiles may be determined.


Based on the traveler profile or profiles assigned to the prospective traveler, a formal model of consumer choice may be constructed. Using the model, a set of customer choices consistent with the formal model may be identified and offered to the prospective traveler. The set may include a moderate number of choices (for example, ten customer choices). Thus, the prospective traveler has the products prioritized and displayed based on his profile.


Additionally, any responses of the prospective traveler to the offered set of customer choices may be analyzed. The analysis may determine that the assigned traveler profiles contradict or do not correspond to actual purchase decisions made by the prospective traveler. Based on the determination, the prospective traveler may be assigned different traveler profiles and offered customer choices corresponding to those profiles.



FIG. 1 illustrates an environment 100 within which the systems and methods for classifying a prospective traveler based on statistical inference can be implemented, in accordance to some embodiments. Input 120 associated with a prospective traveler 130 may be received, for example, via a user interface displayed on a user device 140. The input 120 may include free text data. The free text data may be obtained as a natural language input by the prospective traveler 130, by speech-to-text conversion of an oral exchange with the prospective traveler 130, or otherwise. In some embodiments, the prospective traveler 130 may be asked, in oral or written form, one or more motivating questions to receive relevant input 120.


The input 120 may be transmitted to the system 200 for classifying a prospective traveler via a network 110. The network 110 may include the Internet or any other network capable of communicating data between devices. Suitable networks may include or interface with anyone or more of, for instance, a local intranet, a PAN (Personal Area Network), a LAN (Local Area Network), a WAN (Wide Area Network), a MAN (Metropolitan Area Network), a virtual private network (VPN), a storage area network (SAN), a frame relay connection, an Advanced Intelligent Network (AIN) connection, a synchronous optical network (SONET) connection, a digital Tl, T3, El or E3line, Digital Data Service (DDS) connection, DSL (Digital Subscriber Line) connection, an Ethernet connection, an ISDN (Integrated Services Digital Network) line, a dial-up port such as a V.90, V.34 or V.34bis analog modem connection, a cable modem, an ATM (Asynchronous Transfer Mode) connection, or an FDDI (Fiber Distributed Data Interface) or CDDI (Copper Distributed Data Interface) connection. Furthermore, communications may also include links to any of a variety of wireless networks, including WAP (Wireless Application Protocol), GPRS (General Packet Radio Service), GSM (Global System for Mobile Communication), CDMA (Code Division Multiple Access) or TDMA (Time Division Multiple Access), cellular phone networks, GPS (Global Positioning System), CDPD (cellular digital packet data), RIM (Research in Motion, Limited) duplex paging network, Bluetooth radio, or an IEEE 802.11-based radio frequency network. The network 110 can further include or interface with any one or more of an RS-232 serial connection, an IEEE-1394 (Firewire) connection, a Fiber Channel connection, an IrDA (infrared) port, a SCSI (Small Computer Systems Interface) connection, a Universal Serial Bus (USB) connection or other wired or wireless, digital or analog interface or connection, mesh or Digi® networking. The network 110 may include any suitable number and type of devices (e.g., routers and switches) for forwarding commands, content, and/or web object requests from each client to the online community application and responses back to the clients.


The user device 140, in some example embodiments, may include a Graphical User Interface (GUI) for displaying the user interface associated with the system 200. In a typical GUI, instead of offering only text menus or requiring typed commands, the system 200 may present graphical icons, visual indicators, or special graphical elements called widgets that may be utilized to allow the prospective traveler 130 to interact with the system 200. The user device 140 may be configured to utilize icons used in conjunction with text, labels, or text navigation to fully represent the information and actions available to the prospective traveler 130.


The user device 140 may include a mobile telephone, a computer, a lap top, a smart phone, a tablet personal computer (PC), and so forth. The system 200 may be a server-based distributed application; thus, it may include a central component residing on a server and one or more client applications residing on one or more user devices and communicating with the central component via the network 110. The prospective traveler 130 may communicate with the system 200 via a client application available through the user device 140.


The central component of the system 200 may receive the input 120 and other data from various sources, which may include online directories, social networks, blogs, travel history, and so forth. For data retrieving, the system 200 may use a search engine (not shown). The system 200 may extract encoded representation of preferences and goals of the prospective traveler and assign levels to the preferences and goals. Based on the levels, the prospective traveler 130 may be classified according to traveler profiles.


Available products from a product database 150 may be analyzed with reference to the traveler profiles of the prospective traveler 130, and a set of consumer choices 160 suiting the profiles may be determined. The consumer choices 160 may be offered to the prospective traveler 130 by displaying them via the user interface on a screen of the user device 140.



FIG. 2 is a block diagram showing various modules of the system 200 for classifying a prospective traveler, in accordance with certain embodiments. The system 200 may comprise a processor 210 and a database 220. The processor 210 may include a programmable processor, such as a microcontroller, central processing unit (CPU), and so forth. In other embodiments, the processor 210 may include an application-specific integrated circuit (ASIC) or programmable logic array (PLA), such as a field programmable gate array (FPGA), designed to implement the functions performed by the system 200. Thus, the processor 210 may receive free text data related to the prospective traveler. The free text data may be provided by the prospective traveler or retrieved by the search engine from online resources (for example, social networks, blogs, and so forth). The processor 210 may extract encoded representation of preferences and goals of the prospective traveler from the free text data and assign levels to the preferences and goals. Furthermore, the processor 210 may compare the levels of the preferences and goals of the prospective traveler to those of a plurality of predefined traveler profiles. One or more of the plurality of traveler profiles that better match the levels of the prospective traveler than the rest of traveler profiles may be selected. Based on the selected traveler profiles, the prospective traveler may be classified. According to the classification, one or more consumer choices may be offered to the prospective traveler. The database 220 may be configured to store at least the free text data, the preferences and goals, the predefined traveler profiles, and so forth.



FIG. 3 is a process flow diagram showing a method 300 for classifying a prospective traveler based on statistical inference within the environment described with reference to FIG. 1. The method may commence with receiving input associated with a prospective traveler at operation 310. The input may be received in response to motivational questions and may include free text data.


The input may be processed by the system to extract encoded representation of preferences and goals of the prospective traveler at operation 320. The extracting may be based on intentional semantics and consider the language of the prospective traveler used to describe his needs. In some embodiments, the extracting may be Natural Language Processing (NLP)-enabled. At operation 330, levels are assigned to preferences and goals. At operation 340, the prospective traveler is classified according to the traveler profiles based on the assigned levels. At operation 350, based on the classification from operation 340, one or more customer choices is offered to the prospective traveler.



FIG. 4 illustrates preference-level combinations that characterize example traveler profiles in airline markets, in accordance with some embodiments. The extracted preferences and goals typically include preference types 402 corresponding to an illustrative preference structure which may include a class of service requested 404, booking delta 406, a ticket fare level 408, a connection count 410, a travel speed 412, a connection time sum 414, and a departure time 416. Each of the extracted preferences and goals may be assigned a certain level.


In an example embodiment, the preferences and goals may be characterized by multiple levels. As an example, FIG. 4 illustrates characterization of the preferences and goals by only three levels: low, medium, and high. However, other embodiments may utilize any other number of levels. Levels may be associated with specific requests with relation to the preference type 402. The class of service requested 404 may be assigned a low level if the prospective traveler, based on the extracted preferences and goals, typically requests an economy class. If the prospective traveler typically requests a business class, the assigned level may be medium, and if the typical class is first class, then the level may be high.


The booking delta 406 may be relative to the expected date of departure. For example, the booking delta 406 within 7 days before departure may be assigned a low level; from 7 to 30 days may be a medium level; and over 30 days may be a high level.


The ticket fare level 408 may be determined by assigning levels to existing options. For example, a range of the total ticket price for all city pairs may be obtained and divided into three levels. The connection count 410 may be defined as the desired number of connections in the itinerary. A low level may be assigned to a non-stop service; a medium level may be 1 connection; and more than 2 connections may be associated with a high level.


The travel speed 412 may be used to suit differentiated products contained within the inventory. A low level may be assigned to a non-stop service; a medium level may be 1 connection; and more than 2 connections may be associated with a high level. The connection time sum 414 may be measured in hours. For example, a time sum of connections below 2 hours may be associated with a low level, 2-6 hours may be a medium level, and over 6 hours may be a high level. The departure time 416 may capture the relationship between desirable departure times and traveler profile.


In some embodiments, the extracted preferences and goals may include only some of the preferences and goals described above. If all seven preference types 402 are extracted and assigned levels, than there exists 37 possible preference-level combinations.


In some embodiments, the preference structure (x) of the prospective traveler may be represented by a vector (xl, . . . , x7), comprised of the preference levels for the traveler preference structure.


Based on preference-level combinations, the prospective traveler may be classified according to traveler profiles. The classification may be performed with one or more Machine Learning Techniques (MLT), which may include Neural Networks, SVM, Bayesian, and Naïve Bayesian. The highest probability of the prospective traveler fitting the one or more traveler profiles may be determined by using one or more of the MLTs. One or more customer choices may be offered to the prospective traveler based on the classification. In some embodiments, one or more consumer choices of the prospective traveler may be received. Based on the received consumer choices, the prospective traveler may be reclassified.


Thus, a leisure traveler 418 may be associated with a low cabin class, high booking delta, low ticket fare level, and medium connection count, travel speed, connection time sum, and departure time. A business class traveler 424 may be associated with a medium cabin class, low booking delta, high ticket fare level, low connection count, and so forth. Further profiles may be defined for a self-paying business traveler 420, and a reimbursed business traveler 422.


Based on the combinations, an uncertain inference capability may be developed. The uncertain inference capability may allow classifying the prospective traveler in terms of three high level attributes of a prospective traveler: price sensitivity, time sensitivity, and content affinity. The high level attributes represent dimensions of consumer choice.


In some example embodiments, each dimension of consumer choice may be defined in terms of three discrete categorical states: price sensitivity={low, medium, high}; time sensitivity={low, medium, high}; content affinity={low, medium, high}.


In some embodiments, to classify the prospective traveler, a Naïve Bayesian classifier may be used. Thus, a probability of the prospective customer belonging to a traveler profile may be determined.


For example, the following expression may be used:







Pr


(

c
|

x
*


)


=




Pr


(


x
*

|
c

)




Pr


(
c
)




Pr


(

x
*

)



=



Pr


(


x
*

|
c

)




Pr


(
c
)











cPr


(


x
*

|
c

)




Pr


(
c
)










Where dom(c)={Price Sensitivity; Time Sensitivity; Content Affinity}


Thus, if c=Time Sensitivity, the Naive Bayesian classifier may be computed based on the preference types 402 shown by FIG. 4 (see table 426). The computed posterior probability values for Pr(c l x*i), for i=1, . . . , 4, may be tabulated as in the table 428. The highest values of the posterior probability may be chosen. These posterior values may agree with how the classifier should function for certain types of travelers.



FIG. 5 is a graphical representation of a probabilistic model 500 that represents conditional dependencies between some preferences and goals and time sensitivity of the prospective traveler. As shown, the preferences and goals associated with the time sensitivity 502 may include a class of service requested 504, booking delta 506, a ticket fare level 508, a connection count 510, travel speed 512, a connection time sum 514, and a departure time 516.



FIG. 6 shows an example representation 600 of a conditional probability table 602 for a time sensitivity network, in accordance with some example embodiments. The conditional probability table 602 represents probability values for the preferences and goals of the prospective traveler with respect to time sensitivity.


Similar computations may be performed for other consumer choice dimensions. FIG. 7 illustrates a Bayesian network 700 for price sensitivity 702 of the prospective traveler. As shown, the preferences and goals associated with the price sensitivity 702 may include a class of service requested 704, booking delta 706, a ticket fare level 708, a connection count 710, travel speed 712, a connection time sum 714, and a departure time 716.



FIG. 8 provides an example representation 800 of a conditional probability table 802 for the price sensitivity network. The conditional probability table 802 represents probability values for the preferences and goals of the prospective traveler with respect to price sensitivity.



FIG. 9 shows a Bayesian network 900 for context affinity 902 of the prospective traveler. As shown, the preferences and goals associated with the context affinity 902 may include a class of service requested 904 and a ticket fare level 906.



FIG. 10 provides an example representation 1000 of a conditional probability table 1002 for the context affinity network. The conditional probability table 1002 represents probability values for the preferences and goals of the prospective traveler with respect to context affinity.


Based on the computations for consumer choice dimensions, an inference model of consumer choice may be constructed. The inference model may combine a goal of the prospective traveler, his preference with regard to price and time sensitivities, product characteristics scored with regard to price and time, and so forth.


The consumer choice model may be based on a multi-attribute value function: V (XP, XT, XC),


where XP=Price Sensitivity; XT=Time Sensitivity, and XC=Content Affinity.


Formally specifying this model may require characterizing single-attribute value functions for these model criteria, namely: VP(XP), VT(XT), VC(XC).


To characterize the single-dimensional value function for price sensitivity, VP(XP), it may be assumed that preferences for price are monotonically decreasing and are represented by the function:








V


(

X
P

)


=


1
-

exp


[

-


High
-

X
p


ρ


]




1
-

exp


[

-


High
-
Low

ρ


]





,




where Low and High are the lowest and highest levels, respectively, of Xp; over this range, V maps to the unit interval, and p is the exponential constant.


An important element of the characterization of the multi-attribute value function V (XP, XT, XC) may be an algorithmic procedure for appropriately specifying p. Proper characterization of p is associated, for a given consumer, with identification of the midvalue for the range of available prices. Thus, for example, if the score where difference in value between lowest score and midvalue is the same as the difference in value between midvalue and highest score, Xp (midvalue)=0.5.


Using the exponential value function specified previously, the following equation for r may be solved:







0.5
=


1
-

exp


(

-


z
0.5

r


)




1
-

exp


(

-

1
r


)





,




where z denotes the normalized midvalue.


A closed form solution does not exist for this relation, so it may be solved numerically. A given midvalue of the customer is, essentially, an unknown quantity. However, some data about this value may be inferred by utilizing posterior probabilities from Bayesian inference, by conducting statistical analysis of prices for products in choice set, and so forth. The relationship between the midvalue, mid-range, and values of p may be explored. If midvalue is (roughly) equal to the mid-range of the High and Low values, then V(Xp) is, essentially, a linear function. If midvalue is greater than the sum of High and Low divided by 2, then p may be greater than zero. If midvalue is less than the sum of High and Low divided by 2, then p may be less than zero.


For small sample sizes (n=4 to 20) drawn from a sufficiently platykurtic distribution (i.e., possessing negative excess kurtosis, γ2), the mid-range (High+Low)/2 is an efficient estimator for the mean-. The mid-range value may serve as a “reference” point around which a statistical “estimation” procedure for p may be designed.


Specifically, a “triangulation” strategy may be pursued. The “triangulation” strategy may use statistical analysis of product prices to construct a “confidence limit” for the midvalue of the customer and may average the trio of midvalue estimates that emerge from this process, using the previously computed Bayesian posterior probabilities associated with price sensitivity.


An example Algorithm 1 may be used for triangulation procedure for p:


Require: Products {I1, . . . , In}, n≤30















 1:
function Triangulation({l1, . . . , ln}, PrL, PrM, PrH})


 2:
 {p1, . . . , pn} ← {l(1), . . . , l(n)}   custom character   Rank-ordered prices


 3:
 Low ← min{pi}


 4:
 High ← max{pi}


 5:
x ← sample mean for {p1, . . . , pn}


 6:
 s2 ← sample variance for {p1, . . . , pn}


 7:
 α ← 0.05            custom character   Boundng coefficient


 8:
 v ← n − 1      custom character   Degrees of freedom for t distribution





 9:

(a,b)(x_-tα/2(sn),x_+tα/2(sn))






10:

z(High-aHigh-Low,High-x_High-Low,High-bHigh-Low)Normalizevalues






11:

r0.5=1-exp(-z/r)1-exp(-1/r)Solveforrthreetimes






12:
 ρ ≡ (ρL, ρM, ρH) ← (High − Low) · r


13:
 return EV(ρ) ← PrH × ρL + PrM × ρM + PrL × ρH


14:
end function









Numerically, the triangulation procedure may be expressed as follows:

    • 1. {I1; . . . ; I7}; and
      • PrL=0.10
      • PrM=0.20
      • PrH=0.70
    • 2. {279, 315, 399, 425, 505, 616, 849}
    • 3. Low=279
    • 4. High=849
    • 5. x=484
    • 6. s2=38, 730.33
    • 7. α=0:05
    • 8. V=7−1=6
    • 9. (a, b)=(301.99, 666.01)
    • 10. z=(0.96, 0.64, 0.32)
    • 11. r=(−0.06, −0.85, 0.63)
    • 12. ρ=(−34.2, −484.5, 359.1)
    • 13. EV (ρ)=151.05


In such a way, products with a high probability of being purchased by the prospective traveler may be determined. In the presented example, seven illustrative itineraries are selected.


Characterizing time sensitivity within the value model may be based on the manner and degree of specifying time factors of the preferences and goals of the prospective traveler. The time factors may include the degree of specificity (e.g., “morning,” “afternoon,” 3 pm, and so forth), strength of time-related preference, and so forth. To characterize and value the valuation of time of the prospective traveler within the multi-attribute framework, the following cases can be considered: articulation of categorical time preferences and articulation of “sharp” or “crisp” time preferences.


For purposes of illustration, a constructed attribute that measures how close a given product is to a specified departure time goal may be utilized. Preference values may be assumed to be valued symmetrically around a given goal; however, prospective travelers may value pre- and post-goal product times differently.


For example, the attribute XT may be defined as follows:


if consistent with departure time goal







X
T

=

{




0
,




if





consistent





with





departure





time





goal






1
,




if





within





1.5





hrs





of





goal






2
,




if





within





3





hrs





of





goal






3
,




if





within





4.5





hrs





of





goal






4
,




if





within





6





hrs





of





goal









It may be assumed that the single-attribute value function characterizing time sensitivity is a linear function. In an example embodiment, the linear function may be defined as shown by table 1102 of FIG. 11.


A linear additive value model may be applied. The linear additive value model may take the form: V(XP, XT)=WP*VP (XP)+WT*VT (XT).


To parameterize the linear additive model, Price Sensitivity×Time Sensitivity scenarios that emerge from the Bayesian inference capabilities may be used.


Each scenario gives rise to an order pair containing the parameter-specific values for WP and WT, respectively, as illustrated by table 1104.


For example, the assumed goal of the prospective traveler may be 2:00 pm departure time. The list of products (for example, itineraries for the prospective traveler) that was considered with reference to price sensitivity may be considered again. The list of products may include, for example, itinerary 1 with price $279 and departure time 6:00 am, itinerary 2 with price $315 and departure time 11:00 am, itinerary 3 with price $399 and departure time 3:00 pm, itinerary 4 with price $425 and departure time 3:30 pm, itinerary 5 with price $505 and departure time 6:00 pm, itinerary 6 with price $616 and departure time 2:00 pm, and itinerary 7 with price $849 and departure time 1:30 pm.


In this case, only the front-end of the planning problem (i.e., origin) may be considered; the tail-end may be modeled in an analogous fashion. For each of the itineraries, the probability that the prospective traveler may choose it may be estimated. The probability may be expressed numerically as shown by FIG. 12. FIG. 12 shows example itineraries 1-7 1202 considered based on Price Sensitivity=Medium and Time Sensitivity=High levels.



FIG. 13 shows another representation 1300 of classifying a prospective traveler 1302 using a statistical inference model. The input associated with the prospective traveler 1302 may be processed by a parser 1304 to extract preferences and goals which are used to build a preference model 1306. The parsed preferences may be formally characterized 1308. A Naïve Bayes classifier 1310 may be applied to the characterized preferences. As a result, a traveler profile 1312 to which the prospective traveler most likely belongs may be determined.


Based on the traveler profile assigned to the prospective traveler, a multi-attribute utility model 1314 may be built. Using the multi-attribute utility model 1314, available products may be estimated. The products best matching the multi-attribute utility model 1314 may be selected and ranked. A predetermined number of the ranked products 1316 may be offered to the prospective traveler.



FIG. 14 shows a diagrammatic representation of a machine in the example electronic form of a computer system 1400, within which a set of instructions for causing the machine to perform anyone or more of the methodologies discussed herein may be executed. In various example embodiments, the machine operates as a standalone device or may be connected (e.g., networked) to other machines. In a networked deployment, the machine may operate in the capacity of a server or a client machine in a server-client network environment, or as a peer machine in a peer-to-peer (or distributed) network environment. The machine may be a PC, a tablet PC, a set-top box (STB), a cellular telephone, a portable music player (e.g., a portable hard drive audio device such as an Moving Picture Experts Group Audio Layer 3 (MP3) player), a web appliance, a network router, switch or bridge, or any machine capable of executing a set of instructions (sequential or otherwise) that specify actions to be taken by that machine. Further, while only a single machine is illustrated, the term “machine” shall also be taken to include any collection of machines that individually or jointly execute a set (or multiple sets) of instructions to perform anyone or more of the methodologies discussed herein.


The example computer system 1400 includes a processor or multiple processors 1402 (e.g., a CPU, a graphics processing unit (CPU), or both), a main memory 1406, and a static memory 1408, which communicate with each other via a bus 1410. The computer system 1400 may further include a video display unit (e.g., a liquid crystal display (LCD) or a cathode ray tube (CRT)). The computer system 1400 may also include an alphanumeric input device (e.g., a keyboard), a cursor control device (e.g., a mouse), a disk drive unit 1404, a signal generation device (e.g., a speaker), and a network interface device 1412.


The disk drive unit 1404 includes a non-transitory computer-readable medium 1420, on which is stored one or more sets of instructions and data structures (e.g., instructions 1422) embodying or utilized by anyone or more of the methodologies or functions described herein. The instructions 1422 may also reside, completely or at least partially, within the main memory 1406 and/or within the processors 1402 during execution thereof by the computer system 1400. The main memory 1406 and the processors 1402 may also constitute machine-readable media.


The instructions 1422 may further be transmitted or received over a network via the network interface device 1412 utilizing anyone of a number of well-known transfer protocols (e.g., HyperText Transfer Protocol (HTTP)).


In some embodiments, the computer system 1400 may be implemented as a cloud-based computing environment, such as a virtual machine operating within a computing cloud. In other embodiments, the computer system 1400 may itself include a cloud-based computing environment, where the functionalities of the computer system 1400 are executed in a distributed fashion. Thus, the computer system 1400, when configured as a computing cloud, may include pluralities of computing devices in various forms, as will be described in greater detail below.


In general, a cloud-based computing environment is a resource that typically combines the computational power of a large grouping of processors (such as within web servers) and/or that combines the storage capacity of a large grouping of computer memories or storage devices. Systems that provide cloud-based resources may be utilized exclusively by their owners, or such systems may be accessible to outside users who deploy applications within the computing infrastructure to obtain the benefit of large computational or storage resources.


The cloud may be formed, for example, by a network of web servers that comprise a plurality of computing devices, such as a computing device of system 200, with each server (or at least a plurality thereof) providing processor and/or storage resources. These servers may manage workloads provided by multiple users (e.g., cloud resource customers or other users). Typically, each user places workload demands upon the cloud that vary in real-time, sometimes dramatically. The nature and extent of these variations typically depends on the type of business associated with the user.


It is noteworthy that any hardware platform suitable for performing the processing described herein is suitable for use with the technology. The terms “computer-readable storage medium” and “computer-readable storage media” as used herein refer to any medium or media that participate in providing instructions to a CPU for execution. Such media can take many forms, including, but not limited to, non-volatile media, volatile media and transmission media. Non-volatile media include, for example, optical or magnetic disks, such as a fixed disk. Volatile media include dynamic memory, such as system RAM. Transmission media include coaxial cables, copper wire, and fiber optics, among others, including the wires that comprise one embodiment of a bus. Transmission media can also take the form of acoustic or light waves, such as those generated during radio frequency (RF) and infrared (IR) data communications. Common forms of computer-readable media include, for example, a floppy disk, a flexible disk, a hard disk, magnetic tape, any other magnetic medium, a CD-ROM disk, digital video disk (DVD), any other optical medium, any other physical medium with patterns of marks or holes, a RAM, a PROM, an EPROM, an EEPROM, a FLASHEPROM, any other memory chip or data exchange adapter, a carrier wave, or any other medium from which a computer can read.


Various forms of computer-readable media may be involved in carrying one or more sequences of one or more instructions to a CPU for execution. A bus carries the data to system RAM, from which a CPU retrieves and executes the instructions. The instructions received by system RAM can optionally be stored on a fixed disk either before or after execution by a CPU.


Computer program code for carrying out operations for aspects of the present technology may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “c” programming language or similar programming languages. The program code 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 LAN or a WAN, or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).


The corresponding structures, materials, acts, and equivalents of all means or steps 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 technology has been presented for purposes of illustration and description, but is not intended to be exhaustive or limited to the disclosure. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the disclosure. Exemplary embodiments were chosen and described in order to best explain the principles of the present technology and its practical application, and to enable others of ordinary skill in the art to understand the disclosure for various embodiments with various modifications as are suited to the particular use contemplated.


Aspects of the present technology are described above with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the disclosure. 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 program instructions. These computer 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 program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.


Thus, computer-implemented methods and systems for classifying a prospective traveler based on statistical inference are described. Although embodiments have been described with reference to specific exemplary embodiments, it will be evident that various modifications and changes can be made to these exemplary embodiments without departing from the broader spirit and scope of the present application. Accordingly, the specification and drawings are to be regarded in an illustrative rather than a restrictive sense.

Claims
  • 1. A computer-implemented method for classifying a prospective traveler based on a statistical inference, the method comprising: receiving, by a processor, input associated with the prospective traveler, the input including at least free text data provided by the prospective traveler and data from one or more online resources associated with the prospective traveler;extracting, by the processor, an encoded representation of a plurality of preferences and goals from the free text data and from the data from the one or more online resources retrieved by the search engine;assigning, by the processor, one of a plurality of preference levels to each of the preferences and goals to define a preference structure of the prospective traveler, the preference structure represented by a vector comprising each of the assigned preference levels for each of the preferences and goals;classifying the prospective traveler according to one or more predefined traveler profiles;determining a plurality of products with a high probability of being purchased by the prospective traveler using a triangulation statistical analysis of the product characteristics;estimating a numerical probability value that the prospective traveler will choose one of the plurality of products, the numerical probability value estimated for at least two of the plurality of products; andoffering, by the processor, one or more consumer choices to the prospective traveler via graphical elements on a graphical user interface by displaying a predetermined number of the plurality of products to the prospective traveler on the graphical user interface, in order of the numerical probability value that the prospective traveler will choose the product, the processor being configured to receive a selection by the prospective traveler of the one or more offered consumer choices.
  • 2. The method of claim 1, wherein the free text data includes one or more of the following: natural language text, voice data, and oral exchange.
  • 3. The method of claim 1, further comprising: aggregating the assigned preference levels for each of the preferences and goals represented in the preference structure;based on the aggregating the assigned preference levels for each of the preferences and goals represented in the preference structure:determining a numerical value representing a highest probability of the prospective traveler fitting one or more predefined traveler profiles using one or more machine learning techniques.
  • 4. The method of claim 1, further comprising: developing an uncertain inference capability to classify the prospective traveler in terms of a first high level attribute of a plurality of high level attributes, wherein the uncertain inference capability comprises a probabilistic inference model representing conditional dependences between the first high level attribute and the preferences and goals associated with the first high level attribute.
  • 5. The method of claim 4, further comprising: constructing a multi-attribute inference model of consumer choice from the uncertain inference capability of the first high level attribute, an uncertain inference capability of a second high level attribute, and product characteristics scored.
  • 6. The method of claim 1, wherein the one or more predefined traveler profiles include at least a leisure traveler, a self-paying business traveler, a reimbursed traveler, and a business class traveler.
  • 7. The method of claim 1, wherein the predefined traveler profile defines a choice of the prospective traveler according to time sensitivity, price sensitivity, and content affinity.
  • 8. The method of claim 1, further comprising: receiving a response of the prospective traveler to the one or more consumer choices;determining from the response that one or more purchase decisions of the prospective traveler contradicts the preference levels assigned to the preferences and goals;based on the determining, re-assigning the preference levels to the preferences and goals; andoffering further one or more consumer choices to the prospective traveler.
  • 9. The method of claim 1, further comprising receiving a selection of the one or more consumer choices of the prospective traveler; and reclassifying the prospective traveler based on the received selection.
  • 10. The method of claim 1, wherein the plurality of preferences and goals include at least one of: a class of service requested, a booking delta, a ticket fare level, a connection count, a travel speed, a connection time sum, and a departure time.
  • 11. A system for classifying a prospective traveler based on statistical inference, the system comprising: a processor configured to: receive input associated with the prospective traveler, the input including at least free text data provided by the prospective traveler and data from one or more online resources associated with the prospective traveler, the data from the one or more online resources being retrieved by a search engine;extract encoded representation of preferences and goals from the free text data and the data from the one or more online resources retrieved by the search engine;assign levels to the encoded representation of preferences and goals to define a preference structure of the prospective traveler;classify the prospective traveler according to one or more traveler profiles based on the levels assigned to the encoded representation of preferences and goals by matching the preference structure of the prospective traveler to one or more preference structures associated with the one or more traveler profiles, the classifying performed with at least one or more machine learning techniques;determine a plurality of products with a high probability of being purchased by the prospective traveler using a triangulation statistical analysis of the product characteristics;estimate a numerical probability value that the prospective traveler will choose one of the plurality of products, the numerical probability value estimated for at least two of the plurality of products; andoffer the one or more consumer choices to the prospective traveler via graphical elements on a graphical user interface by displaying a predetermined number of the plurality of products to the prospective traveler on the graphical user interface, in order of the numerical probability value, the processor being configured to receive a selection by the prospective traveler of the one or more offered consumer choices; anda database in communication with the processor configured to store at least the input and the preferences and goals.
  • 12. The system of claim 11, wherein the free text data includes one or more of the following: natural language text, voice data, and oral exchange.
  • 13. The system of claim 11, wherein the processor is further configured to: develop an uncertain inference capability to classify the prospective traveler in terms of a first high level attribute of a plurality of high level attributes, wherein the uncertain inference capability comprises a probabilistic inference model representing conditional dependences between the first high level attribute and the preferences and goals associated with the first high level attribute.
  • 14. The system of claim 13, wherein the processor is further configured to: construct a multi-attribute inference model of consumer choice from the uncertain inference capability of the first high level attribute, an uncertain inference capability of a second high level attribute, and product characteristics scored, the multi-attribute inference model being based on computations for consumer choice dimensions, the multi-attribute inference model being applied to identify one or more consumer choices to be offered to the prospective traveler.
  • 15. The system of claim 11, wherein the one or more traveler profiles include at least a leisure traveler, a self-paying business traveler, a reimbursed traveler, and a business class traveler.
  • 16. The system of claim 11, wherein the one or more traveler profiles define a choice of the prospective traveler according to time sensitivity, price sensitivity, and content affinity.
  • 17. The system of claim 11, wherein the encoded representation of preferences and goals are associated with the time sensitivity, wherein the encoded representation of preferences and goals associated with the time sensitivity include one or more of the following: a class of service requested, a booking delta, a ticket fare level, a connection count, a travel speed, a connection time sum, and a departure time.
  • 18. The system of claim 11, wherein the encoded representation of preferences and goals are associated with the price sensitivity, wherein the encoded representation of preferences and goals associated with the price sensitivity include one or more of the following: a class of service requested, a booking delta, a ticket fare level, a connection count, a travel speed, a connection time sum, and a departure time.
  • 19. The system of claim 11, wherein the encoded representation of preferences and goals are associated with the content affinity, wherein the encoded representation of preferences and goals associated with the content affinity include one or more of the following: a class of service requested and a ticket fare level.
  • 20. The system of claim 14, wherein the multi-attribute inference model is based on a multi-attribute value function.
CROSS-REFERENCE TO RELATED APPLICATIONS

The present utility patent application is a continuation of, and claims the priority benefit of, U.S. patent application Ser. No. 14/676,302 filed on Apr. 1, 2015. U.S. patent application Ser. No. 14/676,302 in turn claims the priority benefit of U.S. Provisional Application No. 61/973,695, filed on Apr. 1, 2014. The disclosures of the above-referenced applications are incorporated herein by reference for all purposes to the extent that such subject matter is not inconsistent herewith or limiting hereof.

US Referenced Citations (192)
Number Name Date Kind
5557524 Maki Sep 1996 A
5797127 Walker et al. Aug 1998 A
5832452 Schneider et al. Nov 1998 A
5948040 DeLorme et al. Sep 1999 A
6059724 Campell et al. May 2000 A
6275808 DeMarcken Aug 2001 B1
6307572 DeMarcken et al. Oct 2001 B1
6477520 Malaviya et al. Nov 2002 B1
6553310 Lopke Apr 2003 B1
6795710 Creemer Sep 2004 B1
7092892 Sobalvarro et al. Aug 2006 B1
7219073 Taylor et al. May 2007 B1
7286998 Sauser et al. Oct 2007 B2
7302398 Ban et al. Nov 2007 B2
7680777 Poston et al. Mar 2010 B2
7860808 Peters Dec 2010 B2
7912734 Kil Mar 2011 B2
7979457 Garman Jul 2011 B1
7983956 Goel Jul 2011 B1
8005685 Bird Aug 2011 B1
8035511 Weaver et al. Oct 2011 B2
8165920 Goel Apr 2012 B2
8224665 Morris Jul 2012 B2
8332247 Bailey et al. Dec 2012 B1
8510133 Peak et al. Aug 2013 B2
8600784 Ivey et al. Dec 2013 B1
8600830 Hoffberg Dec 2013 B2
8631007 Blandford et al. Jan 2014 B1
8762160 Lulla Jun 2014 B2
9031853 Bartfeld et al. May 2015 B2
9043151 Cai et al. May 2015 B2
9286629 Miller et al. Mar 2016 B2
9449151 Etchegoyen Sep 2016 B2
9659099 Miller et al. May 2017 B2
9946839 Wilson et al. Apr 2018 B1
10041803 Miller et al. Aug 2018 B2
10078855 Miller et al. Sep 2018 B2
10210270 Miller et al. Feb 2019 B2
20010044788 Demir et al. Nov 2001 A1
20020069133 Currie et al. Jun 2002 A1
20020082877 Schiff et al. Jun 2002 A1
20020147619 Floss et al. Oct 2002 A1
20020178034 Gardner et al. Nov 2002 A1
20030018499 Miller et al. Jan 2003 A1
20030023463 Dombroski et al. Jan 2003 A1
20030050846 Rodon Mar 2003 A1
20030055690 Garback Mar 2003 A1
20030055772 Goldstein Mar 2003 A1
20030135458 Tadano et al. Jul 2003 A1
20030177044 Sokel et al. Sep 2003 A1
20030217052 Rubenczyk et al. Nov 2003 A1
20040002876 Sommers et al. Jan 2004 A1
20040044516 Kennewick et al. Mar 2004 A1
20040078213 Brice et al. Apr 2004 A1
20040111255 Huerta et al. Jun 2004 A1
20040220854 Postrel Nov 2004 A1
20040249680 Liew et al. Dec 2004 A1
20050033614 Lettovsky et al. Feb 2005 A1
20050038644 Napper et al. Feb 2005 A1
20050043940 Elder Feb 2005 A1
20050108068 Marcken et al. May 2005 A1
20050220278 Zirngibl et al. Oct 2005 A1
20050267651 Arango et al. Dec 2005 A1
20050288973 Taylor et al. Dec 2005 A1
20060106655 Lettovsky May 2006 A1
20060178931 Horn Aug 2006 A1
20060241983 Viale et al. Oct 2006 A1
20060247954 Hunt Nov 2006 A1
20060265508 Angel et al. Nov 2006 A1
20060285662 Yin et al. Dec 2006 A1
20060293930 Rodgers et al. Dec 2006 A1
20070073563 Dourthe et al. Mar 2007 A1
20070100962 Barth et al. May 2007 A1
20070106497 Ramsey et al. May 2007 A1
20070106536 Moore May 2007 A1
20070143154 Ashby et al. Jun 2007 A1
20070156469 Bird et al. Jul 2007 A1
20070168245 de Marcken et al. Jul 2007 A1
20070174350 Pell et al. Jul 2007 A1
20070192186 Greene et al. Aug 2007 A1
20070198442 Horn Aug 2007 A1
20070203735 Ashton Aug 2007 A1
20070208503 Harnsberger Sep 2007 A1
20070260495 Mace et al. Nov 2007 A1
20070276595 Lewinson et al. Nov 2007 A1
20070294149 Lu et al. Dec 2007 A1
20080021748 Bay et al. Jan 2008 A1
20080046274 Geelen et al. Feb 2008 A1
20080052217 Etkin Feb 2008 A1
20080059454 Andrieu Mar 2008 A1
20080091525 Kretz Apr 2008 A1
20080091557 Cella et al. Apr 2008 A1
20080103949 Lobana et al. May 2008 A1
20080109232 Musgrove et al. May 2008 A1
20080114623 Berthaud et al. May 2008 A1
20080120306 Panabaker et al. May 2008 A1
20080201178 Vizitei Aug 2008 A1
20080319803 Heyraud et al. Dec 2008 A1
20090005650 Angell et al. Jan 2009 A1
20090006143 Orttung et al. Jan 2009 A1
20090048876 Bonissone et al. Feb 2009 A1
20090063359 Connors Mar 2009 A1
20090070322 Salvetti et al. Mar 2009 A1
20090112639 Robinson Apr 2009 A1
20090157312 Black et al. Jun 2009 A1
20090157664 Wen Jun 2009 A1
20090177651 Takamatsu et al. Jul 2009 A1
20090210262 Rines et al. Aug 2009 A1
20090216633 Whitsett et al. Aug 2009 A1
20090234681 Champernowne Sep 2009 A1
20090240517 Pelter Sep 2009 A1
20090319305 Weissert et al. Dec 2009 A1
20090327148 Kamar et al. Dec 2009 A1
20100010841 Cooper et al. Jan 2010 A1
20100010978 Carapella et al. Jan 2010 A1
20100030594 Swart Feb 2010 A1
20100082241 Trivedi Apr 2010 A1
20100153292 Zheng et al. Jun 2010 A1
20100217680 Fusz et al. Aug 2010 A1
20100217723 Sauerwein, Jr. et al. Aug 2010 A1
20100317420 Hoffberg Dec 2010 A1
20100318386 Vaughan et al. Dec 2010 A1
20100324927 Tinsley Dec 2010 A1
20110046989 Crean et al. Feb 2011 A1
20110093361 Morales Apr 2011 A1
20110125578 Alspector et al. May 2011 A1
20110137766 Rasmussen et al. Jun 2011 A1
20110153373 Dantzig et al. Jun 2011 A1
20110167003 Nice et al. Jul 2011 A1
20110231182 Weider et al. Sep 2011 A1
20110246246 Johnson Oct 2011 A1
20110295692 Zivkovic et al. Dec 2011 A1
20110307241 Waibel et al. Dec 2011 A1
20110307280 Mandelbaum Dec 2011 A1
20110312870 Beatty Dec 2011 A1
20120036158 Cahill et al. Feb 2012 A1
20120054001 Zivkovic et al. Mar 2012 A1
20120059679 de Marcken et al. Mar 2012 A1
20120209517 Li et al. Aug 2012 A1
20120233207 Mohajer Sep 2012 A1
20120239440 Miller et al. Sep 2012 A1
20120239443 Miller et al. Sep 2012 A1
20120239455 Crean et al. Sep 2012 A1
20120239584 Yariv et al. Sep 2012 A1
20120239669 Miller et al. Sep 2012 A1
20120259667 Pelissier et al. Oct 2012 A1
20120265598 Krone Oct 2012 A1
20120330982 Arnaud et al. Dec 2012 A1
20130166329 Amoux-Prost et al. Jan 2013 A1
20130041696 Richard Feb 2013 A1
20130041902 Swann et al. Feb 2013 A1
20130054375 Sy et al. Feb 2013 A1
20130073323 Zacharia et al. Mar 2013 A1
20130073325 Ross Mar 2013 A1
20130090959 Kvamme et al. Apr 2013 A1
20130096965 Pappas et al. Apr 2013 A1
20130132129 Fox et al. May 2013 A1
20130151291 Salway Jun 2013 A1
20130158821 Ricci Jun 2013 A1
20130159023 Srinivas et al. Jun 2013 A1
20130198036 Pappas et al. Aug 2013 A1
20130304349 Davidson Nov 2013 A1
20130339105 Russell et al. Dec 2013 A1
20140012659 Yan Jan 2014 A1
20140019176 Mandelbaum Jan 2014 A1
20140025540 Hendrickson Jan 2014 A1
20140074746 Wang Mar 2014 A1
20140081793 Hoffberg Mar 2014 A1
20140089020 Murphy Mar 2014 A1
20140089036 Chidlovskii Mar 2014 A1
20140089101 Meller Mar 2014 A1
20140114705 Bashvitz et al. Apr 2014 A1
20140156411 Murgai Jun 2014 A1
20140229102 Bapna et al. Aug 2014 A1
20140257949 Gishen Sep 2014 A1
20140279196 Wilson et al. Sep 2014 A1
20140330605 Connolly et al. Nov 2014 A1
20140330606 Paget et al. Nov 2014 A1
20140330621 Nichols et al. Nov 2014 A1
20140337063 Nelson et al. Nov 2014 A1
20150012309 Buchheim et al. Jan 2015 A1
20150012467 Greystoke et al. Jan 2015 A1
20150046201 Miller et al. Feb 2015 A1
20150066594 Li et al. Mar 2015 A1
20150193583 McNair et al. Jul 2015 A1
20150227633 Shapira Aug 2015 A1
20150235478 Blandin et al. Aug 2015 A1
20150242927 Will Aug 2015 A1
20160162871 Lee Jun 2016 A1
20160196271 Miller et al. Jul 2016 A1
20170316103 Miller et al. Nov 2017 A1
20190012712 Miller et al. Jan 2019 A1
Non-Patent Literature Citations (67)
Entry
Non-final Office Action and Notice of References Cited dated Sep. 26, 2017 in U.S. Appl. No. 15/178,453 (12 pages).
Non-final Office Action and Notice of References Cited dated Sep. 16, 2019 in U.S. Appl. No. 16/055,767 (7 pages).
Final Office Action and Notice of References Cited dated Apr. 18, 2017 in U.S. Appl. No. 14/453,420 (27 pages).
Non-final Office Action dated Mar. 9, 2018 in U.S. Appl. No. 14/453,420 (38 pages).
Final Office Action and Notice of References Cited dated Aug. 27, 2018 in U.S. Appl. No. 14/453,420 (45 pages).
Non-final Office Action and Notice of References Cited dated Jan. 7, 2019 in U.S. Appl. No. 14/453,420 (47 pages).
Final Office Action and Notice of References Cited dated Mar. 29, 2019 in U.S. Appl. No. 14/453,420 (44 pages).
Non-final Office Action and Notice of References Cited dated Jul. 12, 2018 in U.S. Appl. No. 15/183,620 (14 pages).
Non-Final Office Action and Notice of References Cited dated Nov. 29, 2018 in U.S. Appl. No. 15/183,620 (17 pages).
Non-final Office Action and Notice of References Cited dated May 22, 2019 in U.S. Appl. No. 15/183,620 (16 pages).
Non-final Office Action and Notice of References Cited dated Apr. 17, 2019 in U.S. Appl. No. 15/482,619 (42 pages).
Non-final Office Action and Notice of References Cited dated Apr. 14, 2020 in U.S. Appl. No. 15/979,275 (14 pages).
Non-final Office Action and Notice of References Cited dated May 28, 2020 in U.S. Appl. No. 16/142,834 (33 pages).
Final Office Action and Notice of References Cited dated Oct. 23, 2020 in U.S. Appl. No. 14/750,841 (21 pages).
International Search Report and Written Opinion dated Jun. 15, 2012 in International Patent Application No. PCT/US2012/029121 (8 pages).
International Search Report and Written Opinion dated Jun. 7, 2012 in International Patent Application No. PCT/US2012/029098 (6 pages).
International Search Report and Written Opinion dated Mar. 14, 2013 in International Patent Application No. PCT/US2012/029112 (6 pages).
International Search Report and Written Opinion dated Nov. 24, 2014 in International Patent Application No. PCT/US2014/049979 (8 pages).
United Hub, “FareLock: An Opportunity to Lock in Your Ticket Price for up to Seven Days”, Jul. 28, 2012 <https://web.archive.org/web/20120728071904/https://www.united.com/CMS/en-US/products/travelproducts/Pages/FareLock.aspx>, Aug. 17, 2012 <https://hub.united.com/en-us/news/products-services/pages/farelock-lets-you-lock-in-your-ticket-price.aspx> (3 pages).
Mackenzie, “Two Services Help You Lock in a Good Deal on Airfare”, Hack My Trip, Apr. 2014 <http://hackmytrip.com/2014/04/two-services-help-lock-good-deal-airfare> (9 pages).
Boardman, “Options Away”, Vimeo, May 24, 2013 <http://vimeo.com/66936261> (2 pages).
International Search Report and Written Opinion dated Jul. 2, 2015 in International Patent Application No. PCT/US2015/023901 (8 pages).
Examiner's Report dated May 18, 2016 in CA Patent Application No. 2,830,224 (6 pages).
Examiner's Report dated May 19, 2016 in CA Patent Application No. 2,830,229 (4 pages).
International Search Report and Written Opinion dated Jul. 11, 2016 in International Patent Application No. PCT/US2016/037555 (12 pages).
International Search Report and Written Opinion dated Sep. 1, 2016 in International Patent Application No. PCT/US2016/036760 (8 pages).
International Search Report and Written Opinion dated Sep. 9, 2016 in International Patent Application No. PCT/US2016/037503 (6 pages).
International Search Report and Written Opinion dated Sep. 27, 2016 in International Patent Application No. PCT/US2016/036749 (6 pages).
Examiner's Report dated Apr. 28, 2017 in CA Patent Application No. 2,830,229 (4 pages).
International Search Report and Written Opinion dated Jul. 7, 2017 in International Patent Application No. PCT/US2017/026708 (8 pages).
Mayerowitz, “Latest Airline Fee: $9 to Lock in Airfare”, ABC News [online], Dec. 13, 2010 <http://web.archive.org/web/20110122133909/http://abcnews.go.com/Travel/airline-fees-forget-checked-bags-pay-lock-airfare/story?id=12385126> (p. 1) and Dec. 18, 2010 <http://web.archive.org/web/20101218074131/http://abcnews.go.com:80/Travel/airline-fees-forget-checked-bags-pay-lock-airfare/story?id=12385126&page=2 (p. 2), total 8 pages.
Examiner's Report dated Mar. 16, 2018 in CA Patent Application No. 2,830,229 (5 pages).
Soddeau, et al., “Galaxy: A Human-Language Interface to On-Line Travel Information”, 3rd International Conference on Spoken Language Processing (ICSLP94), Yokohama, Japan, Sep. 18-22, 1994, pp. 707-710.
Subramoni, “Topology-Aware MPI Communication and Scheduling for High Performance Computing Systems”, Ohio State University, 2013, 151 pages.
Tablan et al., “A Natural Language Query Interface to Structured Information”, The Semantic Web: Research and Applications, ESWC 2008: Lecture Notes in Computer Science, vol. 5021, pp. 361-375.
United Airlines, “FareLock”, webpage, Jul. 28, 2012 <https://www.united.com/CMS/en-US/products/travel/products/Pages/FareLock.aspx> (4 pages).
Federal Trade Commission, “Using Layaway Plans”, webpage, Dec. 19, 2012 <http://web.archive.org/web/20121219044435/https://www.consumer.ftc.gov/articles/0128-using-layaway-plans> (2 pages).
Examiner's Report dated Feb. 27, 2019 in CA Patent Application No. 2,944,652 (5 pages).
Examiner's Report dated Mar. 1, 2019 in CA Patent Application No. 2,830,229 (3 pages).
Examiner's Report dated Jun. 3, 2019 in CA Patent Application No. 3,021,147 (5 pages).
Examiner's Report dated Jul. 26, 2019 in CA Patent Application No. 2,989,325 (6 pages).
Non-final Office Action and Notice of References Cited dated Jun. 5, 2018 in U.S. Appl. No. 15/595,795 (14 pages).
Non-final Office Action and Notice of References Cited dated Mar. 11, 2015 in U.S. Appl. No. 13/420,433 (9 pages).
Non-final Office Action and Notice of References Cited dated Feb. 26, 2016 in U.S. Appl. No. 13/420,433 (11 pages).
Non-final Office Action and Notice of References Cited dated Dec. 16, 2013 in U.S. Appl. No. 13/419,989 (16 pages).
Non-final Office Action and Notice of References Cited dated Dec. 5, 2014 in U.S. Appl. No. 13/419,989 (14 pages).
Notices of Allowance and References Cited dated Dec. 18, 2015 in U.S. Appl. No. 13/419,989 (15 pages).
Non-final Office Action and Notice of References Cited dated Oct. 21, 2014 in U.S. Appl. No. 13/420,179 (10 pages).
Non-final Office Action and Notice of References Cited dated Aug. 12, 2015 in U.S. Appl. No. 14/750,841 (15 pages).
Non-final Office Action and Notice of References Cited dated Aug. 14, 2015 in U.S. Appl. No. 14/676,302 (19 pages).
Final Office Action and Notice of References Cited dated Apr. 6, 2016 in U.S. Appl. No. 14/676,302 (26 pages).
Final Office Action and Notice of References Cited dated Jul. 11, 2016 in U.S. Appl. No. 13/420,433 (12 pages).
Non-final Office Action and Notice of References Cited dated Sep. 20, 2016 in U.S. Appl. No. 14/453,420 (29 pages).
Non-final Office Action and Notice of References Cited dated Nov. 30, 2016 in U.S. Appl. No. 14/676,302 (20 pages).
Non-final Office Action and Notice of References Cited dated Dec. 29, 2016 in U.S. Appl. No. 14/750,841 (16 pages).
Non-final Office Action and Notice of References Cited dated Jul. 13, 2016 in U.S. Appl. No. 15/069,791 (12 pages).
Non-final Office Action and Notice of References Cited dated Jun. 22, 2016 in U.S. Appl. No. 13/420,179 (13 pages).
Notices of Allowance and References Cited dated Dec. 27, 2018 in U.S. Appl. No. 13/420,179 (13 pages).
Non-final Office Action and Notice of References Cited dated Apr. 24, 2018 in U.S. Appl. No. 14/676,302 (26 pages).
Non-final Office Action and Notice of References Cited dated Feb. 7, 2019 in U.S. Appl. No. 14/750,841 (18 pages).
Non-final Office Action and Notice of References Cited dated Mar. 13, 2020 in U.S. Appl. No. 14/750,841 (25 pages).
Non-final Office Action and Notice of References Cited dated Aug. 24, 2018 in U.S. Appl. No. 15/178,064 (30 pages).
Final Office Action and Notice of References Cited dated Feb. 19, 2019 in U.S. Appl. No. 15/178,064 (33 pages).
Non-final Office Action and Notice of References Cited dated Oct. 7, 2019 in U.S. Appl. No. 15/178,064 (44 pages).
Notice of Allowance and References Cited in U.S. Appl. No. 14/750,841, dated Mar. 23, 2021 (12 pages).
PR Newswire, “GetGoing Launches Multi-Supplier Hotel Merchandising Platform: BCD Travel Signs Multi-Year Agreement to Streamline Hotel Booking for Travel Management Companies”, New York, PR Newswire Association LLC, Sep. 23, 2014 (2-3 pages).
Notices of Allowance and References Cited dated Jul. 9, 2021 in U.S. Appl. No. 16/275,133 (12 pages).
Related Publications (1)
Number Date Country
20190251643 A1 Aug 2019 US
Provisional Applications (1)
Number Date Country
61973695 Apr 2014 US
Continuations (1)
Number Date Country
Parent 14676302 Apr 2015 US
Child 16396436 US