Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

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

Published: 09 June 2021 Publication History

Abstract

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.

References

[1]
Les E. Atlas, Toshiteru Homma, and Robert J. Marks. 1988. An artificial neural network for spatio-temporal bipolar patterns: Application to phoneme classification. In Neural Information Processing Systems, D. Z. Anderson (Ed.). American Institute of Physics, 31–40.
[2]
James Atwood and Don Towsley. 2015. Search-convolutional neural networks. CoRR abs/1511.02136 (2015). arxiv:1511.02136 http://arxiv.org/abs/1511.02136
[3]
Andrew D. Bagdanov and Marcel Worring. 2003. First order gaussian graphs for efficient structure classification. Pattern Recognition 36, 6 (2003), 1311–1324.
[4]
Ehsan Zare Borzeshi, Massimo Piccardi, Kaspar Riesen, and Horst Bunke. 2013. Discriminative prototype selection methods for graph embedding. Pattern Recognition 46, 6 (June 2013), 1648–1657.
[5]
Joan Bruna, Wojciech Zaremba, Arthur Szlam, and Yann LeCun. 2014. Spectral networks and locally connected networks on graphs. In Proceedings of the 2nd International Conference on Learning Representations (ICLR’14).
[6]
Horst Bunke. 1998. Error-tolerant graph matching: A formal framework and algorithms. In Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition (SSPR’98/SPR’98). Springer-Verlag, London, UK, 1–14.
[7]
Horst Bunke and G. Allermann. 1983. Inexact graph matching for structural pattern recognition. Pattern Recognition Letters 1, 4 (May 1983), 245–253.
[8]
Qi Chen, Wei Wang, Fangyu Wu, Suparna De, Ruili Wang, Bailing Zhang, and Xing Huang. 2019. A survey on an emerging area: Deep learning for smart city data. IEEE Transactions on Emerging Topics in Computational Intelligence 3, 5 (2019), 392–410.
[9]
David K. Y. Chiu and Andrew K. C. Wong. 1986. Synthesizing knowledge: A cluster analysis approach using event covering. IEEE Transactions on Systems, Man and Cybernetics 16, 2 (1986), 251–259.
[10]
Stephen A. Cook. 1971. The complexity of theorem-proving procedures. In Proceedings of the 3rd Annual ACM Symposium on Theory of Computing (STOC’71). ACM, New York, NY, 151–158.
[11]
Debora Donato, Stefano Leonardi, Stefano Millozzi, and Panayiotis Tsaparas. 2008. Mining the inner structure of the web graph. Journal of Physics A: Mathematical and Theoretical 41, 22 (2008), 224017.
[12]
Günes Erkan and Dragomir R. Radev. 2004. LexRank: Graph-based lexical centrality as salience in text summarization. Journal of Artificial Intelligence Research 22, 1 (Dec. 2004), 457–479.
[13]
Pedro F. Felzenszwalb and Daniel P. Huttenlocher. 2004. Efficient graph-based image segmentation. International Journal of Computer Vision 59, 2 (2004), 167–181.
[14]
Pasquale Foggia, Roberto Genna, and Mario Vento. 2000. Prototype learning with attributed relational graphs. In Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition. Springer-Verlag, London, UK, 447–456.
[15]
Simon Günter and Horst Bunke. 2002. Self-organizing map for clustering in the graph domain. Pattern Recognition Letters 23, 4 (2002), 405–417.
[16]
Markus Hagenbuchner, Shujia Zhang, Ah Chung Tsoi, and Alessandro Sperduti. 2009. Projection of undirected and non-positional graphs using self organizing maps. In Proceedings of 17th European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning. D-Side Publications, 559–564.
[17]
Jonathan Hayman and Tobias Heindel. 2013. Pattern graphs and rule-based models: The semantics of kappa. In Proceedings of 16th International Conference on Foundations of Software Science and Computation Structures (Lecture Notes in Computer Science), Frank Pfenning (Ed.), Vol. 7794. Springer, 1–16.
[18]
Adel Hlaoui and Shengrui Wang. 2002. A new algorithm for inexact graph matching. In Proceedings of the 16th International Conference on Pattern Recognition (ICPR’02). IEEE Computer Society, Washington, DC, 180–183.
[19]
Brijnesh J. Jain and Klaus Obermayer. 2010. Elkan’s K-means algorithm for graphs. In Proceedings of the 9th Mexican International Conference on Artificial Intelligence (MICAI’10), Vol. 6438. Springer-Verlag, Berlin, 22–32.
[20]
Xiaoyi Jiang, Andreas Müunger, and Horst Bunke. 2001. On median graphs: Properties, algorithms, and applications. IEEE Transactions on Pattern Analysis and Machine Intelligence 23, 10 (2001), 1144–1151.
[21]
Myunghwan Kim and Jure Leskovec. 2012. Latent multi-group membership graph model. CoRR abs/1205.4546 (2012). http://arxiv.org/abs/1205.4546
[22]
Yann Lecun, Leon Bottou, Yoshua Bengio, and Patrick Haffner. 1998. Gradient-based learning applied to document recognition. Proceedings of the IEEE 86 (1998), 2278–2324.
[23]
Mathias Niepert, Mohamed Ahmed, and Konstantin Kutzkov. 2016. Learning convolutional neural networks for graphs. In Proceedings of the 33rd International Conference on Machine Learning (JMLR Workshop and Conference Proceedings), Vol. 48. JMLR.org, 2014–2023.
[24]
Darwin Saire Pilco and Adín Ramírez Rivera. 2019. Graph Learning Network: A Structure Learning Algorithm. http://arxiv.org/abs/1905.12665
[25]
K. Riesen and H. Bunke. 2008. IAM graph database repository for graph based pattern recognition and machine learning. In Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition. 287–297.
[26]
Alberto Sanfeliu and King-Sun Fu. 1983. A distance measure between attributed relational graphs for pattern recognition. IEEE Transactions on Systems, Man and Cybernetics 13, 3 (May 1983), 353–362.
[27]
Alberto Sanfeliu, Francesc Serratosa, and René Alquézar. 2004. Second-order random graphs for modeling sets of attributed graphs and their application to object learning and recognition. International Journal on Pattern Recognition and Artificial Intelligence 18, 3 (2004), 375–396.
[28]
Venu Satuluri, Srinivasan Parthasarathy, and Duygu Ucar. 2010. Markov clustering of protein interaction networks with improved balance and scalability. In Proceedings of the 1st ACM International Conference on Bioinformatics and Computational Biology. ACM, 247–256.
[29]
Franco Scarselli, Marco Gori, Ah Chung Tsoi, Marcus Hagenbuchner, and Gabriele Monfardini. 2009. The graph neural network model. IEEE Transactions on Neural Networks 20, 1 (2009), 61–80.
[30]
Francesc Serratosa, René Alquézar, and Alberto Sanfeliu. 2003. Function-described graphs for modelling objects represented by sets of attributed graphs. Pattern Recognition 36, 3 (2003), 781–798.
[31]
Andrea Torsello and David L. Dowe. 2008. Learning a generative model for structural representations. In Proceedings of AI 2008: Advances in Artificial Intelligence, 21st Australasian Joint Conference on Artificial Intelligence. 573–583.
[32]
Wen-Hsiang Tsai and King-Sun Fu. 1979. Error-correcting isomorphisms of attributed relational graphs for pattern analysis. IEEE Transactions on Systems, Man, and Cybernetics 9, 12 (1979), 757–768.
[33]
Andrew K. C. Wong and Manlai You. 1985. Entropy and distance of random graphs with application to structural pattern recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence 7, 5 (1985), 599–609.
[34]
Bingbing Xu, Huawei Shen, Qi Cao, Yunqi Qiu, and Xueqi Cheng. 2019. Graph wavelet neural network. In Proceedings of the 7th International Conference on Learning Representations. https://openreview.net/forum?id=H1ewdiR5tQ
[35]
Qian Xu, Derek Hao Hu, Hong Xue, and Qiang Yang. 2010. Predicting chemical activities from structures by attributed molecular graph classification. In Proceedings of the 2010 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology. IEEE, 1–8.
[36]
T. Xu, D. Chiu, and I. Gondra. 2012. Constructing target concept in multiple instance learning using maximum partial entropy. In Proceedings of the 8th international Conference on Machine Learning and Data Mining in Pattern Recognition. 169–182.
[37]
Tao Xu, David K. Y. Chiu, and Iker Gondra. 2018. Common random subgraph modeling using multiple instance learning. In Proceedings of the 24th International Conference on Pattern Recognition (ICPR’18). 1205–1210.

