著者
岡田 正人 金盛 克俊 青木 伸 大和田 勇人
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会論文誌 (ISSN:13460714)
巻号頁・発行日
vol.29, no.1, pp.194-200, 2014-01-05 (Released:2014-01-07)
参考文献数
23

This paper presents a high performance virtual screening method for drug design based on machine learning. In drug discovery with computers, drug designers often use docking softwares. They decide the docking between the compound and the protein with the result of docking software, structure of the compound, and any information of the compound. Currently, the performance of docking software is not high. This paper shows the machine learning method which uses the experiential knowledge of pharmaceutical researchers. This method calculates the docking possibility of compounds with high performance based on the results of the docking software and chemical information of compounds. The experiment shows our method have high-accuracy as 98.4 % and excellent ROC curve.
著者
小林 一樹 船越 孝太郎 小松 孝徳 山田 誠二 中野 幹生
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会論文誌 (ISSN:13460714)
巻号頁・発行日
vol.30, no.4, pp.604-612, 2015-07-01 (Released:2015-05-21)
参考文献数
30
被引用文献数
2

In this paper, we describe an investigation into users' experiences of a simple talking robot with back-channel feedbacks that is designed based on an artificial subtle expression (ASE). In the experiments with participants, they are divided into six conditions based on an expression factor (three levels; human-like speech, blinking light, and beeping sound) and a timing decision method factor (two levels; a linguistic method and an acoustic method) for investigating participants' impressions on the dialogue experience. We developed an electric pedestal to show the blinking expression, on which a simple cubic robot was fixed. Participants engaged in a task of explaining a cooking procedure with a spoken dialogue system coupled with the robot on the pedestal. The robots responded to them by making the back-channel feedbacks in accordance with the expression factor. The results of questionnaire analyses suggested that the ASE-based expressions of back-channel feedback provide positive experiences for users.
著者
中井 淳一 筑紫 晴久
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会論文誌 (ISSN:13460714)
巻号頁・発行日
vol.30, no.6, pp.791-801, 2015-11-01 (Released:2016-04-06)
参考文献数
32

The structure of the control software is often complicated. The reason is that it's created by multiple developers and added the functions later. Thus, many software developers want technology to reconstruct decomposing the structure of the software. However, current situation, the grouping of the control software is dependent on the experience and the sense of the skilled person. In addition, the opportunity of the review is very small, generic clustering algorithm has not yet been established. Existing clustering algorithm is not considered to apply to the control software. The problem is the inter-group feedback increase and group size not adjustable. This is because, when inter-group feedback is large, it is difficult to understand the control software, rework increases when division of labor. Also, when there is feedback between the pre-process and the next process at the black box testing, the calculation result of the next step also affects the pre-process, the test process is increased considerably. In this study, we tried the application of the clustering algorithm of graph theory to structure organize the control software. Using a genetic algorithm, and by forming groups based on modularity, while groups of closely related ones, and aid the formation of a grouping less inter-group feedback. Furthermore, it is easy to understand, and for ease of testing, adjustment of the number of groups to a size suitable for control software also aims to be a possibility.
著者
福田 エリック駿 伊庭 斉志
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会全国大会論文集 第22回全国大会(2008)
巻号頁・発行日
pp.253, 2008 (Released:2009-07-31)

本研究では、二次元モジュラーロボットが中央集中的ではなく自己組織的に全体として有用な構造をとるための結合ルールをGAによって得る手法と、それに必要なモジュラーロボットの機能を提案する。
著者
仲田 圭佑 村田 剛志
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会論文誌 (ISSN:13460714)
巻号頁・発行日
vol.30, no.1, pp.96-101, 2015-01-06 (Released:2015-01-06)
参考文献数
12
被引用文献数
1

Recent development of information technology and rise of social media enable us to access massive data. Large scale data such as hyperlink structure in WWW and friendship information in social media can be represented as networks based on graph theory. For analyzing such data, many methods have been proposed. Among them, the methods called community detection have advantages that they can make networks simple and easy to understand. However, most of them had not considered the background knowledge of data, thus some methods called constrained community detection which take such background knowledge into consideration have been proposed. Constrained community detection methods show robust performance on noisy data due to its background knowledge. In particular, constrained Hamiltonian-based community detection methods have advantages such as flexibility of output results. The Hamiltonian, energy in statistical mechanics, can be theoretically considered as a generalization of the Newman's modularity. In this paper, we propose a method for accelerating constrained community detection based on Hamiltonian. Our proposed method is a variant of Blondel's Louvain method which is known for its computational efficiency. We experimentally show that the proposed method is superior to the existing method based on simulated annealing in terms of computational efficiency, and its accuracy is as well as the existing method under the same conditions. Our method enables us to perform constrained community detection for larger networks compared with the existing method.
著者
佐藤 晃矢 岡 瑞起 橋本 康弘 加藤 和彦
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会論文誌 (ISSN:13460714)
巻号頁・発行日
vol.30, no.5, pp.667-674, 2015-09-01 (Released:2015-08-27)
参考文献数
19

