Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Physical Sciences and Mathematics
Find Me If You Can: Aligning Users In Different Social Networks, Priyanka Kasbekar, Katerina Potika, Chris Pollett
Find Me If You Can: Aligning Users In Different Social Networks, Priyanka Kasbekar, Katerina Potika, Chris Pollett
Faculty Publications, Computer Science
Online Social Networks allow users to share experiences with friends and relatives, make announcements, find news and jobs, and more. Several have user bases that number in the hundred of millions and even billions. Very often many users belong to multiple social networks at the same time under possibly different user names. Identifying a user from one social network on another social network gives information about a user's behavior on each platform, which in turn can help companies perform graph mining tasks, such as community detection and link prediction. The process of identifying or aligning users in multiple networks is …
Graph Classification With Kernels, Embeddings And Convolutional Neural Networks, Monica Golahalli Seenappa, Katerina Potika, Petros Potikas
Graph Classification With Kernels, Embeddings And Convolutional Neural Networks, Monica Golahalli Seenappa, Katerina Potika, Petros Potikas
Faculty Publications, Computer Science
In the graph classification problem, given is a family of graphs and a group of different categories, and we aim to classify all the graphs (of the family) into the given categories. Earlier approaches, such as graph kernels and graph embedding techniques have focused on extracting certain features by processing the entire graph. However, real world graphs are complex and noisy and these traditional approaches are computationally intensive. With the introduction of the deep learning framework, there have been numerous attempts to create more efficient classification approaches. We modify a kernel graph convolutional neural network approach, that extracts subgraphs (patches) …