EDBT 2026 Demo / reviewers in the wild / expert
Philip O'Brien
dblp:25/1934
· DBLP profile ↗
3ranked-venue papers
3as first author
0since 2021 · last 2009
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 3 · 3 first-authorArtificial intelligence and machine learning · 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
2 papers |
Information retrieval · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval
web search |
0.1 | 2 | 2007 | A link-based ranking scheme for focused search · WWW 2007 Focused ranking in a vertical search engine · SIGIR 2007 |
Information retrieval › document retrieval › structured document retrieval
focused retrieval |
0.1 | 1 | 2007 | A link-based ranking scheme for focused search · WWW 2007 |
Information retrieval › ranking › graph-based ranking
link-based ranking |
0.1 | 1 | 2007 | A link-based ranking scheme for focused search · WWW 2007 |
Information retrieval › web search
vertical search |
0.1 | 1 | 2007 | Focused ranking in a vertical search engine · SIGIR 2007 |
Methods — techniques the papers use, named apart from their topics
topic-sensitive pagerank · 0.1pagerank · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2009 | Personalization of Content Ranking in the Context of Local SearchabstractRanking search results using a single ranking function for all search engine visitors is inherently bounded in the performance the ranking algorithm can achieve when considering the variety of requirements of Web searchers and the proliferation of topics and types of data modern search engines rank. Adding a geographical dimension to the mix by way of local search engines further reduces the average satisfaction a ranking algorithm can garner from local search users. Personalization has been proposed in Web search with some success but has not, to our knowledge, been investigated thoroughly in local search. As initial steps in local search personalization, we propose a model for personalizing search results in a local search engine using a hybrid of profile- and click-based user modeling methods. User profiles are used to compare local search results to the topical interests of users and the specific businesses in which they have shown interest by way of search result “clicks”. Our model is tested through a user study and is shown to result in significantly improved mean average precision over the baseline ranking system. Philip O'Brien, Tony Abou-Assaleh, Weizheng Gao |
Web Intelligence | 1 |
| 2007 | Focused ranking in a vertical search engineabstractSince the debut of PageRank and HITS, hyperlink-induced Web document ranking has come a long way. The Web has become increasingly vast and topically diverse. Such vastness has led many into the area of topic-sensitive ranking and its variants. We address the high dimensionality of the Web by providing tools for focused search. A focused search engine is one which seeks coverage over a subset of topics of the Web and presents users with relevant search results in a known domain. This demonstration will introduce readers to the GenieKnows.com Vertical Search Engine. Philip O'Brien, Tony Abou-Assaleh |
SIGIR | 1 |
| 2007 | A link-based ranking scheme for focused searchabstractThis paper introduces a novel link-based ranking algorithm based on a model of focused Web surfers. FocusedRank is described and compared to implementations of PageRank and Topic-Sensitive PageRank. We report a user study that measures the relevance and precision of each approach. FocusedRank gives superior relevancy over PageRank, while significantly reducing the computational complexity compared to the Topic-Senstivice PageRank. Philip O'Brien, Tony Abou-Assaleh, Tapajyoti Das, Weizheng Gao, Yingbo Miao, Zhen Zhen |
WWW | 1 |