著者
鈴木 輝彦 延澤 志保 太原 育夫
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会論文誌 (ISSN:13460714)
巻号頁・発行日
vol.24, no.1, pp.178-190, 2009 (Released:2009-01-06)
参考文献数
9

Tierra and Avida are well-known models of digital organisms. They describe a life process as a sequence of computation codes. A linear sequence model may not be the only way to describe a digital organism, though it is very simple for a computer-based model. Thus we propose a new digital organism model based on a tree structure, which is rather similar to the generic programming. With our model, a life process is a combination of various functions, as if life in the real world is. This implies that our model can easily describe the hierarchical structure of life, and it can simulate evolutionary computation through mutual interaction of functions. We verified our model by simulations that our model can be regarded as a digital organism model according to its definitions. Our model even succeeded in creating species such as viruses and parasites.
著者
平尾 努 鈴木 潤 磯崎 秀樹
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会論文誌 (ISSN:13460714)
巻号頁・発行日
vol.24, no.2, pp.223-231, 2009 (Released:2009-01-20)
参考文献数
17
被引用文献数
3 4 1

We derived the oracle summary with the highest ROUGE score that can be achieved by integrating sentence extraction with sentence compression from the reference abstract. The analysis results of the oracle revealed that summarization systems have to assign an appropriate compression rate for each sentence in the document. In accordance with this observation, this paper proposes a summarization method as a combinatorial optimization: selecting the set of sentences that maximize the sum of the sentence scores from the pool which consists of the sentences with various compression rates, subject to length constrains. The score of the sentence is defined by its compression rate, content words and positional information. The parameters for the compression rates and positional information are optimized by minimizing the loss between score of oracles and that of candidates. The results obtained from TSC-2 corpus showed that our method outperformed the previous systems with statistical significance.
著者
今別府 考洋 小野 智司 森重 綾太 黒瀬 元義 中山 茂
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会論文誌 (ISSN:13460714)
巻号頁・発行日
vol.24, no.2, pp.250-262, 2009 (Released:2009-01-27)
参考文献数
45
被引用文献数
1 1

Quantum-inspired Evolutionary Algorithm (QEA) has been proposed as one of stochastic algorithms of evolutionary computation instead of a quantum algorithm. The authors have proposed Quantum-inspired Evolutionary Algorithm based on Pair Swap (QEAPS), which uses pair swap operator and does not group individuals in order to simplify QEA and reduce parameters in QEA. QEA and QEAPS imitationally use quantum bits as genes and superposition states in quantum computation. QEAPS has shown better search performance than QEA on knapsack problem, while eliminating parameters about immigration intervals and number of groups. However, QEAPS still has a parameter in common with QEA, a rotation angle unit, which is uncommon among other evolutionary computation algorithms. The rotation angle unit deeply affects exploitation and exploration control in QEA, but it has been unclear how the parameter influences QEAPS to behave. This paper aims to show that QEAPS involves few parameters and even those parameters can be adjusted easily. Experimental results, in knapsack problem and number partitioning problem which have different characteristics, have shown that QEAPS is competitive with other metaheuristics in search performance, and that QEAPS is robust against the parameter configuration and problem characteristics.
著者
三木 光範 廣安 知之 冨岡 弘志
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会論文誌 (ISSN:13460714)
巻号頁・発行日
vol.20, no.4, pp.289-296, 2005 (Released:2005-04-19)
参考文献数
17
被引用文献数
3 6

We propose a parallel distributed interactive genetic algorithm(PDIGA) as a new design collaboration method. PDIGA uses an IGA and a parallel distributed genetic algorithm, which combines several IGA systems, and it has a scheme that best ones among the design solutions based on the subjective evaluation of each user are shared among users for every generation. A collaboration system using PDIGA is developed to make good design solutions among several people at difference locations. To verify a validity of the PDIGA system, we conducted experiments for comparing IGA and PDIGA. In particular, we examined each user's evaluation to the final design, compared the averages of the individual evaluation value, and examined the similarity of the design solution. These showed that the collaboration system using PDIGA become a consensus building system, and users' design solutions are unified in a group.
著者
内田 誠 白山 晋
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会論文誌 (ISSN:13460714)
巻号頁・発行日
vol.23, no.6, pp.485-493, 2008 (Released:2008-08-26)
参考文献数
33
被引用文献数
1

