Mining outliers in graph data is a rapidly growing area of research. Traditional methods focus either on static graphs, or restrict relationships to be pairwise. In this work we address both of these limitations directly, and propose the first approach for mining outliers in hyperedge streams. Hyperedges, which generalize edges, faithfully capture higher order relationships that naturally occur in complex systems. Our model annotates every incoming hyperedge with an outlier score, which is based on the incident vertices and the historical relationships among them. Additionally, we describe an approximation scheme that ensures our model is suitable for being run in streaming environments. Experimental results on several real-world datasets show our model effectively identifies outliers, and that our approximation provides speedups between 33–775x.
CITATION STYLE
Ranshous, S., Chaudhary, M., & Samatova, N. F. (2018). Efficient outlier detection in hyperedge streams using minhash and locality-sensitive hashing. In Studies in Computational Intelligence (Vol. 689, pp. 105–116). Springer Verlag. https://doi.org/10.1007/978-3-319-72150-7_9
Mendeley helps you to discover research relevant for your work.