著者

井上 昂治 原 康平 ララ ディベッシュ 中村 静 高梨 克也 河原 達也

出版者

一般社団法人 人工知能学会

雑誌

人工知能学会論文誌 (ISSN:13460714)

巻号頁・発行日

vol.35, no.5, pp.D-K43_1-10, 2020-09-01 (Released:2020-09-01)

参考文献数

32

---

A spoken dialogue system that plays the role of an interviewer for job interviews is presented. In this work, ourgoal is to implement an automated job interview system where candidates can use it as practice before the real interview.Conventional job interview systems ask only pre-defined questions, which make the dialogue monotonous andfar from human-human interviews. We propose follow-up question generation based on the assessment of candidateresponses and keyword extraction. This model was integrated into the dialogue system of the autonomous androidERICA to conduct subject experiments. The proposed job interview system was compared with the baseline systemthat did not generate any follow-up questions and selected among pre-defined questions. The experimental resultsshow that the proposed system is significantly better in subjective evaluations regarding impressions of job interviewpractice, the quality of questions, and the presence of the interviewer.

著者

角森 唯子 東中 竜一郎 高橋 哲朗 稲葉 通将

出版者

一般社団法人 人工知能学会

雑誌

人工知能学会論文誌 (ISSN:13460714)

巻号頁・発行日

vol.35, no.1, pp.DSI-G_1-10, 2020-01-01 (Released:2020-01-01)

参考文献数

26

被引用文献数

1

---

The task of detecting dialogue breakdown, the aim of which is to detect whether a system utterance causes dialogue breakdown in a given dialogue context, has been actively researched in recent years. However, currently, it is not clear which evaluation metrics should be used to evaluate dialogue breakdown detectors, hindering progress in dialogue breakdown detection. In this paper, we propose finding appropriate metrics for evaluating the detectors in dialogue breakdown detection challenge 3. In our approach, we first enumerate possible evaluation metrics and then rank them on the basis of system ranking stability and discriminative power. By using the submitted runs (results of dialogue breakdown detection of participants) of dialogue breakdown detection challenge 3, we experimentally found that RSNOD(NB,PB,B) is an appropriate metric for dialogue breakdown detection in dialogue breakdown detection challenge 3 for English and Japanese, although NMD(NB,PB,B) and MSE(NB,PB,B) were found appropriate specifically for English and Japanese, respectively.

著者

岩崎 敦 横尾 真 寺田 賢二

出版者

一般社団法人 人工知能学会

雑誌

人工知能学会論文誌 (ISSN:13460714)

巻号頁・発行日

vol.19, no.4, pp.334-342, 2004 (Released:2004-05-28)

参考文献数

14

被引用文献数

1

---

This paper develops a new ascending-price multi-unit auction protocol that has following characteristics: (i) it has an open format, (ii) sincere bidding is an equilibrium strategy even if the marginal utilities of each agent can increase and agents can submit false-name bids. False-name bids are bids submitted under fictitious names such as multiple e-mail addresses, which can be done easily in the Internet. This is the first protocol that has these two characteristics. We show that our new protocol outperforms an existing protocol, which satisfies (ii), with respect to the social surplus and the seller's revenue.

著者

吉岡 卓 東条 敏

出版者

一般社団法人 人工知能学会

雑誌

人工知能学会論文誌 (ISSN:13460714)

巻号頁・発行日

vol.21, no.3, pp.257-265, 2006 (Released:2006-03-09)

参考文献数

31

被引用文献数

1

---

Linear tense logics are widely accepted for structural temporal representation, where the basic KT has two modal operators G and H, each of which represents the future and the past, respectively. On the other hand, the temporal interval relations arranged by Allen have long been the standard of natural language semantics, though it still lacks the modal-logical foundation. Van Benthem proposed ∉up and ∉down in regard to the accessibility to overlapping intervals and subintervals, respectively; however, the logical feature of the modality has not well studied. In this study, we propose a many-dimensional logic including the conventional tense logic, together with such interval accessibility. And, we show that our logic provide a formal apparatus for a precise aspectual classification. Lastly, we introduce the sequent system for our logic. We show the subformula property holds in our system, and thus would be able to show the decidability.

著者

高村 大也 奥村 学

出版者

一般社団法人 人工知能学会

雑誌

