A survey on graph kernels
Graph kernels have become an established and widely-used technique for solving
classification tasks on graphs. This survey gives a comprehensive overview of techniques …
classification tasks on graphs. This survey gives a comprehensive overview of techniques …
Fighting opinion control in social networks via link recommendation
V Amelkin, AK Singh - Proceedings of the 25th ACM SIGKDD …, 2019 - dl.acm.org
The process of opinion formation is inherently a network process, with user opinions in a
social network being driven to a certain average opinion. One simple and intuitive …
social network being driven to a certain average opinion. One simple and intuitive …
Toward online node classification on streaming networks
The proliferation of networked data in various disciplines motivates a surge of research
interests on network or graph mining. Among them, node classification is a typical learning …
interests on network or graph mining. Among them, node classification is a typical learning …
Temporal graph kernels for classifying dissemination processes
Many real-world graphs are temporal, eg, in a social network persons only interact at
specific points in time. This temporality directs possible dissemination processes on the …
specific points in time. This temporality directs possible dissemination processes on the …
Fasten: Fast sylvester equation solver for graph mining
The Sylvester equation offers a powerful and unifying primitive for a variety of important
graph mining tasks, including network alignment, graph kernel, node similarity, subgraph …
graph mining tasks, including network alignment, graph kernel, node similarity, subgraph …
Everything evolves in personalized pagerank
Personalized PageRank, as a graphical model, has been proven as an effective solution in
many applications such as web page search, recommendation, etc. However, in the real …
many applications such as web page search, recommendation, etc. However, in the real …
A spectral method for unsupervised multi-document summarization
K Wang, B Chang, Z Sui - Proceedings of the 2020 Conference on …, 2020 - aclanthology.org
Multi-document summarization (MDS) aims at producing a good-quality summary for several
related documents. In this paper, we propose a spectral-based hypothesis, which states that …
related documents. In this paper, we propose a spectral-based hypothesis, which states that …
Network connectivity optimization: Fundamental limits and effective algorithms
Network connectivity optimization, which aims to manipulate network connectivity by
changing its underlying topology, is a fundamental task behind a wealth of high-impact data …
changing its underlying topology, is a fundamental task behind a wealth of high-impact data …
The child is father of the man: Foresee the success at the early stage
Understanding the dynamic mechanisms that drive the high-impact scientific work (eg,
research papers, patents) is a long-debated research topic and has many important …
research papers, patents) is a long-debated research topic and has many important …
Classifying dissemination processes in temporal graphs
Many real-world graphs are temporal, for example, in a social network, persons only interact
at specific points in time. This temporal information directs dissemination processes on the …
at specific points in time. This temporal information directs dissemination processes on the …