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

Adam D. Troy

dblp:88/5706 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2018
—ORCID · none

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

Databases, data management, data science and information retrieval · 3 · 1 first-authorArtificial intelligence and machine learning · 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
Recommender systems · 70% Information retrieval · 30%

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

TopicWeightPapersLastEvidence papers
Recommender systems
context-aware recommendation
0.312018
Calendar-Aware Proactive Email Recommendation · SIGIR 2018
Recommender systems › interactive recommendation
proactive recommendation
0.312018
Calendar-Aware Proactive Email Recommendation · SIGIR 2018
Information retrieval
ranking
0.112007
Enhancing relevance scoring with chronological term rank · SIGIR 2007
Information retrieval › ranking › relevance estimation
relevance scoring
0.112007
Enhancing relevance scoring with chronological term rank · SIGIR 2007
Information retrieval › retrieval models
probabilistic retrieval model
0.012007
Enhancing relevance scoring with chronological term rank · SIGIR 2007
Information retrieval
retrieval models
0.012007
Enhancing relevance scoring with chronological term rank · SIGIR 2007

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

survey · 0.3online learning · 0.3linear model · 0.3field experiment · 0.3pivoted length normalization · 0.1language model · 0.1Okapi BM25 · 0.1
YearPublicationVenuePosition
2018 Calendar-Aware Proactive Email Recommendation
abstract
In this paper, we study how to leverage calendar information to help with email re-finding using a zero-query prototype, Calendar-Aware Proactive Email Recommender System (CAPERS). CAPERS proactively selects and displays potentially useful emails to users based on their upcoming calendar events with a particular focus on meeting preparation. We approach this problem domain through a survey, a task-based experiment, and a field experiment comparing multiple email recommenders in a large technology company. We first show that a large proportion of email access is related to meetings and then study the effects of four email recommenders on user perception and engagement taking into account four categories of factors: the amount of email content, email recency, calendar-email content match, and calendar-email people match. We demonstrate that these factors all positively predict the usefulness of emails to meeting preparation and that calendar-email content match is the most important. We study the effects of different machine learning models for predicting usefulness and find that an online-learned linear model doubles user engagement compared with the baselines, which suggests the benefit of continuous online learning.
Paul N. Bennett, Adam Fourney, Anne Loomis Thompson, Shane Williams, Adam D. Troy, Susan T. Dumais
SIGIR6
2012 Domain dependent query reformulation for web search
abstract
Query reformulation has been studied as a domain independent task. Existing work attempts to expand a query or substitute its terms with the same set of candidates regardless of the domain of this query. Since terms might be semantically related in one domain but not in others, it is more effective to provide candidates for queries with respect to their domain. This paper demonstrates the advantage of this domain dependent query reformulation approach, which learns its candidates, using a standard technique, for each domain from a separate sample of data derived automatically from a generic query log. Our results show that our approach statistically significantly outperforms the domain independent approach, which learns to reformulate from the same log using the same technique, on a large query set consisting of both health and commerce queries. Our results have very practical interpretation: while building different reformulation systems to handle queries from different domains does not require additional manual effort, it provides substantially better retrieval effectiveness than having a single system handling all queries. Additionally, we show that leveraging domain specific manually labelled data leads to further improvement.
Van Dang, Giridhar Kumaran, Adam D. Troy
CIKM3
2007 Enhancing relevance scoring with chronological term rank
abstract
We introduce a new relevance scoring technique that enhances existing relevance scoring schemes with term position information. This technique uses chronological term rank (CTR) which captures the positions of terms as they occur in the sequence of words in a document. CTR is both conceptually and computationally simple when compared to other approaches that use document structure information, such as term proximity, term order and document features. CTR works well when paired with Okapi BM25. We evaluate the performance of various combinations of CTR with Okapi BM25 in order to identify the most effective formula. We then compare the performance of the selected approach against the performance of existing methods such as Okapi BM25, pivoted length normalization and language models. Significant improvements are seen consistently across a variety of TREC data and topic sets, measured by the major retrieval performance metrics. This seems to be the first use of this statistic for relevance scoring. There is likely to be greater retrieval improvements possible using chronological term rank enhanced methods in future work.
Adam D. Troy, Guo-Qiang Zhang 0001
SIGIR1