Reconstructing Diffusion Model for Virality Detection in News Spread Networks

2021 ◽  
pp. 98-111
Author(s):  
Kritika Jain ◽  
Ankit Garg ◽  
Somya Jain
Keyword(s):  
Diffusion Model ◽  
Experimental Analysis ◽  
Recommendation System ◽  
Continuous Process ◽  
The Internet ◽  
Temporal Network ◽  
Temporal Networks ◽  
Spreading Pattern ◽  
Effective Product ◽  
Business Technology

In today's competitive world, organizations take advantage of widely-available data to promote their products and increase their revenue. This is achieved by identifying the reader's preference for news genre and patterns in news spread network. Spreading news over the internet seems to be a continuous process which eventually triggers the evolution of temporal networks. This temporal network comprises of nodes and edges, where node corresponds to published articles and similar articles are connected via edges. The main focus of this article is to reconstruct a susceptible-infected (SI) diffusion model to discover the spreading pattern of news articles for virality detection. For experimental analysis, a dataset of news articles from four domains (business, technology, entertainment, and health) is considered and the articles' rate of diffusion is inferred and compared. This will help to build a recommendation system, i.e. recommending a particular domain for advertisement and marketing. Hence, it will assist to build strategies for effective product endorsement for sustainable profitability.

Reconstructing Diffusion Model for Virality Detection in News Spread Networks

2019 ◽  
Vol 10 (1) ◽  
pp. 21-37 ◽  
Author(s):  
Kritika Jain ◽  
Ankit Garg ◽  
Somya Jain
Keyword(s):  
Diffusion Model ◽  
Experimental Analysis ◽  
Recommendation System ◽  
Continuous Process ◽  
The Internet ◽  
Temporal Network ◽  
Temporal Networks ◽  
Spreading Pattern ◽  
Effective Product ◽  
Business Technology

In today's competitive world, organizations take advantage of widely-available data to promote their products and increase their revenue. This is achieved by identifying the reader's preference for news genre and patterns in news spread network. Spreading news over the internet seems to be a continuous process which eventually triggers the evolution of temporal networks. This temporal network comprises of nodes and edges, where node corresponds to published articles and similar articles are connected via edges. The main focus of this article is to reconstruct a susceptible-infected (SI) diffusion model to discover the spreading pattern of news articles for virality detection. For experimental analysis, a dataset of news articles from four domains (business, technology, entertainment, and health) is considered and the articles' rate of diffusion is inferred and compared. This will help to build a recommendation system, i.e. recommending a particular domain for advertisement and marketing. Hence, it will assist to build strategies for effective product endorsement for sustainable profitability.

scholarly journals Movie Recommenadation System

2021 ◽  
Vol 9 (4) ◽  
pp. 13-16
Author(s):  
Gandhali Malve ◽  
Lajree Lohar ◽  
Tanay Malviya ◽  
Shirish Sabnis
Keyword(s):  
Machine Learning ◽  
Recommender System ◽  
Recommendation System ◽  
Learning Algorithms ◽  
Recommendation Systems ◽  
Machine Learning Algorithms ◽  
The Internet ◽  
Amount Of Information ◽  
System Recommendation ◽  
User Ratings

Today the amount of information in the internet growth very rapidly and people need some instruments to find and access appropriate information. One of such tools is called recommendation system. Recommendation systems help to navigate quickly and receive necessary information. Many of us find it difficult to decide which movie to watch and so we decided to make a recommender system for us to better judge which movie we are more likely to love. In this project we are going to use Machine Learning Algorithms to recommend movies to users based on genres and user ratings. Recommendation system attempt to predict the preference or rating that a user would give to an item.

scholarly journals Recommendation with Diversity: Mass Diffusion Model Based on Trust Network and Object Reputation

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Yun Bai ◽  
Wandong Cai
Keyword(s):  
Resource Allocation ◽  
Diffusion Model ◽  
Recommendation System ◽  
Small Degree ◽  
Mass Diffusion ◽  
Recommendation Algorithm ◽  
Trust Relationship ◽  
Positive Effects ◽  
Allocation Process ◽  
Resource Allocation Process