We investigate a factor of the `network effect' that affects on communication service markets by a multi-agent based simulation approach. The network effect is one of a market characteristic, whereby the benefit of a service or a product increase with use. So far, the network effect has been studied in terms of macroscopic metrics, and interaction patterns of consumers in the market were often ignored. To investigate an infulence of structures of the interaction patterns, we propose a multi-agent based model for a communication serivce market, in which embedded complex network structures are considered as an interaction pattern of agents. Using several complex network models as the interaction patterns, we study the dynamics of a market in which two providers are competing. By a series of simulations, we show that the structural properties of the complex networks, such as the clustering coefficient and degree correlations, are the major factors of the network effect. We also discuss an adequate model of the interaction pattern for reproducing the market dynamics in the real world by performing simulations exploiting with a real data of social network.
著者
携帯電話アプリケーション 作成プロジェクト 新美 礼彦 高木 剛 小西 修 宮本 衛市 高橋 修
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会全国大会論文集 第20回全国大会(2006)
巻号頁・発行日
pp.111, 2006 (Released:2006-12-07)

GPS携帯電話を用いたマルチベンダ対応アプリケーションを開発した。GPS機能を用いて、グループメンバの現在位置を地図上に表示し、チャットによりコミュニケーションがとれるシステムを実装した。また、グループメンバで共有できるオンラインスケジューラを実装した。今後、両機能を実装したアプリケーションを開発する予定である。
著者
土井 晃一郎 山下 哲矢 田中 孝侑 山本 章博
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会論文誌 (ISSN:13460714)
巻号頁・発行日
vol.23, no.3, pp.185-192, 2008 (Released:2008-03-11)
参考文献数
20

We present the intentional kernel as a new class of kernel functions for structured data. The class is highly contrasted to the convolution kernel, that is a typical class of kernel functions. That is, the convolution kernel is defined with sub-structures, while the intentional kernel is based on derivations constracting structures. We show instances of the intentional kernel for boolean functions, first-order terms, context sensitive languages, and RNA sequences. We also show some properties of the intentional kernel, and discuss the difference between the intentional kernel and the convolution kernel.
著者
上原 宏 佐藤 忠彦 吉田 健一
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会論文誌 (ISSN:13460714)
巻号頁・発行日
vol.23, no.3, pp.205-216, 2008 (Released:2008-03-11)
参考文献数
20
被引用文献数
1

This paper proposes a method to measure the effects of TV advertisements on the Internet bulletin boards. It aims to clarify how the viewes' interests on TV advertisements are reflected on their images on the promoted products. Two kinds of time series data are generated based on the proposed method. First one represents the time series fluctuation of the interests on the TV advertisements. Another one represents the time series fluctuation of the images on the products. By analysing the correlations between these two time series data, we try to clarify the implicit relationship between the viewer's interests on the TV advertisement and their images on the promoted products. By applying the proposed method to an Internet bulletin board that deals with certain cosmetic brand, we show that the images on the products vary depending on the difference of the interests on each TV advertisement.
著者
佐久間 淳 安藤 晋 小林 重信
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会論文誌 (ISSN:13460714)
巻号頁・発行日
vol.23, no.3, pp.163-175, 2008 (Released:2008-02-26)
参考文献数
17

In the process of mixture model estimation using Expectation-Maximization (EM) methods, mixture densities are required to be measured at every step to obtain posterior probabilities. When the number of data n in a dataset or the number of mixtures m is large, the time complexity required for the evaluation of posterior probabilities is O(mn).
著者
加藤 恒昭 松下 光範
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会論文誌 (ISSN:13460714)
巻号頁・発行日
vol.22, no.5, pp.553-562, 2007 (Released:2007-07-17)
参考文献数
20
被引用文献数
1 2

Information compilation is a novel technology that allows it to compile various information intelligently, and to make it easy to understand and to access. In this paper, as an instance of the possibilities of information compilation, we show a framework that extracts and visualizes given time-series information and its changes, and provides users with a multi-modal summarization and also an interactive interface for accessing that information. It can meet information requests, in which users need to comprehend some trend and movement, and access a series of documents containing specific time-series information related. We emphasis the importance of changes of data during some time period rather than data points, as the unit of information extracted and represented. Based on this idea, we propose a visualization method in which qualitative and quantitative characteristics of changes of a given time-series information are plotted with textually represented comments, and a widely applicable information extraction method that regards the changes of time-series information as information primitives and extracts those for the visualization.
著者
片上 大輔 大久保 亮介 新田 克己
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会論文誌 (ISSN:13460714)
巻号頁・発行日
vol.21, no.6, pp.459-472, 2006 (Released:2006-08-23)
参考文献数
13

The purpose of this research is to predict the subjects which will become the fashion in an electronic bulletin board in the near future. We proposed the technique which analyzes propagation of the subject based on link information. To extract the pattern of propagation, we proposed several criteria to measure the fashion degree of the subject based on link information which appears in contributed articles. We realized prediction method with unknown subject in fashion using the classification by Support Vector Machine. We conducted experiments to verify the validity of this technique with known collected fashion-subjects.
著者
青山 一美 南野 活樹 下村 秀樹
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会論文誌 (ISSN:13460714)
巻号頁・発行日
vol.22, no.4, pp.375-388, 2007 (Released:2007-04-18)
参考文献数
11
被引用文献数
1 3 2

An autonomous agent in the real world should learn its own sensor-motor coordination through interactions with the environment; otherwise the behaviors can not be grounded and they can easily be inappropriate in the variety of the environment. The sensor-motor signals are usually complex time sequence, therefore the cognitive action system of the agent has to handle them.In this paper, we propose a computational model of the cognitive action system that consists of a sensor space HMM-SOM, a motor space HMM-SOM and connection mapping between the two HMM-SOMs. A HMM-SOM can be recognized as a set of HMMs that are placed in a SOM space. It can model a set of complex time series signal in a self-organizing manner.We apply this HMM-SOM based cognitive action system on vision-motion and auditory-articulation signals. The experimental results show that this system is basically capable of constructing sensor-motor coordination structure in a self-organizing manner, handling complex time series signals.
著者
尾崎 知伸 渡沼 智己 大川 剛直
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会論文誌 (ISSN:13460714)
巻号頁・発行日
vol.22, no.2, pp.173-182, 2007 (Released:2007-01-25)
参考文献数
43
被引用文献数
1

Recently, the research area of mining in structured data has been actively studied. However, since most techniques for structured data mining so far specialize in mining from single structured data, it is difficult for these techniques to handle more realistic data which is related to various types of attribute and which consists of plural kinds of structured data. Since such kind of data is expected to be going to rapidly increase, we need to establish a flexible and highly accurate technique that can inclusively treat such kind of data. In this paper, as one of the techniques to deal with such kind of data, we propose data mining algorithms of mining classification rules in multidimensional structured data. First, an algorithm with two pruning capabilities of mining correlated patterns is introduced. Then, top-k multidimensional correlated patterns are discovered by using this algorithm repeatedly in the fashion like a beam search. We also show the algorithms for constructing classifiers based on the discovered patterns. Experiments with real world data were conducted to assess the effectiveness of the proposed algorithms. The results show that the proposed algorithms can construct comprehensible and accurate classifiers within a reasonable running time.
著者
幸島 明男 和泉 憲明 車谷 浩一 中島 秀之
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会論文誌 (ISSN:13460714)
巻号頁・発行日
vol.19, no.4, pp.322-333, 2004 (Released:2004-05-28)
参考文献数
34
被引用文献数
2

In the vision of the semantic web, agents are defined as the programs that collect information from diverse sources, process the information, and exchange the results with other programs. In order to extend application areas of the agents from the Internet to the real world, we propose CONSORTS, a multiagent architecture for content managements in ubiquitous computing. In this paper, we, first, describe two important concepts in order to realize the agent-based content managements in ubiquitous computing, ``physically grounding'' and ``cognitive resources managements.'' Second, we describe the outline of the CONSORTS (ver. 1) and its RDF-based spatial information representation. Finally, we show an application of the CONSORTS, context-aware information assist services in a museum.
著者
原田 実 水野 高宏
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会論文誌 (ISSN:13460714)
巻号頁・発行日
vol.16, no.1, pp.85-93, 2001 (Released:2002-02-28)
参考文献数
15
被引用文献数
3 6

Up to now, the research on the automation of object-oriented analysis, especially extracting objectoriented design elements from the problem specification written in Japanese, has been continued in the Harada laboratory since 1993. As this first process, we have developed the semantic analysis system SAGE which could be practically useable both in the performance and in the accuracy. Given a dependency tree, where clauses constituting a sentence are related by dependency arcs, SAGE searches the EDR electronic dictionary, retrieves for any two clauses connected by a dependency arc the meaning of the principal word in each clause and the deep case between such two words, and assigns the probability of such meaning-case tuple. Then, SAGE constructs an interpretation tree by allocating such meaning-case tuple and its probability to each arc in the dependency tree. Next, SAGE searches for the allocation having the maximum of the overall evaluation value given by the sum of the probability of the allocated meaning and cases. Finally, SAGE converts the resulting interpretation tree into the set of semantic frames containing the information of each word and relations with other words. In developing the system, we achieved speed-up of the construction of the interpretation tree by reducing the search space with pruning useless meaning-case tuples and by using the branch and bound method. Moreover the accuracy improvement of the analysis was achieved by applying the following four methods: (A)in constructing the interpretation tree, assigning 0 probability to all the combination of word meanings with which there are no “case” information in the concept description dictionary, (B)using the experimental rules to presume the deep cases from the surface cases to each dependency between verb clauses, (C)improving the fitness of the sentences retrieved from corpus by using part of speech, and (D)decreasing the number of meaning candidates by using reading information. As a result, the average interpretation construction time of one sentence with nine clauses or less was 2 seconds on a PC with the Pentium III processor using 320MB memory. The correct answer rate of the meaning was 82.1%, and that of the case was 77.8%.