U.S. patent application number 12/176021 was filed with the patent office on 2010-01-21 for event scheduling forecasting for a calendaring system using historically collected event data.
This patent application is currently assigned to INTERNATIONAL BUSINESS MACHINES CORPORATION. Invention is credited to AI CHAKRA, SIDDHARTH P. DESAI, ZACHARY J. H. MARLOW, TEJASWINI R. PATIL.
Application Number | 20100017216 12/176021 |
Document ID | / |
Family ID | 41531079 |
Filed Date | 2010-01-21 |
United States Patent
Application |
20100017216 |
Kind Code |
A1 |
CHAKRA; AI ; et al. |
January 21, 2010 |
EVENT SCHEDULING FORECASTING FOR A CALENDARING SYSTEM USING
HISTORICALLY COLLECTED EVENT DATA
Abstract
The present invention discloses a solution for event scheduling
forecasting for a calendaring system using historically collected
event data. In the solution, metrics collected from historic events
can be utilized to compute event duration for scheduled and events
being scheduled. Metrics such as number of attendees, quantity of
topics being covered, and meeting duration can be collected.
Metrics can be aggregated from one or more systems including, but
not limited to, calendaring systems and presentation systems. A
forecasting engine can utilize metrics to compute a duration for
events which can be used to advise event coordinators, adjust
scheduled event times, and notify of potential schedule
conflicts.
Inventors: |
CHAKRA; AI; (APEX, NC)
; DESAI; SIDDHARTH P.; (VIRGINIA BEACH, VA) ;
MARLOW; ZACHARY J. H.; (RALEIGH, NC) ; PATIL;
TEJASWINI R.; (RALEIGH, NC) |
Correspondence
Address: |
PATENTS ON DEMAND, P.A. IBM-RSW
4581 WESTON ROAD, SUITE 345
WESTON
FL
33331
US
|
Assignee: |
INTERNATIONAL BUSINESS MACHINES
CORPORATION
ARMONK
NY
|
Family ID: |
41531079 |
Appl. No.: |
12/176021 |
Filed: |
July 18, 2008 |
Current U.S.
Class: |
705/1.1 |
Current CPC
Class: |
G06Q 10/063116 20130101;
G06Q 10/1093 20130101; G06Q 10/10 20130101; G06Q 10/1095 20130101;
G06Q 10/06314 20130101; G06Q 10/06311 20130101 |
Class at
Publication: |
705/1 |
International
Class: |
G06Q 99/00 20060101
G06Q099/00 |
Claims
1. A method for forecasting event duration comprising: collecting
event metrics of historical events automatically from at least one
of plurality of sources; identifying an event in a calendaring
system and an associated time duration to be forecasted; computing
a time duration approximation for the identified event based on the
collected event metrics; and automatically performing at least one
programmatic action driven by the computed duration for identified
event.
2. The method of claim 1, wherein the collected event metrics are
manually inputted.
3. The method of claim 1, wherein historical metrics is collected
from at least one of a calendar system and a presentation
system.
4. The method of claim 1, wherein the computed approximate duration
is computed for an event to be planned.
5. The method of claim 1, wherein the computed approximate duration
is compared to the duration of a scheduled event, wherein the
comparison results in at least one programmatic action being
performed.
6. The method of claim 5, wherein the programmatic action is a one
of a notification being presented and a modification of the
duration of the scheduled event.
7. The method of claim 1, wherein the computed approximate duration
is compared to an event to be scheduled, wherein the comparison
results in at least one programmatic action being performed,
wherein the programmatic action is at least one notification being
presented.
8. A system for forecasting event duration comprising: a history
manager configured to receive historic event metrics; and a
forecasting engine able to compute at least one time duration for
an event associated with a calendaring system, wherein the
forecasting engine is configured to interact with a calendaring
system to perform one of optimizing scheduled calendar events and
to automatically provide suggestions to users of the calendaring
systems based upon durations computed by the forecasting
engine.
9. The system of claim 8, wherein the history manager is linked to
said calendaring system and automatically acquires duration
information regarding events of the calendaring system.
10. The system of claim 8, wherein the forecasting engine computes
a time duration associated with at least one of a scheduled event
and an event to be scheduled.
11. The system of claim 8, wherein the forecasting system is
accessible from at least one of a uniform resource identifier (URI)
addressable location and a Web service.
12. A computer program product for forecasting event duration
comprising: a computer usable medium having computer usable program
code embodied therewith, the computer usable program code
comprising: computer usable program code configured to collect
event metrics of historical events automatically from at least one
of plurality of sources; computer usable program code configured to
identify an event in a calendaring system and an associated time
duration to be forecasted; computer usable program code configured
to compute a time duration approximation for the identified event
based on the collected event metrics; and computer usable program
code configured to automatically perform at least one programmatic
action driven by the computed duration for identified event.
13. The computer program product of claim 12, wherein the collected
event metrics are manually inputted.
14. The computer program product of claim 12, wherein historical
metrics is collected from at least one of a calendar system and a
presentation system.
15. The computer program product of claim 12, wherein the computed
approximate duration is computed for an event to be planned.
16. The computer program product of claim 12, wherein the computed
approximate duration is compared to the duration of a scheduled
event, wherein the comparison results in at least one programmatic
action being performed, wherein the programmatic action is a one of
a notification being presented.
17. The computer program product of claim 12, wherein the computed
approximate duration is compared to an event to be scheduled,
wherein the comparison results in at least one programmatic action
being performed, wherein the programmatic action is at least one of
a notification being presented.
Description
BACKGROUND OF THE INVENTION
[0001] The present invention relates to the field of collaborative
calendaring systems and, more particularly, to event scheduling
forecasting for a calendaring system using historically collected
event data.
[0002] Accurately allotting time for events (e.g., meetings,
presentations, etc.) can often be a difficult task. Such factors
can include number of attendees, quantity of topics being covered,
and event location availability. A common tactic coordinators
employ is to use "round numbers" such as hours and half-hours to
schedule events. However, when a coordinator schedules too much or
too little time for an event, event participants are adversely
affected. For instance, when a meeting lasts longer than scheduled
time, the meeting can conflict with participant's subsequently
planned events. When events terminate early, attendees are often
left waiting for another scheduled event to begin. During this
time, attendees are typically not very productive because their
work is affected by a subsequently scheduled events or they a left
with a short period of time which proves difficult to accomplish
tasks within.
[0003] One approach that is used to overcome these scheduling
problems is to synchronize events based on attendee scheduling
preferences. While this method is useful, it still relies on
coordinators and attendees to set preferences and make estimates
which are used as inputs to calculate the duration of events. Since
coordinators and attendees regularly make imprecise estimates, this
method also suffers from major drawbacks. At present, there are no
ideal solutions for overcoming these scheduling
challenges/obstacles.
BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS
[0004] FIG. 1 is a schematic diagram illustrating a set of
scenarios for utilizing a forecasted event duration to plan
schedule events in accordance with an embodiment of the inventive
arrangements disclosed herein.
[0005] FIG. 2 is a schematic diagram illustrating a system where a
set of collected event metrics is employed in the forecasting of an
event duration in accordance with an embodiment of the inventive
arrangements disclosed herein.
[0006] FIG. 3 is a schematic diagram illustrating a system for
performing event duration forecasting in accordance with an
embodiment of the inventive arrangements disclosed herein.
[0007] FIG. 4 is a schematic diagram illustrating a calendaring
interface with event duration forecasting capabilities in
accordance with an embodiment of the inventive arrangements
disclosed herein.
DETAILED DESCRIPTION OF THE INVENTION
[0008] The present invention discloses a solution for event
duration forecasting for a calendaring system using historically
collected event data. In the solution, metrics collected from
historic events can be utilized to compute an event duration for a
scheduled event. Metrics such as number of attendees, quantity of
topics being covered, and meeting duration can be collected.
Metrics can be aggregated from one or more systems including, but
not limited to, calendaring systems and presentation systems. A
forecasting engine can utilize metrics to compute a duration for
events which can be used to advise event coordinators, adjust
scheduled event times, and notify of potential schedule
conflicts.
[0009] The present invention may be embodied as a method, system,
or computer program product. Accordingly, the present invention may
take the form of an entirely hardware embodiment, an entirely
software embodiment (including firmware, resident software,
micro-code, etc.) or an embodiment combining software and hardware
aspects that may all generally be referred to herein as a
"circuit," "module" or "system." Furthermore, the present invention
may take the form of a computer program product on a
computer-usable storage medium having computer-usable program code
embodied in the medium. In a preferred embodiment, the invention is
implemented in software, which includes but is not limited to
firmware, resident software, microcode, etc.
[0010] Furthermore, the invention can take the form of a computer
program product accessible from a computer-usable or
computer-readable medium providing program code for use by or in
connection with a computer or any instruction execution system. For
the purposes of this description, a computer-usable or computer
readable medium can be any apparatus that can contain, store,
communicate, propagate, or transport the program for use by or in
connection with the instruction execution system, apparatus, or
device. The computer-usable medium may include a propagated data
signal with the computer-usable program code embodied therewith,
either in baseband or as part of a carrier wave. The computer
usable program code may be transmitted using any appropriate
medium, including but not limited to the Internet, wireline,
optical fiber cable, RF, etc.
[0011] Any suitable computer usable or computer readable medium may
be utilized. The computer-usable or computer-readable medium may
be, for example but not limited to, an electronic, magnetic,
optical, electromagnetic, infrared, or semiconductor system,
apparatus, device, or propagation medium. Examples of a
computer-readable medium include a semiconductor or solid state
memory, magnetic tape, a removable computer diskette, a random
access memory (RAM), a read-only memory (ROM), an erasable
programmable read-only memory (EPROM or Flash memory, a rigid
magnetic disk and an optical disk. Current examples of optical
disks include compact disk-read only memory (CD-ROM), compact
disk-read/write (CD-R/W) and DVD. Other computer-readable medium
can include a transmission media, such as those supporting the
Internet, an intranet, a personal area network (PAN), or a magnetic
storage device. Transmission media can include an electrical
connection having one or more wires, an optical fiber, an optical
storage device, and a defined segment of the electromagnet spectrum
through which digitally encoded content is wirelessly conveyed
using a carrier wave.
[0012] Note that the computer-usable or computer-readable medium
can even include paper or another suitable medium upon which the
program is printed, as the program can be electronically captured,
via, for instance, optical scanning of the paper or other medium,
then compiled, interpreted, or otherwise processed in a suitable
manner, if necessary, and then stored in a computer memory.
[0013] Computer program code for carrying out operations of the
present invention may be written in an object oriented programming
language such as Java, Smalltalk, C++ or the like. However, the
computer program code for carrying out operations of the present
invention may also be written in 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 a local area network (LAN)
or a wide area network (WAN), or the connection may be made to an
external computer (for example, through the Internet using an
Internet Service Provider).
[0014] A data processing system suitable for storing and/or
executing program code will include at least one processor coupled
directly or indirectly to memory elements through a system bus. The
memory elements can include local memory employed during actual
execution of the program code, bulk storage, and cache memories
which provide temporary storage of at least some program code in
order to reduce the number of times code must be retrieved from
bulk storage during execution.
[0015] Input/output or I/O devices (including but not limited to
keyboards, displays, pointing devices, etc.) can be coupled to the
system either directly or through intervening I/O controllers.
[0016] Network adapters may also be coupled to the system to enable
the data processing system to become coupled to other data
processing systems or remote printers or storage devices through
intervening private or public networks. Modems, cable modem and
Ethernet cards are just a few of the currently available types of
network adapters.
[0017] The present invention is described below with reference to
flowchart illustrations and/or block diagrams of methods, apparatus
(systems) and computer program products according to embodiments of
the invention. It will be understood that each block of the
flowchart illustrations and/or block diagrams, and combinations of
blocks in the flowchart illustrations and/or block diagrams, can be
implemented by computer 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.
[0018] These computer program instructions may also be stored in a
computer-readable memory that can direct a computer or other
programmable data processing apparatus to function in a particular
manner, such that the instructions stored in the computer-readable
memory produce an article of manufacture including instruction
means which implement the function/act specified in the flowchart
and/or block diagram block or blocks.
[0019] The computer program instructions may also be loaded onto a
computer or other programmable data processing apparatus to cause a
series of operational steps to be performed on the computer or
other programmable apparatus to produce a computer implemented
process such that the instructions which execute on the computer or
other programmable apparatus provide steps for implementing the
functions/acts specified in the flowchart and/or block diagram
block or blocks.
[0020] FIG. 1 is a schematic diagram illustrating a set of
scenarios 110-150 for utilizing a forecasted event duration to plan
schedule events in accordance with an embodiment of the inventive
arrangements disclosed herein. In scenarios 110-150, coordinators
112-152 can be assisted in event scheduling by event duration
forecasting. Calendar interface 114-154 can present dialogs 120-160
which enable event forecasting capabilities to be presented to
coordinators 112-152. Based on user entered data in dialog 120, an
appropriate event history for determining an event duration can be
identified. For instance, based on title and location information,
historic metrics from "progress meetings" can be used to estimate
event duration. Forecasted duration represents a best-fit
estimation for the duration of an event based on historic
metrics.
[0021] In scenario 110, an event being planned by coordinator 112
can be forecasted based on historically collected event metrics.
Utilizing artifact 122 coordinator can be presented with an
estimated time duration 126 for the event being considered. The
coordinator can choose to use the computed event duration to create
the new event. Alternatively, based on information 124 presented,
coordinator 112 can attempt to manually determine the duration for
the event being planned.
[0022] In scenario 130, coordinator 132 can be notified of
potential duration issues associated with an event being created. A
computed duration 142 can be compared against a duration 146
established by coordinator 132. Based on the result of the
comparison, a notification 144 can be presented in interface 134.
For instance, when duration 142 is greater than user selected
duration 146, a notification can alert the coordinator 132 that the
event duration can exceed the user selected duration 146.
[0023] In scenario 150, computed event duration can be used to aid
a calendar user 152 in handling potential scheduling conflicts.
User 152 accepting an event using dialog 160 can be alerted of a
potential conflict with a previously scheduled event 156.
Explicitly established times for the events may not actually
conflict, which could preclude acceptance, but forecasted times
(e.g., anticipated time overruns based upon forecaster estimated
durations) can indicate likely problems with being able to attend
all scheduled meetings. The notification 162 can alert user 152 of
a forecaster predicted problem.
[0024] Scenarios 110-150 are for illustrative purposes only and
should not be construed to limit the invention in any regard.
Interface dialogs 120-160 are for demonstrative purposes and do not
reflect the only contemplated embodiment. Interface 114-154 can
include, but is not limited to, a graphical user interface (GUI), a
voice user interface (VUI), a multi-modal interface, and the
like.
[0025] FIG. 2 is a schematic diagram illustrating a system 200
where a set of collected events metrics is employed in the
forecasting of an event duration in accordance with an embodiment
of the inventive arrangements disclosed herein. In system 200, past
events metrics 218 can be used to generate a duration forecast for
an event. Planning server 220 can utilize metrics 218 in
association with scheduling data 232 to compute a duration for a
given event.
[0026] As used herein, past events 205 can include any historic
event wherein metrics can be obtained. Events 205 can include, but
is not limited to, meetings, interviews, open discussions,
conventions, and the like. In past events 205, presenter 212 can be
a set or subset of participants 214. Event forecast 226 can include
a start and end time, duration, and a start time and duration.
[0027] During past events 205, presentation device 210 can collect
metrics 218 which can be conveyed and stored in data store 222.
Metrics 218 can be collected through interface 216 such as the
number of participants 214, the time each presenter 212 utilizes
for the event, topic information, the length of the event, and the
like. For instance, interface 216 can record the time spent on each
slide of a slideshow presentation for an event. Further, individual
metrics can be tracked for each participant, which can be used in
part to compute an aggregate duration based on individual
metrics.
[0028] Planning server 220 can be a hardware/software component
able to compute a time duration for one or more events. Server can
include components such as history manager 222 and forecasting
engine 224. Computed event forecasts 226 can be stored in data
store which can be conveyed to a requesting system for
processing.
[0029] History manager 222 can process metrics 218 and enable users
to access past event metrics 218. Manager 222 can be configured to
process and present relevant metrics to forecasting engine 224
during the forecast process. Verification of metrics can be
performed by manager 222 to ensure that metric anomalies do not
completely bias event 205 metrics. Additionally, manager 222 can
allow users to search and/or browse historic metrics 218. For
instance, a user can audit previous event durations to adjust
forecast accuracy.
[0030] Forecasting engine 224 can calculate an estimated duration
for an event based on one or more metrics 218. In one embodiment,
engine 224 can be used to model new events based on specific types
of past events 205. For instance, users can establish product
review meetings as a model which specific metrics can be matched
against to form a blueprint for future events. Engine 224 can
heuristically determine durations for events based on agenda
information associated with events. Further, engine 224 can be
utilized data 232 to determine location availability to evade
conflicts for forecasted events.
[0031] Weighting factors 225 can affect how metrics are applied to
forecasting. For instance, past meeting lengths can be allowed to
affect forecasting results more significantly than the number of
attendees. Alternatively, participants who historically utilize a
significant portion of event time can be used to skew event
durations when they are shown to be a participant for the event.
Weighting factors 225 can be influenced in part by user preferences
established in system 230.
[0032] FIG. 3 is a schematic diagram illustrating a system 300 for
performing event duration forecasting in accordance with an
embodiment of the inventive arrangements disclosed herein. In
system 300, event metrics 342 collected from a presentation system
340 can be conveyed via network 350 to a planning server 320.
Planning server 320 can provide a request/response mechanism to
enable event forecasting capabilities in a calendaring system 330.
Users of calendar system 330 can be presented with a forecasted
event duration which can be comprised in result 360.
[0033] Presentation system 340 can be a hardware/software component
capable of visually and/or aurally presenting content to one or
more participants. System 340 can include, slide projectors,
presentation software (e.g., slideshow programs), teleconferencing
software, videoconferencing software, and the like. Presentation
system 340 can utilize technologies to collect metrics 342 such as
biometrics, presence detection, voice recognition, face
recognition, and the like. For instance, a presenter of a meeting
can be identified and his "floor time" recorded for use in future
forecasting.
[0034] Users of calendar system 330 can receive forecast duration
for desired events. System 330 can request a one or more duration
forecasts for one or more events. For instance, users can choose to
"optimize" their events for a busy day. Additionally, requests for
alternative start and duration times can be requested based on user
preference, conflict schedules with other participants, and other
extenuating factors.
[0035] Planning server 320 can use stored historical event metrics
329 in association with scheduling data 332 to produce forecast
result 360. In one embodiment, functionality encapsulated in
planning server 320 can be performed by a Web service. In another
embodiment, server 320 functionality can be present in system
330.
[0036] FIG. 4 is a schematic diagram illustrating a calendaring
interface 410, 420 with event duration forecasting capabilities in
accordance with an embodiment of the inventive arrangements
disclosed herein. In interface 410, 420, a calendaring system can
permit a user to forecast the duration for events. Interface 410,
420 can include one or more interface artifacts 412, 422 associated
with performing event forecasting activities.
[0037] Interface 410 can be a calendar interface 410 associated
with a calendaring application with forecasting capabilities. For
instance, interactive menu buttons 412 can be presented in the
calendar interface 410 to aid a user in creating planned events.
Additionally, presented artifacts 412 can be used to forecast
planned events to verify or improve the accuracy of the duration of
the planned events. Further, artifacts 412 can permit users to
manually input event metrics which can include manual data entry,
file imports, uniform resource identifier (URI) addressable
content, and the like.
[0038] Interface 420 can be an event planning dialog able to help
users plan events more accurately by providing a forecasted
duration for the event. Interface 420 can allow the user to select
start and end times for a planned events with an option to use a
forecasted duration for the event. For instance, interactive button
424 can invoke a forecast calculation for the event based on user
entered data. The user can optionally override user entered time
and duration by selecting the appropriate interface artifact.
[0039] Interfaces 410-420 are for illustrative purposes only and
should not be construed to limit the invention in any regard.
Interface 410-420 can include, but is not limited to, a graphical
user interface (GUI), a voice user interface (VUI), a multi-modal
interface, and the like.
[0040] The diagrams in FIGS. 1-4 illustrate the architecture,
functionality, and operation of possible implementations of
systems, methods, and computer program products according to
various embodiments of the present invention. In this regard, each
block in the flowchart or block diagrams may represent a module,
segment, or portion of code, which comprises one or more executable
instructions for implementing the specified logical function(s). It
should also be noted that, in some alternative implementations, the
functions noted in the block may occur out of the order noted in
the figures. For example, two blocks shown in succession may, in
fact, be executed substantially concurrently, or the blocks may
sometimes be executed in the reverse order, depending upon the
functionality involved. It will also be noted that each block of
the block diagrams and/or flowchart illustration, and combinations
of blocks in the block diagrams and/or flowchart illustration, can
be implemented by special purpose hardware-based systems that
perform the specified functions or acts, or combinations of special
purpose hardware and computer instructions.
[0041] The terminology used herein is for the purpose of describing
particular embodiments only and is not intended to be limiting of
the invention. As used herein, the singular forms "a," "an," and
"the" are intended to include the plural forms as well, unless the
context clearly indicates otherwise. It will be further understood
that the terms "comprises" and/or "comprising," when used in this
specification, specify the presence of stated features, integers,
steps, operations, elements, and/or components, but do not preclude
the presence or addition of one or more other features, integers,
steps, operations, elements, components, and/or groups thereof.
[0042] The corresponding structures, materials, acts, and
equivalents of all means or step plus function elements in the
claims below are intended to include any structure, material, or
act for performing the function in combination with other claimed
elements as specifically claimed. The description of the present
invention has been presented for purposes of illustration and
description, but is not intended to be exhaustive or limited to the
invention in the form disclosed. Many modifications and variations
will be apparent to those of ordinary skill in the art without
departing from the scope and spirit of the invention. The
embodiment was chosen and described in order to best explain the
principles of the invention and the practical application, and to
enable others of ordinary skill in the art to understand the
invention for various embodiments with various modifications as are
suited to the particular use contemplated.
* * * * *