Twitter Referral Behaviours on News Consumption with Ensemble Clustering
of Click-Stream Data in Turkish Media
- URL: http://arxiv.org/abs/2202.02056v1
- Date: Fri, 4 Feb 2022 09:57:13 GMT
- Title: Twitter Referral Behaviours on News Consumption with Ensemble Clustering
of Click-Stream Data in Turkish Media
- Authors: Didem Makaroglu, Altan Cakir, Behcet Ugur Toreyin
- Abstract summary: This study investigates the readers' click activities in the organizations' websites to identify news consumption patterns following referrals from Twitter.
The investigation is widened to a broad perspective by linking the log data with news content to enrich the insights.
- Score: 2.9005223064604078
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Click-stream data, which comes with a massive volume generated by the human
activities on the websites, has become a prominent feature to identify readers'
characteristics by the newsrooms after the digitization of the news outlets. It
is essential to have elastic architectures to process the streaming data,
particularly for unprecedented traffic, enabling conducting more comprehensive
analyses such as recommending mostly related articles to the readers. Although
the nature of click-stream data has a similar logic within the websites, it has
inherent limitations to recognize human behaviors when looking from a broad
perspective, which brings the need of limiting the problem in niche areas. This
study investigates the anonymized readers' click activities in the
organizations' websites to identify news consumption patterns following
referrals from Twitter, who incidentally reach but propensity is mainly the
routed news content. The investigation is widened to a broad perspective by
linking the log data with news content to enrich the insights rather than
sticking into the web journey. The methodologies on ensemble cluster analysis
with mixed-type embedding strategies are applied and compared to find similar
reader groups and interests independent from time. Our results demonstrate that
the quality of clustering mixed-type data set approaches to optimal internal
validation scores when embedded by Uniform Manifold Approximation and
Projection (UMAP) and using consensus function as a key to access the most
applicable hyper parameter configurations in the given ensemble rather than
using consensus function results directly. Evaluation of the resulting clusters
highlights specific clusters repeatedly present in the samples, which provide
insights to the news organizations and overcome the degradation of the modeling
behaviors due to the change in the interest over time.
Related papers
- InterFormer: Towards Effective Heterogeneous Interaction Learning for Click-Through Rate Prediction [72.50606292994341]
We propose a novel module named InterFormer to learn heterogeneous information interaction in an interleaving style.
Our proposed InterFormer achieves state-of-the-art performance on three public datasets and a large-scale industrial dataset.
arXiv Detail & Related papers (2024-11-15T00:20:36Z) - Enhancing Affinity Propagation for Improved Public Sentiment Insights [0.0]
This project introduces an approach using unsupervised learning techniques to analyze sentiment.
AP clustering groups text data based on natural patterns, without needing predefined cluster numbers.
To enhance performance, AP is combined with Agglomerative Hierarchical Clustering.
arXiv Detail & Related papers (2024-10-12T19:20:33Z) - Improving and Evaluating the Detection of Fragmentation in News
Recommendations with the Clustering of News Story Chains [46.44827993583994]
The Fragmentation metric quantifies the degree of fragmentation of information streams in news recommendations.
This paper presents an investigation of various approaches for quantifying Fragmentation in news recommendations.
arXiv Detail & Related papers (2023-09-12T13:01:20Z) - A Graph-Enhanced Click Model for Web Search [67.27218481132185]
We propose a novel graph-enhanced click model (GraphCM) for web search.
We exploit both intra-session and inter-session information for the sparsity and cold-start problems.
arXiv Detail & Related papers (2022-06-17T08:32:43Z) - Masked Transformer for Neighhourhood-aware Click-Through Rate Prediction [74.52904110197004]
We propose Neighbor-Interaction based CTR prediction, which put this task into a Heterogeneous Information Network (HIN) setting.
In order to enhance the representation of the local neighbourhood, we consider four types of topological interaction among the nodes.
We conduct comprehensive experiments on two real world datasets and the experimental results show that our proposed method outperforms state-of-the-art CTR models significantly.
arXiv Detail & Related papers (2022-01-25T12:44:23Z) - Improved Topic modeling in Twitter through Community Pooling [0.0]
Twitter posts are short and often less coherent than other text documents.
We propose a new pooling scheme for topic modeling in Twitter, which groups tweets whose authors belong to the same community.
Results show that our Community polling method outperformed other methods on the majority of metrics in two heterogeneous datasets.
arXiv Detail & Related papers (2021-12-20T17:05:32Z) - Like Article, Like Audience: Enforcing Multimodal Correlations for
Disinformation Detection [20.394457328537975]
correlations between user-generated and user-shared content can be leveraged for detecting disinformation in online news articles.
We develop a multimodal learning algorithm for disinformation detection.
arXiv Detail & Related papers (2021-08-31T14:50:16Z) - Author Clustering and Topic Estimation for Short Texts [69.54017251622211]
We propose a novel model that expands on the Latent Dirichlet Allocation by modeling strong dependence among the words in the same document.
We also simultaneously cluster users, removing the need for post-hoc cluster estimation.
Our method performs as well as -- or better -- than traditional approaches to problems arising in short text.
arXiv Detail & Related papers (2021-06-15T20:55:55Z) - Adversarial Feature Augmentation and Normalization for Visual
Recognition [109.6834687220478]
Recent advances in computer vision take advantage of adversarial data augmentation to ameliorate the generalization ability of classification models.
Here, we present an effective and efficient alternative that advocates adversarial augmentation on intermediate feature embeddings.
We validate the proposed approach across diverse visual recognition tasks with representative backbone networks.
arXiv Detail & Related papers (2021-03-22T20:36:34Z) - Search Result Clustering in Collaborative Sound Collections [17.48516881308658]
We propose a graph-based approach using audio features for clustering diverse sound collections obtained when querying large online databases.
We show that using a confidence measure for discarding inconsistent clusters improves the quality of the partitions.
arXiv Detail & Related papers (2020-04-08T13:08:17Z) - Mining Implicit Entity Preference from User-Item Interaction Data for
Knowledge Graph Completion via Adversarial Learning [82.46332224556257]
We propose a novel adversarial learning approach by leveraging user interaction data for the Knowledge Graph Completion task.
Our generator is isolated from user interaction data, and serves to improve the performance of the discriminator.
To discover implicit entity preference of users, we design an elaborate collaborative learning algorithms based on graph neural networks.
arXiv Detail & Related papers (2020-03-28T05:47:33Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.