@christopher
You can imagine fraud on open social graphs with intents in an n*n matrix. Hottest paths lose.
Then do an embedding with the intents. Then apply k-means with a temporal blowoff.
Solves 95% of existing cases and apply isolation forest for the rest.
š
129 replies
3 recasts
489 reactions