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

Takayuki Kawabata

dblp:09/6440 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · none

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

Artificial intelligence and machine learning · 3Databases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1Human-computer interaction and ubiquitous computing · 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.

Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 56% Mathematical optimization · 44%

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

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design › auction theory › bidding strategy
bid optimization
0.312018
Optimal Bidding Strategy for Brand Advertising · IJCAI 2018
Algorithmic game theory and mechanism design
online advertising
0.312018
Optimal Bidding Strategy for Brand Advertising · IJCAI 2018
Mathematical optimization › submodular optimization › submodular maximization
online submodular maximization
0.312018
Optimal Bidding Strategy for Brand Advertising · IJCAI 2018
Mathematical optimization › submodular optimization
submodular maximization
0.312018
Optimal Bidding Strategy for Brand Advertising · IJCAI 2018
Algorithmic game theory and mechanism design
auction theory
0.112018
Optimal Bidding Strategy for Brand Advertising · IJCAI 2018
Algorithmic game theory and mechanism design › mechanism design › auction design
second-price auction
0.112018
Optimal Bidding Strategy for Brand Advertising · IJCAI 2018

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

submodular optimization · 0.3online knapsack · 0.3
YearPublicationVenuePosition
2018 Conversational Agents to Suppress Customer Anger in Text-based Customer-support Conversations
abstract
Emotional labor in text-based chat environments will be widespread in the near future. It is difficult for novice workers to make smooth conversation with an angry customer in a customer-support work- ing environment, one of the stressful emotional labors. In this pa- per, we propose a method to suppress the customer's anger based on a communication agent introduced into customer-support work in order to facilitate smooth communication. The agent first estab- lishes a positive relationship with the customer, and then the atti- tude changes to be sympathetic to the customer-support worker in order for the customer to follow sympathy and reduce anger. From the experimental evaluation, it is found that there is the possibil- ity of suppressing the participants' anger by this method, but the anger itself is at a higher level than in the common environment without the agent.
Itaru Kuramoto, Jun Baba, Kohei Ogawa, Yuichiro Yoshikawa, Takayuki Kawabata, Hiroshi Ishiguro
HAI5
2018 Optimal Bidding Strategy for Brand Advertising
abstract
Brand advertising is a type of advertising that aims at increasing the awareness of companies or products. This type of advertising is well studied in economic, marketing, and psychological literature; however, there are no studies in the area of computational advertising because the effect of such advertising is difficult to observe. In this study, we consider a real-time biding strategy for brand advertising. Here, our objective to maximizes the total number of users who remember the advertisement, averaged over the time. For this objective, we first introduce a new objective function that captures the cognitive psychological properties of memory retention, and can be optimized efficiently in the online setting (i.e., it is a monotone submodular function). Then, we propose an algorithm for the bid optimization problem with the proposed objective function under the second price mechanism by reducing the problem to the online knapsack constrained monotone submodular maximization problem. We evaluated the proposed objective function and the algorithm in a real-world data collected from our system and a questionnaire survey. We observed that our objective function is reasonable in real-world setting, and the proposed algorithm outperformed the baseline online algorithms.
Takanori Maehara, Atsuhiro Narita, Jun Baba, Takayuki Kawabata
IJCAI4
2013 A File Recommendation Method Based on Task Workflow Patterns Using File-Access Logs
Takayuki Kawabata, Fumiaki Itoh, Yousuke Watanabe, Haruo Yokota
DEXA (2)2
2003 Concept-based Web communities for Google™ search engine
abstract
The objective of this paper is to develop an intelligent computer system with some deductive capabilities to conceptually cluster, match and rank pages based on predefined linguistic formulations and rules defined by experts or based on a set of known homepages. The conceptual fuzzy set (CFS) model will be used for intelligent information and knowledge retrieval through conceptual matching of both text and links (here defined as "Concept"). The selected query doesn't need to match the decision criteria exactly, which gives the system a more human-like behavior. The model can be used for intelligent information and knowledge retrieval through Web-connectivity-based clustering.
Tomoe Tomiyama, Ryosuke Ohgaya, Akiyoshi Shimmura, Takayuki Kawabata, Tomohiro Takagi, M. Nikravesh
FUZZ-IEEE4