EDBT 2026 Demo / reviewers in the wild / expert
Koji Tsukamoto
dblp:144/2763
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2014
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 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
1 paper |
Information retrieval · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval › online advertising › sponsored search
ad retrieval |
0.2 | 1 | 2014 | Filling context-ad vocabulary gaps with click logs · KDD 2014 |
Information retrieval › query log analysis › clickthrough data
click-through data mining |
0.2 | 1 | 2014 | Filling context-ad vocabulary gaps with click logs · KDD 2014 |
Information retrieval › online advertising
contextual advertising |
0.2 | 1 | 2014 | Filling context-ad vocabulary gaps with click logs · KDD 2014 |
Information retrieval
vocabulary mismatch |
0.2 | 1 | 2014 | Filling context-ad vocabulary gaps with click logs · KDD 2014 |
Methods — techniques the papers use, named apart from their topics
translation learning · 0.2TF-IDF · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | Filling context-ad vocabulary gaps with click logsabstractContextual advertising is a form of textual advertising usually displayed on third party Web pages. One of the main problems with contextual advertising is determining how to select ads that are relevant to the page content and/or the user information in order to achieve both effective advertising and a positive user experience. Typically, the relevance of an ad to page content is indicated by a tf-idf score that measures the word overlap between the page and the ad content, so this problem is transformed into a similarity search in a vector space. However, such an approach is not useful if the vocabulary used on the page is expected to be different from that in the ad. There have been studies proposing the use of semantic categories or hidden classes to overcome this problem. With these approaches it is necessary to expand the ad retrieval system or build new index to handle the categories or classes, and it is not always easy to maintain the number of categories and classes required for business needs. In this work, we propose a translation method that learns the mapping of the contextual information to the textual features of ads by using past click data. The contextual information includes the user's demographic information and behavioral information as well as page content information. The proposed method is able to retrieve more preferable ads while maintaining the sparsity of the inverted index and the performance of the ad retrieval system. In addition, it is easy to implement and there is no need to modify an existing ad retrieval system. We evaluated this approach offline on a data set based on logs from an ad network. Our method achieved better results than existing methods. We also applied our approach with a real ad serving system and compared the online performance using A/B testing. Our approach achieved an improvement over the existing production system. Yukihiro Tagami, Toru Hotta, Shingo Ono, Koji Tsukamoto, Akira Tajima |
KDD | 5 |
| 2002 | Learning with Multiple Stacking for Named Entity Recognition
Koji Tsukamoto, Yutaka Mitsuishi, Manabu Sassano |
CoNLL | 1 |