KR20100007006A - Method and system for recommending schedule - Google Patents
Method and system for recommending schedule Download PDFInfo
- Publication number
- KR20100007006A KR20100007006A KR1020080067403A KR20080067403A KR20100007006A KR 20100007006 A KR20100007006 A KR 20100007006A KR 1020080067403 A KR1020080067403 A KR 1020080067403A KR 20080067403 A KR20080067403 A KR 20080067403A KR 20100007006 A KR20100007006 A KR 20100007006A
- Authority
- KR
- South Korea
- Prior art keywords
- schedule
- information
- recommendation
- generation reference
- reference information
- Prior art date
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0207—Discounts or incentives, e.g. coupons or rebates
Abstract
The present invention relates to a schedule service providing method and a system thereof.
The present invention provides a method for providing a schedule service in a schedule service system, the method comprising: storing and managing schedule type specific scenarios and schedule generation reference information; Receiving basic input information from a requester's terminal; Generating at least one recommendation schedule using a scenario for each schedule type and referring to at least one of basic input information and schedule generation reference information; Providing a generated recommendation schedule; And managing a selected selection schedule from the provided recommendation schedules, and providing corresponding notification information for each detailed schedule included in the selection schedule.
According to the present invention, even if the minimum information is input from the requestor, it is effective to generate and provide a schedule that best matches the taste, situation, and demand of the requester or companion.
Description
The present invention relates to a schedule service providing method and a system thereof. More specifically, the present invention relates to a schedule service providing method and system for generating and providing a schedule that best meets the taste, situation, and request of the requester or companion, even though the minimum information is input from the requester.
These days, when a user is planning a trip, tourism, a date, etc., a user travels through various related sites on the Internet, collects travel information, restaurant information, traffic information, and schedules. However, when the user lacks time to set a schedule or cannot collect enough information for satisfactory scheduling, the current situation is that many users feel difficulty in scheduling.
Therefore, there is a growing demand for schedule services that create and recommend schedules that meet the user's plan. However, in the conventional schedule service, a user must receive as much information as possible from the user in order to generate a schedule suitable for the user's needs. This may cause inconvenience to user input of information.
In addition, in the conventional schedule service, only the standardized information, such as pre-stored travel information and restaurant information, is used to schedule a schedule that matches the same based on a lot of information input from the user. There is a problem that does not fully reflect the taste of the companion. In addition, since the overall schedule is generated without considering the relationship between the detailed schedules, there is a problem in that a schedule may be generated that does not include a detailed schedule that is not practical or must be performed in view of common sense, time, and distance. For example, the problem of creating and providing an unsatisfactory schedule such as swimming after drinking, scheduling a schedule of moving from Seoul to Busan within a short time, or scheduling a detailed schedule of not eating at mealtimes. There is this.
An object of the present invention for solving the above problems is to generate and provide a schedule that best meets the taste, situation, needs, etc. of the requestor or companion, even if the minimum information is input from the requestor.
Another object of the present invention is to collect and store a variety of information to be referred to in order to generate a schedule that best meets the requester's or companion's tastes, circumstances, needs, etc., even when a minimum amount of information is input from the requester.
It is still another object of the present invention to generate an overall schedule in consideration of the relationship between the detailed schedules in order to avoid generating schedules that do not include detailed schedules that are not practical or must be made in view of common sense, time and distance. It is to recommend a schedule of satisfaction.
According to an aspect of the present invention for achieving the above object, a schedule service system for providing a schedule service, comprising: a scenario information management unit for storing and managing a scenario for each schedule type; A schedule generation reference information manager for storing and managing schedule generation reference information; A basic input information input unit which receives basic input information from a requester's terminal; A recommendation schedule generation unit generating one or more recommendation schedules by using the schedule type-specific scenario and referring to at least one of the basic input information and the schedule generation reference information; A recommendation schedule providing unit providing the generated recommendation schedule; And a selection schedule management unit configured to manage the selected selection schedule among the provided recommendation schedules, and provide corresponding notification information for each detailed schedule included in the selection schedule.
According to another aspect of the present invention for achieving the above object, a method for providing a schedule service in a schedule service system, the method comprising: (a) storing and managing scenarios and schedule generation reference information for each schedule type; (b) receiving basic input information from a requester's terminal; (c) generating at least one recommendation schedule by using the schedule type-specific scenario and referring to at least one of the basic input information and the schedule generation reference information; (d) providing the generated recommendation schedule; And (e) managing a selected selection schedule from the provided recommendation schedules, and providing corresponding notification information for each detailed schedule included in the selection schedule.
As described above, according to the present invention, even when the minimum information is input from the requester, it is effective to generate and provide a schedule that best matches the taste, situation, and request of the requester or companion.
In addition, according to the present invention, by collecting and storing a variety of information to refer to the schedule to create a variety, by using this to create a schedule that best meets the taste, situation, needs, etc. of the requester or companions, it is effective have.
In addition, according to the present invention, by generating the overall schedule in consideration of the relationship between the detailed schedule, in the light of common sense, time and distance, etc., it is not possible to create a schedule that does not include a detailed schedule that is not actually possible or must-have. It is effective to recommend a schedule of high satisfaction.
Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings. First of all, in adding reference numerals to the components of each drawing, it should be noted that the same reference numerals are used as much as possible even if displayed on different drawings. In addition, in describing the present invention, when it is determined that the detailed description of the related well-known configuration or function is obvious to those skilled in the art or may obscure the gist of the present invention, the detailed description thereof will be omitted.
1 is a diagram schematically illustrating a schedule service according to an embodiment of the present invention.
Referring to FIG. 1, the
Thereafter, the
Accordingly, the
The
The above-mentioned "recommended schedule" may include a plurality of schedules to be recommended, and each schedule has one scenario in which one or more play cultures are connected in order. In addition, schedules such as recommendation schedules may be classified into specific schedule types. For example, if the
A "scenario" that may be included in this recommendation schedule or may be itself may be viewed as a collection of play cultures in which play cultures are connected in sequence, and may include one or more play units connected to one or more affiliated stores that can enjoy such play culture. Play Unit) is included.
In addition, the "play unit" included in such a scenario may be a specific play culture such as eating, watching a movie, drinking tea, drinking, etc., where "merchant" refers to a specific store or place associated with the above-described play unit. This means that the information about the merchant may include one or more specific "event" related information that can be enjoyed at the merchant.
In addition, the play unit and the event may be divided into a plurality of layers.
For example, a play unit called movie view can be subdivided into action movie viewing and melodramatic viewing, and information about merchants linked to the play unit for action movie viewing will be the name of the theater where action movies can be viewed. And, the event-related information corresponding to this may be the actual movie name for the action movie to be seen at the merchant. As another example, a play unit called dinning may be subdivided into Korean, Western, Chinese, Japanese, Instant, Family Restaurants, etc., depending on the type of meal. The information on the affiliated store may be a merchant name to eat Korean food, the event-related information corresponding to this may be the actual cooking name to eat at the merchant.
In addition, one or more of the above-described scenarios, play units, and events may be generated and collected by the operator of the
Schedules (recommended schedules), schedule types, scenarios, play units, merchants, and events, which are briefly described above, are terms used in the present invention and will be described in more detail with reference to FIGS. 3 and 4.
2 is a block diagram of a
2, the
The
The schedule generation reference
The basic input
The recommendation
The recommendation
The selection
The above scenario
The above-mentioned "schedule type-specific scenario" may be regarded as a collection of play cultures in which order of play cultures are connected in order for a certain type of schedule, and at least one play unit connected to one or more affiliated stores that can enjoy such play culture. Contains information about units). That is, the schedule type-specific scenario may include one or more play units associated with one or more affiliate stores, and may include information about an execution order and execution time of the play units.
That is, the schedule type-specific scenario may include one or more play units, one or more affiliate stores, and one or more events hierarchically, and may include information about an execution order and execution time of the play units. In addition, one or more play units, one or more merchants, and one or more events may be associated with each other.
In addition, the "play unit" included in the schedule-type scenario may be a specific play culture such as eating, watching a movie, drinking tea, or drinking, and the term "merchant" refers to a specific store or place related to the play unit described above. The information on the affiliated store may include one or more specific “event” related information that can be enjoyed at the affiliated store.
In addition, the play unit and the event included in the above-described type-specific scenario may be subdivided into a plurality of layers. For example, a play unit called movie view can be subdivided into action movie viewing and melodramatic viewing, and information about merchants linked to the play unit for action movie viewing will be the name of the theater where action movies can be viewed. And, the event-related information corresponding to this may be the actual movie name for the action movie to be seen at the merchant. As another example, a play unit called dinning may be subdivided into Korean, Western, Chinese, Japanese, Instant, Family Restaurants, etc., depending on the type of meal. The information on the affiliated store may be a merchant name to eat Korean food, the event-related information corresponding to this may be the actual cooking name to eat at the merchant.
Meanwhile, the scenario
The above-described recommendation
Here, the "recommended schedule" may include a plurality of schedules to be recommended, and each schedule has one scenario in which one or more play cultures are connected in order. In addition, schedules such as recommendation schedules may be classified into specific “schedule types”. If the
For example, the requester enters the date, time, companion and schedule type as basic input information, respectively, "October 1", "6 pm-10 pm", "Hong Gil-dong" and "Depressed mood", respectively. , And if 10 scenarios for the selected schedule type ("depressed mood") are stored and managed in advance, the specific date and time included in the basic input information among the 10 scenarios ("October 1, 6 PM) Candidate scenarios can be selected, except for scenarios that are not suitable for hours to 10 ". In addition, if the user information for the companion "Hong Gil-dong" included in the basic input information is pre-stored or collected in the
Thereafter, the
First, the recommendation
For example, if the time information included in the basic input information is from 6 pm to 9 pm, if some of the selected candidate scenarios are possible scenarios from 9 am to 10 pm, then all of the candidate scenarios A correction may be performed to reduce the execution time (9 am to 10 pm) from 6 pm to 9 pm, which is the time included in the basic input information. In this case, the play unit corresponding to the execution time from 9 am to 6 pm and from 9 pm to 10 pm, that is, the play culture, is deleted.
As another example, if the information about the time included in the basic input information includes dinner time, the candidate scenario may be corrected by additionally including a play unit for the dining play culture in the selected candidate scenario. You can also create
Next, the recommendation
In the following, the candidate scenario is corrected based on one of the information exemplified above with respect to the schedule generation reference information.
First, with respect to schedule generation reference information including "user information", the recommendation
For example, the requestor is identified from the basic information input from the service request received from the requester who likes movie viewing, the user information about the confirmed requester is extracted from the database, and the requestor views the movie through the extracted user information. Recognizing that the user likes, add the play unit for the movie viewing to the candidate scenario, and in this regard can include the information recommending the adjacent theater to correct the candidate scenario to generate a recommendation schedule. The user information extracted from the database is information entered by the requester when subscribing to a schedule service, information stored based on information included in a selected schedule when providing a schedule service in the past, or registered by a requester when using another service such as a blog or mini homepage. It may be information collected and stored from a text or purchased content usage information.
Second, with respect to the schedule generation reference information including "affiliate related information", the recommendation
For example, if there is a merchant that does not use a coupon among merchants corresponding to a specific play unit included in the candidate scenario, the candidate scenario may be corrected by deleting the merchant or changing to another merchant that can use the coupon.
Third, with respect to schedule generation reference information including "local distance information", the recommended
For example, if information about the location between the merchants corresponding to the play unit included in the candidate scenario is identified, that is, local distance information, and the determined distance between the affiliated stores is too far, it is easy to move. The candidate scenario may be corrected by changing to merchants or deleting some distant merchants.
Fourth, with respect to schedule generation reference information including "common sense information," the recommended
For example, if the candidate scenario includes two play cultures (play unit), such as drinking and driving, the candidate scenario may be corrected by changing or deleting the play unit based on the common sense information about not driving or drinking. have. The basic common sense information is stored in the database, and whenever there is a new common sense information is stored in the database can increase the amount of information of the common sense information.
Fifth, with respect to schedule generation reference information including "cost information", the recommendation
For example, if there are a plurality of selected candidate scenarios, the recommendation schedule may be generated by inquiring cost information about a plurality of candidate scenarios, selecting and correcting only candidate scenarios having a low cost.
In the above description, the candidate scenario is corrected based on one piece of information included in the schedule generation reference information. However, in some embodiments, the candidate scenario is corrected based on two or more pieces of information included in the schedule generation reference information. In this case, the candidate scenario may be corrected by giving different weights to two or more pieces of information.
In addition, as described above, the recommendation
The schedule generation
The
Providing the recommendation schedule, the recommendation schedule may be stored as a request result for the terminal 120 and transmitted when the request result from the terminal 120 is inquired, or the recommendation schedule may be directly transmitted to the terminal 120.
The
In addition, the
The
The selection schedule mentioned above may be all or part of a schedule selected from the recommendation schedule provided by the
In addition, the selection schedule may be a part in which a play unit or an event included in a schedule selected among the recommended schedules by the user is changed, deleted or added according to the user's selection, thereby increasing or decreasing its own weight. As such, a selection schedule in which some play units or events are changed, deleted, or added may be fed back to the schedule generation reference
According to the
In addition, according to the
In addition, according to the
3 is a diagram for exemplarily describing a scenario for each schedule type according to an embodiment of the present invention.
FIG. 3 is a diagram schematically illustrating and illustrating a data hierarchy structure for a predetermined type of scenario previously stored in the
As shown in FIG. 3, as an example, the scenarios stored in the
Referring to FIG. 3, one of three schedule types (schedule type 1 (31), schedule type 2 (32), and schedule type 3 (33)) has three scenarios (scenario 1 (310)). ), Scenario 2 (320), scenario 3 (330).
These three scenarios (Scenario 1 310, Scenario 2 320, and Scenario 3 330) may each include one or more play units representing a play culture. Referring to FIG. 3, Scenario 1 (310) includes play unit 1 (311), play unit 2 (312) and play unit 3 (313) for three play cultures: 'tea drinking', 'movie watching', 'and' drinking alcohol ' .
In addition, referring to Figure 3, the play unit 2 (312) for the 'movie viewing' play culture has three affiliated stores (affiliate 1 (3121), affiliated store 2 (3122), affiliated store 3 (3123) associated with a certain service) Is stored in association. As in the embodiment of FIG. 3, three
In addition, referring to FIG. 3, there are two events (event 1 (31221) and event 2 (31222)) that can be enjoyed at merchant 2 (3122), and the actual movie name for the action movie corresponds to event 1 (31221). Event 2 (31222) corresponds to the actual movie name for the melodramatic movie. In this regard, the action movie view or horror movie view may be one play unit or a sub-play unit of play unit 2 312 called 'movie view'.
As described above, data of information about schedules, scenarios, play units, merchants, and events may be stored in the
Meanwhile, as described above with reference to FIG. 2, the recommendation
4 is a diagram for exemplarily describing a recommendation schedule according to an embodiment of the present invention.
FIG. 4 is a diagram schematically illustrating that the recommendation
As shown in FIG. 3, it is assumed that the information on the schedule type included in the basic input information input by the requestor corresponds to the schedule type 1 31, and the schedule type scenario according to the scenario 1 310 is a scenario. 2 320 and scenario 3 330, scenario 1 310 includes three
In addition, if the basic input information entered when the requester requests the schedule service includes information on the time, companion and schedule type of "1 pm to 9 pm", "girlfriend" and "date", recommendation
On the other hand, it is assumed that the position of the three-pole (theater C) 3123 of the affiliated store is far from the position of the affiliated store in the play unit 1 311 or the newly added play unit 4 410. Assume that information about the affiliate store location of 3 (theater C) 3123 is pre-stored in the
On the other hand, it is assumed that the user information about the companion confirmed from the basic input information input by the requestor can be confirmed in the
In this case, referring to FIG. 4, 'movie name for action movie' (event 1) 312121 that can be enjoyed at merchant 2 (theater B) 3122, that is, the screened movie, is deleted, By selecting only the movie name '(Event 2) 3222 2, scenario 1 310, which is a candidate scenario, may be modified to generate a recommendation schedule.
Meanwhile, as shown in FIG. 4, when providing a recommendation schedule to the requester, information such as booking a movie ticket and outputting a coupon at a merchant may be sent. In addition, the display control information for confirming the location of the affiliated shop in the recommendation schedule may be transmitted together.
5 is a flowchart illustrating a schedule service providing method provided by the
Referring to FIG. 5, the method for providing a schedule service by the
The basic input information mentioned above may include information about time, date, companion and schedule type.
The schedule generation reference information mentioned above may include one or more of user information, affiliate store related information, local distance information, common sense information, and cost information.
The step S504 of generating a recommendation schedule may include: a first step of selecting one or more scenarios from among previously stored scenarios of the schedule type as candidate scenarios based on one or more of basic input information and schedule generation reference information; And a second step of generating a recommendation schedule using the selected candidate scenario based on at least one of the basic input information and schedule generation reference information.
Based on at least one of the basic input information and schedule generation reference information, the second step of generating a recommendation schedule using the selected candidate scenario may include selecting a candidate scenario selected based on at least one of the basic input information and schedule generation reference information. The revised candidate scenario is generated as the recommended schedule.
The above description is merely illustrative of the technical idea of the present invention, and those skilled in the art to which the present invention pertains may make various modifications and changes without departing from the essential characteristics of the present invention. Therefore, the embodiments disclosed in the present invention are not intended to limit the technical idea of the present invention but to describe the present invention, and the scope of the technical idea of the present invention is not limited by these embodiments. The scope of protection of the present invention should be interpreted by the following claims, and all technical ideas within the scope equivalent thereto should be construed as being included in the scope of the present invention.
1 is a view for schematically explaining a schedule service according to an embodiment of the present invention;
2 is a block diagram of a schedule service system according to an embodiment of the present invention;
3 is a diagram for exemplarily describing a scenario for each schedule type according to an embodiment of the present invention;
4 is a diagram for exemplarily describing a recommendation schedule according to an embodiment of the present invention;
5 is a flowchart illustrating a schedule service providing method according to an embodiment of the present invention.
<Description of Symbols for Main Parts of Drawings>
100: scheduling service system 110: database
120: terminal 130: transmission system
210: scenario information management unit 220: schedule generation reference information management unit
230: basic input information input unit 240: recommendation schedule generation unit
250: recommended schedule provider 260: optional schedule management unit
Claims (24)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
KR1020080067403A KR20100007006A (en) | 2008-07-11 | 2008-07-11 | Method and system for recommending schedule |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
KR1020080067403A KR20100007006A (en) | 2008-07-11 | 2008-07-11 | Method and system for recommending schedule |
Publications (1)
Publication Number | Publication Date |
---|---|
KR20100007006A true KR20100007006A (en) | 2010-01-22 |
Family
ID=41816058
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
KR1020080067403A KR20100007006A (en) | 2008-07-11 | 2008-07-11 | Method and system for recommending schedule |
Country Status (1)
Country | Link |
---|---|
KR (1) | KR20100007006A (en) |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR101421599B1 (en) * | 2012-09-12 | 2014-07-22 | 아주대학교산학협력단 | Method and apparatus for providing a schedule to user |
WO2014120583A2 (en) * | 2013-01-31 | 2014-08-07 | Microsoft Corporation | Activity graphs |
KR101507077B1 (en) * | 2013-05-06 | 2015-04-02 | 주식회사 스마트미디어테크 | Intelligent guide system based on user`s location |
WO2016186261A1 (en) * | 2015-05-20 | 2016-11-24 | 주식회사 코노랩스 | Method, system, and non-transitory computer-readable recording medium for providing notification of schedule |
US10007897B2 (en) | 2013-05-20 | 2018-06-26 | Microsoft Technology Licensing, Llc | Auto-calendaring |
KR20200135036A (en) * | 2019-05-24 | 2020-12-02 | 서울시립대학교 산학협력단 | Apparatus and method for evaluating |
-
2008
- 2008-07-11 KR KR1020080067403A patent/KR20100007006A/en not_active Application Discontinuation
Cited By (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR101421599B1 (en) * | 2012-09-12 | 2014-07-22 | 아주대학교산학협력단 | Method and apparatus for providing a schedule to user |
WO2014120583A2 (en) * | 2013-01-31 | 2014-08-07 | Microsoft Corporation | Activity graphs |
WO2014120583A3 (en) * | 2013-01-31 | 2014-10-23 | Microsoft Corporation | Activity graphs |
US10237361B2 (en) | 2013-01-31 | 2019-03-19 | Microsoft Technology Licensing, Llc | Activity graphs |
KR101507077B1 (en) * | 2013-05-06 | 2015-04-02 | 주식회사 스마트미디어테크 | Intelligent guide system based on user`s location |
US10007897B2 (en) | 2013-05-20 | 2018-06-26 | Microsoft Technology Licensing, Llc | Auto-calendaring |
WO2016186261A1 (en) * | 2015-05-20 | 2016-11-24 | 주식회사 코노랩스 | Method, system, and non-transitory computer-readable recording medium for providing notification of schedule |
KR20200135036A (en) * | 2019-05-24 | 2020-12-02 | 서울시립대학교 산학협력단 | Apparatus and method for evaluating |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US11100527B2 (en) | Verification of redemption of an electronic offer | |
US20210243275A1 (en) | Method and system for docketing | |
US20160343037A1 (en) | Method and system for the creating, managing, and delivering of enhanced feed formatted content | |
US8359206B2 (en) | Web based interactive meeting facility | |
TWI519972B (en) | System and method for improved mapping and routing | |
US8620735B2 (en) | Location calendar targeted advertisements | |
US20080126476A1 (en) | Method and System for the Creating, Managing, and Delivery of Enhanced Feed Formatted Content | |
US20180172458A1 (en) | Travel planning system, travel planning method, and program | |
US20090132665A1 (en) | Method and system for communicating invitations and responses to an event with a mobile device | |
US20070043766A1 (en) | Method and System for the Creating, Managing, and Delivery of Feed Formatted Content | |
US20110289142A1 (en) | Web-Based Interactive Meeting Event Facility | |
US20110289433A1 (en) | Web-Based Interactive Meeting Facility with Recommendations to Users | |
US20100030743A1 (en) | Automated method for re-attracting job seekers to job match site at more opportune times | |
KR20100007006A (en) | Method and system for recommending schedule | |
US20050228677A1 (en) | Scheduling events for an itinerary using agents | |
JP7301108B2 (en) | INFORMATION NOTIFICATION DEVICE, INFORMATION NOTIFICATION METHOD AND PROGRAM | |
US20170206554A1 (en) | Centralized system of aggregated data sources and methods of use | |
JP2016071741A (en) | Server system, program, and information recommendation method | |
US20090055513A1 (en) | Method and system for communicating carpool information | |
Hujić et al. | Marketing in tourism-direct marketing as marketing communications technology | |
Burgess et al. | A model of ICDT internet flows on mobile devices for the travel and tourism consumer | |
JP4506215B2 (en) | Information system, schedule generation device, and schedule generation method | |
US20140025776A1 (en) | General-purpose framework for delivering custom, location-based data to mobile clients | |
JP7158660B2 (en) | Information processing device, information processing method, and program | |
KR20170080009A (en) | Travel information service system for foreigners who visited korea |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
A201 | Request for examination | ||
E902 | Notification of reason for refusal | ||
E601 | Decision to refuse application |