IP Library Granted Patent US 12,355,919
Granted Patent B2
US 12,355,919 · App. 18/666,310 · Granted Jul 8, 2025

Techniques for data matching in a contact center system

Inventor: Zia Chishti (Washington, DC)
Assignee: Afiniti AI Limited
H04M3/5232G06F16/2365G06F16/27G06Q10/06311G06Q10/06315G06Q30/01H04M2203/551H04M2203/556H04M2203/558
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 12,355,919
App. No.
18/666,310
Granted
Jul 8, 2025
Kind
B2
Abstract

Techniques for data matching in a contact center system are disclosed. In one particular embodiment, the techniques may be realized as a method for data matching in a contact center system comprising determining, by at least one computer processor communicatively coupled to and configured to operate in the contact center system, an interaction event time associated with a historical contact interaction; determining, by the at least one computer processor, an outcome event time associated with a historical contact interaction outcome; analyzing, by the at least one computer processor, the interaction event time and the outcome event time to determine a correlation; and matching, by the at least one computer processor, the historical contact interaction with the historical contact interaction outcome based on the correlation.

Claims (53)

1. A method for data matching in a contact center system comprising:

receiving, at a data matching module communicatively coupled to at least one switch of the contact center system and configured to perform data matching operations in the contact center system, a first set of data comprising historical contact interactions from a contact interaction database, wherein the contact interaction database is communicatively coupled to the data matching module;

receiving, at the data matching module, a second set of data comprising historical contact interaction outcomes from an outcome database, wherein the outcome database is communicatively coupled to the data matching module;

determining, by the data matching module, a first matching criteria based at least in part on a first set of characteristics associated with the historical contact interactions in the first set of data and a second set of characteristics associated with the historical contact interaction outcomes in the second set of data;

matching, by the data matching module, a first historical contact interaction in the first set of data with a second historical contact interaction outcome in the second set of data based at least in part on the first matching criteria;

identifying, by the data matching module, at least one error in the match of the first historical contact interaction in the first set of data and the second historical contact interaction outcome in the second set of data;

determining, by the data matching module, a second matching criteria based at least in part on a third set of characteristics associated with the historical contact interactions in the first set of data and a fourth set of characteristics associated with the historical contact interaction outcomes in the second set of data; and

matching, by the data matching module, a third historical contact interaction in the first set of data with a fourth historical contact interaction outcome in the second set of data based at least in part on the second matching criteria.

2. The method of claim 1 , wherein the first set of characteristics comprises one or more of: an interaction start time, an interaction end time, a caller identifier, and an agent identifier.

3. The method of claim 2 , wherein the second set of characteristics comprises one or more of: an interaction outcome time, an interaction outcome type, an interaction outcome amount, a caller identifier, and an agent identifier.

4. The method of claim 1 , further comprising:

determining, by the data matching module, a probability that the matching of the third historical contact interaction with the fourth historical contact interaction outcome is accurate.

5. The method of claim 1 , further comprising:

determining, by the data matching module, a pairing strategy for the contact center system based at least in part on the matching of the third historical contact interaction with the fourth historical contact interaction outcome.

6. The method of claim 5 , wherein determining a pairing strategy comprises determining a contact-agent pairing model based on the matching of the third historical contact interaction with the fourth historical contact interaction outcome for optimizing contact-agent pairings in the contact center system.

7. The method of claim 5 , further comprising:

establishing a connection between an agent and a contact based on the pairing strategy in the at least one switch of the contact center system.

8. A system for data matching in a contact center system comprising:

at least one computer processor in a data matching module communicatively coupled to at least one switch of the contact center system and configured to perform data matching operations in the contact center system, wherein the at least one computer processor is further configured to:

receive a first set of data comprising historical contact interactions from a contact interaction database, wherein the contact interaction database is communicatively coupled to the data matching module;

receive a second set of data comprising historical contact interaction outcomes from an outcome database, wherein the outcome database is communicatively coupled to the data matching module;

determine a first matching criteria based at least in part on a first set of characteristics associated with the historical contact interactions in the first set of data and a second set of characteristics associated with the historical contact interaction outcomes in the second set of data;

match a first historical contact interaction in the first set of data with a second historical contact interaction outcome in the second set of data based at least in part on the first matching criteria;

identify at least one error in the match of the first historical contact interaction in the first set of data and the second historical contact interaction outcome in the second set of data;

determine a second matching criteria based at least in part on a third set of characteristics associated with the historical contact interactions in the first set of data and a fourth set of characteristics associated with the historical contact interaction outcomes in the second set of data; and

match a third historical contact interaction in the first set of data with a fourth historical contact interaction outcome in the second set of data based at least in part on the second matching criteria.

9. The system of claim 8 , wherein the first set of characteristics comprises one or more of: an interaction start time, an interaction end time, a caller identifier, and an agent identifier.

10. The system of claim 9 , wherein the second set of characteristics comprises one or more of: an interaction outcome time, an interaction outcome type, an interaction outcome amount, a caller identifier, and an agent identifier.

11. The system of claim 8 , wherein the at least one computer processor is further configured to:

determine a probability that the matching of the third historical contact interaction with the fourth historical contact interaction outcome is accurate.

12. The system of claim 8 , wherein the at least one computer processor is further configured to:

determine a pairing strategy for the contact center system based at least in part on the matching of the third historical contact interaction with the fourth historical contact interaction outcome.

13. The system of claim 12 , wherein determining a pairing strategy comprises determining a contact-agent pairing model based on the matching of the third historical contact interaction with the fourth historical contact interaction outcome for optimizing contact-agent pairings in the contact center system.

14. The system of claim 12 , wherein the at least one computer processor is further configured to:

establish a connection between an agent and a contact based on the pairing strategy in the at least one switch of the contact center system.

15. An article of manufacture for data matching in a contact center system comprising:

a non-transitory processor readable medium; and

instructions stored on the medium;

wherein the instructions are configured to be readable from the medium by at least one computer processor in a data matching module communicatively coupled to at least one switch of the contact center system and configured to perform data matching operations in the contact center system and thereby cause the at least one computer processor to operate so as to:

receive a first set of data comprising historical contact interactions from a contact interaction database, wherein the contact interaction database is communicatively coupled to the data matching module;

receive a second set of data comprising historical contact interaction outcomes from an outcome database, wherein the outcome database is communicatively coupled to the data matching module;

determine a first matching criteria based at least in part on a first set of characteristics associated with the historical contact interactions in the first set of data and a second set of characteristics associated with the historical contact interaction outcomes in the second set of data;

match a first historical contact interaction in the first set of data with a second historical contact interaction outcome in the second set of data based at least in part on the first matching criteria;

identify at least one error in the match of the first historical contact interaction in the first set of data and the second historical contact interaction outcome in the second set of data;

determine a second matching criteria based at least in part on a third set of characteristics associated with the historical contact interactions in the first set of data and a fourth set of characteristics associated with the historical contact interaction outcomes in the second set of data; and

match a third historical contact interaction in the first set of data with a fourth historical contact interaction outcome in the second set of data based at least in part on the second matching criteria.

16. The article of manufacture of claim 15 , wherein the first set of characteristics comprises one or more of: an interaction start time, an interaction end time, a caller identifier, and an agent identifier.

17. The article of manufacture of claim 16 , wherein the second set of characteristics comprises one or more of: an interaction outcome time, an interaction outcome type, an interaction outcome amount, a caller identifier, and an agent identifier.

18. The article of manufacture of claim 15 , wherein the at least one computer processor is further caused to operate so as to:

determine a probability that the matching of the third historical contact interaction with the fourth historical contact interaction outcome is accurate.

19. The article of manufacture of claim 15 , wherein the at least one computer processor is further caused to operate so as to:

determine a pairing strategy for the contact center system based at least in part on the matching of the third historical contact interaction with the fourth historical contact interaction outcome.

20. The article of manufacture of claim 19 , wherein determining a pairing strategy comprises determining a contact-agent pairing model based on the matching of the third historical contact interaction with the fourth historical contact interaction outcome for optimizing contact-agent pairings in the contact center system.