人工知能学会論文誌 (ISSN:13460714)

巻号頁・発行日

vol.25, no.1, pp.174-182, 2010 (Released:2010-01-06)

参考文献数

31

被引用文献数

1 4

---

e propose a novel multi-document generic summarization model based on the budgeted median problem, which is a facility location problem. The summarization method based on our model is an extractive method, which selects sentences from the given document cluster and generates a summary. Each sentence in the document cluster will be assigned to one of the selected sentences, where the former sentece is supposed to be represented by the latter. Our method selects sentences to generate a summary that yields a good sentence assignment and hence covers the whole content of the document cluster. An advantage of this method is that it can incorporate asymmetric relations between sentences such as textual entailment. Through experiments, we showed that the proposed method yields good summaries on the dataset of DUC'04.

著者

池田 心 小林 重信

出版者

一般社団法人 人工知能学会

雑誌

人工知能学会論文誌 (ISSN:13460714)

巻号頁・発行日

vol.17, no.3, pp.239-246, 2002 (Released:2002-04-25)

参考文献数

19

被引用文献数

4 8

---

Genetic Algorithms(GAs) are effective approximation algorithms which focus on “hopeful area” in the searching process. However, in harder problems, it is often very difficult to maintain a favorable trade-off between exploitation and exploration. All individuals leave the big-valley including the global optimum, and concentrate on another big-valley including a local optimum often. In this paper, we define such a situation on conventional GAs as the “UV-phenomenon”, and suggest UV-structures as hard landscape structures that will cause the UV-phenomenon. We introduce a test function which has explicit UV-structures, and show UV-phenomenon caused by them. Next we analyze Fletcher and Powell function to confirm our hypothesis. Finally we propose a novel framework of GAs which can cope with UV-structures.

著者

伊藤 禎宣 角 康之 間瀬 健二 國藤 進

出版者

人工知能学会

雑誌

人工知能学会論文誌 (ISSN:13460714)

巻号頁・発行日

vol.17, no.3, pp.301-312, 2002-05-01

被引用文献数

2

---

SmartCourier is a Web-based system for browsing electronic documents shared in a group of people. It allows users to annotate on the documents with a pen interface, and share the annotations among the users having similar interests on the documents. Also, the system recommends a user unread documents inferred interesting to the user by using a collaborative filtering method. We prototyped two versions of SmartCourier. The first version used a method to matchmake users according to agreement of annotated area on the same documents without any semantic processing of the annotations and the base documents. The second version employed a method to extract keywords from the annotated area of the base documents and find other related documents sharing the keywords. The experimented evaluation shows the second version of SmartCourier was accepted by the users as more efficient system for facilitating knowledge interaction among them.

著者

藤巻 遼平 山口 勇太郎 江藤 力

出版者

一般社団法人 人工知能学会

雑誌

人工知能学会論文誌 (ISSN:13460714)

巻号頁・発行日

vol.31, no.6, pp.AI30-I_1-9, 2016-11-01 (Released:2016-11-02)

参考文献数

34

被引用文献数

2

---

Piecewise sparse linear regression models using factorized asymptotic Bayesian inference (a.k.a. FAB/HME) have recently been employed in practical applications in many industries as a core algorithm of the Heterogeneous Mixture Learning technology. Such applications include sales forecasting in retail stores, energy demand prediction of buildings for smart city, parts demand prediction to optimize inventory, and so on. This paper extends FAB/HME for classification and conducts the following two essential improvements. First, we derive a refined version of factorized information criterion which offers a better approximation of Bayesian marginal log-likelihood. Second, we introduce an analytic quadratic lower bounding technique in an EM-like iterative optimization process of FAB/HME, which drastically reduces computational cost. Experimental results show that advantages of our piecewise sparse linear classification over state-of-the-art piecewise linear models.

著者

溝口 理一郎

出版者

一般社団法人 人工知能学会

雑誌

人工知能学会論文誌 (ISSN:13460714)

巻号頁・発行日

vol.35, no.1, pp.C-J52_1-13, 2020-01-01 (Released:2020-01-01)

参考文献数

16

---

