Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Avni Gulati

dblp:234/2682 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2019
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems › social recommendation
influence-based recommendation
0.412019
With a Little Help from My Friends (and Their Friends): Influence Neighborhoods for Social Recommendations · WWW 2019
Recommender systems › collaborative filtering
matrix factorization
0.412019
With a Little Help from My Friends (and Their Friends): Influence Neighborhoods for Social Recommendations · WWW 2019
Recommender systems
social recommendation
0.412019
With a Little Help from My Friends (and Their Friends): Influence Neighborhoods for Social Recommendations · WWW 2019
Recommender systems
social regularization
0.412019
With a Little Help from My Friends (and Their Friends): Influence Neighborhoods for Social Recommendations · WWW 2019

Methods — techniques the papers use, named apart from their topics

neighborhood construction · 0.4matrix factorization · 0.4
YearPublicationVenuePosition
2019 With a Little Help from My Friends (and Their Friends): Influence Neighborhoods for Social Recommendations
abstract
Social recommendations have been a very intriguing domain for researchers in the past decade. The main premise is that the social network of a user can be leveraged to enhance the rating-based recommendation process. This has been achieved in various ways, and under different assumptions about the network characteristics, structure, and availability of other information (such as trust, content, etc.) In this work, we create neighborhoods of influence leveraging only the social graph structure. These are in turn introduced in the recommendation process both as a pre-processing step and as a social regularization factor of the matrix factorization algorithm. Our experimental evaluation using real-life datasets demonstrates the effectiveness of the proposed technique.
Avni Gulati, Magdalini Eirinaki
WWW1
2018 Influence Propagation for Social Graph-based Recommendations
abstract
Social networking is an inevitable behavior of humans living in a society. In recent years, and with the rise of online social networks, personalized recommendations that leverage the social aspect have become a very intriguing domain for researchers. In this work, we explore how influence propagation and the decay in the cascading effect of influence from influential users can be leveraged to generate social graph-based recommendations. Understanding how influence propagates within a social network is itself a challenging problem. Few researchers have considered influence propagation and even fewer have considered decay in the cascading effect of influence in a social network. In this work we model the decay in influence propagation in directed graphs, utilizing the structural properties of the social graph to measure the propagated influence beyond one-hop. We then employ this influence propagation model to form social recommendations, and present our experimental results using real-life datasets.
Avni Gulati, Magdalini Eirinaki
IEEE BigData1