The traditional mass diffusion recommendation algorithm only relies on the user’s object collection relationship, resulting in poor recommendation performance for users with small purchases (i.e., small-degree user), and it is difficult to balance the accuracy and diversity of the recommendation system. This paper introduces the trust relationship into the resource allocation process of the traditional mass diffusion algorithm and proposes the Dual Wing Mass Diffusion model (DWMD), which constructs a dual wing graph based on trust relationships and object collection relationships. Implicit trust is mined according to the network structure of the trust relationship and integrated into the resource allocation process, and then merging the positive effects of object reputation on a recommendation through tunable scaling parameters. The user controls the tunable scaling parameter to achieve the best recommendation performance. The experimental results show that the DWMD method significantly improves diversity and novelty while ensuring high accuracy and effectively improves the accuracy and diversity balance. The improved recommendation performance for small-degree users proves that the trust relationship can effectively alleviate the generalized cold start problem of the recommendation algorithm for users who collect a small number of objects.

scholarly journals Approximating the Temporal Neighbourhood Function of Large Temporal Graphs

Algorithms ◽  
2019 ◽  
Vol 12 (10) ◽  
pp. 211 ◽  
Author(s):  
Pierluigi Crescenzi ◽  
Clémence Magnien ◽  
Andrea Marino
Keyword(s):  
Public Transportation ◽  
Arrival Time ◽  
Time Interval ◽  
Temporal Network ◽  
Temporal Networks ◽  
Starting Time ◽  
Neighborhood Function ◽  
Temporal Graphs ◽  
Temporal Path

Temporal networks are graphs in which edges have temporal labels, specifying their starting times and their traversal times. Several notions of distances between two nodes in a temporal network can be analyzed, by referring, for example, to the earliest arrival time or to the latest starting time of a temporal path connecting the two nodes. In this paper, we mostly refer to the notion of temporal reachability by using the earliest arrival time. In particular, we first show how the sketch approach, which has already been used in the case of classical graphs, can be applied to the case of temporal networks in order to approximately compute the sizes of the temporal cones of a temporal network. By making use of this approach, we subsequently show how we can approximate the temporal neighborhood function (that is, the number of pairs of nodes reachable from one another in a given time interval) of large temporal networks in a few seconds. Finally, we apply our algorithm in order to analyze and compare the behavior of 25 public transportation temporal networks. Our results can be easily adapted to the case in which we want to refer to the notion of distance based on the latest starting time.

scholarly journals Temporal network alignment via GoT-WAVE

2019 ◽  
Vol 35 (18) ◽  
pp. 3527-3529 ◽  
Author(s):  
David Aparício ◽  
Pedro Ribeiro ◽  
Tijana Milenković ◽  
Fernando Silva
Keyword(s):  
User Interface ◽  
State Of The Art ◽  
Source Code ◽  
Network Alignment ◽  
Supplementary Information ◽  
Temporal Network ◽  
Temporal Networks ◽  
Supplementary Data ◽  
Node Similarity ◽  
User Friendly

Abstract Motivation Network alignment (NA) finds conserved regions between two networks. NA methods optimize node conservation (NC) and edge conservation. Dynamic graphlet degree vectors are a state-of-the-art dynamic NC measure, used within the fastest and most accurate NA method for temporal networks: DynaWAVE. Here, we use graphlet-orbit transitions (GoTs), a different graphlet-based measure of temporal node similarity, as a new dynamic NC measure within DynaWAVE, resulting in GoT-WAVE. Results On synthetic networks, GoT-WAVE improves DynaWAVE’s accuracy by 30% and speed by 64%. On real networks, when optimizing only dynamic NC, the methods are complementary. Furthermore, only GoT-WAVE supports directed edges. Hence, GoT-WAVE is a promising new temporal NA algorithm, which efficiently optimizes dynamic NC. We provide a user-friendly user interface and source code for GoT-WAVE. Availability and implementation http://www.dcc.fc.up.pt/got-wave/ Supplementary information Supplementary data are available at Bioinformatics online.

Research on Intelligent Recommendation Method and its Application on Internet Bookstore

2010 ◽  
Vol 121-122 ◽  
pp. 447-452
Author(s):  
Qing Zhang Chen ◽  
Yu Jie Pei ◽  
Yan Jin ◽  
Li Yan Zhang
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Recommendation System ◽  
Recommendation Systems ◽  
Experimental Results ◽  
Personalized Recommendation ◽  
The Internet

As the current personalized recommendation systems of Internet bookstore are limited too much in function, this paper build a kind of Internet bookstore recommendation system based on “Strategic Data Mining”, which can provide personalized recommendations that they really want. It helps us to get the weight attribute of type of book by using AHP, the weight attributes spoken on behalf of its owner, and we add it in association rules. Then the method clusters the customer and type of book, and gives some strategies of personalized recommendation. Internet bookstore recommendation system is implemented with ASP.NET in this article. The experimental results indicate that the Internet bookstore recommendation system is feasible.

