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

Jagadeesh Gorla

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

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

Artificial intelligence and machine learning · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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%
Artificial intelligence
2 papers
Information extraction and text analysis · 56% Knowledge representation and reasoning · 44%

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

TopicWeightPapersLastEvidence papers
Recommender systems
collaborative filtering
0.212013
Probabilistic group recommendation via information matching · WWW 2013
Recommender systems
group recommendation
0.212013
Probabilistic group recommendation via information matching · WWW 2013
Natural language and speech › Information extraction and text analysis › syntactic parsing
dependency parsing
0.112007
Two Approaches for Building an Unsupervised Dependency Parser and Their Other Applications · AAAI 2007
Knowledge, reasoning and agents › Knowledge representation and reasoning
logic in computer science
0.112007
Two Approaches for Building an Unsupervised Dependency Parser and Their Other Applications · AAAI 2007
Natural language and speech › Information extraction and text analysis › syntactic parsing › statistical parsing
unsupervised parsing
0.012007
Two Approaches for Building an Unsupervised Dependency Parser and Their Other Applications · AAAI 2007

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

probabilistic framework · 0.3information matching · 0.3unsupervised learning · 0.1dependency parsing · 0.1
YearPublicationVenuePosition
2013 Probabilistic group recommendation via information matching
abstract
Increasingly, web recommender systems face scenarios where they need to serve suggestions to groups of users; for example, when families share e-commerce or movie rental web accounts. Research to date in this domain has proposed two approaches: computing recommendations for the group by merging any members' ratings into a single profile, or computing ranked recommendations for each individual that are then merged via a range of heuristics. In doing so, none of the past approaches reason on the preferences that arise in individuals when they are members of a group. In this work, we present a probabilistic framework, based on the notion of information matching, for group recommendation. This model defines group relevance as a combination of the item's relevance to each user as an individual and as a member of the group; it can then seamlessly incorporate any group recommendation strategy in order to rank items for a set of individuals. We evaluate the model's efficacy at generating recommendations for both single individuals and groups using the MovieLens and MoviePilot data sets. In both cases, we compare our results with baselines and state-of-the-art collaborative filtering algorithms, and show that the model outperforms all others over a variety of ranking metrics.
Jagadeesh Gorla, Neal Lathia, Stephen E. Robertson, Jun Wang 0012
WWW1
2007 Two Approaches for Building an Unsupervised Dependency Parser and Their Other Applications
Jagadeesh Gorla, Rajeev Sangal
AAAI1