From the standpoint of Applied Ontology, we have challenged the problem of causality on the premise that it is real. As a result, it was shown in the former paper the following three items: (1) causation can be mapped to function, and hence it is possible to talk about causation in terms of function, (2) Cause can be divided into four subfunctions such as Achieve, Prevent, Allow and Disallow by introducing two dimensions of direct/indirect and positive/negative, and (3) using Achieve the other three subfunctions are defined and the essence of causality lies in Achieve. However, elucidation of Achieve itself was left incomplete. In this paper, we first restructure the results obtained in the former paper and summarize it so that the results will become clearer than the original paper. Then, the nature of Achieve is revealed to give a world first solution to the problem of what causation is.

著者

Yuanzhi Ke Masafumi Hagiwara

出版者

The Japanese Society for Artificial Intelligence

雑誌

人工知能学会論文誌 (ISSN:13460714)

巻号頁・発行日

vol.33, no.4, pp.D-I23-1-8, 2018-07-01 (Released:2018-07-02)

参考文献数

25

被引用文献数

3

---

Although word embeddings are powerful, weakness on rare words, unknown words and issues of large vocabulary motivated people to explore alternative representations. While the character embeddings have been successful for alphabetical languages, Japanese is difficult to be processed at the character level as well because of the large vocabulary of kanji, written in the Chinese characters. In order to achieve fewer parameters and better generalization on infrequent words and characters, we proposed a model that encodes Japanese texts from the radical-level representation, inspired by the experimental findings in the field of psycholinguistics. The proposed model is comprised of a convolutional local encoder and a recurrent global encoder. For the convolutional encoder, we propose a novel combination of two kinds of convolutional filters of different strides in one layer to extract information from the different levels. We compare the proposed radical-level model with the state-of-the-art word and character embedding-based models in the sentiment classification task. The proposed model outperformed the state-of-the-art models for the randomly sampled texts and the texts that contain unknown characters, with 91% and 12% fewer parameters than the word embedding-based and character embedding-based models, respectively. Especially for the test sets of unknown characters, the results by the proposed model were 4.01% and 2.38% above the word embedding-based and character embedding-based baselines, respectively. The proposed model is powerful with cheaper computational and storage cost, can be used for devices with limited storage and to process texts of rare characters.

著者

大谷 紀子 志村 正道

出版者

一般社団法人 人工知能学会

雑誌

人工知能学会論文誌 (ISSN:13460714)

巻号頁・発行日

vol.19, no.5, pp.399-404, 2004 (Released:2004-07-06)

参考文献数

11

被引用文献数

2 1

---

In representing classification rules by decision trees, simplicity of tree structure is as important as predictive accuracy especially in consideration of the comprehensibility to a human, the memory capacity and the time required to classify. Trees tend to be complex when they get high accuracy. This paper proposes a novel method for generating accurate and simple decision trees based on symbiotic evolution. It is distinctive of symbiotic evolution that two different populations are evolved in parallel through genetic algorithms. In our method one's individuals are partial trees of height 1, and the other's individuals are whole trees represented by the combinations of the former individuals. Generally, overfitting to training examples prevents getting high predictive accuracy. In order to circumvent this difficulty, individuals are evaluated with not only the accuracy in training examples but also the correct answer biased rate indicating the dispersion of the correct answers in the terminal nodes. Based on our method we developed a system called SESAT for generating decision trees. Our experimental results show that SESAT compares favorably with other systems on several datasets in the UCI repository. SESAT has the ability to generate more simple trees than C5.0 without sacrificing predictive accuracy.

著者

中小路 久美代 山本 恭裕

出版者

一般社団法人 人工知能学会

雑誌

人工知能学会論文誌 (ISSN:13460714)

巻号頁・発行日

vol.19, no.2, pp.154-165, 2004 (Released:2004-01-27)

参考文献数

41

被引用文献数

3 3

---

This paper describes our approach for the development of application systems for creative knowledge work, particularly for early stages of information design tasks. Being a cognitive tool serving as a means of externalization, an application system affects how the user is engaged in the creative process through its visual interaction design. Knowledge interaction design described in this paper is a framework where a set of application systems for different information design domains are developed based on an interaction model, which is designed for a particular model of a thinking process. We have developed two sets of application systems using the knowledge interaction design framework: one includes systems for linear information design, such as writing, movie-editing, and video-analysis; the other includes systems for network information design, such as file-system navigation and hypertext authoring. Our experience shows that the resulting systems encourage users to follow a certain cognitive path through graceful user experience.

