Claims
- 1. A system for evaluating value transfers, the system comprising:
a fraud processing computer; and a computer readable medium associated with the fraud processing computer, wherein the computer readable medium comprises computer instructions executable by the fraud processing computer to:
receive a plurality of transaction packages; form a plurality of root node affinities associated with respective transaction packages; compare the plurality of root node affinities with a tier one affinity; and assimilate at least one of the root node affinities with the tier one affinity based on the comparison.
- 2. The system of claim 1, wherein the tier one affinity is a first tier one affinity, and wherein the computer instructions are further executable by the fraud processing computer to:
compare one of the plurality of root node affinities with another of the root node affinities; and based on the comparison, form a second tier one affinity from compared root node affinities.
- 3. The system of claim 1, wherein the computer instructions are further executable by the fraud processing computer to:
receive a trigger level.
- 4. The system of claim 3, wherein the trigger level is selected from a group consisting of: an affinity intensity, an event count, and an event occurrence.
- 5. The system of claim 3, wherein the trigger level is seven matches to a given tier one affinity.
- 6. The system of claim 3, wherein the computer instructions are further executable by the fraud processing computer to:
convert the tier one affinity to a tier two affinity based at least in part on satisfying the trigger level; locking the tier two affinity; and generating a report indicating suspicious activity associated with the tier two affinity.
- 7. The system of claim 6, wherein the tier one affinity is a first tier one affinity, and wherein the computer instructions are further executable by the fraud processing computer to:
compare a second tier one affinity to the tier two affinity; and based at least in part on the comparison, initiate interdiction procedures in relation to the tier two affinity.
- 8. The system of claim 7, wherein the computer instructions are further executable by the fraud processing computer to:
assimilate the second tier one affinity into the tier two affinity based at least in part on the comparison.
- 9. The system of claim 6, wherein the computer instructions are further executable by the fraud processing computer to:
compare one of the plurality of root node affinities to the tier two affinity; and based at least in part on the comparison, initiate interdiction procedures in relation to the tier two affinity.
- 10. The system of claim 9, wherein the computer instructions are further executable by the fraud processing computer to:
assimilate one of the plurality of root node affinities compared with the tier two affinity based at least in part on the comparison.
- 11. The system of claim 1, wherein the computer instructions are further executable by the fraud processing computer to:
receive real time transaction information; request on-demand transaction information; receive on-demand transaction information; and assemble the real time transaction information and the on-demand transaction information to create the plurality of transaction packages.
- 12. The system of claim 1, wherein the plurality of transaction packages are comprised of information selected from a group consisting of: real time transaction information, on-demand transaction information, and a combination of real time transaction information and on-demand transaction information.
- 13. The system of claim 11, wherein the computer instructions are further executable by the fraud processing computer to:
perform a gross sort on the plurality of transaction packages, wherein at least one of the plurality of transaction packages is eliminated from consideration.
- 14. The system of claim 6, wherein the tier one affinity is a first tier one affinity, and wherein the computer instructions are further executable by the fraud processing computer to:
compare a second tier one affinity to an affinity selected from a group consisting of: a third tier one affinity and a root node affinity; and generate a report reflecting the comparison at a defined period.
- 15. A method for progressive value transfer evaluation, the method comprising:
receiving a transaction package; forming a root node affinity associated with the transaction package; comparing the root node affinity with a tier one affinity; assimilating the root node affinity with the tier one affinity based at least in part on the comparison; converting the tier one affinity to a tier two affinity based at least in part on the comparison with the root node affinity; and generating a report associated with the tier two affinity.
- 16. The method of claim 15, wherein the comparison between the tier one affinity and the root node affinity satisfies a trigger level, and wherein the converting the tier one affinity to a tier two affinity is based at least in part on satisfying the trigger level.
- 17. The system of claim 16, wherein the trigger level is selected from a group consisting of: an affinity intensity, an event count, and an event occurrence.
- 18. The method of claim 15, wherein the tier one affinity is a first tier one affinity, the method further comprising:
forming a second tier one affinity; comparing the second tier one affinity with the tier two affinity; and based at least in part on the comparison, initiating interdiction procedures in relation to the tier two affinity.
- 19. The method of claim 15, wherein the tier one affinity is a first tier one affinity, the method further comprising:
forming a second tier one affinity; comparing the second tier one affinity with the tier two affinity; and based at least in part on the comparison, generating a report indicating a result related to the comparison of the second tier one affinity with the tier two affinity at a defined period.
- 20. The method of claim 19, wherein the transaction package is a first transaction package, and wherein forming the second tier one affinity comprises:
receiving a second transaction package and a third transaction package; forming a second root node affinity associated with the second transaction package; forming a third root node affinity associated with the second transaction package; comparing the second root node affinity with the third root node affinity.
- 21. The method of claim 15, wherein the transaction package is a first transaction package, and wherein the root node affinity is a first root node affinity; the method further comprising:
receiving a second transaction package; forming a second root node affinity associated with the second transaction package; comparing the second root node affinity with the tier two affinity; based at least in part on the comparison, performing a function selected from a group consisting of:
generating a report indicating a result related to the comparison of the second root node affinity with the tier two affinity at a defined period; and initiating interdiction procedures in relation to the tier two affinity.
- 22. The method of claim 15, wherein the transaction package is a first transaction package, wherein the root node affinity is a first root node affinity, wherein the tier one affinity is a first tier one affinity; the method further comprising:
receiving a second transaction package; forming a second root node affinity associated with the second transaction package; comparing the second root node affinity with a second tier one affinity; based at least in part on the comparison, assimilating the second root node affinity with the second tier one affinity; comparing the second tier one affinity with the tier two affinity; based on the comparison of the second tier one affinity with the tier two affinity, performing a function selected from a group consisting of:
generating a report indicating a result related to the comparison of the second root node affinity with the tier two affinity at a defined period; and initiating interdiction procedures in relation to the tier two affinity.
- 23. A method for graduated evaluation of value transfer transactions, the method comprising:
receiving a first transaction package; receiving a second transaction package; receiving a third transaction package; receiving a fourth transaction package; forming a first root node affinity associated with the first transaction package; forming a second root node affinity associated with the second transaction package; forming a fourth root node affinity associated with the fourth transaction package; comparing the first root node affinity with the second root node affinity; based at least in part on the comparison of the first root node affinity with the second root node affinity, forming a first tier one affinity; comparing the first tier one affinity with the third root node affinity; based at least in part on the comparison of the first tier one affinity with the third root node affinity, converting the first tier one affinity to a tier two affinity; comparing the tier two affinity to the fourth root node affinity and to a second tier one affinity; based at least in part on the comparison of the tier two affinity to the fourth root node affinity and to a second tier one affinity, performing a function selected from a group consisting of:
generating a report indicating a result related to the comparison of the tier two affinity with the fourth root node affinity and the second tier one affinity; and initiating interdiction procedures in relation to the tier two affinity.
CROSS-REFERENCES TO RELATED APPLICATIONS
[0001] The present application is a Continuation-in-Part of U.S. patent application Ser. No. 10/091,000, entitled “Money Transfer Evaluation Systems and Methods”, and filed by Degen et al. on Mar. 4, 2002. The aforementioned patent application is assigned to an entity common herewith, and is incorporated herein by reference for all purposes.
Continuation in Parts (1)
|
Number |
Date |
Country |
Parent |
10091000 |
Mar 2002 |
US |
Child |
10434409 |
May 2003 |
US |