skip to main content
10.1145/3178876.3186116acmotherconferencesArticle/Chapter ViewAbstractPublication PageswwwConference Proceedingsconference-collections
research-article
Free Access

Dual Graph Convolutional Networks for Graph-Based Semi-Supervised Classification

Published:23 April 2018Publication History

ABSTRACT

The problem of extracting meaningful data through graph analysis spans a range of different fields, such as the internet, social networks, biological networks, and many others. The importance of being able to effectively mine and learn from such data continues to grow as more and more structured data become available. In this paper, we present a simple and scalable semi-supervised learning method for graph-structured data in which only a very small portion of the training data are labeled. To sufficiently embed the graph knowledge, our method performs graph convolution from different views of the raw data. In particular, a dual graph convolutional neural network method is devised to jointly consider the two essential assumptions of semi-supervised learning: (1) local consistency and (2) global consistency. Accordingly, two convolutional neural networks are devised to embed the local-consistency-based and global-consistency-based knowledge, respectively. Given the different data transformations from the two networks, we then introduce an unsupervised temporal loss function for the ensemble. In experiments using both unsupervised and supervised loss functions, our method outperforms state-of-the-art techniques on different datasets.

References

  1. Reid Andersen, Fan Chung, and Kevin Lang. 2006. Local graph partitioning using pagerank vectors. In the 47th Annual IEEE Symposium on Foundations of Computer Science. 475--486. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. James Atwood and Don Towsley. 2016. Diffusion-convolutional neural networks. In Advances in Neural Information Processing Systems. 1993--2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Mikhail Belkin, Partha Niyogi, and Vikas Sindhwani. 2006. Manifold regularization: A geometric framework for learning from labeled and unlabeled examples. Journal of machine learning research Vol. 7, Nov (2006), 2399--2434. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. John A Bullinaria and Joseph P Levy. 2007. Extracting semantic representations from word co-occurrence statistics: A computational study. Behavior research methods Vol. 39, 3 (2007), 510--526.Google ScholarGoogle Scholar
  5. Deng Cai, Xiaofei He, Jiawei Han, and Thomas S Huang. 2011. Graph regularized nonnegative matrix factorization for data representation. IEEE Transactions on Pattern Analysis and Machine Intelligence Vol. 33, 8 (2011), 1548--1560. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Andrew Carlson, Justin Betteridge, Bryan Kisiel, Burr Settles, Estevam R Hruschka Jr, and Tom M Mitchell. 2010. Toward an Architecture for Never-Ending Language Learning Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, Vol. Vol. 5. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Bhavana Dalvi, Aditya Mishra, and William W Cohen. 2016. Hierarchical semi-supervised classification with incomplete class hierarchies Proceedings of the Ninth ACM International Conference on Web Search and Data Mining. 193--202. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Maximilien Danisch, T-H Hubert Chan, and Mauro Sozio. 2017. Large Scale Density-friendly Graph Decomposition via Convex Programming Proceedings of the 26th International Conference on World Wide Web. 233--242. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Michaël Defferrard, Xavier Bresson, and Pierre Vandergheynst. 2016. Convolutional neural networks on graphs with fast localized spectral filtering Advances in Neural Information Processing Systems. 3844--3852. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Franccois Fouss, Kevin Francoisse, Luh Yen, Alain Pirotte, and Marco Saerens. 2012. An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification. Neural networks Vol. 31 (2012), 53--72. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Francois Fouss, Alain Pirotte, Jean-Michel Renders, and Marco Saerens. 2007. Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Transactions on knowledge and data engineering Vol. 19, 3 (2007), 355--369. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. David K Hammond, Pierre Vandergheynst, and Rémi Gribonval. 2011. Wavelets on graphs via spectral graph theory. Applied and Computational Harmonic Analysis Vol. 30, 2 (2011), 129--150.Google ScholarGoogle ScholarCross RefCross Ref
  13. Mikael Henaff, Joan Bruna, and Yann LeCun. 2015. Deep convolutional networks on graph-structured data. arXiv preprint arXiv:1506.05163 (2015).Google ScholarGoogle Scholar
  14. Ming Ji, Yizhou Sun, Marina Danilevsky, Jiawei Han, and Jing Gao. 2010. Graph regularized transductive classification on heterogeneous information networks Joint European Conference on Machine Learning and Knowledge Discovery in Databases. 570--586. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Thomas N Kipf and Max Welling. 2017. Semi-supervised classification with graph convolutional networks Proceedings of the 5th International Conference on Learning Representations. 1--14.Google ScholarGoogle Scholar
  16. Omer Levy and Yoav Goldberg. 2014. Neural word embedding as implicit matrix factorization Advances in neural information processing systems. 2177--2185. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Laurens van der Maaten and Geoffrey Hinton. 2008. Visualizing data using t-SNE. Journal of Machine Learning Research Vol. 9, Nov (2008), 2579--2605.Google ScholarGoogle Scholar
  18. Tomas Mikolov, Ilya Sutskever, Kai Chen, Greg S Corrado, and Jeff Dean. 2013. Distributed representations of words and phrases and their compositionality Advances in neural information processing systems. 3111--3119. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Maximilian Nickel, Kevin Murphy, Volker Tresp, and Evgeniy Gabrilovich. 2016. A review of relational machine learning for knowledge graphs. Proc. IEEE Vol. 104, 1 (2016), 11--33.Google ScholarGoogle ScholarCross RefCross Ref
  20. Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. 1999. The PageRank citation ranking: Bringing order to the web. Technical Report. Stanford InfoLab.Google ScholarGoogle Scholar
  21. Bryan Perozzi, Rami Al-Rfou, and Steven Skiena. 2014. Deepwalk: Online learning of social representations Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining. 701--710. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Sebastian Ruder. 2016. An overview of gradient descent optimization algorithms. arXiv preprint arXiv:1609.04747 (2016).Google ScholarGoogle Scholar
  23. Mehdi Sajjadi, Mehran Javanmardi, and Tolga Tasdizen. 2016. Regularization with stochastic transformations and perturbations for deep semi-supervised learning. In Advances in Neural Information Processing Systems. 1163--1171. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. David I Shuman, Sunil K Narang, Pascal Frossard, Antonio Ortega, and Pierre Vandergheynst. 2013. The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains. IEEE Signal Processing Magazine Vol. 30, 3 (2013), 83--98.Google ScholarGoogle ScholarCross RefCross Ref
  25. Milivoj Simeonovski, Giancarlo Pellegrino, Christian Rossow, and Michael Backes. 2017. Who Controls the Internet?: Analyzing Global Threats using Property Graph Traversals. In Proceedings of the 26th International Conference on World Wide Web. 647--656. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Nitish Srivastava, Geoffrey E Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdinov. 2014. Dropout: a simple way to prevent neural networks from overfitting. Journal of machine learning research Vol. 15, 1 (2014), 1929--1958. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Jian Tang, Meng Qu, Mingzhe Wang, Ming Zhang, Jun Yan, and Qiaozhu Mei. 2015. Line: Large-scale information network embedding. In Proceedings of the 24th International Conference on World Wide Web. 1067--1077. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Peter D Turney and Patrick Pantel. 2010. From frequency to meaning: Vector space models of semantics. Journal of artificial intelligence research Vol. 37 (2010), 141--188. Google ScholarGoogle ScholarCross RefCross Ref
  29. Derry Wijaya, Partha Pratim Talukdar, and Tom Mitchell. 2013. Pidgin: ontology alignment using web text as interlingua Proceedings of the 22nd ACM international conference on Information & Knowledge Management. 589--598. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Zhilin Yang, William W Cohen, and Ruslan Salakhutdinov. 2016. Revisiting semi-supervised learning with graph embeddings Proceedings of the 33rd International Conference on Machine Learning. 1--9. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Wayne W Zachary. 1977. An information flow model for conflict and fission in small groups. Journal of anthropological research Vol. 33, 4 (1977), 452--473.Google ScholarGoogle ScholarCross RefCross Ref
  32. Denny Zhou, Olivier Bousquet, Thomas N Lal, Jason Weston, and Bernhard Schölkopf. 2004. Learning with local and global consistency. In Advances in neural information processing systems. 321--328. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Xiaojin Zhu, Zoubin Ghahramani, and John D Lafferty. 2003. Semi-supervised learning using gaussian fields and harmonic functions Proceedings of the 20th International conference on Machine learning. 912--919. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Dual Graph Convolutional Networks for Graph-Based Semi-Supervised Classification

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      WWW '18: Proceedings of the 2018 World Wide Web Conference
      April 2018
      2000 pages
      ISBN:9781450356398

      Copyright © 2018 ACM

      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

      International World Wide Web Conferences Steering Committee

      Republic and Canton of Geneva, Switzerland

      Publication History

      • Published: 23 April 2018

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      WWW '18 Paper Acceptance Rate170of1,155submissions,15%Overall Acceptance Rate1,899of8,196submissions,23%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    HTML Format

    View this article in HTML Format .

    View HTML Format