IP Library Granted Patent US 12,307,484
Granted Patent B2
US 12,307,484 · App. 17/249,773 · Granted May 20, 2025

Systems and methods for providing transaction affinity information

Inventors: Daniel Alan Jarvis (Alexandria, VA); Lawrence Hutchison Douglas, Jr. (McLean, VA); Jeffrey Carlyle Wieker (Fairfax, VA)
Assignee: Capital One Services, LLC
G06Q30/0255G06F16/288G06F16/9535G06F16/9537G06F16/955G06N5/048G06Q30/0202G06Q30/0224G06Q30/0251G06Q30/0252G06Q30/0631
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,307,484
App. No.
17/249,773
Granted
May 20, 2025
Kind
B2
Abstract

In certain aspects, the disclosed implementations include methods and systems for dynamically generating and providing transaction affinity recommendation data. In certain implementations, the transaction affinity recommendation data may include information that identifies a target merchant and associated merchant promotion data that may be generated based on a dynamic analysis of transaction data corresponding to an account record. The disclosed implementations may determine temporal relationships between pairs of sequential transactions corresponding to the account record, and based on such relationships, may identify pairs of transactions involving separate merchants. The disclosed implementations may determine affinity relationships associated with one or more pairs of the temporally related transactions and a target merchant, and based on such relationships, generate and provide the transaction affinity recommendation data.

Claims (68)

1. A method, comprising:

obtaining, by a device, transaction data associated with one or more transactions associated with an account record;

determining, by the device and during a transaction event, a relationship strength value between a first merchant, associated with a particular transaction of the one or more transactions, and a second merchant,

wherein the relationship strength value is associated with historical merchant affinity data related to historical transactions associated with the first merchant and the second merchant,

wherein the historical merchant affinity data is determined based on determining whether a temporal relationship between a first transaction of the historical transactions and a second transaction of the historical transactions meets a threshold value,

wherein the threshold value is determined based on at least one of merchant density information or location information, and

wherein the first transaction is associated with the first merchant and the second transaction is associated with the second merchant;

determining, by the device and during the transaction event, that the relationship strength value meets a threshold relationship strength value;

generating, by the device, prior to a new transaction event, and based on the relationship strength value meeting the threshold relationship strength value, merchant recommendation data identifying the second merchant; and

transmitting, by the device and to a user device associated with the account record, at least a portion of the merchant recommendation data.

2. The method of claim 1 , wherein the relationship strength value is further based on geographic information associated with the first merchant and the second merchant,

the geographic information indicating a distance between the first merchant and the second merchant.

3. The method of claim 1 , wherein the relationship strength value is further based on a number of hops between the first merchant and the second merchant,

the number of hops indicating intervening merchants historically associated with a chain of transactions between the first merchant and the second merchant.

4. The method of claim 1 , further comprising:

generating a graphical representation of a merchant affinity relationship network,

the graphical representation including data indicating the first merchant, the second merchant, and data associated with the relationship strength value; and

providing the graphical representation for display.

5. The method of claim 1 , wherein the relationship strength value is further based on a prior count of the historical transactions associated with the first merchant and the second merchant,

the prior count of transactions defining a number of prior transactions associated with the first merchant and the second merchant.

6. The method of claim 1 , wherein the user device comprises a merchant device associated with the first merchant.

7. A device, comprising:

one or more memories; and

one or more processors, communicatively coupled to the one or more memories, configured to:

obtain transaction data associated with one or more transactions associated with an account record;

determine, during a transaction event, a relationship strength value between a first merchant, associated with a particular transaction of the one or more transactions, and a second merchant,

wherein the relationship strength value is associated with historical merchant affinity data related to historical transactions associated with the first merchant and the second merchant,

wherein the historical merchant affinity data is determined based on determining a temporal relationship between a first transaction of the historical transactions and a second transaction of the historical transactions meets a threshold value,

wherein the threshold value is determined based on at least one of merchant density information or location information, and

wherein the first transaction is associated with the first merchant and the second transaction is associated with the second merchant;

determine, during the transaction event, that the relationship strength value meets a threshold relationship strength value;

generate, prior to a new transaction event and based on the relationship strength value meeting the threshold relationship strength value, merchant recommendation data identifying the second merchant; and

transmit, to a user device associated with the account record, at least a portion of the merchant recommendation data.

8. The device of claim 7 , wherein the relationship strength value is further based on geographic information associated with the first merchant and the second merchant,