Social Tagging System (STS) which is one of the content management techniques is widely adopted in the online content sharing service. Using STS, users can give any strings (tags) to contents as annotations. It is important to know the usage of tag statistics for accomplishing an effective database design and the information navigation. The frequency of tag usage as well as their dynamics are similar to the ones found in the natural language. It is possible to reproduce the branching process of the tag dynamics using a classical model called Yule-Simon process. Another characteristic aspect of tags is the tag co-occurrence generated from the simultaneous use of tags. Using the tag co-occurrence, STS is able to reconstitute the hierarchy of tags, and recommend the tag which is probably used next. However, Yule-Simon process does not consider the tag co-occurrence and thus how the tag co-occurrence is generated from the model like Yule-Simon has not been addressed yet. In this paper, we propose to expand the Yule-Simon process to model the tag co-occurrence. From the point of view of network hierarchy, we confirm the similarity in the structure of the tag co-occurrence with the empirical data obtained from a social network service called ‘RoomClip’. The present result suggested that this simple model like extended Yule-Simon process generates the tag co-occurrence feature.
著者
古崎 晃司 來村 徳信 溝口 理一郎
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会論文誌 (ISSN:13460714)
巻号頁・発行日
pp.LOD-214, (Released:2015-12-25)
参考文献数
24
被引用文献数
1

Biomimetics contributes to innovative engineering by imitating the models, systems, and elements of nature. Well-known examples of biomimetics include paint and cleaning technologies that imitate the water repellency of the lotus, adhesive tapes that imitate the adhesiveness of gecko feet, and high-speed swimsuits that imitate the low resistance of a shark’s skin. These results integrate studies on the biological mechanisms of organisms with engineering technologies to develop new materials. Facilitating such biomimetics-based innovations requires integrating knowledge, data, requirements, and viewpoints across different domains. Researchers and engineers need to develop a biomimetics database to assist them in achieving this goal. Because ontologies clarify concepts that appear in target domains, we assume that it is important to develop a biomimetics ontology that contributes to improvement of knowledge interoperability between the biology and engineering domains. Furthermore, linked data technologies are very effective for integrating a database with existing biological diversity databases. On the basis of these observations, we developed a biomimetics ontology and keyword exploration tool based on linked data techniques. The tool allows users to find important keywords for retrieving meaningful knowledge from various biomimetics databases. Such a technique could support idea creation by users based on a biomimetics ontology. This paper describes a prototype of our proposed biomimetics ontology and keyword exploration tool.
著者
Katsuhiko Hayashi Jun Suzuki Masaaki Nagata
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会論文誌 (ISSN:13460714)
巻号頁・発行日
pp.J-F83, (Released:2015-12-17)
参考文献数
24
被引用文献数
1

The spinal tree adjoining grammar (TAG) parsing model of [Carreras 08] achieves the current state-of-the-art constituent parsing accuracy on the commonly used English Penn Treebank evaluation setting. Unfortunately, the model has the serious drawback of low parsing efficiency since its Eisner-CKY style parsing algorithm needs O(n4) computation time for input length n. This paper investigates a more practical solution and presents a beam search shift-reduce algorithm for spinal TAG parsing. Since the algorithm works in O(bn) (b is beam width), it can be expected to provide a significant improvement in parsing speed. However, to achieve faster parsing, it needs to prune a large number of candidates in an exponentially large search space and often suffers from severe search errors. In fact, our experiments show that the basic beam search shift-reduce parser does not work well for spinal TAGs. To alleviate this problem, we extend the proposed shift-reduce algorithm with two techniques: Dynamic Programming of [Huang 10a] and Supertagging. The proposed extended parsing algorithm is about 8 times faster than the Berkeley parser, which is well-known to be fast constituent parsing software, while offering state-of-the-art performance. Moreover, we conduct experiments on the Keyaki Treebank for Japanese to show that the good performance of our proposed parser is language-independent.
著者
石川 航平 山本 知幸 藤波 努
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会全国大会論文集 第20回全国大会(2006)
巻号頁・発行日
pp.125, 2006 (Released:2006-12-07)

なぜ人間は技能習得の過程、リズム感の習得において個人差が生じるのであろうか。本研究ではサンバスクールに通い、サンバ・ダンスを初心者が6ヶ月間の練習期間に上達する過程を観察した。サンバのリズムは元来、日本人が持つ感覚とは異なり、長期的に渡る訓練で習得しなければならない。実験においては二人の被験者を対象として6ヶ月間の間、5回に渡り、モーションキャプチャ装置を身体の18カ所のポイントに装着し計測した。タスクは難易度により四段階に分類した踊りのパターンとした。得られたデータを身体各関節の協調度に注目して分析した。その結果、サンバ・ダンスの上達過程における特徴的な差異を特定した。
著者
杉山 弘晃 目黒 豊美 東中 竜一郎
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会論文誌 (ISSN:13460714)
巻号頁・発行日
pp.DSF-518, (Released:2015-12-15)
参考文献数
15

