3 October 2022 in IEEE Access
Graphs are used widely to model complex systems, and detecting anomalies in a graph is an important task in the analysis of complex systems. Graph anomalies are patterns in a graph that do not conform to normal patterns expected of the attributes and/or structures of the graph. In recent years, graph neural networks (GNNs) have been studied extensively and have successfully performed difficult machine learning tasks in node classification, link prediction, and graph classification thanks to the highly expressive capability via message passing in effectively learning graph representations. To solve the graph anomaly detection problem, GNN-based methods leverage information about the graph attributes (or features) and/or structures to learn to score anomalies appropriately. In this survey, we review the recent advances made in detecting graph anomalies using GNN models. Specifically, we summarize GNN-based methods according to the graph type (i.e., static and dynamic), the anomaly type (i.e., node, edge, subgraph, and whole graph), and the network architecture (e.g., graph autoencoder, graph convolutional network). To the best of our knowledge, this survey is the first comprehensive review of graph anomaly detection methods based on GNNs.
8 October 2018 in IEEE Transactions on Knowledge and Data Engineering
This paper proposes LinkBlackHole*, a novel algorithm for finding communities that are (i) overlapping in nodes and (ii) mixing (not separating clearly) in links. There has been a small body of work in each category, but this paper is the first one that addresses both. LinkBlackHole* is a merger of our earlier two algorithms, LinkSCAN* and BlackHole, inheriting their advantages in support of highly-mixed overlapping communities. The former is used to handle overlapping nodes, and the latter to handle mixing links in finding communities. Like LinkSCAN and its more efficient variant LinkSCAN*, this paper presents LinkBlackHole and its more efficient variant LinkBlackHole*, which reduces the number of links through random sampling. Thorough experiments show superior quality of the communities detected by LinkBlackHole* and LinkBlackHole to those detected by other state-of-the-art algorithms. In addition, LinkBlackHole* shows high resilience to the link sampling effect, and its running time scales up almost linearly with the number of links in a network.
19 November 2021 in SN Computer Science
14 April 2022 in IEEE Transactions on Intelligent Transportation Systems
This paper presents the design and analysis of an automated traffic signage inventory management system employing the radio-frequency identification (RFID) technology. Traffic signage inventory management faces the operational challenge of recognizing a large number of traffic signs spread in a large area without obvious identifications on them. Thanks to the remote sensing ability of RFID, the operational efficiency can be significantly improved by scanning traffic signs remotely in motion. The system consists of an in-vehicle RFID reader and a handheld RFID reader, both of which connect to mobile applications with user-friendly interfaces. Additionally, user-friendly control software and a database are developed. In this paper, the adequacy of the RFID technology for the task is assessed. On the theoretical side, this paper investigates the radio-wave propagation model and the antenna radiation range. Additionally, the influences of the vehicle speed and the sign-to-reader distance on the reading performance are studied and empirical tests of the tag positioning are conducted. Finally, a system protocol is validated by a field test.
7 March 2024 in Machine Learning with Applications