Cited By

View all
  • (2023)Next Generation of Multi-Agent Driven Smart City Applications and Research ParadigmsIEEE Open Journal of the Communications Society10.1109/OJCOMS.2023.33105284(2104-2121)Online publication date: 2023
  • (2023)A survey on state-of-the-art computing for cyber-physical systems2ND INTERNATIONAL CONFERENCE ON RECENT ADVANCES IN COMPUTATIONAL TECHNIQUES10.1063/5.0150080(020001)Online publication date: 2023

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Internet Technology
ACM Transactions on Internet Technology  Volume 21, Issue 3
August 2021
522 pages
ISSN:1533-5399
EISSN:1557-6051
DOI:10.1145/3468071
  • Editor:
  • Ling Liu
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 June 2021
Accepted: 01 January 2021
Revised: 01 November 2020
Received: 01 July 2020
Published in TOIT Volume 21, Issue 3

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Smart city
  2. core activity
  3. subgraph pattern recognition
  4. random graphs
  5. multiple instance learning
  6. partial entropy
  7. graph embedding

Qualifiers

  • Research-article
  • Refereed

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)10
  • Downloads (Last 6 weeks)0
Reflects downloads up to 18 Aug 2024

Other Metrics

Citations

Cited By

View all
  • (2023)Next Generation of Multi-Agent Driven Smart City Applications and Research ParadigmsIEEE Open Journal of the Communications Society10.1109/OJCOMS.2023.33105284(2104-2121)Online publication date: 2023
  • (2023)A survey on state-of-the-art computing for cyber-physical systems2ND INTERNATIONAL CONFERENCE ON RECENT ADVANCES IN COMPUTATIONAL TECHNIQUES10.1063/5.0150080(020001)Online publication date: 2023

View Options

Get Access

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format.

HTML Format

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media