Fetching the paper…
Reading the bibliography…
Considering the wide application of network embedding methods in graph data mining, inspired by the adversarial attack in deep learning, this paper proposes a Genetic Algorithm (GA) based Euclidean Distance Attack strategy (EDA) to attack the network embedding, so as to prevent certain structural information from being discovered.
A.-L. Barabási and R. Albert, “Emergence of scaling in random networks,” science , vol. 286, no. 5439, pp. 509–512, 1999
1999
Earlier work this paper cites.
A. K. McCallum, K. Nigam, J. Rennie, and K. Seymore, “Automating the construction of internet portals with machine learning,” Information Retrieval , vol. 3, no. 2, pp. 127–163, 2000
2000
Earlier work this paper cites.
S. Dreiseitl and L. Ohno-Machado, “Logistic regression and artificial neural network classification models: a methodology review,” Journal of biomedical informatics , vol. 35, no. 5-6, pp. 352–359, 2002
2002
Earlier work this paper cites.
F. Morin and Y. Bengio, “Hierarchical probabilistic neural network language model.” in Aistats , vol. 5. Citeseer, 2005, pp. 246–252
2005
Earlier work this paper cites.
R. Andersen, F. Chung, and K. Lang, “Local graph partitioning using pagerank vectors,” in null . IEEE, 2006, pp. 475–486
2006
Earlier work this paper cites.
M. E. Newman, “Modularity and community structure in networks,” Proceedings of the national academy of sciences , vol. 103, no. 23, pp. 8577–8582, 2006
2006
Earlier work this paper cites.
D. Liben-Nowell and J. Kleinberg, “The link-prediction problem for social networks,” Journal of the American society for information science and technology , vol. 58, no. 7, pp. 1019–1031, 2007
2007
Earlier work this paper cites.
U. N. Raghavan, R. Albert, and S. Kumara, “Near linear time algorithm to detect community structures in large-scale networks,” Physical review E , vol. 76, no. 3, p. 036106, 2007
2007
Earlier work this paper cites.
R. Collobert and J. Weston, “A unified architecture for natural language processing: Deep neural networks with multitask learning,” in Proceedings of the 25th international conference on Machine learning . ACM, 2008, pp. 160–167
2008
Earlier work this paper cites.
A. Mnih and G. E. Hinton, “A scalable hierarchical distributed language model,” in Advances in neural information processing systems , 2009, pp. 1081–1088
2009
Earlier work this paper cites.
S. Fortunato, “Community detection in graphs,” Physics reports , vol. 486, no. 3-5, pp. 75–174, 2010
2010
Earlier work this paper cites.
R. Ghosh and K. Lerman, “Community detection using a measure of global influence,” in Advances in Social Network Mining and Analysis . Springer, 2010, pp. 20–35
2010
Earlier work this paper cites.
L. Tang and H. Liu, “Leveraging social media networks for classification,” Data Mining and Knowledge Discovery , vol. 23, no. 3, pp. 447–478, 2011
2011
Earlier work this paper cites.
S. Bhagat, G. Cormode, and S. Muthukrishnan, “Node classification in social networks,” in Social network data analytics . Springer, 2011, pp. 115–148
2011
Earlier work this paper cites.
Y. Bengio, A. Courville, and P. Vincent, “Representation learning: A review and new perspectives,” IEEE transactions on pattern analysis and machine intelligence , vol. 35, no. 8, pp. 1798–1828, 2013
2013
Earlier work this paper cites.
2013
Cited alongside, same era.
2013
Cited alongside, same era.
T. Mikolov, I. Sutskever, K. Chen, G. S. Corrado, and J. Dean, “Distributed representations of words and phrases and their compositionality,” in Advances in neural information processing systems , 2013, pp. 3111–3119
2013
Cited alongside, same era.
B. Perozzi, R. Al-Rfou, and S. Skiena, “Deepwalk: Online learning of social representations,” in Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining . ACM, 2014, pp. 701–710
2014
Cited alongside, same era.
X. Wang, P. Cui, J. Wang, J. Pei, W. Zhu, and S. Yang, “Community preserving network embedding,” in Thirty-First AAAI Conference on Artificial Intelligence , 2017
2017
Later among the works it cites.
Y.-A. Lai, C.-C. Hsu, W. H. Chen, M.-Y. Yeh, and S.-D. Lin, “Prune: Preserving proximity and global ranking for network embedding,” in Advances in Neural Information Processing Systems 30 , I. Guyon, U. V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett, Eds. Curran Associates, Inc., 2017, pp. 5257–5266. [Online]. Available: http://papers.nips.cc/paper/7110-prune-preserving-proximity-and-global-ranking-for-network-embedding.pdf
2017
Later among the works it cites.
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. Tang, M. Qu, M. Wang, M. Zhang, J. Yan, and Q. Mei, “Line: Large-scale information network embedding,” in Proceedings of the 24th International Conference on World Wide Web . International World Wide Web Conferences Steering Committee, 2015, pp. 1067–1077
2015
Cited alongside, same era.
A.-L. Barabási et al. , Network science . Cambridge university press, 2016
2016
Cited alongside, same era.
N. Papernot, P. McDaniel, S. Jha, M. Fredrikson, Z. B. Celik, and A. Swami, “The limitations of deep learning in adversarial settings,” in Security and Privacy (EuroS&P), 2016 IEEE European Symposium on . IEEE, 2016, pp. 372–387
2016
Cited alongside, same era.
2016
Cited alongside, same era.
S. Fortunato and D. Hric, “Community detection in networks: A user guide,” Physics reports , vol. 659, pp. 1–44, 2016
2016
Cited alongside, same era.
J. Tang, C. Aggarwal, and H. Liu, “Node classification in signed social networks,” in Proceedings of the 2016 SIAM International Conference on Data Mining . SIAM, 2016, pp. 54–62
2016
Cited alongside, same era.
A. Grover and J. Leskovec, “node2vec: Scalable feature learning for networks,” in Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining . ACM, 2016, pp. 855–864
2016
Cited alongside, same era.
A. Beveridge and J. Shan, “Network of thrones,” Math Horizons , vol. 23, no. 4, pp. 18–22, 2016
2016
Cited alongside, same era.
2018
Later among the works it cites.
D. Zügner, A. Akbarnejad, and S. Günnemann, “Adversarial attacks on neural networks for graph data,” in Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining . ACM, 2018, pp. 2847–2856
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
X. Liu, C. Shen, X. Guan, and Y. Zhou, “We know who you are: Discovering similar groups across multiple social networks,” IEEE Transactions on Systems, Man, and Cybernetics: Systems , no. 99, pp. 1–12, 2018
2018
Later among the works it cites.
L. Faramondi, G. Oliva, S. Panzieri, F. Pascucci, M. Schlueter, M. Munetomo, and R. Setola, “Network structural vulnerability: a multiobjective attacker perspective,” IEEE Transactions on Systems, Man, and Cybernetics: Systems , no. 99, pp. 1–14, 2018
2018
Later among the works it cites.
M. Waniek, T. P. Michalak, M. J. Wooldridge, and T. Rahwan, “Hiding individuals and communities in a social network,” Nature Human Behaviour , vol. 2, no. 2, p. 139, 2018
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
J. Qiu, Y. Dong, H. Ma, J. Li, K. Wang, and J. Tang, “Network embedding as matrix factorization: Unifying deepwalk, line, pte, and node2vec,” in Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining . ACM, 2018, pp. 459–467
2018
Later among the works it cites.
R. Hong, Y. He, L. Wu, Y. Ge, and X. Wu, “Deep attributed network embedding by preserving structure and attribute information,” IEEE Transactions on Systems, Man, and Cybernetics: Systems , 2019
2019
Closest in time.