Method and apparatus for demographic-based reminders
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
G06F-007/00
G06F-017/30
H04L-029/08
G06Q-010/06
G06Q-010/10
출원번호
US-0618648
(2012-09-14)
등록번호
US-9407707
(2016-08-02)
발명자
/ 주소
Chhatrapati, Rupesh
Treitel, Richard J.
Chester, Jon
Sobotka, David
Lao, Louis
Zaeske, Andrew
Vengadasubbu, Meera
출원인 / 주소
FACEBOOK, INC.
대리인 / 주소
Keller Jolley Preece
인용정보
피인용 횟수 :
0인용 특허 :
57
초록▼
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 w
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.
대표청구항▼
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 r
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; andproviding 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; andprovide 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; andassigning 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; andat 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; andprovide 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.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (57)
North Vaughn W. ; Johnson Kent R. ; Garrett G. O'Brien, Advertising device and method for use at point of sale.
Spielman, Brenda Gates; Dodrill, Lewis Dean; Joshi, Satish; Parasu, Nagendran; Lockwood, Robert James, Arrangement for common-format notification delivery messages based on notification device type in an IP-based notification architecture.
Milewski Allen E. ; Smith Thomas M., Communications system and method of operation for electronic messaging using structured response objects and virtual ma.
Reed Drummond Shattuck ; Heymann Peter Earnshaw ; Mushero Steven Mark ; Jones Kevin Benard ; Oberlander Jeffrey Todd, Computer-based communication system and method using metadata defining a control-structure.
Flores Fernando ; Bell ; III Chauncey F. ; Flores Pablo A. ; Flores Rodrigo F. ; Icaza Raul Medina-Mora,MXX ; McAfee John A. ; Nunez Manuel Jasso ; Buchler Thomas G. ; White Thomas E. ; Redenbaugh Ru, Computerized method and system for managing business processes using linked workflows.
Crandall Richard L. (Ann Arbor MI) Lieffers Dorothy A. (Ann Arbor MI) Beyer Thomas P. (Ann Arbor MI) Hansknecht Paul E. (Northville MI) Eschman James K. (Ann Arbor MI), Creating reminder messages/screens, during execution and without ending current display process, for automatically signa.
Allen David ; Smiga Brian ; Rabbani Danny ; Buchheim Dennis ; Mann Tony ; Hagan Thomas ; Joaquin James, Information organization and collaboration tool for processing notes and action requests in computer systems.
Allen,David; Smiga,Brian; Rabbani,Danny; Buchheim,Dennis; Mann,Tony; Hagan,Thomas; Joaquin,James, Information organization and collaboration tool for processing notes and action requests in computer systems.
Crookham, Joe P.; Rivera, Antonio; Foster, Michael B.; Marsh, Ryan A.; Tippett, Walter R.; Cooley, Patrick K., Means and apparatus for control of remote electrical devices.
Smiga Brian ; Buchheim Dennis ; Hagan Thomas ; Wadhwani David ; Storkel Norman Scott, Method and apparatus for group action processing between users of a collaboration system.
LeMole Suzanne L. ; Nurenberg Steven Howard ; O'Neil Joseph Thomas ; Stuntebeck Peter H., Method and system for presenting customized advertising to a user on the world wide web.
Filepp Robert (Springfield NJ) Gordon Michael L. (Dobbs Ferry NJ) Bidwell Alexander W. (New York NY) Wolf Allan M. (Ridgefield CT) Young Francis C. (Pearl River NY) Tiemann Duane (Ossining NY) Applem, Method for storing data in an interactive computer network.
Adler Micah A. ; Gibbons Phillip B. ; Matias Yossi, System and method for scheduling and controlling delivery of advertising in a communications network.
Schloss Robert Jeffrey (Briarcliff Manor NY) Tetzlaff Linda Sue (Mt. Kisco NY), System and method for scheduling linked events with fixed and dynamic conditions.
Bodnar Eric O. ; Lee Jennifer J. ; Kahn Philippe R. ; Feague Roy W. ; Jorgensen David E. ; Liu Gwoho H., User interface methodology supporting light data entry for microprocessor device having limited user input.
Bodnar Eric O. ; Lee Jennifer J. ; Kahn Philippe R. ; Feague Roy W. ; Jorgensen David E. ; Liu Gwoho H., User interface methodology supporting light data entry for microprocessor device having limited user input.
Bodnar Eric O. ; Lee Jennifer J. ; Kahn Philippe R. ; Feague Roy W. ; Jorgensen David E. ; Liu Gwoho H., User interface methodology supporting light data entry for microprocessor device having limited user input.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.