IP Library Granted Patent US 9,407,707
Granted Patent B2
US 9,407,707 · App. 13/618,648 · Granted Aug 2, 2016

Method and apparatus for demographic-based reminders

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 9,407,707
App. No.
13/618,648
Granted
Aug 2, 2016
Kind
B2
Abstract

An electronic calendar includes such features as recurring reminders, dividing unpredictable work loads into equal pieces, template free parsing, a reminders scheduling algorithm to reduce spikes, dynamic delivery and recovery algorithms, methods for splitting the work load between controllers and workers and for monitoring progress, all within the context of a calendar architecture for a large enterprise.

Claims (36)

1. A method comprising:

collecting information regarding a plurality of reminders associated with a plurality of calendar events, wherein the plurality of reminders have a related delivery time;

determining, by at least one processor, an inferred user intent associated with each of the plurality of reminders;

based on the inferred user intent associated with each of the plurality of reminders, clustering, by the at least one processor, the plurality of reminders into a plurality of priority classes; and

providing the plurality of reminders in clusters in accordance with the plurality of priority classes.

2. The method of claim 1 , further comprising determining the inferred user intent associated with each of the plurality of reminders based on a lead time associated with each of the plurality of reminders.

3. The method of claim 2 , wherein the lead time associated with each of the plurality of reminders comprises an amount of time between a time a corresponding event occurs and a time a reminder is to be sent.

4. The method of claim 3 , wherein clustering the plurality of reminders into a plurality of priority classes comprises clustering reminders associated with similar lead times into a common priority class.

5. The method of claim 3 , wherein clustering the plurality of reminders into a plurality of priority classes comprises assigning reminders associated with relatively shorter lead times to a higher priority class than reminders associated with relatively longer lead times.

6. The method of claim 1 , wherein providing the plurality of reminders in clusters in accordance with the plurality of priority classes comprises spreading delivery of the plurality of reminders out in time.

7. The method of claim 1 , wherein determining the inferred user intent associated with each of the plurality of reminders comprises determining an urgency of each of the plurality of reminders.

8. The method of claim 1 , wherein clustering the plurality of reminders into the plurality of priority classes is further based on a delivery destination associated with each of the plurality of reminders.

9. The method of claim 1 , further comprising assigning a delivery time to each of the plurality reminders in accordance with the plurality of priority classes.

10. The method of claim 9 , further comprising identifying, from a data table of acceptable delivery windows, an acceptable delivery window for each of the plurality of priority classes, and wherein assigning a delivery time to each of the plurality of reminders in accordance with the plurality of priority classes comprises assigning a delivery time within an acceptable delivery window assigned to a corresponding plurality class.

11. The method of claim 1 , further comprising clustering the plurality of reminders into a plurality of priority classes based on a capacity of a corresponding reminder delivery system to prevent delivery of the plurality of reminders from exceeding the capacity of the corresponding reminder delivery system.

12. A non-transitory computer-readable storage medium including a set of instructions that, when executed by at least one processor, cause a computer system to:

collect information regarding a plurality of reminders associated with a plurality of calendar events, wherein the plurality of reminders have a related delivery time;

determine an inferred user intent associated with each of the plurality of reminders;

based on the inferred user intent associated with each of the plurality of reminders, cluster, the plurality of reminders into a plurality of priority classes; and

provide the plurality of reminders in accordance with the plurality of priority classes.

13. The non-transitory computer-readable storage medium of claim 12 , further comprising instructions that, when executed by at least one processor, cause the computer system to determine the inferred user intent associated with each of the plurality of reminders based on a lead time associated with each of the plurality of reminders, wherein the lead time associated with each of the plurality of reminders comprises an amount of time between a time a corresponding event occurs and a time a reminder is to be sent.

14. The non-transitory computer-readable storage medium of claim 13 , wherein clustering the plurality of reminders into a plurality of priority classes comprises:

clustering reminders associated with similar lead times into a common priority class; and

assigning reminders associated with relatively shorter lead times to a higher priority class than reminders associated with relatively longer lead times.

15. The non-transitory computer-readable storage medium of claim 12 , further comprising instructions that, when executed by at least one processor, cause the computer system to provide the plurality of reminders in clusters in accordance with the plurality of priority classes by spreading delivery of the plurality of reminders out in time.

16. The non-transitory computer-readable storage medium of claim 12 , further comprising instructions that, when executed by at least one processor, cause the computer system to provide the plurality of reminders in clusters in accordance with the plurality of priority classes by delivering reminders in a highest priority class of the plurality of priority classes at the related delivery time and delivering reminders in a lowest priority class of the plurality of priority classes before or after the related delivery time.

17. A server device comprising:

at least one processor; and

at least one non-transitory computer-readable storage medium storing instructions thereon that, when executed by the at least one processor, cause the server device to:

collect information regarding a plurality of reminders associated with a plurality of calendar events, wherein the plurality of reminders have a related delivery time;

determine an inferred user intent associated with each of the plurality of reminders;

based on the inferred user intent associated with each of the plurality of reminders, cluster the plurality of reminders into a plurality of priority classes; and

provide the plurality of reminders in clusters in accordance with the plurality of priority classes.

18. The server device of claim 17 , wherein the instructions, when executed by the at least one processor, further cause the server device to determine the inferred user intent associated with each of the plurality of reminders based on a lead time and an urgency associated with each of the plurality of reminders.

19. The server device of claim 17 , wherein the instructions, when executed by the at least one processor, further cause the server device to cluster the plurality of reminders into the plurality of priority classes based further on a delivery destination associated with each of the plurality of reminders.

20. The server device of claim 17 , wherein the instructions, when executed by the at least one processor, further cause the server device to assign a delivery time within an acceptable delivery window to each of the plurality of reminders.

Assignments (5)
CHANGE OF NAME Recorded Dec 20, 2021
From: FACEBOOK, INC.
To: META PLATFORMS, INC.
Reel/Frame 058961/0436 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 19, 2013
From: CHHATRAPATI, RUPESH; TREITEL, RICHARD J.; CHESTER, JON; SOBOTKA, DAVID; LAO, LOUIS; ZAESKE, ANDREW; VENGADASUBBU, MEERA
To: AMERICA ONLINE, INC.
Reel/Frame 030832/0413 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 19, 2013
From: AOL INC.
To: FACEBOOK, INC.
Reel/Frame 030832/0436 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 19, 2013
From: AOL LLC
To: AOL INC.
Reel/Frame 030832/0502 →
CHANGE OF NAME Recorded Jul 19, 2013
From: AMERICA ONLINE, INC.
To: AOL LLC
Reel/Frame 030835/0384 →