In conversational dialogue, a talker sometimes asks questions that relate to the other talker's personality, such as his/her favorites and experiences. This behavior also appears in conversational dialogues with a dialogue system; therefore, the system should be developed so that it responds to this kind of questions. Previous systems realized this function by creating question-answer pairs by hand. However, there is no work that examines the coverage of the created question-answer pairs over real conversations. This study analyzes a huge amount of question-answer pairs created by many question-generators, with one answer-generator for each character. Our analysis shows that 41% of personality questions that appeared in real conversations are covered by the created pairs. We also investigated the types of questions that are frequently asked.
著者
坂本 竜基 中田 豊久 伊藤 禎宣 松岡 有希 小暮 潔 武田 英明
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会全国大会論文集 第20回全国大会(2006)
巻号頁・発行日
pp.226, 2006 (Released:2006-12-07)
被引用文献数
2

本稿では、色付き傍線を用いたWeb文章を対象リソースとするイロノミーと名付けたフォークソノミーシステムを提案する。イロノミーは、3種類の色線を用いて文章の一部分をマーキングする一種のアノテーション入力機能とそのマーキングを色別に検索可能な検索機能、及び、社会的フィルタリングによる推薦機能を有する。また、JSAI2005のイベント空間支援の一環として運用した、発表概要を分類対象としたプロトタイプの説明と運用結果を述べる。
著者
中島 秀之 Hideyuki Nakashima
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会誌 = Journal of Japanese Society for Artificial Intelligence (ISSN:09128085)
巻号頁・発行日
vol.2, no.3, pp.367-374, 1987-09-01
被引用文献数
2 1

Uranus is a programming system designed for knowledge representation. The multiple world mechanism of Uranus makes it possible to represent conceptual space and time sequence. In this paper, we examine commonsense reasoning with this mechanism. By commonsense reasoning, we mean reasoning with rules which have exceptions. The results must fit our intuition. To do so requires ordering among rules. Non-monotonic logic is too weak for this purpose. We show that the multiple world mechanism of Uranus provides the natural ordering among rules, and thus it is suitable for commonsense reasoning.
著者
吉田 智史 高木 友博
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会論文誌 (ISSN:13460714)
巻号頁・発行日
vol.30, no.5, pp.647-657, 2015-09-01 (Released:2015-08-27)
参考文献数
15
被引用文献数
1

Recently, recommender systems have attracted attention as systems that collect the enormous amount of information on the Web and suggests information to users. Recommender systems help users find the products that they want. There is a close relationship between a recommender system and the long tail because the performance of them is evaluated by not only accuracy metrics but also long tail metrics. Collaborative filtering (CF) is a typical recommender system. It is described as technology used to support the long tail. However, CF is prone to be biased towards recommending hit products. In this paper, we propose a system that recommends niche products if an item is similar to the user's preference. We will reduce the bias in top-N recommendation by using the interest in a keyword. The interest is computed from information gain, which is used to choose attributes in decision tree learning and to select features in machine learning. The results from the experiments show that the proposed system outperformed item-based CF in recommending niche products. In most existing studies focused on the long tail, niche products are recommended at the cost of accuracy. However, in our study, not only are niche products recommended but accuracy is also improved.
著者
竹内 俊貴 藤井 達也 小川 恭平 鳴海 拓志 谷川 智洋 廣瀬 通孝
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会論文誌 (ISSN:13460714)
巻号頁・発行日
pp.D-MDF04, (Released:2015-07-23)
参考文献数
21

Modern people are concerned with healthy eating habits; however, sustaining these habits often requires a vigilant self-monitoring and a strong will. The satisfaction found in a meal is influenced not only by the food itself, but also by external stimuli and information. This effect is called expectation assimilation in behavioral science. We propose a social media system that enables people to begin eating meals that are more healthful naturally and without conscious effort. This system uses others' positive evaluations as a trigger of expectation assimilation. Using the proposed system, users share information on their meals and evaluate the yumminess and healthfulness of each other's meals. Novelty of the system is that the system modifies others' evaluations, displaying evaluations of healthfulness as those of yumminess to the user consuming the meal. Therefore, users tend to eat more foods that are evaluated as healthful foods by others and thereby, improve their eating habits without noticing it. In this paper, we report about the mechanism of the proposed system and results of a user study under controlled circumstances. Moreover, we integrated our method with a published mobile application that already had a lot of users. We examined our proposal in the real-world context with the application and, consequently, proved practical effectiveness of the method.
著者
齋藤 ひとみ 三輪 和久 神崎 奈奈 寺井 仁 小島 一晃 中池 竜一 森田 純哉
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会論文誌 (ISSN:13460714)
巻号頁・発行日
vol.30, no.3, pp.547-558, 2015-05-01 (Released:2015-05-01)
参考文献数
23
被引用文献数
1

