A5064514930- Graph Theory and Algorithms
- Complex Network Analysis Techniques
- Advanced Graph Neural Networks
- Data Management and Algorithms
- Advanced Database Systems and Queries
- Sentiment Analysis and Opinion Mining
- Topic Modeling
- Peer-to-Peer Network Technologies
- Algorithms and Data Compression
- Mobile Crowdsensing and Crowdsourcing
- Misinformation and Its Impacts
- Opinion Dynamics and Social Influence
- Semantic Web and Ontologies
- Spam and Phishing Detection
- Hate Speech and Cyberbullying Detection
- Digital Transformation in Industry
- Web Data Mining and Analysis
- Distributed and Parallel Computing Systems
- Big Data and Business Intelligence
- Expert finding and Q&A systems
- Human Mobility and Location-Based Analysis
- Social Media and Politics
IBM Research - Ireland
2020-2022
University of Bari Aldo Moro
2021
South African National Biodiversity Institute
2021
University of Derby
2021
Graz University of Technology
2021
Dublin City University
2021
University of Washington
2021
Juraj Dobrila University of Pula
2021
Cardiff University
2021
University of Ioannina
2015-2020
In this paper, we focus on labeled graphs that evolve over time. Given a sequence of graph snapshots representing the state at different time instants, seek to find most durable matches an input pattern query, is, exist for longest period The straightforward way address problem is by running state-of-the-art algorithm each snapshot and aggregating results. However, large networks approach computationally expensive, since all have be generated snapshot, including those appearing only once. We...
Graphs offer a natural model for the relationships and interactions among entities, such as those occurring users in social cooperation networks, proteins biological networks. Since most networks are dynamic, to capture their evolution over time, we assume sequence of graph snapshots where each snapshot represents state network at different time instance. Given this sequence, seek find top- <inline-formula> <tex-math notation="LaTeX">$k$</tex-math></inline-formula> <i>most durable...
Efficiently detecting conversation threads from a pool of messages, such as social network chats, emails, comments to posts, news etc., is relevant for various applications, including Web Marketing, Information Retrieval and Digital Forensics. Existing approaches focus on text similarity using keywords features that are strongly dependent the dataset. Therefore, dealing with new corpora requires further costly analyses conducted by experts find out features. This paper introduces...
Twitter, being both a micro-blogging service and social network, has become one of the primary means communicating disseminating information online. As such, significant amount research been devoted to analyzing Twitter graph, tweets, behavior its users. In this work, we undertake study user profile bios on Twitter. The goal our is two-fold: first, understand what users choose expose about themselves in their bio, second, investigate if it possible exploit bio for tasks such as predicting...
Network algorithms play a critical role in various applications, such as recommendations, diffusion maximization, and web search. In this paper, we focus on the fairness of particular PageRank. PageRank refers to fair allocation weights among nodes. We consider effect network structure fairness. Concretely, provide analytical formulas for computing edge additions conditions that an must satisfy so its addition improves also evaluating existing edges use our findings propose efficient linear...
The problem of team formation in a social network asks for set individuals who not only have the required skills to perform task but can also communicate effectively with each other. Existing work assumes that all links are positive, is, they indicate friendship or collaboration between individuals. However, it is often case signed, contains both positive and negative links, corresponding friend foe relationships. Building on concept structural balance, we provide definitions compatibility...
Temporal graphs represent relationships and interactions among entities over time, such as those occurring users in social, transaction, telecommunication networks. The analysis of their temporal structure help us understand, predict the behavior entities. A typical task graph networks is finding all appearances an input pattern query. Such are called matches. In this paper, we interested matches interaction query within graphs. To end, propose a hybrid approach that achieves effective...
The influence of sentiment polarization and ex-change in online social networks has been growing studied by many researchers organizations worldwide. For example, the sentiments expressed a text concerning topic discussion tend to community when Twitter user retweets original text, causing chain reactions within network. This paper investigates Twitter, focusing on tweets with hashtags #Coronavirus, #ClimateChange #Immigrants, #MeToo. Specifically, we collect mentioned above classify them...
The primary objective of graph pattern matching is to find all appearances an input query in a large data graph. Such are called matches. In this paper, we interested finding matches interaction patterns temporal graphs. To end, propose hybrid approach that achieves effective filtering potential based both on structure and time. Our exploits representation where edges ordered by We present experiments with real datasets illustrate the efficiency our approach.