Assignments (8)
RELEASE AND TERMINATION OF PATENT SECURITY AGREEMENT Recorded Apr 16, 2025
From: VCP CAPITAL MARKETS, LLC
To: AFINITI, LTD.
Reel/Frame 070866/0614 →
PATENT ASSIGNMENT AGREEMENT Recorded Jan 3, 2025
From: AFINITI, LTD.
To: AFINITI AI HOLDINGS LLC
Reel/Frame 069816/0656 →
PATENT SECURITY AGREEMENT Recorded Jan 3, 2025
From: AFINITI AI LIMITED
To: ALTER DOMUS (US) LLC
Reel/Frame 069816/0858 →
PATENT ASSIGNMENT AGREEMENT Recorded Jan 3, 2025
From: AFINITI AI HOLDINGS LLC
To: AFINITI AI LIMITED
Reel/Frame 069817/0001 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 11, 2024
From: CHISHTI, ZIA
To: AFINITI, LTD.
Reel/Frame 068557/0207 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 11, 2024
From: AFINITI, LTD.
To: AFINITI EUROPE TECHNOLOGIES LIMITED
Reel/Frame 068557/0566 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 11, 2024
From: AFINITI EUROPE TECHNOLOGIES LIMITED
To: AFINITI, LTD.
Reel/Frame 068557/0745 →
PATENT SECURITY AGREEMENT Recorded Aug 26, 2024
From: AFINITI, LTD.
To: VCP CAPITAL MARKETS, LLC
Reel/Frame 068793/0261 →
Continuity (4)
Continuation 18351914 · Jul 13, 2023
Continuation 17845692 · Jun 21, 2022
Continuation 15826093 · Nov 29, 2017
Related Publication 20240305717A1 · Sep 12, 2024
References Cited (389)
US 5155763A · Bigus et al. · 1992 [cited by applicant]
US 5206903A · Kohler et al. · 1993 [cited by applicant]
US 5327490A · Cave · 1994 [cited by applicant]
US 5537470A · Lee · 1996 [cited by applicant]
US 5702253A · Bryce et al. · 1997 [cited by applicant]
US 5825869A · Brooks et al. · 1998 [cited by applicant]
US 5903641A · Tonisson · 1999 [cited by applicant]
US 5907601A · David et al. · 1999 [cited by applicant]
US 5926538A · Deryugin et al. · 1999 [cited by applicant]
US 6049603A · Schwartz et al. · 2000 [cited by applicant]
US 6052460A · Fisher et al. · 2000 [cited by applicant]
US 6064731A · Flockhart et al. · 2000 [cited by applicant]
US 6088444A · Walker et al. · 2000 [cited by applicant]
US 6163607A · Bogart et al. · 2000 [cited by applicant]
US 6222919B1 · Hollatz et al. · 2001 [cited by applicant]
US 6252946B1 · Glowny et al. · 2001 [cited by applicant]
US 6292555B1 · Okamoto · 2001 [cited by applicant]
US 6324282B1 · McIllwaine et al. · 2001 [cited by applicant]
US 6333979B1 · Bondi et al. · 2001 [cited by applicant]
US 6389132B1 · Price · 2002 [cited by applicant]
US 6389400B1 · Bushey et al. · 2002 [cited by applicant]
US 6408066B1 · Andruska et al. · 2002 [cited by applicant]
US 6411687B1 · Bohacek et al. · 2002 [cited by applicant]
US 6424709B1 · Doyle et al. · 2002 [cited by applicant]
US 6434230B1 · Gabriel · 2002 [cited by applicant]
US 6496580B1 · Chack · 2002 [cited by applicant]
US 6504920B1 · Okon et al. · 2003 [cited by applicant]
US 6519335B1 · Bushnell · 2003 [cited by applicant]
US 6535600B1 · Fisher et al. · 2003 [cited by applicant]
US 6535601B1 · Flockhart et al. · 2003 [cited by applicant]
US 6570980B1 · Baruch · 2003 [cited by applicant]
US 6587556B1 · Judkins et al. · 2003 [cited by applicant]
US 6603854B1 · Judkins et al. · 2003 [cited by applicant]
US 6639976B1 · Shellum et al. · 2003 [cited by applicant]
US 6661889B1 · Flockhart et al. · 2003 [cited by applicant]
US 6704410B1 · McFarlane et al. · 2004 [cited by applicant]
US 6707904B1 · Judkins et al. · 2004 [cited by applicant]
US 6714643B1 · Gargeya et al. · 2004 [cited by applicant]
US 6744878B1 · Komissarchik et al. · 2004 [cited by applicant]
US 6763104B1 · Judkins et al. · 2004 [cited by applicant]
US 6774932B1 · Ewing et al. · 2004 [cited by applicant]
US 6775378B1 · Villena et al. · 2004 [cited by applicant]
US 6798876B1 · Bala · 2004 [cited by applicant]
US 6829348B1 · Schroeder et al. · 2004 [cited by applicant]
US 6832203B1 · Villena et al. · 2004 [cited by applicant]
US 6859529B2 · Duncan et al. · 2005 [cited by applicant]
US 6922466B1 · Peterson et al. · 2005 [cited by applicant]
US 6937715B2 · Delaney · 2005 [cited by applicant]
US 6956941B1 · Duncan et al. · 2005 [cited by applicant]
US 6970554B1 · Peterson et al. · 2005 [cited by applicant]
US 6970821B1 · Shambaugh et al. · 2005 [cited by applicant]
US 6978006B1 · Polcyn · 2005 [cited by applicant]
US 7023979B1 · Wu et al. · 2006 [cited by applicant]
US 7039166B1 · Peterson et al. · 2006 [cited by applicant]
US 7050566B2 · Becerra et al. · 2006 [cited by applicant]
US 7050567B1 · Jensen · 2006 [cited by applicant]
US 7062031B2 · Becerra et al. · 2006 [cited by applicant]
US 7068775B1 · Lee · 2006 [cited by applicant]
US 7092509B1 · Mears et al. · 2006 [cited by applicant]
US 7103172B2 · Brown et al. · 2006 [cited by applicant]
US 7158628B2 · McConnell et al. · 2007 [cited by applicant]
US 7184540B2 · Dezonno et al. · 2007 [cited by applicant]
US 7209549B2 · Reynolds et al. · 2007 [cited by applicant]
US 7231032B2 · Nevman et al. · 2007 [cited by applicant]
US 7231034B1 · Rikhy et al. · 2007 [cited by applicant]
US 7236584B2 · Torba · 2007 [cited by applicant]
US 7245716B2 · Brown et al. · 2007 [cited by applicant]
US 7245719B2 · Kawada et al. · 2007 [cited by applicant]
US 7266251B2 · Rowe · 2007 [cited by applicant]
US 7269253B1 · Wu et al. · 2007 [cited by applicant]
US 7353388B1 · Gilman et al. · 2008 [cited by applicant]
US 7398224B2 · Cooper · 2008 [cited by applicant]
US 7593521B2 · Becerra et al. · 2009 [cited by applicant]
US 7676034B1 · Wu et al. · 2010 [cited by applicant]
US 7725339B1 · Aykin · 2010 [cited by applicant]
US 7734032B1 · Kiefhaber et al. · 2010 [cited by applicant]
US 7798876B2 · Mix · 2010 [cited by applicant]
US 7826597B2 · Berner et al. · 2010 [cited by applicant]
US 7864944B2 · Khouri et al. · 2011 [cited by applicant]
US 7899177B1 · Bruening et al. · 2011 [cited by applicant]
US 7916858B1 · Heller et al. · 2011 [cited by applicant]
US 7940917B2 · Lauridsen et al. · 2011 [cited by applicant]
US 7961866B1 · Boutcher et al. · 2011 [cited by applicant]
US 7995717B2 · Conway et al. · 2011 [cited by applicant]
US 8000989B1 · Kiefhaber et al. · 2011 [cited by applicant]
US 8010607B2 · McCormack et al. · 2011 [cited by applicant]
US 8094790B2 · Conway et al. · 2012 [cited by applicant]
US 8126133B1 · Everingham et al. · 2012 [cited by applicant]
US 8140441B2 · Cases et al. · 2012 [cited by applicant]
US 8175253B2 · Knott et al. · 2012 [cited by applicant]
US 8229102B2 · Knott et al. · 2012 [cited by applicant]
US 8249245B2 · Jay et al. · 2012 [cited by applicant]
US 8295471B2 · Spottiswoode et al. · 2012 [cited by applicant]
US 8300797B1 · Benesh et al. · 2012 [cited by applicant]
US 8300798B1 · Wu et al. · 2012 [cited by applicant]
US 8359219B2 · Chishti et al. · 2013 [cited by applicant]
US 8433597B2 · Chishti et al. · 2013 [cited by applicant]
US 8438089B1 · Wasserblat et al. · 2013 [cited by applicant]
US 8472611B2 · Chishti · 2013 [cited by applicant]
US 8565410B2 · Chishti et al. · 2013 [cited by applicant]
US 8634542B2 · Spottiswoode et al. · 2014 [cited by applicant]
US 8644490B2 · Stewart · 2014 [cited by applicant]
US 8670548B2 · Xie et al. · 2014 [cited by applicant]
US 8699694B2 · Chishti et al. · 2014 [cited by applicant]
US 8712821B2 · Spottiswoode · 2014 [cited by applicant]
US 8718271B2 · Spottiswoode · 2014 [cited by applicant]
US 8724797B2 · Chishti et al. · 2014 [cited by applicant]
US 8731178B2 · Chishti et al. · 2014 [cited by applicant]
US 8737595B2 · Chishti et al. · 2014 [cited by applicant]
US 8750488B2 · Spottiswoode et al. · 2014 [cited by applicant]
US 8761380B2 · Kohler et al. · 2014 [cited by applicant]
US 8781100B2 · Spottiswoode et al. · 2014 [cited by applicant]
US 8781106B2 · Afzal · 2014 [cited by applicant]
US 8787532B1 · Adam · 2014 [cited by applicant]
US 8792630B2 · Chishti et al. · 2014 [cited by applicant]
US 8824658B2 · Chishti · 2014 [cited by applicant]
US 8831207B1 · Agarwal · 2014 [cited by applicant]
US 8879715B2 · Spottiswoode et al. · 2014 [cited by applicant]
US 8903079B2 · Xie et al. · 2014 [cited by applicant]
US 8913736B2 · Kohler et al. · 2014 [cited by applicant]
US 8929537B2 · Chishti et al. · 2015 [cited by applicant]
US 8938063B1 · Hackbarth et al. · 2015 [cited by applicant]
US 8995647B2 · Li et al. · 2015 [cited by applicant]
US 9020137B2 · Chishti et al. · 2015 [cited by applicant]
US 9025757B2 · Spottiswoode et al. · 2015 [cited by applicant]
US 9129290B2 · Kannan et al. · 2015 [cited by applicant]
US 9215323B2 · Chishti · 2015 [cited by applicant]
US 9277055B2 · Spottiswoode et al. · 2016 [cited by applicant]
US 9300802B1 · Chishti · 2016 [cited by applicant]
US 9426296B2 · Chishti et al. · 2016 [cited by applicant]
US 9596344B2 · Lum et al. · 2017 [cited by applicant]
US 9692899B1 · Rizvi · 2017 [cited by applicant]
US 9712676B1 · Chishti · 2017 [cited by applicant]
US 9712679B2 · Chishti et al. · 2017 [cited by applicant]
US 9936066B1 · Mammen · 2018 [cited by examiner]
US 10171671B1 · Prasad et al. · 2019 [cited by applicant]
US 10237405B1 · Neuer, III · 2019 [cited by examiner]
US 20010032120A1 · Stuart et al. · 2001 [cited by applicant]
US 20020018554A1 · Jensen et al. · 2002 [cited by applicant]
US 20020046030A1 · Haritsa et al. · 2002 [cited by applicant]
US 20020059164A1 · Shtivelman · 2002 [cited by applicant]
US 20020067821A1 · Benson et al. · 2002 [cited by applicant]
US 20020082736A1 · Lech et al. · 2002 [cited by applicant]
US 20020110234A1 · Walker et al. · 2002 [cited by applicant]
US 20020111172A1 · DeWolf et al. · 2002 [cited by applicant]
US 20020120548A1 · Etkin · 2002 [cited by applicant]
US 20020131399A1 · Philonenko · 2002 [cited by applicant]
US 20020138285A1 · DeCotiis et al. · 2002 [cited by applicant]
US 20020143599A1 · Nourbakhsh et al. · 2002 [cited by applicant]
US 20020161765A1 · Kundrot et al. · 2002 [cited by applicant]
US 20020184069A1 · Kosiba et al. · 2002 [cited by applicant]
US 20020196845A1 · Richards et al. · 2002 [cited by applicant]
US 20030002653A1 · Uckun · 2003 [cited by applicant]
US 20030081757A1 · Mengshoel et al. · 2003 [cited by applicant]
US 20030095652A1 · Mengshoel et al. · 2003 [cited by applicant]
US 20030169870A1 · Stanford · 2003 [cited by applicant]
US 20030174830A1 · Boyer et al. · 2003 [cited by applicant]
US 20030182135A1 · Sone · 2003 [cited by applicant]
US 20030217016A1 · Pericle · 2003 [cited by applicant]
US 20040028211A1 · Culp et al. · 2004 [cited by applicant]
US 20040057416A1 · McCormack · 2004 [cited by applicant]
US 20040096050A1 · Das et al. · 2004 [cited by applicant]
US 20040098274A1 · Dezonno et al. · 2004 [cited by applicant]
US 20040101127A1 · Dezonno et al. · 2004 [cited by applicant]
US 20040109555A1 · Williams · 2004 [cited by applicant]
US 20040133434A1 · Szlam et al. · 2004 [cited by applicant]
US 20040210475A1 · Starnes et al. · 2004 [cited by applicant]
US 20040230438A1 · Pasquale et al. · 2004 [cited by applicant]
US 20040267816A1 · Russek · 2004 [cited by applicant]
US 20050013428A1 · Walters · 2005 [cited by applicant]
US 20050043986A1 · McConnell et al. · 2005 [cited by applicant]
US 20050047581A1 · Shaffer et al. · 2005 [cited by applicant]
US 20050047582A1 · Shaffer et al. · 2005 [cited by applicant]
US 20050071223A1 · Jain et al. · 2005 [cited by applicant]
US 20050129212A1 · Parker · 2005 [cited by applicant]
US 20050135593A1 · Becerra et al. · 2005 [cited by applicant]
US 20050135596A1 · Zhao · 2005 [cited by applicant]
US 20050187802A1 · Koeppel · 2005 [cited by applicant]
US 20050195960A1 · Shaffer et al. · 2005 [cited by applicant]
US 20050286709A1 · Horton et al. · 2005 [cited by applicant]
US 20050287983A1 · Armanio et al. · 2005 [cited by applicant]
US 20060089837A1 · Adar · 2006 [cited by examiner]
US 20060098803A1 · Bushey et al. · 2006 [cited by applicant]
US 20060110052A1 · Finlayson · 2006 [cited by applicant]
US 20060124113A1 · Roberts · 2006 [cited by applicant]
US 20060184040A1 · Keller et al. · 2006 [cited by applicant]
US 20060222164A1 · Contractor et al. · 2006 [cited by applicant]
US 20060233346A1 · McIlwaine et al. · 2006 [cited by applicant]
US 20060262918A1 · Karnalkar et al. · 2006 [cited by applicant]
US 20060262922A1 · Margulies et al. · 2006 [cited by applicant]
US 20070036323A1 · Travis · 2007 [cited by applicant]
US 20070071222A1 · Flockhart et al. · 2007 [cited by applicant]
US 20070116240A1 · Foley et al. · 2007 [cited by applicant]
US 20070121602A1 · Sin et al. · 2007 [cited by applicant]
US 20070121829A1 · Tal et al. · 2007 [cited by applicant]
US 20070136342A1 · Singhai et al. · 2007 [cited by applicant]
US 20070154007A1 · Bernhard · 2007 [cited by applicant]
US 20070174111A1 · Anderson et al. · 2007 [cited by applicant]
US 20070198322A1 · Bourne et al. · 2007 [cited by applicant]
US 20070214191A1 · Chandrasekaran · 2007 [cited by applicant]
US 20070219816A1 · Van Luchene et al. · 2007 [cited by applicant]
US 20070274502A1 · Brown · 2007 [cited by applicant]
US 20080002823A1 · Fama et al. · 2008 [cited by applicant]
US 20080008309A1 · Dezonno et al. · 2008 [cited by applicant]
US 20080046386A1 · Pieraccinii et al. · 2008 [cited by applicant]
US 20080065476A1 · Klein et al. · 2008 [cited by applicant]
US 20080095355A1 · Mahalaha · 2008 [cited by examiner]
US 20080118052A1 · Houmaidi et al. · 2008 [cited by applicant]
US 20080144803A1 · Jaiswal et al. · 2008 [cited by applicant]
US 20080144804A1 · Mergen · 2008 [cited by applicant]
US 20080152122A1 · Idan et al. · 2008 [cited by applicant]
US 20080162580A1 · Ben Harush · 2008 [cited by applicant]
US 20080181389A1 · Bourne et al. · 2008 [cited by applicant]
US 20080199000A1 · Su et al. · 2008 [cited by applicant]
US 20080205611A1 · Jordan et al. · 2008 [cited by applicant]
US 20080267386A1 · Cooper · 2008 [cited by applicant]
US 20080273687A1 · Knott et al. · 2008 [cited by applicant]
US 20090043670A1 · Johansson et al. · 2009 [cited by applicant]
US 20090086933A1 · Patel et al. · 2009 [cited by applicant]
US 20090113242A1 · Miller et al. · 2009 [cited by applicant]
US 20090190740A1 · Chishti et al. · 2009 [cited by applicant]
US 20090190743A1 · Spottiswoode · 2009 [cited by applicant]
US 20090190744A1 · Xie et al. · 2009 [cited by applicant]
US 20090190745A1 · Xie et al. · 2009 [cited by applicant]
US 20090190746A1 · Chishti et al. · 2009 [cited by applicant]
US 20090190747A1 · Spottiswoode · 2009 [cited by applicant]
US 20090190748A1 · Chishti et al. · 2009 [cited by applicant]
US 20090190749A1 · Xie et al. · 2009 [cited by applicant]
US 20090190750A1 · Xie et al. · 2009 [cited by applicant]
US 20090232294A1 · Xie et al. · 2009 [cited by applicant]
US 20090234710A1 · Belgaied Hassine et al. · 2009 [cited by applicant]
US 20090245493A1 · Chen et al. · 2009 [cited by applicant]
US 20090304172A1 · Becerra et al. · 2009 [cited by applicant]
US 20090318111A1 · Desai et al. · 2009 [cited by applicant]
US 20090323921A1 · Spottiswoode et al. · 2009 [cited by applicant]
US 20100020959A1 · Spottiswoode · 2010 [cited by applicant]
US 20100020961A1 · Spottiswoode · 2010 [cited by applicant]
US 20100054431A1 · Jaiswal et al. · 2010 [cited by applicant]
US 20100054452A1 · Afzal · 2010 [cited by applicant]
US 20100054453A1 · Stewart · 2010 [cited by applicant]
US 20100086120A1 · Brussat et al. · 2010 [cited by applicant]
US 20100111285A1 · Chishti · 2010 [cited by applicant]
US 20100111286A1 · Chishti · 2010 [cited by applicant]
US 20100111287A1 · Xie et al. · 2010 [cited by applicant]
US 20100111288A1 · Afzal et al. · 2010 [cited by applicant]
US 20100142698A1 · Spottiswoode et al. · 2010 [cited by applicant]
US 20100158238A1 · Saushkin · 2010 [cited by applicant]
US 20100161315A1 · Melamed · 2010 [cited by examiner]
US 20100183138A1 · Spottiswoode et al. · 2010 [cited by applicant]
US 20110022357A1 · Vock et al. · 2011 [cited by applicant]
US 20110031112A1 · Birang et al. · 2011 [cited by applicant]
US 20110044447A1 · Morris et al. · 2011 [cited by applicant]
US 20110069821A1 · Korolev et al. · 2011 [cited by applicant]
US 20110125048A1 · Causevic et al. · 2011 [cited by applicant]
US 20110184905A1 · Phillips · 2011 [cited by examiner]
US 20120051536A1 · Chishti et al. · 2012 [cited by applicant]
US 20120051537A1 · Chishti et al. · 2012 [cited by applicant]
US 20120224680A1 · Spottiswoode et al. · 2012 [cited by applicant]
US 20120237016A1 · Hegde et al. · 2012 [cited by applicant]
US 20120278136A1 · Flockhart et al. · 2012 [cited by applicant]
US 20130003959A1 · Nishikawa et al. · 2013 [cited by applicant]
US 20130144816A1 · Smith · 2013 [cited by examiner]
US 20130251137A1 · Chishti et al. · 2013 [cited by applicant]
US 20130287202A1 · Flockhart et al. · 2013 [cited by applicant]
US 20130294588A1 · Burger et al. · 2013 [cited by applicant]
US 20140044246A1 · Klemm et al. · 2014 [cited by applicant]
US 20140079210A1 · Kohler et al. · 2014 [cited by applicant]
US 20140119531A1 · Tuchman et al. · 2014 [cited by applicant]
US 20140119533A1 · Spottiswoode et al. · 2014 [cited by applicant]
US 20140140494A1 · Zhakov · 2014 [cited by applicant]
US 20140143018A1 · Nies et al. · 2014 [cited by applicant]
US 20140161241A1 · Baranovsky et al. · 2014 [cited by applicant]
US 20140173078A1 · McCord · 2014 [cited by examiner]
US 20140201225A1 · Deshmukh et al. · 2014 [cited by applicant]
US 20140341370A1 · Li et al. · 2014 [cited by applicant]
US 20150032746A1 · Lev-Tov · 2015 [cited by examiner]
US 20150055772A1 · Klemm et al. · 2015 [cited by applicant]
US 20150189078A1 · Sittin et al. · 2015 [cited by applicant]
US 20150271330A1 · Erel et al. · 2015 [cited by applicant]
US 20150281448A1 · Putra et al. · 2015 [cited by applicant]
US 20150287402A1 · Okabe · 2015 [cited by examiner]
US 20160028758A1 · Ellis · 2016 [cited by examiner]
US 20160080573A1 · Chishti · 2016 [cited by applicant]
US 20160171100A1 · Fujita et al. · 2016 [cited by applicant]
US 20170011302A1 · Heckman et al. · 2017 [cited by applicant]
US 20170013131A1 · Craib · 2017 [cited by applicant]
US 20170026515A1 · Bernstein et al. · 2017 [cited by applicant]
US 20170064081A1 · Chishti et al. · 2017 [cited by applicant]
US 20170134577A1 · Wold · 2017 [cited by applicant]
US 20170208176A1 · Chishti · 2017 [cited by applicant]
US 20170272571A1 · Spiessback et al. · 2017 [cited by applicant]
US 20170316438A1 · Konig et al. · 2017 [cited by applicant]
US 20170344963A1 · Bryars · 2017 [cited by examiner]
US 20180005152A1 · Carter · 2018 [cited by applicant]
US 20180165688A1 · Ismail · 2018 [cited by examiner]
AU 2008349500C1 · 2014 [cited by applicant]
AU 2009209317B2 · 2014 [cited by applicant]
AU 2009311534B2 · 2014 [cited by applicant]
CN 101159730A · 2008 [cited by applicant]
CN 101986801A · 2011 [cited by applicant]
CN 102301688B · 2014 [cited by applicant]
CN 102017591B · 2014 [cited by applicant]
CN 104253911A · 2014 [cited by applicant]
CN 106797382A · 2017 [cited by applicant]
CN 106878572A · 2017 [cited by applicant]
CN 107135320A · 2017 [cited by applicant]
EP 0493292A2 · 1992 [cited by applicant]
EP 0949793A1 · 1999 [cited by applicant]
EP 1032188A1 · 2000 [cited by applicant]
EP 1335572A2 · 2003 [cited by applicant]
EP 2338270B1 · 2018 [cited by applicant]
JP 11098252A · 1999 [cited by applicant]
JP 2000069168A · 2000 [cited by applicant]
JP 2000078291A · 2000 [cited by applicant]
JP 2000078292A · 2000 [cited by applicant]
JP 2000092213A · 2000 [cited by applicant]
JP 2000236393A · 2000 [cited by applicant]
JP 2001292236A · 2001 [cited by applicant]
JP 2001518753A · 2001 [cited by applicant]
JP 2002297900A · 2002 [cited by applicant]
JP 3366565B2 · 2003 [cited by applicant]
JP 2003187061A · 2003 [cited by applicant]
JP 2003316944A · 2003 [cited by applicant]
JP 2004056517A · 2004 [cited by applicant]
JP 2004227228A · 2004 [cited by applicant]
JP 2006345132A · 2006 [cited by applicant]
JP 2007324708A · 2007 [cited by applicant]
JP 2009529729A · 2009 [cited by applicant]
JP 2011511533A · 2011 [cited by applicant]
JP 2011511536A · 2011 [cited by applicant]
JP 5421928B2 · 2014 [cited by applicant]
JP 5631326B2 · 2014 [cited by applicant]
JP 5649575B2 · 2015 [cited by applicant]
JP 2015514371A · 2015 [cited by applicant]
MX 316118 · 2013 [cited by applicant]
MX 322251 · 2014 [cited by applicant]
NZ 587100B · 2013 [cited by applicant]
NZ 587101B · 2013 [cited by applicant]
NZ 591486B · 2014 [cited by applicant]
NZ 592781B · 2014 [cited by applicant]
PH 12010501704 · 2014 [cited by applicant]
PH 12010501705 · 2015 [cited by applicant]
WO WO199917517A1 · 1999 [cited by applicant]
WO WO2001063894A2 · 2001 [cited by applicant]
WO WO2006124113A2 · 2006 [cited by applicant]
WO WO2007106331A1 · 2007 [cited by applicant]
WO WO2009097018A1 · 2009 [cited by applicant]
WO WO2009097210A1 · 2009 [cited by applicant]
WO WO2010053701A2 · 2010 [cited by applicant]
WO WO2011081514A1 · 2011 [cited by applicant]
Afiniti, “Afiniti® Enterprise Behavioral Pairing™ Improves Contact Center Performance,” White Paper, retrieved online from URL: <http://www.afinitit,com/wp-content/uploads/2016/04/Afiniti_White-Paper_Web-Email.pdf> 11 p… [cited by applicant]
Anonymous, “Performance Based Routing in Profit Call Centers,” The Decision Makers' Direct, located at www.decisioncraft.com, Issue Jun. 2002, (3 pages). [cited by applicant]
Canadian Office Action issued in Canadian Patent Application No. 2713526, dated Oct. 25, 2016, 7 pages. [cited by applicant]
Cleveland, William S., “Robust Locally Weighted Regression and Smoothing Scatterplots,” Journal of the American Statistical Association, vol. 74, No. 368, Dec. 1979, pp. 829-836 (8 pages). [cited by applicant]
European Extended Search Report issued by the European Patent Office for European Patent Application No. 18202932.2 dated Nov. 22, 2018, (8 pages). [cited by applicant]
Extended European Search Report issued by the European Patent Office for European Patent Application No. 17154781.3 dated May 4, 2017, (7 pages). [cited by applicant]
Extended European Search Report issued by the European Patent Office for European Patent Application No. 17171761.4 dated Aug. 30, 2017, (8 pages). [cited by applicant]
Gans, N. et al., “Telephone Call Centers: Tutorial, Review and Research Prospects,” Manufacturing & Service Operations Management, vol. 5, No. 2, 2003, pp. 79-141, (84 pages). [cited by applicant]
International Preliminary Report on Patentability issued in connection with PCT Application No. PCT/US2009/066254 mailed Jun. 14, 2011 (6 pages). [cited by applicant]
International Search Report and Written Opinion issued by the European Patent Office as International Searching Authority for International Application No. PCT/IB2016/001762 dated Feb. 20, 2017 (15 pages). [cited by applicant]
International Search Report and Written Opinion issued by the European Patent Office as International Searching Authority for International Application No. PCT/IB2016/001776 dated Mar. 3, 2017 (16 pages). [cited by applicant]
International Search Report and Written Opinion issued by the European Patent Office as International Searching Authority for International Application No. PCT/IB2017/000570 dated Jun. 30, 2017 (13 pages). [cited by applicant]
International Search Report issued in connection with International Application No. PCT/US13/33268 mailed May 31, 2013 (2 pages). [cited by applicant]
International Search Report issued in connection with PCT Application No. PCT/US/2009/054352 mailed Mar. 12, 2010, 5 pages. [cited by applicant]
International Search Report issued in connection with PCT Application No. PCT/US2008/077042 mailed Mar. 13, 2009 (3 pages). [cited by applicant]
International Search Report issued in connection with PCT Application No. PCT/US2009/031611 mailed Jun. 3, 2009 (5 pages). [cited by applicant]
International Search Report issued in connection with PCT Application No. PCT/US2009/066254 mailed Feb. 24, 2010 (4 pages). [cited by applicant]
International Search Report issued in connection with PCT/US2009/061537 mailed Jun. 7, 2010 (5 pages). [cited by applicant]
International Search Report issued in connection with PCT/US2013/033261 mailed Jun. 14, 2013 (3 pages). [cited by applicant]
International Search Report issued in connection with PCT/US2013/33265 mailed Jul. 9, 2013 (2 pages). [cited by applicant]
Japanese Office Action issued by the Japan Patent Office for Application No. 2015-503396 dated Jun. 29, 2016 (7 pages). [cited by applicant]
Japanese Office Action issued by the Japanese Patent Office for Japanese Application No. 2016-159338 dated Oct. 11, 2017 (12 pages). [cited by applicant]
Japanese Office Action issued by the Japanese Patent Office for Japanese Application No. 2016-189126 dated Oct. 19, 2017 (24 pages). [cited by applicant]
Koole, G. (2004). “Performance Analysis and Optimization in Customer Contact Centers,” Proceedings of the Quantitative Evaluation of Systems, First International Conference, Sep. 27-30, 2004 (4 pages). [cited by applicant]
Koole, G et al. (Mar. 6, 2006). “An Overview of Routing and Staffing Algorithms in Multi-Skill Customer Contact Centers,” Manuscript, 42 pages. [cited by applicant]
Ntzoufras, “Bayesian Modeling Using Winbugs”. Wiley Interscience, Chapter 5, Normal Regression Models, Oct. 18, 2007, Redacted version, pp. 155-220 (67 pages). [cited by applicant]
Press, W. H. and Rybicki, G. B., “Fast Algorithm for Spectral Analysis of Unevenly Sampled Data,” The Astrophysical Journal, vol. 338, Mar. 1, 1989, pp. 277-280 (4 pages). [cited by applicant]
Riedmiller, M et al. (1993). “A Direct Adaptive Method for Faster Back Propagation Learning: The RPROP Algorithm,” 1993 IEEE International Conference on Neural Networks, San Francisco, CA, Mar. 28-Apr. 1, 1993, 1:586-59… [cited by applicant]
Stanley et al., “Improving call center operations using performance-based routing strategies,” Calif. Journal of Operations Management, 6(1), 24-32, Feb. 2008; retrieved from http://userwww.sfsu.edu/saltzman/Publist.htm… [cited by applicant]
Subsequent Substantive Examination Report issued in connection with Philippines Application No. 1-2010-501705 mailed Jul. 14, 2014 (1 page). [cited by applicant]
Substantive Examination Report issued in connection with Philippines Application No. 1/2011/500868 dated May 2, 2014 (1 page). [cited by applicant]
Written Opinion of the International Searching Authority issued in connection with International Application No. PCT/US13/33268 mailed May 31, 2013, 7 pages. [cited by applicant]
Written Opinion of the International Searching Authority issued in connection with PCT Application No. PCT/US/2009/054352 mailed Mar. 12, 2010, 5 pages. [cited by applicant]
Written Opinion of the International Searching Authority issued in connection with PCT Application No. PCT/US2008/077042 mailed Mar. 13, 2009, 6 pages. [cited by applicant]
Written Opinion of the International Searching Authority issued in connection with PCT Application No. PCT/US2009/031611 mailed Jun. 3, 2009, 7 pages. [cited by applicant]
Written Opinion of the International Searching Authority issued in connection with PCT Application No. PCT/US2009/066254 mailed Feb. 24, 2010, 5 pages. [cited by applicant]
Written Opinion of the International Searching Authority issued in connection with PCT/US2009/061537 mailed Jun. 7, 2010, 10 pages. [cited by applicant]
Written Opinion of the International Searching Authority issued in connection with PCT/US2013/033261 mailed Jun. 14, 2013, 7 pages. [cited by applicant]
Written Opinion of the International Searching Authority issued in connection with PCT/US2013/33265 mailed Jul. 9, 2013, 7 pages. [cited by applicant]