FAKEDETECTOR detects fake news from social networks.
problem Identifying fake news in online social networks.
method Deep diffusive neural network model.
result Demonstrated effectiveness of FAKEDETECTOR on real-world fake news dataset.
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
169,181 papers · 148 categories
Trend · papers per month
48 results for “online social networks”
The rise in online social networking has brought about a revolution in social relations. However, its effects on offline interactions and its implications for collective well-being are still not clear and are under-investigated. We study the ecology of online and offline interaction in an evolutionary game framework wh…
Paper proposes a new method for social recommendation in online voting.
problem Challenges in recommending online voting based on social networks and voting content.
method Proposes TEWE for word and document representation and JTS-MF for voting recommendation.
result Proves the effectiveness of the proposed approach compared to state-of-the-art methods.
New method for online influence maximization in social networks.
problem Identifying influential nodes in social networks.
method Factorization of activation probabilities into latent factors on nodes, using upper confidence bound online learning.
result Significant reduction in regret with proposed algorithm.
Deep learning detects radical content on social media.
problem Detecting extremist content on social media platforms.
method Employed an LSTM based feed forward neural network to classify radical content.
result Achieved a precision of 85.9% in detecting radical content.
The paper develops algorithms to increase social activity online.
problem Increasing user engagement in social networks.
method Modeling social activity as marked temporal point processes and deriving SDEs with jumps to develop online algorithms.
result The developed algorithms consistently steer social activity more effectively than existing methods.
Efficiently selects seed nodes to maximize content influence in unknown social networks.
problem Maximizing content spread in social networks with unknown network model.
method Formulated as an infinite-horizon discounted MDP, uses model-based reinforcement learning to select seed users adaptively.
result Established a regret bound of for the algorithm.
The paper analyzes user activities in OSNs using a vector space model.
problem Understanding user interactions and activity patterns in OSNs.
method TF-IDF scheme of Vector Space Model to analyze object-viewer relationships.
result Identified activity relationships among users and objects in OSNs.
LoCEC classifies user relationships in large social networks, addressing sparsity issues.
problem Sparse relationship feature and label data in real social platforms.
method Local Community-based Edge Classification (LoCEC) framework with three-phase processing.
result Effective and efficient classification of user relationships in large-scale networks.
The paper explores how to learn from incomplete online social networks.
problem Learning from partially observed networks via node querying.
method Developed algorithms NOL* for sequential node querying to maximize network observability.
result It is possible to sequentially learn which nodes to query for maximal network observability.
Cascading chains of events are a salient feature of many real-world social, biological, and financial networks. In social networks, social reciprocity accounts for retaliations in gang interactions, proxy wars in nation-state conflicts, or Internet memes shared via social media. Neuron spikes stimulate or inhibit spike…
User engagement in social networks depends critically on the number of online actions their users take in the network. Can we design an algorithm that finds when to incentivize users to take actions to maximize the overall activity in a social network? In this paper, we model the number of online actions over time usin…
Study uses attention-based method to detect different types of online harassment.
problem Detecting different types of online harassment in social media content.
method Multi-attention based approach using Recurrent Neural Networks to address imbalanced data.
result Demonstrates effectiveness of attention-based mechanism for detecting various types of online harassment.
Highly precise globalness detection on social network pages.
problem Differentiating local from global nodes in online social networks.
method Four-stage operational flow for globalness detection.
result High precision (89%) and recall (88%) of local pages predictions.
Social media has recently emerged as a premier method to disseminate information online. Through these online networks, tens of millions of individuals communicate their thoughts, personal experiences, and social ideals. We therefore explore the potential of social media to predict, even prior to onset, Major Depressiv…
Framework detects fake news using weak social signals from multiple sources.
problem Lack of annotated data for early fake news detection.
method Jointly uses weak social signals and clean data to train deep neural networks in a meta-learning framework.
result Framework outperforms state-of-the-art baselines for early fake news detection.
Finding Social Media Trolls: Dynamic Keyword Selection Methods for Rapidly-Evolving Online Debatescs.LG
Paper proposes using word embeddings to detect trolls in social media debates.
problem Preventing online harassment through rapid detection of offensive posts.
method Word embedding models for identifying fast-changing topics and negative content.
result GloVe model helps in discovering new keywords for trolling detection.
New method for online learning IC models with node-level feedback.
problem Learning IC models with node-level feedback in social networks.
method Detailed analysis and online algorithm with cumulative regret.
result First confidence-region result and online algorithm for IC models with node-level feedback.
The Social Bow Tiecs.SI
Introduces 'social bow tie' to quantify tie strength in social networks.
problem Understanding tie strength and its influencing factors in social networks.
method Introduced 'social bow tie' framework, defined metrics, used random forests and regression models.
result Bow tie metrics are highly predictive of tie strength, and tie strength is influenced by overlapping and non-overlapping social circles.
Social messages classification is a research domain that has attracted the attention of many researchers in these last years. Indeed, the social message is different from ordinary text because it has some special characteristics like its shortness. Then the development of new approaches for the processing of the social…
Paper tackles online task allocation in multi-attribute social sensing.
problem Optimized task allocation in dynamic, multi-attribute social sensing.
method Quality-Cost-Aware Online Task Allocation (QCO-TA) scheme using online reinforcement learning.
result Significantly outperforms state-of-the-art baselines in sensing accuracy and cost.
Modeling social network activity through user and topic interaction.
problem Understanding complex dynamics of opinion formation in social networks.
method Mixture of Interacting Cascades (MIC) model of marked multidimensional Hawkes processes.
result MIC achieves superior performance in modeling information cascade spread.
Online social networks (OSN) contain extensive amount of information about the underlying society that is yet to be explored. One of the most feasible technique to fetch information from OSN, crawling through Application Programming Interface (API) requests, poses serious concerns over the the guarantees of the estimat…
We study the online influence maximization problem in social networks under the independent cascade model. Specifically, we aim to learn the set of "best influencers" in a social network online while repeatedly interacting with it. We address the challenges of (i) combinatorial action space, since the number of feasibl…
Study shows impersonators generate fake engagement on Instagram.
problem Impersonators exploit Instagram for fake engagement.
method Examined three communities (Politician, News agency, Sports star) on Instagram, collected data on 4.8K comments and 2.6K likes from 3.8K impersonators over 7 months.
result Impersonators generate significant fake engagement on verified accounts.
With the rise of social media, people can now form relationships and communities easily regardless of location, race, ethnicity, or gender. However, the power of social media simultaneously enables harmful online behavior such as harassment and bullying. Cyberbullying is a serious social problem, making it an important…
In this paper, we introduce a methodology that allows to model behavioral trajectories of users in online social media. First, we illustrate how to leverage the probabilistic framework provided by Hidden Markov Models (HMMs) to represent users by embedding the temporal sequences of actions they performed online. We the…
Online social networks offer a new way to investigate financial markets' dynamics by enabling the large-scale analysis of investors' collective behavior. We provide empirical evidence that suggests social media and stock markets have a nonlinear causal relationship. We take advantage of an extensive data set composed o…
Users in social networks whose posts stay at the top of their followers'{} feeds the longest time are more likely to be noticed. Can we design an online algorithm to help them decide when to post to stay at the top? In this paper, we address this question as a novel optimal control problem for jump stochastic different…
New algorithm for competing influence spread in unknown networks.
problem Maximizing influence spread in a social network with unknown probabilities.
method Combinatorial multi-armed bandit (CMAB) framework, Triggering Probability Modulated (TPM) condition, OCIM-TS, OCIM-OFU, OCIM-ETC.
result Sublinear Bayesian and frequentist regret for OCIM-TS and OCIM-OFU, respectively.
Detects radical content on Twitter using textual, psychological, and behavioral signals.
problem Limit the spread of extremist narratives on social media.
method Analyzed extremist material, created contextual text-based model, inferred psychological properties, evaluated on Twitter.
result Radical users exhibit distinguishable textual, psychological, and behavioral properties.
Many kinds of data can be represented as a network or graph. It is crucial to infer the latent structure underlying such a network and to predict unobserved links in the network. Mixed Membership Stochastic Blockmodel (MMSB) is a promising model for network data. Latent variables and unknown parameters in MMSB have bee…
New algorithm for federated learning without a central server.
problem Federated learning in unidirectional trust social networks.
method Central Server Free Federated Learning (OPS) method.
result Users can benefit from communication with trusted users in federated learning.
Proposes a GAN-based model for semi-supervised text regression.
problem Predicting social and economic outcomes from unbalanced textual data.
method Conditional Generative Adversarial Network (GAN) for semi-supervised learning.
result End-to-end framework for predictions without high-level representation selection.
SHINE predicts sentiment links in social networks using diverse information.
problem Predicting sentiment links in social networks using only textual information is insufficient.
method SHINE uses a labeled heterogeneous sentiment dataset and multiple deep autoencoders to predict unobserved sentiment links.
result SHINE outperforms state-of-the-art baselines on link prediction and node recommendation.
Analysis of opinion dynamics in social networks plays an important role in today's life. For applications such as predicting users' political preference, it is particularly important to be able to analyze the dynamics of competing opinions. While observing the evolution of polar opinions of a social network's users ove…
Deep model captures interactions in online forums.
problem Modeling discursive interactions in online forums.
method Coupled Distributed Topics model with deep architecture and GPU-based inference.
result Model outperforms existing methods in online discourse analysis.
New CUSUM method detects changes in Hawkes networks efficiently.
problem Detecting abrupt changes in Hawkes networks.
method Efficient online recursive implementation of CUSUM statistic.
result Proposed CUSUM method outperforms existing methods.
MIM-Reasoner learns seed users for maximizing influence in multiplex networks.
problem Maximizing influence in multiplex networks with multiple layers of social interactions.
method Combining reinforcement learning with probabilistic graphical models.
result Established a theoretical guarantee for MIM-Reasoner's performance.
This paper studies two important signal processing aspects of equilibrium behavior in non-cooperative games arising in social networks, namely, reinforcement learning and detection of equilibrium play. The first part of the paper presents a reinforcement learning (adaptive filtering) algorithm that facilitates learning…
Bayesian inference models disease spread on networks.
problem Understand disease spread mechanisms and predict outbreaks.
method Approximate Bayesian computation (ABC) for complex models.
result Inference scheme works well on heterogeneous network topologies.
Framework for online resource allocation using social welfare functions.
problem Optimal allocation of resources over time steps in a population.
method Confidence sequence framework for SWF-based online learning and inference, valid for any monotonic, concave, and Lipschitz-continuous SWF.
result Achieves near-optimal regret of for SWF-agnostic algorithm SWF-UCB.
Proposes a multi-modal attention network for better stock price prediction.
problem Predicting future stock movements using historical records and social media.
method Extracts semantic information from social media, estimates credibility, and integrates with numeric features.
result Significantly improved prediction accuracy and trading profits compared to previous methods.
New bandit algorithms adapt to evolving user interests influenced by social circles.
problem Adapting to evolving user interests in recommendation systems.
method Online recommendation algorithms tailored for social influence, based on LinREL and Thompson Sampling.
result Our adaptations maintain asymptotic regret bounds similar to non-social cases.
We consider a collaborative online learning paradigm, wherein a group of agents connected through a social network are engaged in playing a stochastic multi-armed bandit game. Each time an agent takes an action, the corresponding reward is instantaneously observed by the agent, as well as its neighbours in the social n…
Algorithm learns fair division from noisy feedback in uncertain markets.
problem Learning fair division in uncertain markets with noisy feedback.
method Wrapper algorithms using dual averaging to learn item and agent values from bandit feedback.
result Asymptotically achieves optimal Nash social welfare in linear Fisher markets.
Paper proposes models to identify topic sparsity in social media texts.
problem Topic sparsity in online social media content.
method Sparsemax and relaxed Wasserstein for topic sparsity.
result Proposed models achieve better topic sparsity identification and performance.
Develops platforms to analyze social media data for human behavior and emotions.
problem Understanding human behavior and emotions from social media data.
method Self-structuring incremental machine learning, event detection, natural language processing.
result Captured salient topics and events from social media data, validated against news.