著者

牧野 拓哉 岩倉 友哉

出版者

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

雑誌

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

巻号頁・発行日

vol.35, no.6, pp.B-K46_1-8, 2020-11-01 (Released:2020-11-01)

参考文献数

25

被引用文献数

1

---

Pointer-generator, which is the one of the strong baselines in neural summarization models, generates summaries by selecting words from a set of words (output vocabulary) and words in source documents. A conventional method for constructing output vocabulary collects highly frequent words in summaries of training data. However, highly frequent words in summaries could be usually a high possibility to be frequent in source documents. Thus, an output vocabulary constructed by the conventional method is redundant for pointer-generator because pointergenerator can copy words in source documents. We propose a vocabulary construction method that selects words included in each summary but not included in its source text of each pair. Experimental results on CNN/Daily Mail corpus and NEWSROOM corpus showed that our method contributes to improved ROUGE scores while obtaining high ratios of generating novel words that do not occur in source documents.

著者

中本 和岐 山田 悠 鈴木 英之進

出版者

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

雑誌

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

巻号頁・発行日

vol.18, no.3, pp.144-152, 2003 (Released:2003-03-04)

参考文献数

12

被引用文献数

1 2

---

This paper proposes a fast clustering method for time-series data based on average time sequence vector. A clustering procedure based on an exhaustive search method is time-consuming although its result typically exhibits high quality. BIRCH, which reduces the number of examples by data squashing based on a data structure CF (Clustering Feature) tree, represents an effective solution for such a method when the data set consists of numerical attributes only. For time-series data, however, a straightforward application of BIRCH based on a Euclidean distance for a pair of sequences, miserably fails since such a distance typically differs from human's perception. A dissimilarity measure based on DTW (Dynamic Time Warping) is desirable, but to the best of our knowledge no methods have been proposed for time-series data in the context of data squashing. In order to circumvent this problem, we propose DTWS (Dynamic Time Warping Squashed) tree, which employs a dissimilarity measure based on DTW, and compresses time sequences to the average time sequence vector. An average time sequence vector is obtained by a novel procedure which estimates correct shrinkage of a result of DTW. Experiments using the Australian sign language data demonstrate the superiority of the proposed method in terms of correctness of clustering, while its degradation of time efficiency is negligible.

著者

江上 周作 呂 暁東 古賀 禎 住谷 泰人

出版者

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

雑誌

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

巻号頁・発行日

vol.36, no.1, pp.WI2-F_1-12, 2021-01-01 (Released:2021-01-01)

参考文献数

28

---

With the advancement of information and communication technologies, to improve the interoperability between heterogeneous information systems by regularizing the syntax for information exchange is essential to achieve global seamless air traffic management operation. However, the current point-to-point aviation related information exchange among different systems and operators cannot satisfy the requirement for interoperability. The concept of System Wide Information Management (SWIM) has been promoted by the International Civil Aviation Organization (ICAO) to implement interoperability and harmonization in a global operation. In the SWIM environment, all the related stakeholders need to efficiently obtain the necessary ATM data with situational awareness from various information domains. However, this is difficult to realize in the current system, as different data are structured based on different data models. In this study, we construct domain ontologies based on flight, aeronautical, and weather information exchange models. Moreover, for semantic interoperability in the SWIM environment, we develop an upper ontology-based reference ontology that enables common situational awareness of spatiotemporal concepts. Furthermore, we propose a methodology for mapping heterogeneous domain ontologies to the reference ontology with the manual refinement. Finally, we apply the proposed ontologies to a SWIM test system. The applicability and scalability of the proposed ontologies are demonstrated through a case study in the SWIM environment.

著者

佐藤 大祐 松林 達史 足立 貴行 大井 伸哉 田中 悠介 長野 翔一 六藤 雄一 塩原 寿子 宮本 勝 戸田 浩之

出版者

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

雑誌

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

巻号頁・発行日

vol.35, no.2, pp.D-wd05_1-10, 2020-03-01 (Released:2020-03-01)

参考文献数

16

被引用文献数

2

---

In places where many people gather, such as large-scale event venues, it is important to prevent crowd accidentsfrom occurring. To that end, we must predict the flows of people and develop remedies before congestioncreates a problem. Predicting the movement of a crowd is possible by using a multi-agent simulator, and highly accurateprediction can be achieved by reusing past event information to accurately estimate the simulation parameters.However, no such information is available for newly constructed event venues. Therefore, we propose here a methodthat improves estimation accuracy by utilizing the data measured on the current day. We introduce a people-flowprediction system that incorporates the proposed method. In this paper, we introduce results of an experiment on thedeveloped system that used people flow data measured at an actual concert event.

著者

平 博司 福島 伸一 大澤 幸生 伊庭 斉志 石塚 満

出版者

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

雑誌

人工知能学会論文誌 = Transactions of the Japanese Society for Artificial Intelligence : AI (ISSN:13460714)

巻号頁・発行日

vol.17, pp.268-275, 2002-11-01

参考文献数

21

被引用文献数

2 1

---

Information on the World Wide Web(WWW) is increasing day by day because of its open characteristics. It becomes difficult for users to find useful information in this huge WWW information space. Even if a user can fortunately find useful pages, it is difficult for him/her to acquire all the aspects or a structured knowledge view regarding his/her query.       In this paper, we describe a system called “AreaView2001”, which presents an overall structured view of the queried area together with a set of useful Web pages explaining the area and its subareas. The style of the presentation is similar to book style, consisiting of chapters and sections. When extracting important keywords of the area from collected Web pages, the system employs the method of KeyGraph which can extract keywords of the main topics and underlying basis knowledge of a text document.       AreaView2001 is particularly useful for those users that want to know unfamiliar areas, such as academic areas, since the area knowledge available in the WWW will be presented as a collection of useful Web pages sorted out according to the overall structure of the area. Although the area knowledge to be presented by the system is not so well structured as book chapters because of the full-automatic structuring, it can provide a variety of vivid knowledge not available in books. Some experimental evaluations are given to illustrate the effectiveness of the sysytem.

