Granted Patent
B2
US 12,231,311 · App. 18/649,423 · Granted Feb 18, 2025
Parallel computational framework and application server for determining path connectivity
Assignee:
WWW.TRUSTSCIENCE.COM INC.
View Patent ↗
Loading inventors, assignments & file history…
Abstract
Systems and methods for social graph data analytics to determine the connectivity between nodes within a community are provided. A user may assign user connectivity values to other members of the community, or connectivity values may be automatically harvested or assigned from third parties or based on the frequency of interactions between members of the community. Connectivity values may represent such factors as alignment, reputation, status, and/or influence within a social graph of a network community, or the degree of trust. The paths connecting a first node to a second node may be retrieved, and social graph data analytics may be performed on the retrieved paths. For example, a network connectivity value may be determined from all or a subset of all of the retrieved paths. Network connectivity values and/or other social graph data may be outputted to third-party processes, services, and ratings agencies for use in initiating automatic transactions, making automated network-based or real-world decisions, determining or verifying the identity of a node within the community, scoring or ranking nodes, or making credit-granting decisions.
Claims (69)
1. A system for determining the network connectivity between a first node and a second node connected to the first node by at least one path, comprising:
a storage device configured to:
store a first list of outgoing paths from the first node,
store a second list of incoming paths to the second node,
store a third list of grouped paths between the first node and the second node,
wherein each path in the first list and each path in the second list comprises one or more links between nodes and each path with more than one link comprises at least one intermediate node; and
processing circuitry configured to:
prior to storing the third list, determine each of the grouped paths for the third list by accessing data from the first list and the second list and grouping together sets of one or more paths having the same last intermediate node that is adjacent to the second node;
determine a relative user weight for each of the one or more links between nodes;
determine an overall weight of each of the grouped paths; and
determine a network connectivity indication based, at least in part, on the grouped paths.
2. The system of claim 1 , wherein
paths comprising a number of links larger than a threshold value are not considered in the network connectivity determination.
3. The system of claim 2 , wherein
determining each of the grouped paths further comprises eliminating from consideration any paths having more links than the threshold value.
4. The system of claim 2 , wherein
the processing circuitry is configured to define a threshold function to determine the maximum number of links in a path that will be analyzed.
5. The system of claim 1 , wherein
each path is qualified only if its path weight meets or exceeds a threshold weight; and
only qualified paths are used to determine connectivity values.
6. The system of claim 1 , wherein
a plurality of the path weights with at least one intermediate node are scaled by a predetermined number; and
the scaled path weights are used to determine the network connectivity indication.
7. The system of claim 6 , wherein
the predetermined number for each of the plurality of the path weights is the number of intermediate nodes in the path corresponding to the path weight.
8. A method for determining the network connectivity between a first node and a second node connected to the first node by at least one path, comprising:
storing a first list of outgoing paths from the first node,
storing a second list of incoming paths to the second node,
wherein each path in the first list and each path in the second list comprises one or more links between nodes and each path with more than one link comprises at least one intermediate node;
determining paths to group for a third list by accessing data from the first list and the second list and grouping together sets of one or more paths having the same last intermediate node that is adjacent to the second node;
storing the third list of grouped paths between the first node and the second node;
determining a relative user weight for each of the one or more links between nodes;
determining an overall weight of each of the grouped paths; and
determining a network connectivity indication based, at least in part, on the grouped paths.
9. The method of claim 8 , wherein
paths comprising a number of links larger than a threshold value are not considered in the network connectivity determination.
10. The method of claim 9 , wherein
determining each of the grouped paths further comprises eliminating from consideration any paths having more links than the threshold value.
11. The method of claim 8 , further comprising:
defining a threshold function to determine the maximum number of links in a path that will be analyzed.
12. The method of claim 8 , wherein
each path is qualified only if its path weight meets or exceeds a threshold weight; and
only qualified paths are used to determine connectivity values.
13. The method of claim 8 , wherein
a plurality of the path weights with at least one intermediate node are scaled by a predetermined number; and
the scaled path weights are used to determine the network connectivity indication.
14. The method of claim 13 , wherein
the predetermined number for each of the plurality of the path weights is the number of intermediate nodes in the path corresponding to the path weight.
15. A non-transitory computer readable medium comprising instructions encoded thereon for providing media guidance for determining the network connectivity between a first node and a second node connected to the first node by at least one path, the instructions comprising instructions for:
storing a first list of outgoing paths from the first node,
storing a second list of incoming paths to the second node,
wherein each path in the first list and each path in the second list comprises one or more links between nodes and each path with more than one link comprises at least one intermediate node;
determining paths to group for a third list by accessing data from the first list and the second list and grouping together sets of one or more paths having the same last intermediate node that is adjacent to the second node;
storing the third list of grouped paths between the first node and the second node;
determining a relative user weight for each of the one or more links between nodes;
determining an overall weight of each of the grouped paths; and
determining a network connectivity indication based, at least in part, on the grouped paths.
16. The medium of claim 15 , further comprising instructions specifying that
paths comprising a number of links larger than a threshold value are not considered in the network connectivity determination.
17. The medium of claim 16 , further comprising instructions for
determining each of the grouped paths by eliminating from consideration any paths having more links than the threshold value.
18. The medium of claim 15 , further comprising instructions specifying that
each path will be qualified only if its path weight meets or exceeds a threshold weight; and
only qualified paths will be used to determine connectivity values.
19. The medium of claim 15 , further comprising instructions for:
scaling a plurality of the path weights with at least one intermediate node by a predetermined number; and
using the scaled path weights to determine the network connectivity indication.
20. The medium of claim 19 , wherein
the predetermined number for each of the plurality of the path weights is the number of intermediate nodes in the path corresponding to the path weight.
Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST
Recorded Apr 29, 2024
From: CHAN, LEO M.
To: WWW.TRUSTSCIENCE.COM INC.
Reel/Frame 067257/0260 →
Continuity (10)
Continuation
15623103
· Jun 14, 2017
Continuation
13503352
Provisional Application
61254313
· Oct 23, 2009
References Cited (400)
US 5555542A
· Ogura et al.
· 1996
[cited by applicant]
US 5860605A
· Van Der Zanden
· 1999
[cited by applicant]
US 6108308A
· Flavin et al.
· 2000
[cited by applicant]
US 6286007B1
· Miller et al.
· 2001
[cited by applicant]
US 6356902B1
· Tan et al.
· 2002
[cited by applicant]
US 6446048B1
· Wells et al.
· 2002
[cited by applicant]
US 6509898B2
· Chi et al.
· 2003
[cited by applicant]
US 6633886B1
· Chong
· 2003
[cited by applicant]
US 6708308B2
· De Souza et al.
· 2004
[cited by applicant]
US 6738777B2
· Bliss et al.
· 2004
[cited by applicant]
US 6751729B1
· Giniger et al.
· 2004
[cited by applicant]
US 6823299B1
· Contreras
· 2004
[cited by applicant]
US 7069259B2
· Horvitz et al.
· 2006
[cited by applicant]
US 7086085B1
· Brown et al.
· 2006
[cited by applicant]
US 7130262B1
· Cortez et al.
· 2006
[cited by applicant]
US 7130908B1
· Pecus et al.
· 2006
[cited by applicant]
US 7139837B1
· Parekh et al.
· 2006
[cited by applicant]
US 7266649B2
· Yoshida et al.
· 2007
[cited by applicant]
US 7272719B2
· Bleckmann et al.
· 2007
[cited by applicant]
US 7451365B2
· Wang et al.
· 2008
[cited by applicant]
US 7458049B1
· Tuncer et al.
· 2008
[cited by applicant]
US 7512612B1
· Akella et al.
· 2009
[cited by applicant]
US 7539697B1
· Akella et al.
· 2009
[cited by applicant]
US 7664802B2
· Aaltonen et al.
· 2010
[cited by applicant]
US 7668665B2
· Kim
· 2010
[cited by applicant]
US 7685192B1
· Scofield et al.
· 2010
[cited by applicant]
US 7743208B2
· Yoshida et al.
· 2010
[cited by applicant]
US 7805407B1
· Verbeke et al.
· 2010
[cited by applicant]
US 7822631B1
· Vander Mey et al.
· 2010
[cited by applicant]
US 7856449B1
· Martino et al.
· 2010
[cited by applicant]
US 7865551B2
· Mcculler
· 2011
[cited by applicant]
US 7886334B1
· Walsh
· 2011
[cited by applicant]
US 7930255B2
· Choi et al.
· 2011
[cited by applicant]
US 8010458B2
· Galbreath et al.
· 2011
[cited by applicant]
US 8010460B2
· Work et al.
· 2011
[cited by applicant]
US 8010602B2
· Shen et al.
· 2011
[cited by applicant]
US 8108536B1
· Hernacki et al.
· 2012
[cited by applicant]
US 8156558B2
· Goldfeder et al.
· 2012
[cited by applicant]
US 8170958B1
· Gremett et al.
· 2012
[cited by applicant]
US 8180804B1
· Narayanan et al.
· 2012
[cited by applicant]
US 8214883B2
· Obasanjo et al.
· 2012
[cited by applicant]
US 8234688B2
· Grandison et al.
· 2012
[cited by applicant]
US 8237714B1
· Burke
· 2012
[cited by applicant]
US 8244848B1
· Narayanan
· 2012
[cited by applicant]
US 8261078B2
· Barriga et al.
· 2012
[cited by applicant]
US 8301617B2
· Muntz et al.
· 2012
[cited by applicant]
US 8306973B2
· Ohazama et al.
· 2012
[cited by applicant]
US 8316056B2
· Wable
· 2012
[cited by applicant]
US 8386301B2
· Rajasingham
· 2013
[cited by applicant]
US 8392590B2
· Bouchard et al.
· 2013
[cited by applicant]
US 8443366B1
· Yancey
· 2013
[cited by applicant]
US 8468103B2
· Galbreath et al.
· 2013
[cited by applicant]
US 8489641B1
· Seefeld et al.
· 2013
[cited by applicant]
US 8516196B2
· Jain et al.
· 2013
[cited by applicant]
US 8560605B1
· Gyongyi et al.
· 2013
[cited by applicant]
US 8572129B1
· Lee et al.
· 2013
[cited by applicant]
US 8601025B1
· Shajenko et al.
· 2013
[cited by applicant]
US 8606721B1
· Dicker
· 2013
[cited by applicant]
US 8621215B1
· Iyer
· 2013
[cited by applicant]
US 8682837B2
· Skelton
· 2014
[cited by applicant]
US 8683423B2
· Amaral et al.
· 2014
[cited by applicant]
US 8688701B2
· Ghosh et al.
· 2014
[cited by applicant]
US 8725673B2
· Kast et al.
· 2014
[cited by applicant]
US 8768759B2
· Ghosh et al.
· 2014
[cited by applicant]
US 8832093B2
· Redstone et al.
· 2014
[cited by applicant]
US 8832790B1
· Villa et al.
· 2014
[cited by applicant]
US 8874572B1
· Broyles
· 2014
[cited by applicant]
US 8949250B1
· Garg et al.
· 2015
[cited by applicant]
US 9143503B2
· Lo et al.
· 2015
[cited by applicant]
US 9147273B1
· Allen et al.
· 2015
[cited by applicant]
US 9154491B1
· Leske
· 2015
[cited by applicant]
US 9171336B2
· Englar et al.
· 2015
[cited by applicant]
US 9171338B2
· Chrapko et al.
· 2015
[cited by applicant]
US 9223978B2
· Kraemer
· 2015
[cited by applicant]
US 9319419B2
· Sprague et al.
· 2016
[cited by applicant]
US 9390243B2
· Dhillon et al.
· 2016
[cited by applicant]
US 9438619B1
· Chan et al.
· 2016
[cited by applicant]
US 9443004B2
· Chan
· 2016
[cited by examiner]
US 9443044B2
· Gou et al.
· 2016
[cited by applicant]
US 9460475B2
· Chrapko et al.
· 2016
[cited by applicant]
US 9584540B1
· Chan et al.
· 2017
[cited by applicant]
US 9613341B2
· Shivakumar
· 2017
[cited by applicant]
US 9721296B1
· Chrapko
· 2017
[cited by applicant]
US 9747650B2
· Chrapko et al.
· 2017
[cited by applicant]
US 9785696B1
· Yaknenko et al.
· 2017
[cited by applicant]
US 9846896B2
· Shah
· 2017
[cited by applicant]
US 20030046280A1
· Rotter et al.
· 2003
[cited by applicant]
US 20030076825A1
· Guruprasad
· 2003
[cited by examiner]
US 20030133411A1
· Ise et al.
· 2003
[cited by applicant]
US 20030227924A1
· Kodialam et al.
· 2003
[cited by applicant]
US 20040018518A1
· Krieb et al.
· 2004
[cited by applicant]
US 20040088147A1
· Wang et al.
· 2004
[cited by applicant]
US 20040122803A1
· Dom et al.
· 2004
[cited by applicant]
US 20040181461A1
· Raiyani et al.
· 2004
[cited by applicant]
US 20040181518A1
· Mayo et al.
· 2004
[cited by applicant]
US 20040239674A1
· Ewald
· 2004
[cited by applicant]
US 20050083936A1
· Ma
· 2005
[cited by examiner]
US 20050096987A1
· Miyauchi
· 2005
[cited by applicant]
US 20050149522A1
· Cookson et al.
· 2005
[cited by applicant]
US 20050243736A1
· Faloutsos et al.
· 2005
[cited by applicant]
US 20050256949A1
· Gruhl et al.
· 2005
[cited by applicant]
US 20060212931A1
· Shull et al.
· 2006
[cited by applicant]
US 20060248573A1
· Pannu et al.
· 2006
[cited by applicant]
US 20060259957A1
· Tam et al.
· 2006
[cited by applicant]
US 20060271564A1
· Meng Muntz et al.
· 2006
[cited by applicant]
US 20060287842A1
· Kim
· 2006
[cited by applicant]
US 20060290697A1
· Madden et al.
· 2006
[cited by applicant]
US 20060294134A1
· Berkhim et al.
· 2006
[cited by applicant]
US 20070087819A1
· Van Luchene et al.
· 2007
[cited by applicant]
US 20070109302A1
· Tsuboshita et al.
· 2007
[cited by applicant]
US 20070124291A1
· Hassan et al.
· 2007
[cited by applicant]
US 20070136086A1
· Luerssen
· 2007
[cited by applicant]
US 20070143629A1
· Hardjono et al.
· 2007
[cited by applicant]
US 20070162761A1
· Davis et al.
· 2007
[cited by applicant]
US 20070180495A1
· Hardjono et al.
· 2007
[cited by applicant]
US 20070214259A1
· Ahmed et al.
· 2007
[cited by applicant]
US 20070220146A1
· Suzuki
· 2007
[cited by applicant]
US 20070263012A1
· Panditharadhya et al.
· 2007
[cited by applicant]
US 20070282886A1
· Purang et al.
· 2007
[cited by applicant]
US 20080005096A1
· Moore
· 2008
[cited by applicant]
US 20080015916A1
· Cossey et al.
· 2008
[cited by applicant]
US 20080059576A1
· Liu et al.
· 2008
[cited by applicant]
US 20080086442A1
· Dasdan et al.
· 2008
[cited by applicant]
US 20080101343A1
· Monette et al.
· 2008
[cited by applicant]
US 20080104225A1
· Zhang et al.
· 2008
[cited by applicant]
US 20080109451A1
· Harding
· 2008
[cited by applicant]
US 20080133391A1
· Kurian et al.
· 2008
[cited by applicant]
US 20080183378A1
· Weidner
· 2008
[cited by applicant]
US 20080281694A1
· Kretz et al.
· 2008
[cited by applicant]
US 20080288457A1
· Aaltonen et al.
· 2008
[cited by applicant]
US 20080288612A1
· Kwon
· 2008
[cited by applicant]
US 20090024629A1
· Miyauchi
· 2009
[cited by applicant]
US 20090027392A1
· Jadhav et al.
· 2009
[cited by applicant]
US 20090043489A1
· Weidner
· 2009
[cited by applicant]
US 20090049517A1
· Sorniotti et al.
· 2009
[cited by applicant]
US 20090063157A1
· Seo
· 2009
[cited by applicant]
US 20090064293A1
· Li et al.
· 2009
[cited by applicant]
US 20090094134A1
· Toomer
· 2009
[cited by applicant]
US 20090106822A1
· Obasanjo et al.
· 2009
[cited by applicant]
US 20090198562A1
· Wiesinger et al.
· 2009
[cited by applicant]
US 20090276233A1
· Brimhall et al.
· 2009
[cited by applicant]
US 20090296568A1
· Kitada
· 2009
[cited by applicant]
US 20090327054A1
· Yao
· 2009
[cited by applicant]
US 20100004940A1
· Choi et al.
· 2010
[cited by applicant]
US 20100010826A1
· Rosenthal et al.
· 2010
[cited by applicant]
US 20100043055A1
· Baumgart
· 2010
[cited by applicant]
US 20100076987A1
· Schreiner
· 2010
[cited by applicant]
US 20100100963A1
· Mahaffey
· 2010
[cited by applicant]
US 20100106557A1
· Buss
· 2010
[cited by applicant]
US 20100121707A1
· Goeldi
· 2010
[cited by applicant]
US 20100161662A1
· Jonas et al.
· 2010
[cited by applicant]
US 20100169137A1
· Jastrebski et al.
· 2010
[cited by applicant]
US 20100180048A1
· Guo et al.
· 2010
[cited by applicant]
US 20100205541A1
· Rapaport et al.
· 2010
[cited by applicant]
US 20100217525A1
· King et al.
· 2010
[cited by applicant]
US 20100250605A1
· Pamu et al.
· 2010
[cited by applicant]
US 20100262610A1
· Acosta et al.
· 2010
[cited by applicant]
US 20100274815A1
· Vanasco
· 2010
[cited by applicant]
US 20100309915A1
· Pirbhai et al.
· 2010
[cited by applicant]
US 20100312644A1
· Borgs et al.
· 2010
[cited by applicant]
US 20110029467A1
· Spehr et al.
· 2011
[cited by applicant]
US 20110055897A1
· Arasaratnam
· 2011
[cited by applicant]
US 20110113098A1
· Walsh et al.
· 2011
[cited by applicant]
US 20110113149A1
· Kaal
· 2011
[cited by applicant]
US 20110173344A1
· Mihaly et al.
· 2011
[cited by applicant]
US 20110184983A1
· Kwantes et al.
· 2011
[cited by applicant]
US 20110208866A1
· Marmolejo-Meillon et al.
· 2011
[cited by applicant]
US 20110219034A1
· Dekker et al.
· 2011
[cited by applicant]
US 20110246237A1
· Vdovjak
· 2011
[cited by applicant]
US 20110246412A1
· Skelton
· 2011
[cited by applicant]
US 20110265011A1
· Taylor et al.
· 2011
[cited by applicant]
US 20110283205A1
· Nie et al.
· 2011
[cited by applicant]
US 20110295626A1
· Chen et al.
· 2011
[cited by applicant]
US 20110314557A1
· Marshall
· 2011
[cited by applicant]
US 20120109714A1
· Azar
· 2012
[cited by applicant]
US 20120110005A1
· Kuo et al.
· 2012
[cited by applicant]
US 20120182822A1
· Hayashi
· 2012
[cited by applicant]
US 20120182882A1
· Chrapko et al.
· 2012
[cited by applicant]
US 20120197758A1
· Zhong et al.
· 2012
[cited by applicant]
US 20120204265A1
· Judge
· 2012
[cited by applicant]
US 20120278767A1
· Stibel et al.
· 2012
[cited by applicant]
US 20120282884A1
· Sun
· 2012
[cited by applicant]
US 20120290427A1
· Reed et al.
· 2012
[cited by applicant]
US 20120317149A1
· Jagota et al.
· 2012
[cited by applicant]
US 20120317200A1
· Chan
· 2012
[cited by applicant]
US 20120324027A1
· Vaynblat et al.
· 2012
[cited by applicant]
US 20130013807A1
· Chrapko et al.
· 2013
[cited by applicant]
US 20130054598A1
· Caceres
· 2013
[cited by applicant]
US 20130073387A1
· Heath
· 2013
[cited by applicant]
US 20130097180A1
· Tseng
· 2013
[cited by applicant]
US 20130097184A1
· Berkhim et al.
· 2013
[cited by applicant]
US 20130110732A1
· Uppal
· 2013
[cited by applicant]
US 20130124542A1
· Lee et al.
· 2013
[cited by applicant]
US 20130138741A1
· Redstone et al.
· 2013
[cited by applicant]
US 20130166601A1
· Chrapko et al.
· 2013
[cited by applicant]
US 20130173457A1
· Chrapko et al.
· 2013
[cited by applicant]
US 20130198811A1
· Yu et al.
· 2013
[cited by applicant]
US 20130254305A1
· Cheng et al.
· 2013
[cited by applicant]
US 20130282884A1
· Chandrasekaran et al.
· 2013
[cited by applicant]
US 20130290226A1
· Dokken
· 2013
[cited by applicant]
US 20130291098A1
· Chung et al.
· 2013
[cited by applicant]
US 20130332740A1
· Sauve et al.
· 2013
[cited by applicant]
US 20140081652A1
· Klindworth
· 2014
[cited by applicant]
US 20140089189A1
· Vasireddy
· 2014
[cited by applicant]
US 20140114962A1
· Rosenburg et al.
· 2014
[cited by applicant]
US 20140156274A1
· You et al.
· 2014
[cited by applicant]
US 20140172708A1
· Chrapko et al.
· 2014
[cited by applicant]
US 20140173723A1
· Singla et al.
· 2014
[cited by applicant]
US 20140258160A1
· Chrapko et al.
· 2014
[cited by applicant]
US 20140278730A1
· Muhart et al.
· 2014
[cited by applicant]
US 20140279352A1
· Schaefer et al.
· 2014
[cited by applicant]
US 20140280151A1
· Micaelian
· 2014
[cited by applicant]
US 20140287725A1
· Lee
· 2014
[cited by applicant]
US 20140304339A1
· Hamilton
· 2014
[cited by applicant]
US 20140317003A1
· Shah
· 2014
[cited by applicant]
US 20140317107A1
· Gharpure et al.
· 2014
[cited by applicant]
US 20150019565A1
· Lijachev et al.
· 2015
[cited by applicant]
US 20150026120A1
· Chrapko et al.
· 2015
[cited by applicant]
US 20150089568A1
· Sprague et al.
· 2015
[cited by applicant]
US 20150121456A1
· Milman et al.
· 2015
[cited by applicant]
US 20150142595A1
· Acuña-Rohter
· 2015
[cited by applicant]
US 20150163217A1
· Lo et al.
· 2015
[cited by applicant]
US 20150169142A1
· Longo et al.
· 2015
[cited by applicant]
US 20150213407A1
· Cabler et al.
· 2015
[cited by applicant]
US 20150220835A1
· Wilson et al.
· 2015
[cited by applicant]
US 20150242856A1
· Dhurandhar et al.
· 2015
[cited by applicant]
US 20150271206A1
· Schultz et al.
· 2015
[cited by applicant]
US 20150347591A1
· Bax et al.
· 2015
[cited by applicant]
US 20150359039A1
· Haque et al.
· 2015
[cited by applicant]
US 20150370801A1
· Shah
· 2015
[cited by applicant]
US 20160004741A1
· Johnson et al.
· 2016
[cited by applicant]
US 20160035046A1
· Gupta et al.
· 2016
[cited by applicant]
US 20160073271A1
· Schultz et al.
· 2016
[cited by applicant]
US 20160171011A1
· Drogobetski et al.
· 2016
[cited by applicant]
US 20160171113A1
· Fanous et al.
· 2016
[cited by applicant]
US 20160180840A1
· Siddiq et al.
· 2016
[cited by applicant]
US 20160197788A1
· Chrapko et al.
· 2016
[cited by applicant]
US 20160253679A1
· Venkatraman et al.
· 2016
[cited by applicant]
US 20160277424A1
· Mawji et al.
· 2016
[cited by applicant]
US 20170024749A1
· Barathy et al.
· 2017
[cited by applicant]
US 20170083820A1
· Huang et al.
· 2017
[cited by applicant]
US 20170236078A1
· Rasumov
· 2017
[cited by applicant]
US 20170293696A1
· Bendersky et al.
· 2017
[cited by applicant]
US 20180068010A1
· Paterson et al.
· 2018
[cited by applicant]
US 20190385130A1
· Mossoba et al.
· 2019
[cited by applicant]
CA 2600344A1
· 2006
[cited by applicant]
CA 2775899A1
· 2011
[cited by applicant]
CN 1619567A
· 2005
[cited by applicant]
CN 101167093A
· 2008
[cited by applicant]
CN 101383695A
· 2009
[cited by applicant]
CN 101393566A
· 2009
[cited by applicant]
CN 101403978A
· 2009
[cited by applicant]
CN 101438279A
· 2009
[cited by applicant]
CN 101443806A
· 2009
[cited by applicant]
CN 101841539A
· 2010
[cited by applicant]
CN 101902459A
· 2010
[cited by applicant]
CN 102136114A
· 2011
[cited by applicant]
CN 102668457A
· 2012
[cited by applicant]
CN 102685661A
· 2012
[cited by applicant]
CN 102855572A
· 2013
[cited by applicant]
CN 103095728A
· 2013
[cited by applicant]
CN 103456233A
· 2013
[cited by applicant]
CN 103493049A
· 2014
[cited by applicant]
CN 103593764A
· 2014
[cited by applicant]
CN 104504043A
· 2015
[cited by applicant]
CN 102823225B
· 2015
[cited by applicant]
CN 104954492A
· 2015
[cited by applicant]
CN 109690608A
· 2019
[cited by applicant]
EP 1511232A1
· 2005
[cited by applicant]
JP 2001298453A
· 2001
[cited by applicant]
JP 2002123649A
· 2002
[cited by applicant]
JP 2003259070A
· 2003
[cited by applicant]
JP 2005149202A
· 2005
[cited by applicant]
JP 2005339281A
· 2005
[cited by applicant]
JP 2006113900A
· 2006
[cited by applicant]
JP 2006260099A
· 2006
[cited by applicant]
JP 2007004411A
· 2007
[cited by applicant]
JP 2007249413A
· 2007
[cited by applicant]
JP 2008129990A
· 2008
[cited by applicant]
JP 2009025871A
· 2009
[cited by applicant]
JP 2009064433A
· 2009
[cited by applicant]
JP 2009146253A
· 2009
[cited by applicant]
JP 2013506204A
· 2013
[cited by applicant]
KR 2019860B1
· 2019
[cited by applicant]
TW 201250611A
· 2012
[cited by applicant]
WO 2006019752A1
· 2006
[cited by applicant]
WO 2006115919A2
· 2006
[cited by applicant]
WO 2007085903A2
· 2007
[cited by applicant]
WO 2009002193A1
· 2008
[cited by applicant]
WO 2009020964A2
· 2009
[cited by applicant]
WO 2009109009A1
· 2009
[cited by applicant]
WO 2010048172A1
· 2010
[cited by applicant]
WO 2011106897A1
· 2011
[cited by applicant]
WO 2011134086A1
· 2011
[cited by applicant]
WO 2011143761A1
· 2011
[cited by applicant]
WO 2011127206A3
· 2012
[cited by applicant]
WO 2013026095A1
· 2013
[cited by applicant]
WO 2013173790A1
· 2013
[cited by applicant]
WO 2014144114A1
· 2014
[cited by applicant]
WO 2015047992A2
· 2015
[cited by applicant]
WO 2015106657A1
· 2015
[cited by applicant]
WO 2016011371A1
· 2016
[cited by applicant]
WO 2017019203A1
· 2017
[cited by applicant]
Angwin et al., “Scrapers' Dig Deep for Data on Web”, http://online.wsj.com/article/SB10001424052748703358504575544381288117888.html?, Oct. 12, 2010, printed on Nov. 6, 2010, 5 pages.
[cited by applicant]
Anthes, “The Search Is On-Computerworld”, http://www.computerworld.com/s/article/70041|The_Search_Is_On, Apr. 15, 2002, printed Nov. 6, 2010, 8 pages.
[cited by applicant]
Baras et al., “Dynamic Self-Organization and Clustering in Distributed Networked Systems for Performance Improvement,” Proceedings of the 47th annual Allerton conference on Communication, Control, and Computing, Alierto…
[cited by applicant]
Chakraborty et al., “TrustBAC-Integrating Trust Relationships into the RBAC Model for Access Control in Open Systems,” Proceedings of the eleventh ACM symposium on Access Control Models and Technologies, SACMAT '06, 10 …
[cited by applicant]
Ding et al., “Transitive Closure and Metric Inequality of Weighted Graphs: Detecting Protein Interaction Modules Using Cliques”, Int. J. Data Mining and Bioinformatics, vol. X, No. X, 200X, pp. 162-177, 2006.
[cited by applicant]
“Facebook announces groups, downloading”, http://content.usatoday.com/communities/technologylive/post/2010/10/live-facebook-announcesdownloading-other-features/1, Oct. 6, 2010, printed Nov. 6, 10, 7 pages.
[cited by applicant]
Feldman et al., “Robust Incentive Techniques for Peer-to-Peer Networks”, Proceedings of the fifth ACM Conference on Electronic Commerce EC'04, New York, New York, USA, 10 pages, May 17-20, 2004.
[cited by applicant]
Final Office Action received for U.S. Appl. No. 15/079,952, dated Dec. 16, 2016, 14 pages.
[cited by applicant]
Gan et al., “A Novel Reputation Computing Model for Mobile Agent-Based E-Commerce Systems”, Proceedings of the International Conference on Information Security and Assurance, ISA 2008, pp. 253-260, Apr. 24-26, 2008.
[cited by applicant]
Geisberger, et al., “Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks”, LNCS 5038, 2008, pp. 319-333.
[cited by applicant]
Golbeck et al., “Inferring Trust Relationships in Web-based Social Networks”, Journal of ACM Transactions of Internet Technology (TOIT), vol. 6, issue 4, Nov. 2006, 41 pages.
[cited by applicant]
Gu et al., “Processing Massive Sized Graphs Using Sector/Sphere”, Proceedings of the 2010 IEEE Workshop on Many-Task Computing on Grids and Supercomputers (MTAGS), New Orleans, LA, USA, 10 pages, Nov. 15, 2010.
[cited by applicant]
Gupta et al., “A Reputation System for Peer-to-Peer Networks,” Proceedings of the 13th International Workshop on Network and operating systems support for digital audio and video NOSSDAV'03, Monterey, California, USA, J…
[cited by applicant]
Gupta et al., “Reputation Management Framework and its use as Currency in large-Scale Peer to-Peer Networks”, Proceedings of the Fourth IEEE International Conference on Peer-to-Peer Computing P2P2004, Zurich, Switzerlan…
[cited by applicant]
Hartley et al., “MSSG: A Framework for Massive-Scale Semantic Graphs,” Proceedings of 2006 IEEE International Conference on Cluster Computing, CLUSTER'2006, Barcelona, Spain, 10 pages, Sep. 25-28, 2006.
[cited by applicant]
Huynh et al., “An Integrated Trust and reputation model for open multi-Agent systems,” Journal of Autonomous Agents and Multi-Agent Systems, vol. 13, issue 2, pp. 119-154, Sep. 2006.
[cited by applicant]
International Search Report and Written Opinion for International Patent Application No. PCT/CA2016/050305 mailed Jun. 3, 2016, 7 pages.
[cited by applicant]
Josang et al., “Simplification and Analysis of Transitive Trust Networks”, Journal of Web Intelligence and Agent Systems, vol. 4, Issue 2, Apr. 2006, pp. 1-26.
[cited by applicant]
Kamola et al., “Reconstruction of a Social Network Graph from Incomplete Call Detail Records”, Conference Proceedings of the International Conference on Computational Aspects of SocialNetworks (CASON), Oct. 19, 2011, pp…
[cited by applicant]
Kang et al., “PEGASUS: A Peta-Scale Graph Mining System—Implementation and Observations”, Proceedings of the Ninth IEEE International Conference on Data Mining, ICDM'09, Miami, FL, USA, pp. 229-238, Dec. 6-9, 2009.
[cited by applicant]
Kim et al., “Design and Implementation of the location-based Personalized Social Media Service,” Conference Proceedings of the International Conference on Internet and Web Applications and Services (ICIW), May 9, 2010, …
[cited by applicant]
Lumsdaine et al., “Challenges in Parallel Graph Processing”, Parallel Processing letters, vol. 17, No. 1, Mar. 2007,16 pages.
[cited by applicant]
Malewicz et al., “Pregel: a System for large-Scale Graph Processing”, Proceedings of the 2010 International Conference on Management Data, SIGMOD'10, Indianapolis, Indiana, USA, Jun. 6-11, 2010, pp. 135-145.
[cited by applicant]
Meyer “Outrage as Credit Agency Plans to Mine Facebook Data,” Gigaom.com, https://gigaom.com/2012/06/07/credit-agency-mines-facebook-data/ Jun. 7, 2012, 3 pages.
[cited by applicant]
Mining Social Networks, Untangling the social Web, http://www.economist.com/node/16910031?story_id=16910031&fsrc=rss, Sep. 2, 2010, printed Nov. 6, 2010, 5 pages.
[cited by applicant]
Mori et al., “Improving Deployability of Peer-Assisted CDN Platform with Incentive”, Proceedings of IEEE Global Telecommunications Conference GLOBECOM 2009, Honolulu, Hawaii, USA, 2009, 7 pages.
[cited by applicant]
Mui et al., “A Computational Model of Trust and Reputation”, Proceedings of the 35th Annual Hawaii International Conference on System Sciences, HICSS '02, vol. 7, 2002, 9 pages.
[cited by applicant]
Notice of Allowance received for U.S. Appl. No. 15/224,172, dated Oct. 14, 2016, 35 pages.
[cited by applicant]
Notice of Allowance received for U.S. Appl. No. 15/056,484, dated Jul. 13, 2016, 31 pages.
[cited by applicant]
Non- Final Office Action received for U.S. Appl. No. 15/079,952, dated Jul. 14, 2016, 26 pages.
[cited by applicant]
Notice of Allowance received for U.S. Appl. No. 14/664,285, dated Oct. 7, 2016, 27 pages.
[cited by applicant]
Notice of Allowance received for U.S. Appl. No. 15/070,643, dated Apr. 7, 2017, 28 pages.
[cited by applicant]
Notice of Allowance received for U.S. Appl. No. 15/406,405, dated Apr. 6, 2017, 27 pages.
[cited by applicant]
Non-Final Office Action for U.S. Appl. No. 15/070,643, dated Feb. 24, 2017, 38 pages.
[cited by applicant]
Safaei et al., “Social Graph Generation & Forecasting Using Social Network Mining”, Proceedings of the 33rd Annual IEEE International Computer Software and Applications Conference, COMPSAC '09, 2009, pp. 31-35.
[cited by applicant]
“Startup Wants to Base Your Credit Score on Social Media Profiles”, Mashable, Technology Review 7, Jun. 7, 2012, 18 pages.
[cited by applicant]
Office Action received for Taiwanese Patent Application No. 105108584 dated Oct. 31, 2016, 7 pages.
[cited by applicant]
Wallentin et al., “A Cross-Layer Route Discovery Strategy for Virtual Currency Systems in Mobile Ad Hoc Networks”, Proceedings of the Seventh International Conference on Wireless On-demand Network Systems and Services I…
[cited by applicant]
Zetter, “Tracking Terrorists the Las Vegas Way”, http://pcworld.about.com/news/Aug072002id103692.htm, printed Nov. 6, 2010, 3 pages.
[cited by applicant]
Zhang et al., “A Review of Incentive Mechanisms in Peer-to-Peer Systems”, Proceedings of the First International Conference on Advances in P2P Systems AP2PS'09, Sliema, Malta, 2009, pp. 45-50.
[cited by applicant]
Zhang et al., “March: A Distributed Incentive Scheme for Peer-to-Peer Networks”, Proceedings of the 26th Annual IEEE Conference on Computer Communication INFOCOM 2007, Anchorage, Alaska, USA, 2007, pp. 1091-1099.
[cited by applicant]
Non-Final Office Action received for U.S. Appl. No. 13/498,429, dated Apr. 17, 2014, 24 pages.
[cited by applicant]
Non-Final Office Action received for U.S. Appl. No. 13/498,429, dated Jul. 25, 2014, 18 pages.
[cited by applicant]
Final Office Action received for U.S. Appl. No. 13/498,429, dated Jan. 16, 2015, 21 pages.
[cited by applicant]
Non-Final Office Action received for U.S. Appl. No. 14/282,935, dated Jul. 21, 2014, 26 pages.
[cited by applicant]
Final Office Action received for U.S. Appl. No. 14/282,935, dated Jan. 30, 2015, 42 pages.
[cited by applicant]
Non-Final Office Action received for U.S. Appl. No. 14/282,935, dated Aug. 5, 2015, 7 pages.
[cited by applicant]
Final Office Action received for U.S. Appl. No. 14/282,935, dated Feb. 12, 2016, 13 pages.
[cited by applicant]
Non-Final Office Action received for U.S. Appl. No. 15/254,642, dated Dec. 28, 2016, 29 pages.
[cited by applicant]
EPO. Mitteilung des Europischen Patentamts vom 1. Oktober 2007 ber Geschftsmethoden = Notice from the European Patent Office dated Oct. 1, 2007 concerning business methods = Communiqu de l'Office europen des brevets, en…
[cited by applicant]
Tang, et al. Social influence analysis in large-scale networks. p. 807. Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining ; KDD '09: Proceedings of the 15th ACM SIGKDD Interna…
[cited by applicant]
Non-Final Office Action received for U.S. Appl. No. 13/521,216, dated Jun. 20, 2014, 20 pages.
[cited by applicant]
Final Office Action received for U.S. Appl. No. 13/521,216, dated May 21, 2015, 28 pages.
[cited by applicant]
Non-Final Office Action received for U.S. Appl. No. 13/521,216, dated Apr. 13, 2016, 30 pages.
[cited by applicant]
Final Office Action received for U.S. Appl. No. 13/521,216, dated Oct. 21, 2016, 36 pages.
[cited by applicant]
Final Office Action received for U.S. Appl. No. 13/503,352, dated Jan. 5, 2015, 28 pages.
[cited by applicant]
Non-Final Office Action received for U.S. Appl. No. 13/503,352, dated Aug. 21, 2014 24 pages.
[cited by applicant]
Non-Final Office Action received for U.S. Appl. No. 13/503,352, dated Aug. 18, 2015, 26 pages.
[cited by applicant]
Non-Final Office Action received for U.S. Appl. No. 15/224,063, dated Sep. 1, 2016, 47 pages.
[cited by applicant]
Non-Final Office Action received for U.S. Appl. No. 13/695,419, dated Oct. 31, 2014, 20 pages.
[cited by applicant]
Final Office Action received for U.S. Appl. No. 13/695,419, dated Jun. 2, 2015, 31 pages.
[cited by applicant]
Non-Final Office Action received for U.S. Appl. No. 13/695,419, dated Dec. 17, 2015, 43 pages.
[cited by applicant]
Non-Final Office Action received for U.S. Appl. No. 13/695,419, dated Apr. 5, 2016, 72 pages.
[cited by applicant]
Non-Final Office Action received for U.S. Appl. No. 13/695,419, dated Oct. 12, 2016, 147 pages.
[cited by applicant]
Non-Final Office Action received for U.S. Appl. No. 13/824,324, dated Mar. 9, 2017, 17 pages.
[cited by applicant]
Non-Final Office Action received for U.S. Appl. No. 14/664,285, dated Jun. 4, 2015, 25 pages.
[cited by applicant]
Final Office Action received for U.S. Appl. No. 14/664,285, dated Sep. 21, 2015, 33 pages.
[cited by applicant]
Non-Final Office Action received for U.S. Appl. No. 14/664,285, dated Mar. 4, 2016, 24 pages.
[cited by applicant]
Final Office Action received for U.S. Appl. No. 14/664,285, dated Jul. 29, 2016, 29 pages.
[cited by applicant]
Non-Final Office Action received for U.S. Appl. No. 15/070,643, dated Aug. 26, 2016, 36 pages.
[cited by applicant]
Non-Final Office Action received for U.S. Appl. No. 15/589,841, dated Jun. 5, 2017, 40 pages.
[cited by applicant]
International Search Report and Written Opinion received for PCT Application No. PCT/CA2017/050257, dated May 19, 2017, 8 pages.
[cited by applicant]
International Search Report and Written Opinion received for PCT Application No. PCT/CA2017/050197, fated May 30, 2017, 15 pages.
[cited by applicant]
Non- Final Office Action received for U.S. Appl. No. 15/466,590, dated Jul. 13, 2017, 20 pages.
[cited by applicant]
Non- Final Office Action received for U.S. Appl. No. 15/055,952, dated Aug. 12, 2016, 33 pages.
[cited by applicant]
International Search Report and Written Opinion for received for PCT Application No. PCT/CA2017/050255, dated Jun. 19, 2017, 9 pages.
[cited by applicant]
Non-Final Office Action received for U.S. Appl. No. 13/695,419, dated Jun. 14, 2017, 44 pages.
[cited by applicant]
Notice of Reasons for Refusal received for Japanese Patent Application No. 2016-131310, dated Aug. 2, 2017, 4 pages (Including English Translation).
[cited by applicant]
Non-Final Office Action received for U.S. Appl. No. 15/224,063, dated Jul. 14, 2017, 36 pages.
[cited by applicant]
Non-Final Office Action received for U.S. Appl. No. 15/400,471, dated Aug. 7, 2017, 24 pages.
[cited by applicant]
Non-Final Office Action received for U.S. Appl. No. 15/630,299, dated Aug. 10, 2017, 17 pages.
[cited by applicant]
International Search Report and Written Opinion received for PCT Application No. PCT/CA2017/050351 dated Jun. 19, 2017, 10 pages.
[cited by applicant]
Non-Final Office Action received for U.S. Appl. No. 15/671,102 dated Sep. 22, 2017, 21 pages.
[cited by applicant]
Non-Final Office Action received for U.S. Appl. No. 15/675,041 dated Oct. 6, 2017, 72 pages.
[cited by applicant]
Office Action received for Canadian Patent Application Serial No. 2,775,899 dated Oct. 12, 2017, 6 pages (Including English Translation).
[cited by applicant]
Notice of Allowance received for U.S. Appl. No. 13/695,419 dated Nov. 8, 2017, 92 pages.
[cited by applicant]
Final Office Action received for U.S. Appl. No. 13/824,324, dated Nov. 30, 2017, 33 pages.
[cited by applicant]
Decision to Grant received for Japanese Patent Application No. 2016-131310, dated Nov. 14, 2017, 6 pages (Including English Translation).
[cited by applicant]
International Search Report and Written Opinion received for PCT Application No. PCT/CA2010/001531, dated Jan. 10, 2011, 9 pages.
[cited by applicant]
Notification of Reasons for Refusal received for Japanese Patent Application No. 2015-085003, Mar. 29, 2016, 4 pages(Including English Translation).
[cited by applicant]
Decision to Grant a Patent received for Japanese Patent Application No. 2015-085003, dated Jun. 2, 2016 6 pages (Including English Translation).
[cited by applicant]