arrow
Return

Random Graph-based Multiple Instance Learning for Structured IoT Smart City Applications

delete2021-06-09
delete2
PRE
AI
D
David Chiu *
T
Tao Xu
I
Iker Gondra
DOI:10.1145/3448611delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Because of the complex activities involved in IoT networks of a smart city, an important question arises: What are the core activities of the networks as a whole and its basic information flow structure? Identifying and discovering core activities and information flow is a crucial step that can facilitate the analysis. This is the question we are addressing-that is, to identify the core services as a common core substructure despite the probabilistic nature and the diversity of its activities. If this common substructure can be discovered, a systemic analysis and planning can then be performed and key policies related to the community can be developed. Here, a local IoT network can be represented as an attributed graph. From an ensemble of attributed graphs, identifying the common subgraph pattern is then critical in understanding the complexity. We introduce this as the common random subgraph (CRSG) modeling problem, aiming at identifying a subgraph pattern that is the structural core that conveys the probabilistically distributed graph characteristics. Given an ensemble of network samples represented as attributed graphs, the method generates a CRSG model that encompasses both structural and statistical characteristics from the related samples while excluding unrelated networks. In generating a CRSG model, our method using a multiple instance learning algorithm transforms an attributed graph (composed of structural elements as edges and their two endpoints) into a bag of instances in a vector space. Common structural components across positively labeled graphs are then identified as the common instance patterns among instances across different bags. The structure of the CRSG arises through the combining of common patterns. The probability distribution of the CRSG can then be estimated based on the connections and distributions from the common elements. Experimental results demonstrate that CRSG models are highly expressive in describing typical network characteristics.
Keywords:
Smart city
core activity
subgraph pattern recognition
random graphs
multiple instance learning
partial entropy
graph embedding
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

ACM Transactions on Internet Technology cover
ACM Transactions on Internet Technology
IF:
4.1
Papers:
896
Citations:
1.9K

Organization

S
saint francis xavier university - canada
Scholars:
761
Papers: 911
Citations: 0
U
University of Guelph
Scholars:
1.3W
Papers: 1.2W
Citations: 1.7W
Cited Papers

Cited Papers

Discriminative prototype selection methods for graph embedding
err2013-06-01
err42
errOAAI
errBorzeshi, Ehsan Zare; Piccardi, Massimo; Riesen, Kaspar; Bunke, Horst
errShare
errSave
Atmospheric History of H2 Over the Past Century Reconstructed From South Pole Firn Air
err2020-07-16
err0
errOAAI
errJ. D. Patterson; M. Aydin; A. M. Crotwell; G. Petron; J. P. Severinghaus; E. S. Saltzman
errShare
errSave
STAT1 represses hypoxia-inducible factor-1-mediated transcription
err2009-10-01
err0
PREAI
errMiki Hiroi; Kazumasa Mori; Yoshiichi Sakaeda; Jun Shimada; Yoshihiro Ohmori
errShare
errSave
Visible-Light Photoredox and Palladium Dual Catalysis in Organic Synthesis
err2020-01-01
err0
errOAAI
errWenjun Zhou; Yuanxu Jiang; Liang Chen; Kaixing Liu; Dagang Yu
errShare
errSave
Gradient-based learning applied to document recognition
err1998-01-01
err3.8W
PREAI
errLecun, Y; Bottou, L; Bengio, Y; Haffner, P
errShare
errSave
Efficient graph-based image segmentation
err2004-09-01
err4.9K
PREAI
errFelzenszwalb, PF; Huttenlocher, DP
errShare
errSave
researcher View more