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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Prantik Bhattacharyya

dblp:05/7221 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
0since 2021 · last 2015
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 1 first-authorDatabases, data management, data science and information retrieval · 3 · 1 first-authorHuman-computer interaction and ubiquitous computing · 2 · 2 first-authorComputer networks · 1

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
2 papers
Web and social media mining · 48% Recommender systems · 29% Data mining · 22%

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

TopicWeightPapersLastEvidence papers
Web and social media mining
social network analysis
0.422015
When-To-Post on Social Networks · KDD 2015
LASTA: large scale topic assignment on multiple social networks · KDD 2014
Data mining › text mining › topic model
topic assignment
0.212014
LASTA: large scale topic assignment on multiple social networks · KDD 2014
Recommender systems
user profiling
0.212014
LASTA: large scale topic assignment on multiple social networks · KDD 2014
Recommender systems › user interest modeling
user interest inference
0.112014
LASTA: large scale topic assignment on multiple social networks · KDD 2014

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

survival analysis · 0.2multi-network learning · 0.2feature engineering · 0.2
YearPublicationVenuePosition
2015 When-To-Post on Social Networks
abstract
For many users on social networks, one of the goals when broadcasting content is to reach a large audience. The probability of receiving reactions to a message differs for each user and depends on various factors, such as location, daily and weekly behavior patterns and the visibility of the message. While previous work has focused on overall network dynamics and message flow cascades, the problem of recommending personalized posting times has remained an under-explored topic of research.
Nemanja Spasojevic, Zhisheng Li, Adithya Rao, Prantik Bhattacharyya
KDD4
2014 LASTA: large scale topic assignment on multiple social networks
abstract
Millions of people use social networks everyday to talk about a variety of subjects, publish opinions and share information. Understanding this data to infer user's topical interests is a challenging problem with applications in various data-powered products. In this paper, we present 'LASTA' (Large Scale Topic Assignment), a full production system used at Klout, Inc., which mines topical interests from five social networks and assigns over 10,000 topics to hundreds of millions of users on a daily basis. The system continuously collects streams of user data and is reactive to fresh information, updating topics for users as interests shift. LASTA generates over 50 distinct features derived from signals such as user generated posts and profiles, user reactions such as comments and retweets, user attributions such as lists, tags and endorsements, as well as signals based on social graph connections. We show that using this diverse set of features leads to a better representation of a user's topical interests as compared to using only generated text or only graph based features. We also show that using cross-network information for a user leads to a more complete and accurate understanding of the user's topics, as compared to using any single network. We evaluate LASTA's topic assignment system on an internal labeled corpus of 32,264 user-topic labels generated from real users.
Nemanja Spasojevic, Jinyun Yan, Adithya Rao, Prantik Bhattacharyya
KDD4
2011 Your best might not be good enough: Ranking in collaborative social search engines
abstract
—A relevant feature of online social networks like Facebook is the scope for users to share external information from the web with their friends by sharing an URL. The phenomenon of sharing has bridged the web graph with the social network graph and the shared knowledge in ego networks
Prantik Bhattacharyya, Jeff Rowe, Shyhtsun Felix Wu, Karen Zita Haigh, Niklas Lavesson, Henric Johnson
CollaborateCom1
2009 Social Network Model Based on Keyword Categorization
abstract
A user profile on an online social network is characterized by its profile entries (keywords). In this paper, we study the relationship between semantic similarity of user keywords and the social network topology. First, we present a 'forest' model to categorize keywords and define the notion of distance between keywords across multiple categorization trees (i.e., a forest). Second, we use the keyword distance to define similarity functions between a pair of users and show how social network topology can be modeled accordingly. Third, we validate our social network topology model, using a simulated social graph, against a real life social graph dataset.
Prantik Bhattacharyya, Ankush Garg, Shyhtsun Felix Wu
ASONAM1
2009 Design and Implementation of Davis Social Links OSN Kernel
Kelcey Chan, Shaozhi Ye, Prantik Bhattacharyya, Ankush Garg, Xiaoming Lu, Shyhtsun Felix Wu
WASA4