Vertex Nomination via Content and Context
Glen A. Coppersmith, Carey E. Priebe

TL;DR
This paper introduces a vertex nomination method combining content and context in attributed communication graphs to identify interesting or suspicious actors, demonstrated on the Enron email dataset.
Contribution
It develops a joint model leveraging both communication content and network structure, improving vertex nomination accuracy over models using only one source.
Findings
Joint content and context modeling enhances nomination performance.
Experimental results on Enron data validate the approach.
Content-only or context-only models perform worse than combined models.
Abstract
If I know of a few persons of interest, how can a combination of human language technology and graph theory help me find other people similarly interesting? If I know of a few people committing a crime, how can I determine their co-conspirators? Given a set of actors deemed interesting, we seek other actors who are similarly interesting. We use a collection of communications encoded as an attributed graph, where vertices represents actors and edges connect pairs of actors that communicate. Attached to each edge is the set of documents wherein that pair of actors communicate, providing content in context - the communication topic in the context of who communicates with whom. In these documents, our identified interesting actors communicate amongst each other and with other actors whose interestingness is unknown. Our objective is to nominate the most likely interesting vertex from all…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Image Retrieval and Classification Techniques · Machine Learning and Algorithms