著者

立花 誠人 村田 剛志

出版者

一般社団法人 人工知能学会

雑誌

人工知能学会論文誌 (ISSN:13460714)

巻号頁・発行日

vol.34, no.5, pp.B-IC2_1-8, 2019-09-01 (Released:2019-09-01)

参考文献数

14

被引用文献数

1

---

Since several types of data can be represented as graphs, there has been a demand for generalizing neural network models for graph data. Graph convolution is a recent scalable method for performing deep feature learning on attributed graphs by aggregating local node information over multiple layers. Such layers only consider attribute information of node neighbors in the forward model and do not incorporate knowledge of global network structure in the learning task. In this paper, we present a scalable semi-supervised learning method for graph-structured data which considers not only neighbors information, but also the global network structure. In our method, we add a term preserving the network structural features such as centrality to the objective function of Graph Convolutional Network and train for both node classification and network structure preservation simultaneously. Experimental results showed that our method outperforms state-of-the-art baselines for the node classification tasks in the sparse label regime.

著者

辻 順平 能登 正人

出版者

一般社団法人 人工知能学会

雑誌

人工知能学会論文誌 (ISSN:13460714)

巻号頁・発行日

vol.33, no.2, pp.C-H98_1-9, 2018-03-01 (Released:2018-03-01)

参考文献数

14

---

In the theme park problem, it is important to find a coordination algorithm that effectively shortens the visiting time of an entire theme park while guaranteeing individual optimality for each visitor. In a previous study, a coordination algorithm, called statement-based cost estimate (SCE), was proposed that allows individual visitors to select plans that minimize a visitor’s visiting time while shortening the visiting time of the entire theme park. However, the improvement in visiting time was not sufficient from their experiment using SCE. We thought it necessary to relax the premise constraint “minimize individual visiting time” to further improve SCE. In this paper, we propose a framework to further reduce visiting time by considering Pareto optimality. In the proposed framework, each visitor determines several Pareto optimal plans based on the evaluation value calculated using SCE and presents them to a coordination system. Then, the coordination system searches for the entire optimal plan that minimizes the predicted value of the total visiting time of the entire theme park among the Pareto optimal plan candidates. The proposed framework guarantees visitors’ “personal optimality” in the meaning of Pareto optimality, and there is a possibility that the framework will shorten the visiting time of the entire theme park. We conducted a simulation experiment using a coordination algorithm based on the proposed framework and clarified the effectiveness of the framework.

著者

浜田 良樹 松尾 徳朗 伊藤 孝行

出版者

一般社団法人 人工知能学会

雑誌

人工知能学会論文誌 (ISSN:13460714)

巻号頁・発行日

vol.33, no.5, pp.A-I13_1-4, 2018-09-01 (Released:2018-09-03)

参考文献数

10

---

The authors’ group has been developed AI-based Online Consensus Building Support System called COLLAGREE and used around our university since 2010. The goal of our research is to spread this system to other local governments. However, new technology which directly concerns to society might make a conflict with current society. This problem has been commonly known as ELSI. In this paper, we analyzed our past experiments by using our system, developed the reason of success, and ELSI problems that need to solve. To achieve this purpose, we launched ELSI Committee on December 2017. Our approach should be useful for other AI-based systems, when researcher has been conscious on ELSI issue.

著者

藁谷 敏晴

出版者

一般社団法人 人工知能学会

雑誌

人工知能学会論文誌 (ISSN:13460714)

巻号頁・発行日

vol.20, no.6, pp.448-460, 2005 (Released:2005-10-12)

参考文献数

27

被引用文献数

2 2

---

The main aim of this paper is to propose an appropriate logical system that is suitable to describe the notion of IS-A link as well as is-a link. The most important point to be realized is that those relations are not set thoretical ones. They connect two `general names' to construct a proposition, so that what is needed for proper descriptions of the relations in question is a theory of general names. It will be shown that is-a is a logical unit of axiomatically determined behaviour. The axiom concerning is-a relation was established by S. Lesniewski who named his theory of general names ontology. Today `ontology' has also become a common term for AI researchers. I intend to make it clear that there is a close connection between `ontology' used by Lesniewski and by AI researchers, even though they developed quite independently. I wish to stress that ontology created by Lesniewski is a system of syllogistic equipped with singular propositions and the theory of quantification. To make this point clear, I proposed a fragment of syllogism that I called MO(minimal ontology). This paper includes comments and examples articulating the logical power of ontology.