the geographic information indicating a distance between the first merchant and the second merchant.

9. The device of claim 7 , wherein the relationship strength value is further based on a number of hops between the first merchant and the second merchant,

the number of hops indicating intervening merchants historically associated with a chain of transactions between the first merchant and the second merchant.

10. The device of claim 7 , wherein the one or more processors are further configured to:

generate a graphical representation of a merchant affinity relationship network,

the graphical representation including data indicating the first merchant, the second merchant, and data associated with the relationship strength value; and

provide the graphical representation for display.

11. The device of claim 7 , wherein the relationship strength value is further based on a prior count of the historical transactions associated with the first merchant and the second merchant,

the prior count of transactions defining a number of prior transactions associated with the first merchant and the second merchant.

12. The device of claim 7 , wherein the user device comprises a merchant device associated with the first merchant.

13. A non-transitory computer-readable medium storing a set of instructions, the set of instructions comprising:

one or more instructions that, when executed by one or more processors of a device, cause the device to:

obtain transaction data associated with one or more transactions associated with an account record;

determine, during a transaction event, a relationship strength value between a first merchant, associated with a particular transaction of the one or more transactions, and a second merchant,

wherein the relationship strength value is associated with historical merchant affinity data related to historical transactions associated with the first merchant and the second merchant,

wherein the historical merchant affinity data is determined based on determining whether a temporal relationship between a first transaction of the historical transactions and a second transaction of the historical transactions meets a threshold value,

wherein the threshold value is determined based on at least one of merchant density information or location information, and

wherein the first transaction is associated with the first merchant and the second transaction is associated with the second merchant;

determine, during the transaction event, that the relationship strength value meets a threshold relationship strength value;

generate, prior to a new transaction event and based on the relationship strength value meeting the threshold relationship strength value, merchant recommendation data identifying the second merchant; and

transmit, to a user device associated with the account record, at least a portion of the merchant recommendation data.

14. The non-transitory computer-readable medium of claim 13 , wherein the relationship strength value is further based on geographic information associated with the first merchant and the second merchant,

the geographic information indicating a distance between the first merchant and the second merchant.

15. The non-transitory computer-readable medium of claim 13 , wherein the relationship strength value is further based on a number of hops between the first merchant and the second merchant,

the number of hops indicating intervening merchants historically associated with a chain of transactions between the first merchant and the second merchant.

16. The non-transitory computer-readable medium of claim 13 , wherein the one or more instructions further cause the device to:

generate a graphical representation of a merchant affinity relationship network,

the graphical representation including data indicating the first merchant, the second merchant, and data associated with the relationship strength value; and

provide the graphical representation for display.

17. The non-transitory computer-readable medium of claim 13 , wherein the relationship strength value is further based on a prior count of the historical transactions associated with the first merchant and the second merchant,

the prior count of transactions defining a number of prior transactions associated with the first merchant and the second merchant.

18. The method of claim 1 , wherein the first transaction and the second transaction are sequential transactions.

19. The device of claim 7 , wherein the first transaction and the second transaction are sequential transactions.