Data interpretation based on theory is one of most important skills in scientific discovery learning, but to achieve this process is difficult for learners. In this study, we propose that model construction and execution could support data interpretation based on theory. We used the web-based production system ``DoCoPro'' as an environment for model construction and execution, and we designed and evaluated class practice in cognitive science domain to confirm our ideas. Fifty-three undergraduate students attended the course in Practice 1 in 2012. During class, students constructed a computational model on the process of semantic memory and conducted simulations using their model from which we evaluated any changes in learner interpretation of experimental data from pretest to posttest. The results of comparing pretest with posttest showed that the number of theory-based interpretations increase from pretest to posttest. However, we could not confirm the relationship between students' interpretations and their mental models acquired through learning activities and whether the students could transfer their understanding of theory to other different experimental data. Therefore, we conducted Practice 2 in 2013, in which 39 undergraduate students attended the course. Instruction in Practice 2 was same as in Practice 1. We improved pretest and posttest to assess students' mental model of theory and whether they transfer their understanding to another experiment. Comparing the pretest and posttest results showed that students acquired more sophisticated mental models from pretest to posttest, and they could apply their understanding of theory to their interpretations of near transfer experimental data. The results also indicated that students who shifted their interpretations from non theory-based to theory-based acquired more superior mental models on theory. Finally, we discuss applicability of our findings to scientific education.
著者
神崎 奈奈 三輪 和久 寺井 仁 小島 一晃 中池 竜一 森田 純哉 齋藤 ひとみ
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会論文誌 (ISSN:13460714)
巻号頁・発行日
vol.30, no.3, pp.536-546, 2015-05-01 (Released:2015-05-01)
参考文献数
25

When people understand an object, they construct a mental model of the object. A mental model is a structural, behavioral, or functional analog representation of a real-world or imaginary situation, event, or process. We conducted a class practice in which newcomers to cognitive science constructed a mental model by implementing and simulating a computational model of cognitive information processing, i.e., a cognitive model. We quantitatively evaluated the learning outcomes of the class. The participants were required to implement a complete cognitive model of subtraction processing. Furthermore, they were required to implement bug models, which are cognitive models with bug rules that cause several types of errors. Pre- and post-tests were performed before and after implementing and using these models, respectively. The results indicate that the class intervention led to the increase of the number of the participants who constructed the correct mental model and promoted more accurate mental simulations. However, the significant effects were confirmed only with participants who correctly completed the bug model, but the effects were limited with those who failed.
著者
後藤 匡史 長木 悠太 鈴木 英之進
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会論文誌 (ISSN:13460714)
巻号頁・発行日
vol.16, no.2, pp.193-201, 2001 (Released:2002-02-28)
参考文献数
13

This paper presents a novel decision-tree induction for a multi-objective data set, i.e. a data set with a multi-dimensional class. Inductive decision-tree learning is one of the frequently-used methods for a single-objective data set, i.e. a data set with a single-dimensional class. However, in a real data analysis, we usually have multiple objectives, and a classifier which explains them simultaneously would be useful. A conventional decision-tree inducer requires transformation of a multi-dimensional class into a singledimensional class, but such a transformation can considerably worsen both accuracy and readability. In order to circumvent this problem we propose a bloomy decision tree which deals with a multi-dimensional class without such transformations. A bloomy decision tree consists of a set of decision nodes each of which splits examples according to their attribute values, and a set of .ower nodes each of which decidesa dimension of the class for examples. A flower node appears not only at the fringe of a tree but also inside a tree. Our pruning is executed during tree construction, and evaluates each dimension of the class based on Cramér’s V. The proposed method has been implemented as D3-B (Decision tree in Bloom), and tested with eleven benchmark data sets in the machine learning community. The experiments showed that D3-B has higher accuracies in nine data sets than C4.5 and tied with it in the other two data sets. In terms of readability, D3-B has a smaller number of decision nodes in all data sets, and thus outperforms C4.5. Moreover, experts in agriculture evaluated bloomy decision trees, each of which is induced from an agricultural data set, and found them appropriate and interesting.
著者
三橋 憲晃 山口 亨 高間 康史
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会全国大会論文集 第17回全国大会(2003)
巻号頁・発行日
pp.24, 2003 (Released:2004-02-03)

類似した情報を提供しているwebページは, デザインや画像などが似ている場合が多いことに注目し, webページを視覚的に画像として扱う事により情報の検索・デザインの比較を行う方法を提案する.