著者

藤原 靖宏 中辻 真 塩川 浩昭 三島 健 鬼塚 真

出版者

一般社団法人 人工知能学会

雑誌

人工知能学会論文誌 (ISSN:13460714)

巻号頁・発行日

vol.30, no.2, pp.473-478, 2015-03-01 (Released:2015-02-03)

参考文献数

6

---

In AI communities, many applications utilize PageRank. To obtain high PageRank score nodes, the original approach iteratively computes the PageRank score of each node until convergence from the whole graph. If the graph is large, this approach is infeasible due to its high computational cost. The goal of this study is to find top-k PageRank score nodes efficiently for a given graph without sacrificing accuracy. Our solution, F-Rank, is based on two ideas: (1) It iteratively estimates lower/upper bounds of PageRank scores, and (2) It constructs subgraphs in each iteration by pruning unnecessary nodes and edges to identify top-k nodes. Experiments show that F-Rank finds top-k nodes much faster than the original approach.

著者

井手 一郎 木下 智義 高橋 友和 孟 洋 片山 紀生 佐藤 真一 村瀬 洋

出版者

一般社団法人 人工知能学会

雑誌

人工知能学会論文誌 (ISSN:13460714)

巻号頁・発行日

vol.23, no.5, pp.282-292, 2008

被引用文献数

9 2

---

Recent increase of digital storage capacity has enabled the creation of large-scale on-line broadcast video archives. In order to make full use of the data in the archive, it is necessary to let a user easily grasp the availability of certain video data and their contents. Considering this problem, we have been investigating efficient and effective retrieval and reusing methodologies of archived video data. The archive used as a test-bed consists of more than 1,000 hours of news video obtained from a Japanese news program during the past six years. This paper first proposes a news topic tracking and structuring method. A structure called the `topic thread structure', is organized so that it should represent the temporal flow of news topics originating from a specified news story. The paper next introduces a browsing and editing interface that enables the user to browse through news stories along the topic thread structure, and also assists the compilation of selected news stories as a customized video summary or a documentary. The method was applied to the archived news video data in order to observe the quality of the topic thread structure and the usability of the prototype interface. As a result, some structures represented the flow of topics quite close to real-world comprehension. In addition, experiments showed that when the structure could be considered meaningful, the interface combined with the structure could drastically reduce the time needed to browse through the archive for news stories related to the user's interest.

著者

寺田 和憲 山田 誠二 伊藤 昭

出版者

一般社団法人 人工知能学会

雑誌

人工知能学会論文誌 (ISSN:13460714)

巻号頁・発行日

vol.27, no.2, pp.73-81, 2012

---

We conducted an experimental investigation on human adaptation to change in an agent's strategy through a competitive two-player game. Modeling the process of human adaptation to agents is important for designing intelligent interface agents and adaptive user interfaces that learn a user's preferences and behavior strategy. However, few studies on human adaptation to such an agent have been done. We propose a human adaptation model for a two-player game. We prepared an on-line experimental system in which a participant and an agent play a repeated penny-matching game with a bonus round. We then conducted experiments in which different opponent agents (human or robot) change their strategy during the game. The experimental results indicated that, as expected, there is an adaptation phase when a human is confronted with a change in the opponent agent's strategy, and adaptation is faster when a human is competing with robot than with another human.

著者

稲葉 通将 高橋 健一

出版者

一般社団法人 人工知能学会

雑誌

人工知能学会論文誌 (ISSN:13460714)

巻号頁・発行日

vol.34, no.2, pp.E-I94_1-9, 2019-03-01 (Released:2019-03-01)

参考文献数

28

---

Non-task-oriented dialogue systems are required to chat with users in accordance with their interests. In this study, we propose a neural network-based method for estimating speakers’ levels of interest from dialogues. Our model first converts given utterances into utterance vectors using a word sequence encoder with word attention. Afterward, our novel attention approach, sentence-specific sentence attention extracts useful information for estimating the level of interest. Additionally, we introduce a new pre-training method for our model. Experimental results indicated that it was most effective to use topic-specific sentence attention and proposed pre-training in combination.