BUILDING A KNOWLEDGE BASE FOR IMPLEMENTING A WEB-BASED COMPUTERIZED RECOMMENDATION SYSTEM

2007 ◽  
Vol 16 (05) ◽  
pp. 793-828 ◽  
Author(s):  
JUAN D. VELÁSQUEZ ◽  
VASILE PALADE
Keyword(s):  
Knowledge Base ◽  
Web Site ◽  
Web Mining ◽  
Recommendation System ◽  
The Internet ◽  
Web Pages ◽  
Web Based ◽  
Web Logs ◽  
Mining Tools ◽  
The Web

Understanding the web user browsing behaviour in order to adapt a web site to the needs of a particular user represents a key issue for many commercial companies that do their business over the Internet. This paper presents the implementation of a Knowledge Base (KB) for building web-based computerized recommender systems. The Knowledge Base consists of a Pattern Repository that contains patterns extracted from web logs and web pages, by applying various web mining tools, and a Rule Repository containing rules that describe the use of discovered patterns for building navigation or web site modification recommendations. The paper also focuses on testing the effectiveness of the proposed online and offline recommendations. An ample real-world experiment is carried out on a web site of a bank.

scholarly journals DISCOVER POINTS OF INTEREST BASED ON USERS’ INTERNET SEARCHES THROUGH AN ONLINE SHOPPING WEBSITE

2019 ◽  
Vol XLII-4/W18 ◽  
pp. 975-980
Author(s):  
G. Shahriari Mehr ◽  
M. R. Delavar ◽  
C. Claramunt ◽  
B. N. Araabi ◽  
M. R. A. Dehaqani
Keyword(s):  
Spatial Analysis ◽  
Recommendation System ◽  
Online Shopping ◽  
Contextual Information ◽  
Information Source ◽  
Primary Source ◽  
The Internet ◽  
Points Of Interest ◽  
Internet Searches ◽  
The City

Abstract. In recent years, the development of the Internet plays a significant role in human's daily activities. One of the most important effects of the Internet is the change in the process of shopping. The advent of online shopping leads to establish a new channel for customers to obtain information about their desired goods and demands. Although many customers collect information from online channel, they also wish to try and search for their required goods at the stores. Besides, discovering this data leads to a new source for spatial analysis to find the users’ interests. Therefore, we can consider this data as a contextual information source for spatial analysis or primary source for recommending points of interest (POIs). In this research, our aim is to discover a relation among the users' internet searches and the goods at the stores to recommend the best store to the users. Euclidean distance is used to calculate the similarity between users' searches and the available goods at the stores. The proposed method has been implemented in the city of Tehran, capital of Iran. The results show that the users’ internet search behavior plays an essential role in the recommendation system which provides stores to the users based on the similarity among the users’ internet searches and the available goods at the stores.

scholarly journals Various Implementation of Collaborative Filtering-Based Approach on Recommendation Systems using Similarity

2020 ◽  
pp. 179-186
Author(s):  
Zainur Romadhon ◽  
Eko Sediyono ◽  
Catur Edi Widodo
Keyword(s):  
Collaborative Filtering ◽  
Fast Food ◽  
Recommendation System ◽  
Black Pepper ◽  
The Internet ◽  
Daily Lives ◽  
A Value ◽  
Similarity Calculation ◽  
Item Data ◽  
Filtering Approach

The Recommendation System plays an increasingly important role in our daily lives. With the increasing amount of information on the internet, the recommendation system can also solve problems caused by increasing information quickly. Collaborative filtering is one method in the recommendation system that makes recommendations by analyzing correlations between users. Collaborative filtering accumulates customer item ratings, identifies customers with common ratings, and offers recommendations based on inter-customer comparisons. This study aims to build a system that can provide recommendations to users who want to order or choose fast food menus. This recommendation system provides recommendations based on item data calculations with customer review data using a collaborative filtering approach. The results of applying cosine similarity calculation to determine fast food menu recommendations obtained for the item-based recommendation is Pizza Frankfurter BBQ Large with a value of 1.0, item-based with genre recommendation is Calblend Float with value 1.0 and user-based recommendation is Pizza Black Pepper Beef / Chicken Large with mean score 2.5.

Sign in / Sign up

Export Citation Format

Share Document