activity
20162018
most citedUnsupervised Abstractive Meeting Summarization with Multi-Sentence Compression and Budgeted Submodular Maximization

16 citations · 24 across the 3 of their papers we have counts for

collaborators

5 papers

cs.CL2018★ 8 cited

Word Embeddings from Large-Scale Greek Web Content

Stamatis Outsios, Konstantinos Skianis, Polykarpos Meladianos +2

Word embeddings are undoubtedly very useful components in many NLP tasks. In this paper, we present word embeddings and other linguistic resources trained on the largest to date di…

cs.CL2018★ 16 cited

Unsupervised Abstractive Meeting Summarization with Multi-Sentence Compression and Budgeted Submodular Maximization

Guokan Shang, Wensi Ding, Zekun Zhang +4

We introduce a novel graph-based framework for abstractive meeting speech summarization that is fully unsupervised and does not rely on any annotations. Our work combines the stren…

cs.LG2017

Kernel Graph Convolutional Neural Networks

Giannis Nikolentzos, Polykarpos Meladianos, Antoine Jean-Pierre Tixier +2

Graph kernels have been successfully applied to many graph classification problems. Typically, a kernel is first designed, and then an SVM classifier is trained based on the featur…

cs.CV2017

Graph Classification with 2D Convolutional Neural Networks

Antoine Jean-Pierre Tixier, Giannis Nikolentzos, Polykarpos Meladianos +1

Graph learning is currently dominated by graph kernels, which, while powerful, suffer some significant limitations. Convolutional Neural Networks (CNNs) offer a very appealing alte…

cs.DS2016

K-clique-graphs for Dense Subgraph Discovery

G. Nikolentzos, P. Meladianos, Y. Stavrakas +1

Finding dense subgraphs in a graph is a fundamental graph mining task, with applications in several fields. Algorithms for identifying dense subgraphs are used in biology, in finan…