著者

日高 昇平

出版者

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

雑誌

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

巻号頁・発行日

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

参考文献数

30

---

A long-standing dream in research on artificial intelligence (AI) is to build a strong AI, which understands and processes the input, unlike a weak AI which just processes it as programmed. Toward realization of this dream, we need a mathematical formulation on what understanding is. In the present study, starting off by revisiting Shannon’s mathematical theory of communication, I argue that it is a model of information transmission but not that of information understanding, because of its common codebook shared by the sender and receiver. I outline the steps to build a model of information understanding, by seeking possibilities of decoding without the shared codebook. Given the model of information understanding, I discuss its relationship to other known problems in AI research, such as the symbol grounding problem and frame problem.

著者

蜷川 繁 米田 政明 広瀬 貞樹

出版者

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

雑誌

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

巻号頁・発行日

vol.16, no.2, pp.164-166, 2001 (Released:2002-02-28)

参考文献数

5

被引用文献数

2

---

The “Game of Life” acquires the property of significant behavior, such as universal computation, selforganized criticality and 1/f fluctuation, which depends on initial configurations. Our research investigates the relationship between the transient behavior starting from random initial configurations and array size in the Game of Life. The simulations show that the average transient time ‹T› increases logarithmically with square array size N×N, ‹T›∼logN in null and periodic boundary conditions. This result suggests that the duration of 1/f fluctuation in the “Game of Life” lengthens infinitely in infinite array size.

著者

細馬 宏通 坊農 真弓 石黒 浩 平田 オリザ

出版者

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

雑誌

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

巻号頁・発行日

vol.29, no.1, pp.60-68, 2014

被引用文献数

2

---

When the presence and the action of an android reach to those of human, andoroid can derive multi-modal action from human. How can human parties act with the android to organize the interaction and find the android as the social actor? We observed the development process of the play ``Three Sisters, Android Version'', and analyzed the multi-modal interaction between the android and human players in the process. As the result, the actors express the assessment of human likeness of the android with their utterances and body movements, and the border between human and machine was expressed with each modality in different way. Moreover, these expressions are not one-way product by the writer and director, but the product of repeated interactions between the actors and the android through the practice and rehearsals. Finally we discuss the possibility of ``media equation'' study using the direct observations of man-machine interaction.

著者

角森 唯子 東中 竜一郎 吉村 健 礒田 佳徳

出版者

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

雑誌

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

巻号頁・発行日

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

参考文献数

23

---

A chat-oriented dialogue system can become more likeable if it can remember information about users and use that information during a dialogue. We propose a chat-oriented dialogue system that can use user information acquired during a dialogue and discuss its effectiveness on the interaction over multiple days. In our subjective evaluation over five consecutive days, we compared three systems: A system that can remember and use user information over multiple days (proposed system), one that can only remember user information within a single dialogue session, and another that does not remember any user information. We found that users were significantly more satisfied with our proposed system than with the other two. This paper is the first to verify the effectiveness of remembering on the interaction over multiple days with a fully automated chat-oriented dialogue system.

著者

吉川 友也 岩田 具治 澤田 宏

出版者

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

雑誌

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

巻号頁・発行日

vol.30, no.2, pp.485-490, 2015-03-01 (Released:2015-03-05)

参考文献数

13

---

Group recommendation is a task to recommend items to groups such as households and communities. In this paper, we propose a non-linear matrix factorization method for group recommendation. The proposed method assumes that each member in groups has its own latent vector, and behavior of each group is determined by the probability distribution of the members' latent vectors. Recommending items is performed by using non-linear functions that map the distributions of the groups into scores for items. The non-linear functions are generated from Gaussian processes, which are defined by the similarities between distributions of the groups. We can efficiently calculate the similarities by embedding each distribution as an element in a reproducing kernel Hilbert space. We demonstrate the effectiveness of the method using two synthetic datasets and two real datasets in two prediction tasks.

著者

伊原 尚正 東藤 大樹 櫻井 祐子 横尾 真

出版者

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

雑誌

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

巻号頁・発行日

vol.32, no.5, pp.AG16-E_1-9, 2017-09-01 (Released:2017-09-01)

参考文献数

18

---

The cake cutting problem is concerned with the fair allocation of a divisible good among agents whose preferences vary over it. Recently, designing strategy-proof (SP) cake cutting mechanisms has caught considerable attention from AI and MAS researchers. Previous works assumed that an agent’s utility function is additive so that theoretical analysis becomes tractable. However, in practice, agents have non-additive utility over a resource. In this paper, we consider the all-or-nothing utility function as a representative example of non-additive utility because it can widely cover agents’ preferences for such real-world resources as the usage of meeting rooms, time slots for computational resources, bandwidth usage, and so on. We first show the incompatibility between envy-freeness (EF) and Pareto efficiency (PE) when each agent has all-or-nothing utility. We next propose a SP mechanism that satisfy PE, which is based on the serial dictatorship mechanism, at the sacrifice of EF. To address computational feasibility, we propose a heuristic-based allocation algorithm to find a near-optimal allocation in time polynomial in the number of agents, since the problem of finding a PE allocation is NP-hard. As another approach that abandons PE, we develop an EF and SP mechanism. Furthermore, we argue about false-name-proofness (FNP), which is the expansion of SP, and propose FNP and EF cake cutting mechanism. Finally, we evaluate our proposed mechanisms by computational experiments.

著者

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

出版者

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

雑誌

人工知能学会論文誌 (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.