A Graph Embedding Method Based on Opinion Dynamics
Pages 687 - 697
References
[1]
D. Warneke and C. Dannewitz. Load balancing in p2p networks: Using statistics to fight data and execution skew. Journal of Advances in Information Technology, 2(1), 2011.
[2]
S. Bhagat, G. Cormode, and S. Muthukrishnan. Node Classification in Social Networks. Computer Science, 2011.
[3]
The link prediction problem for social networks. Journal of the American Society for Information Science and Technology, 58(7), 2003.
[4]
C.H.Q. Ding, Xiaofeng He, Hongyuan Zha, Ming Gu, and H.D. Simon. A min-max cut algorithm for graph partitioning and data clustering. In Proceedings 2001 IEEE International Conference on Data Mining, pages 107–114, 2001.
[5]
S. Sugawara. An efficient version management for contents sharing by using file splitting and differences in hybrid peer-to-peer networks. Ieice Technical Report, 112:669–674, 2012.
[6]
P K Guha Thakurta, S. Basu, S. Goswami, and S. Bandyopadhyay. A new approach on cluster based call scheduling for mobile networks. Journal of Advances in Information Technology,3,3(2012-08-01), 3(3), 2012.
[7]
Laurens van der Maaten and Geoffrey Hinton. Visualizing data using t-sne. Journal of Machine Learning Research, 9(86):2579–2605, 2008.
[8]
St Roweis and Lk Saul. Nonlinear dimensionality reduction by locally linear embedding. Science, 290(5500):2323–2326, 2000.
[9]
A. Robles-Kelly. Segmentation via graph-spectral methods and riemannian geometry. In International Conference on Computer Analysis of Images & Patterns, 2005.
[10]
D. Luo, Chq Ding, F. Nie, and H. Huang. Cauchy graph embedding. In International Conference on International Conference on Machine Learning, 2011.
[11]
B. Shaw and T. Jebara. Structure preserving embedding. ACM, pages 1–8, 2009.
[12]
Amr Ahmed, Nino Shervashidze, Shravan Narayanamurthy, Vanja Josifovski, and Alexander J Smola. Distributed large-scale natural graph factorization. In Proceedings of the 22nd international conference on World Wide Web, pages 37–48, 2013.
[13]
Shaosheng Cao, Wei Lu, and Qiongkai Xu. Grarep: Learning graph representations with global structural information. In Proceedings of the 24th ACM International on Conference on Information and Knowledge Management, CIKM ’15, page 891–900, New York, NY, USA, 2015. Association for Computing Machinery.
[14]
Mingdong Ou, Peng Cui, Jian Pei, Ziwei Zhang, and Wenwu Zhu. Asymmetric transitivity preserving graph embedding. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’16, page 1105–1114, New York, NY, USA, 2016. Association for Computing Machinery.
[15]
F. Fouss, A. Pirotte, J. M. Renders, and M. Saerens. Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Transactions on Knowledge and Data Engineering, 19:p.355–369, 2007.
[16]
Mej Newman. A measure of betweenness centrality based on random walks. Social Networks, 27(1):39–54, 2003.
[17]
Aditya Grover and Jure Leskovec. Node2vec: Scalable feature learning for networks. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’16, page 855–864, New York, NY, USA, 2016. Association for Computing Machinery.
[18]
Bryan Perozzi, Rami Al-Rfou, and Steven Skiena. Deepwalk: Online learning of social representations. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’14, page 701–710, New York, NY, USA, 2014. Association for Computing Machinery.
[19]
N. E. Friedkin and E. C. Johnsen. Social influence and opinions. Journal of Mathematical Sociology, 15(3-4):193–206, 1990.
[20]
R. Hegselmann. Opinion dynamics and bounded confidence models, analysis and simulation. Journal of Artificial Societies & Social Simulation, 5(3):2, 2002.
[21]
Guillaume Deffuant, David Neau, Frederic Amblard, and G´erard Weisbuch. Mixing beliefs among interacting agents. Adv. Complex Syst., 3(1–4):87–98, 2000.
[22]
R. B. Cialdini and N. J. Goldstein. Social influence: Compliance and conformity. Annual Review of Psychology, 55(1):591–621, 2004.
[23]
Z. Bu, Hui Jia Li, C. Zhang, J. Cao, Anhua Li, and Y. Shi. Graph k-means based on leader identification, dynamic game and opinion dynamics. IEEE Transactions on Knowledge and Data Engineering, pages 1–1, 2019.
[24]
Petar Velikovi, G. Cucurull, A. Casanova, A. Romero, P Lio`, and Y. Bengio. Graph attention networks. 2018.
[25]
J. Bruna, W. Zaremba, A. Szlam, and Y. Lecun. Spectral networks and locally connected networks on graphs. Computer Science, 2013.
[26]
M. Henaff, J. Bruna, and Y. Lecun. Deep convolutional networks on graph-structured data. Computer Science, 2015.
[27]
Michal Defferrard, X. Bresson, and P. Vandergheynst. Convolutional neural networks on graphs with fast localized spectral filtering. 2016.
[28]
Thomas N Kipf and Max Welling. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907, 2017.
[29]
B. Xu, H. Shen, Q. Cao, Y. Qiu, and X.Cheng. Graph wavelet neural network. 2019.
[30]
D. Duvenaud, D. Maclaurin, J. Aguilera-Iparraguirre, R G´omez-Bombarelli, T. Hirzel, A. AspuruGuzik, and Ryan P Adams. Convolutional networks on graphs for learning molecular fingerprints. MIT Press, 2015.
[31]
Mathias Niepert, Mohamed Ahmed, and Konstantin Kutzkov. Learning convolutional neural networks for graphs. In International conference on machine learning, pages 2014–2023. PMLR, 2016.
[32]
F. Monti, D. Boscaini, J. Masci, E. Rodola, and M. M. Bronstein. Geometric deep learning on graphs and manifolds using mixture model cnns.2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2017.
[33]
Prithviraj Sen, Galileo Namata, Mustafa Bilgic, Lise Getoor, Brian Galligher, and Tina EliassiRad. Collective classification in network data. AI magazine, 29(3):93–93, 2008.
[34]
Zhilin Yang, William Cohen, and Ruslan Salakhudinov. Revisiting semi-supervised learning with graph embeddings. In International conference on machine learning, pages 40–48. PMLR, 2016.
[35]
Bryan Perozzi, Rami Al-Rfou, and Steven Skiena. Deepwalk: Online learning of social representations. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’14, page 701–710, New York, NY, USA, 2014. Association for Computing Machinery.
[36]
D. Kingma and J. Ba. Adam: A method for stochastic optimization. Computer Science, 2014.
[37]
Xavier Glorot and Yoshua Bengio. Understanding the difficulty of training deep feedforward neural networks. In Proceedings of the thirteenth international conference on artificial intelligence and statistics, pages 249–256. JMLR Workshop and Conference Proceedings, 2010.
[38]
Van Der Maaten Laurens and Geoffrey Hinton. Visualizing data using t-sne. Journal of Machine Learning Research, 9(2605):2579–2605, 2008.
Index Terms
- A Graph Embedding Method Based on Opinion Dynamics
Index terms have been assigned to the content through auto-classification.
Recommendations
SGCN: A Graph Sparsifier Based on Graph Convolutional Networks
Advances in Knowledge Discovery and Data MiningAbstractGraphs are ubiquitous across the globe and within science and engineering. With graphs growing in size, node classification on large graphs can be space and time consuming, even with powerful classifiers such as Graph Convolutional Networks (GCNs)...
A Knowledge Graph Embedding Model Based on Node-Relation Fusion Perception
ICNCC '20: Proceedings of the 2020 9th International Conference on Networks, Communication and ComputingAlthough modeling graph structure data with graph convolution network has become a hot research topic in recent years, the research subject in most papers are simple undirected graphs while the multi-relational ones, for example, knowledge graphs, of ...
Knowledge Graph Embedding: A Locally and Temporally Adaptive Translation-Based Approach
A knowledge graph is a graph with entities of different types as nodes and various relations among them as edges. The construction of knowledge graphs in the past decades facilitates many applications, such as link prediction, web search analysis, ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
September 2021
715 pages
ISBN:9781450384087
DOI:10.1145/3488933
Copyright © 2021 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 the author(s) 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: 25 February 2022
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
AIPR 2021
AIPR 2021: 2021 4th International Conference on Artificial Intelligence and Pattern Recognition
September 24 - 26, 2021
Xiamen, China
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 89Total Downloads
- Downloads (Last 12 months)22
- Downloads (Last 6 weeks)0
Reflects downloads up to 19 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format