Ming K Lin, 422482 NW 9Th Ter, Cape Coral, FL 33993

2016035, Dec 1, 2016

May 28, 2016

15/167992

- Mountain View CA, US
- Kent OH, US
Ming Lin - Great Neck NY, US
Nicholas Tietz - Kent OH, US

G06N 5/04
G06F 17/30

Systems and methods for generating real-time, personalized recommendations are disclosed. In one embodiment, a method operates upon an electronic data collection organized as a network of vertices and edge connections between the vertices. The method provides the recommendations includes iteratively traversing across edges that satisfy search criteria to a new set of vertices and filtering each new set of vertices to satisfy the search criteria. At the conclusion of the traversing and filtering, a final set of vertices represents the recommended entities. In some embodiments, a control vector describes a sequence of relationships between a requester and the items to be recommended. The method can assign scores to candidate recommendations and select the recommendations having the highest scores. Advantageously, the method provides flexibility and rapid execution of recommendation queries without the need to precompute intermediate results.

2015037, Dec 31, 2015

Jun 25, 2015

14/750743

- Mountain View CA, US
Ming Lin - Great Neck NY, US
Yu Xu - Mountain View CA, US
Adam P. Anthony - Kent OH, US
Victor E. Lee - Kent OH, US

G06Q 20/40
G06F 17/30

Systems and methods for enhanced detection of fraudulent electronic transactions are disclosed. In one embodiment, a system uses the ongoing stream of transactions to construct and maintain a dynamically evolving merchant relationship graph. When a proposed transaction is submitted to the system, the system computes a predicted likelihood that the given account would make a transaction with these characteristics with the given merchant. The graph is used to compute transitive relatedness between merchants which may be indirectly associated with one another, as well as to compute aggregate relatedness, when there are multiple avenues of relationship between two merchants.