20. The non-transitory computer-readable medium of claim 13 , wherein the first transaction and the second transaction are sequential transactions.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 12, 2021
From: JARVIS, DANIEL ALAN; DOUGLAS, LAWRENCE HUTCHISON, JR.; WIEKER, JEFFREY CARLYLE
To: CAPITAL ONE SERVICES, LLC
Reel/Frame 055576/0230 →
Continuity (3)
Continuation 16710218 · Dec 11, 2019
Continuation 16006075 · Jun 12, 2018
Related Publication 20210201350A1 · Jul 1, 2021
References Cited (217)
US 5909023A · Ono et al. · 1999 [cited by applicant]
US 6189005B1 · Chakrabarti et al. · 2001 [cited by applicant]
US 6292786B1 · Deaton et al. · 2001 [cited by applicant]
US 6334110B1 · Walter et al. · 2001 [cited by applicant]
US 6430539B1 · Lazarus et al. · 2002 [cited by applicant]
US 7801843B2 · Kumar et al. · 2010 [cited by applicant]
US 8185597B1 · Cumberbatch et al. · 2012 [cited by applicant]
US 8930204B1 · Igoe et al. · 2015 [cited by applicant]
US 9053495B1 · Niu et al. · 2015 [cited by applicant]
US 9087088B1 · Bose et al. · 2015 [cited by applicant]
US 9251168B1 · Tomkins · 2016 [cited by examiner]
US 9311653B1 · Bonalle et al. · 2016 [cited by applicant]
US 10140623B1 · Lloyd et al. · 2018 [cited by applicant]
US 10204355B1 · Cory et al. · 2019 [cited by applicant]
US 10217130B1 · Varma et al. · 2019 [cited by applicant]
US 10290039B2 · Hueter et al. · 2019 [cited by applicant]
US 10402798B1 · Varma et al. · 2019 [cited by applicant]
US 10521820B1 · Jarvis et al. · 2019 [cited by applicant]
US 10521821B2 · DeWitt et al. · 2019 [cited by applicant]
US 10909553B1 · Schulte · 2021 [cited by examiner]
US 10949825B1 · Brosamer et al. · 2021 [cited by applicant]
US 10949879B2 · Jarvis et al. · 2021 [cited by applicant]
US 11776009B2 · Jarvis et al. · 2023 [cited by applicant]
US 20050027590A9 · Gailey et al. · 2005 [cited by applicant]
US 20050149392A1 · Gold et al. · 2005 [cited by applicant]
US 20050159996A1 · Lazarus · 2005 [cited by examiner]
US 20060247978A1 · Davis · 2006 [cited by applicant]
US 20070244741A1 · Blume et al. · 2007 [cited by applicant]
US 20080103853A1 · Watanabe et al. · 2008 [cited by applicant]
US 20080249836A1 · Angell et al. · 2008 [cited by applicant]
US 20080270398A1 · Landau et al. · 2008 [cited by applicant]
US 20090076925A1 · DeWitt et al. · 2009 [cited by applicant]
US 20090171759A1 · McGeehan · 2009 [cited by applicant]
US 20100017279A1 · Connor, Jr. · 2010 [cited by examiner]
US 20100153224A1 · Livnat · 2010 [cited by applicant]
US 20100280880A1 · Faith et al. · 2010 [cited by applicant]
US 20100280881A1 · Faith et al. · 2010 [cited by applicant]
US 20100280882A1 · Faith et al. · 2010 [cited by applicant]
US 20100280927A1 · Faith et al. · 2010 [cited by applicant]
US 20100280950A1 · Faith et al. · 2010 [cited by applicant]
US 20110035288A1 · Clyne · 2011 [cited by applicant]
US 20110087546A1 · Fordyce, III et al. · 2011 [cited by applicant]
US 20110090080A1 · Yu · 2011 [cited by applicant]
US 20110178844A1 · Rane et al. · 2011 [cited by applicant]
US 20110178845A1 · Rane et al. · 2011 [cited by applicant]
US 20110178849A1 · Rane et al. · 2011 [cited by applicant]
US 20110231225A1 · Winters · 2011 [cited by applicant]
US 20110231257A1 · Winters · 2011 [cited by applicant]
US 20110264501A1 · Clyne · 2011 [cited by applicant]
US 20110313835A1 · Falkenborg et al. · 2011 [cited by applicant]
US 20120059702A1 · Yoder et al. · 2012 [cited by applicant]
US 20120066064A1 · Yoder et al. · 2012 [cited by applicant]
US 20120066065A1 · Switzer · 2012 [cited by applicant]
US 20120094639A1 · Carlson et al. · 2012 [cited by applicant]
US 20120109734A1 · Fordyce, III et al. · 2012 [cited by applicant]
US 20120130724A1 · Flegel · 2012 [cited by examiner]
US 20120136704A1 · Carlson et al. · 2012 [cited by applicant]
US 20120310831A1 · Harris et al. · 2012 [cited by applicant]
US 20120311139A1 · Brave et al. · 2012 [cited by applicant]
US 20130024211A1 · Monteforte et al. · 2013 [cited by applicant]
US 20130080239A1 · Okerlund et al. · 2013 [cited by applicant]
US 20130090980A1 · Hummel · 2013 [cited by applicant]
US 20130124263A1 · Amaro et al. · 2013 [cited by applicant]
US 20130151388A1 · Falkenborg et al. · 2013 [cited by applicant]
US 20130191198A1 · Carlson et al. · 2013 [cited by applicant]
US 20130191213A1 · Beck et al. · 2013 [cited by applicant]
US 20130246176A1 · Chang et al. · 2013 [cited by applicant]
US 20130275222A1 · Amaro et al. · 2013 [cited by applicant]
US 20130282480A1 · Lertzman et al. · 2013 [cited by applicant]
US 20130325587A1 · Kothari et al. · 2013 [cited by applicant]
US 20130332284A1 · Faith · 2013 [cited by examiner]
US 20130339064A1 · Denning et al. · 2013 [cited by applicant]
US 20140006284A1 · Faith et al. · 2014 [cited by applicant]
US 20140067596A1 · McGovern et al. · 2014 [cited by applicant]
US 20140136300A1 · Tietzen et al. · 2014 [cited by applicant]
US 20140164112A1 · Kala et al. · 2014 [cited by applicant]
US 20140172576A1 · Spears et al. · 2014 [cited by applicant]
US 20140180811A1 · Boal · 2014 [cited by applicant]
US 20140180817A1 · Zilkha · 2014 [cited by examiner]
US 20140180881A1 · Krueger · 2014 [cited by examiner]
US 20140188568A1 · Margolin · 2014 [cited by applicant]
US 20140222506A1 · Frazer et al. · 2014 [cited by applicant]
US 20140222570A1 · Devolites et al. · 2014 [cited by applicant]
US 20140222636A1 · Cheng et al. · 2014 [cited by applicant]
US 20140236672A1 · Yoder et al. · 2014 [cited by applicant]
US 20140236725A1 · Golden et al. · 2014 [cited by applicant]
US 20140279002A1 · Grigg et al. · 2014 [cited by applicant]
US 20140279003A1 · Grigg et al. · 2014 [cited by applicant]
US 20140279130A1 · Lau et al. · 2014 [cited by applicant]
US 20140279185A1 · Merz et al. · 2014 [cited by applicant]
US 20140279420A1 · Okerlund · 2014 [cited by examiner]
US 20140314215A1 · Duva et al. · 2014 [cited by applicant]
US 20140330646A1 · Mierle et al. · 2014 [cited by applicant]
US 20140344068A1 · Fordyce, III et al. · 2014 [cited by applicant]
US 20140351048A1 · Fordyce et al. · 2014 [cited by applicant]
US 20140365301A1 · Rappoport et al. · 2014 [cited by applicant]
US 20140372338A1 · Kim et al. · 2014 [cited by applicant]
US 20140379617A1 · Yang et al. · 2014 [cited by applicant]
US 20150006277A1 · Delug · 2015 [cited by applicant]
US 20150032543A1 · Weis et al. · 2015 [cited by applicant]
US 20150058076A1 · Leff et al. · 2015 [cited by applicant]
US 20150073954A1 · Braff · 2015 [cited by applicant]
US 20150081410A1 · Ross · 2015 [cited by applicant]
US 20150106206A1 · Vengroff et al. · 2015 [cited by applicant]
US 20150106244A1 · Lo Faro · 2015 [cited by applicant]
US 20150134413A1 · Deshpande et al. · 2015 [cited by applicant]
US 20150142515A1 · Ghosh · 2015 [cited by examiner]
US 20150170175A1 · Zhang et al. · 2015 [cited by applicant]
US 20150186951A1 · Wilson et al. · 2015 [cited by applicant]
US 20150193853A1 · Ayzenshtat et al. · 2015 [cited by applicant]
US 20150220835A1 · Wilson et al. · 2015 [cited by applicant]
US 20150278875A1 · Summer et al. · 2015 [cited by applicant]
US 20150287145A1 · Lee · 2015 [cited by applicant]
US 20150294328A1 · Thalken · 2015 [cited by examiner]
US 20150317668A1 · Tietzen · 2015 [cited by applicant]
US 20150332414A1 · Unser et al. · 2015 [cited by applicant]
US 20150363840A1 · Gupta et al. · 2015 [cited by applicant]
US 20160012425A1 · Sharan et al. · 2016 [cited by applicant]
US 20160012457A1 · Unser et al. · 2016 [cited by applicant]
US 20160014819A1 · Cona et al. · 2016 [cited by applicant]
US 20160019465A1 · Milton et al. · 2016 [cited by applicant]
US 20160063566A1 · Nagarathinam · 2016 [cited by applicant]
US 20160117781A1 · Lee et al. · 2016 [cited by applicant]
US 20160140622A1 · Wang et al. · 2016 [cited by applicant]
US 20160148092A1 · Chauhan · 2016 [cited by applicant]
US 20160148258A1 · Chavarria et al. · 2016 [cited by applicant]
US 20160148270A1 · Vigier et al. · 2016 [cited by applicant]
US 20160162911A1 · Chao et al. · 2016 [cited by applicant]
US 20160203211A1 · Milton et al. · 2016 [cited by applicant]
US 20160217446A1 · Fordyce, III et al. · 2016 [cited by applicant]
US 20160224997A1 · Blackhurst et al. · 2016 [cited by applicant]
US 20160225026A1 · Golden et al. · 2016 [cited by applicant]
US 20160247175A1 · Milton et al. · 2016 [cited by applicant]
US 20160253689A1 · Milton et al. · 2016 [cited by applicant]
US 20160253737A1 · Chang et al. · 2016 [cited by applicant]
US 20160275553A1 · Gupta et al. · 2016 [cited by applicant]
US 20160292705A1 · Ayzenshtat et al. · 2016 [cited by applicant]
US 20160321284A1 · Spears et al. · 2016 [cited by applicant]
US 20160323711A1 · Spears et al. · 2016 [cited by applicant]
US 20160335702A1 · Ko et al. · 2016 [cited by applicant]
US 20160343017A1 · Carlson · 2016 [cited by examiner]
US 20160350866A1 · Lee · 2016 [cited by examiner]
US 20160364489A1 · Gupta · 2016 [cited by examiner]
US 20160371692A1 · Clyne · 2016 [cited by applicant]
US 20160379290A1 · Weinberger et al. · 2016 [cited by applicant]
US 20170011424A1 · Abou-Rizk et al. · 2017 [cited by applicant]
US 20170011430A1 · Sparrow et al. · 2017 [cited by applicant]
US 20170083881A1 · Sardela Bianchi et al. · 2017 [cited by applicant]
US 20170124574A1 · Gerard et al. · 2017 [cited by applicant]
US 20170163655A1 · Ramalingam et al. · 2017 [cited by applicant]
US 20170169497A1 · Lee et al. · 2017 [cited by applicant]
US 20170177721A1 · Prabhu et al. · 2017 [cited by applicant]
US 20170213246A1 · Shahan · 2017 [cited by applicant]
US 20170235786A9 · Faith et al. · 2017 [cited by applicant]
US 20170236107A1 · Arora · 2017 [cited by applicant]
US 20170262872A1 · Fischer et al. · 2017 [cited by applicant]
US 20170300940A1 · Faith · 2017 [cited by examiner]
US 20170300988A1 · Zamer · 2017 [cited by applicant]
US 20170303088A1 · Spears et al. · 2017 [cited by applicant]
US 20170345005A1 · Faith et al. · 2017 [cited by applicant]
US 20170345067A1 · Leng · 2017 [cited by applicant]
US 20170364953A1 · Grimes · 2017 [cited by applicant]
US 20170372434A1 · Winters · 2017 [cited by applicant]
US 20180027091A1 · Agarwal et al. · 2018 [cited by applicant]
US 20180040011A1 · Milton · 2018 [cited by applicant]
US 20180096417A1 · Cook et al. · 2018 [cited by applicant]
US 20180149486A1 · Spears et al. · 2018 [cited by applicant]
US 20180181971A1 · Macilwaine et al. · 2018 [cited by applicant]
US 20180189806A1 · Fordyce et al. · 2018 [cited by applicant]
US 20180189990A1 · Cardno et al. · 2018 [cited by applicant]
US 20180211330A1 · Ran et al. · 2018 [cited by applicant]
US 20180211331A1 · Winters · 2018 [cited by applicant]
US 20180225678A1 · Macilwaine et al. · 2018 [cited by applicant]
US 20180232762A1 · Greene et al. · 2018 [cited by applicant]
US 20180276710A1 · Tietzen et al. · 2018 [cited by applicant]
US 20180293585A1 · Salmon et al. · 2018 [cited by applicant]
US 20180341650A1 · Faith et al. · 2018 [cited by applicant]
US 20180374119A1 · Kohli · 2018 [cited by applicant]
US 20190026781A1 · Beck et al. · 2019 [cited by applicant]
US 20190043096A1 · Cory et al. · 2019 [cited by applicant]
US 20190057419A1 · Jacobs · 2019 [cited by applicant]
US 20190073669A1 · Dutta et al. · 2019 [cited by applicant]
US 20190073685A1 · Ayzenshtat · 2019 [cited by examiner]
US 20190147469A1 · Hu · 2019 [cited by examiner]
US 20190164181A1 · Adjaoute · 2019 [cited by applicant]
US 20190205288A1 · Faith et al. · 2019 [cited by applicant]
US 20190205698A1 · Liu · 2019 [cited by examiner]
US 20190213623A1 · Nagula et al. · 2019 [cited by applicant]
US 20190236601A1 · Izenson et al. · 2019 [cited by applicant]
US 20190259053A1 · Merz et al. · 2019 [cited by applicant]
US 20190286998A9 · Wilson et al. · 2019 [cited by applicant]
US 20190289043A1 · Zavesky et al. · 2019 [cited by applicant]
US 20190347679A1 · Banerjee et al. · 2019 [cited by applicant]
US 20190378027A1 · Jarvis et al. · 2019 [cited by applicant]
US 20190378194A1 · Jarvis et al. · 2019 [cited by applicant]
US 20190378195A1 · Jarvis et al. · 2019 [cited by applicant]
US 20190385219A1 · Ouyang · 2019 [cited by applicant]
US 20200250694A1 · Mock et al. · 2020 [cited by applicant]
AU 2013267037A1 · 2014 [cited by applicant]
CN 107742245A · 2018 [cited by applicant]
EP 2204745A1 · 2010 [cited by applicant]
IN 201944032151A · 2020 [cited by applicant]
Davies K., et al., “Detecting Inter-Transaction Affinities,” IBM Technical Disclosure Bulletin, Jun. 1994, vol. 37(06A), pp. 377-380. [cited by applicant]
Yeh M., et al., “Merchant Category Identification Using Credit Card Transactions,” IEEE International Conference on Big Data, 2020, pp. 1-9. [cited by applicant]
Ahmed S.R., “Applications of Data Mining in Retail Business,” Proceedings of theInternational Conference on Information Technology Coding and Computing IEEE, 2004, 5 pages. [cited by applicant]
Chen Y.L., et al., Discovering Recency, Frequency, and Monetary (RFM) Sequential Patterns from Customers' Purchasing Data, Electronic Commerce Research and Applications, Mar. 25, 2009. [cited by applicant]
Cho Y.H., et al., “A Personalized Recommender System Based on Web Usage Mining and Decision Tree Induction,” Expert System with Applications, 2002, 14 pages. [cited by applicant]
Clemente R.D., et al., “Sequences of Purchases in Credit Card Data Reveal Lifestyles in Urban Populations,” Nature communications, 2018, pp. 1-8. [cited by applicant]
Hsueh-Chan Lu E., et al., “Mining Cluster-based Temporal Mobile Sequential Patterns in Location-based Service Environments,” IEEE Transactions on Knowledge and Data Engineering, 2011, vol. 23(6), pp. 914-927. [cited by applicant]
Jiang T., et al., “Improving Personalization Solutions through Optimal Segmentation of Customer Bases,” IEEE Transactions on Knowledge and Data Engineering, Mar. 2009, vol. 21(3), pp. 305-320. [cited by applicant]
Lai H., et al., “A Group-based Inference Approach to Customized Marketing on the Web—Integrating Clustering and Association Rules Techniques,” Proceedings of the 33rd Hawaii International Conference on System Sciences, … [cited by applicant]
Pirani Z., et al., “Analysis and Optimization of Online Sales of Products,” International Conference on Innovations in Information Embedded and Communications Systems, 2017, 5 Pages. [cited by applicant]
Ren D., et al., “Charticulator: Interactive Construction of Bespoke Chart Layouts,” IEEE Transactions on Visualization and Computer Graphics, vol. 25 (1), Jan. 2019. [cited by applicant]
Ren D., et al., “iVisDesigner: Expressive Interactive Design of Information Visualizations,” IEEE Transactions on Visualization and Computer Graphics, vol. 20 (12), Dec. 2014. [cited by applicant]
Subbiah A., et al., “Implementing Affinity Analysis in Determining Critical Factors One-Service Systems in Malaysia,” IEEE, Nov. 2011, 6 pages. [cited by applicant]
Yu et al., “Performance Analysis of Affinity Clustering on Transaction Processing Coupling Architecture,” IEEE Transactions on Knowledge and Data Engineering, 1994, vol. 6(5), 23 Pages. [cited by applicant]
Bao, J., et al., “Partner-marketing Using Geo-social Media Data for Smarter Commerce,” IBM J. RES. & DEV. vol. 58(5/6) Paper Sep. 6/Nov. 2014, pp. 6.1-6.12. [cited by applicant]