2 0 0 0 OA Web上の人物理解のための履歴書作成
- 著者
- 上田 洋 村上 晴美 辰巳 昭治
- 出版者
- 一般社団法人 人工知能学会
- 雑誌
- 人工知能学会論文誌 (ISSN:13460714)
- 巻号頁・発行日
- vol.25, no.1, pp.144-156, 2010 (Released:2010-01-06)
- 参考文献数
- 17
- 被引用文献数
- 1
When users find information about people from the results of Web people searches, they often need to browse many obtained Web pages and check much unnecessary information. This task is time-consuming and complicates the understanding of the designated people. We investigate a method that integrates the useful information obtained from Web pages and displays them to understand people. We focus on curriculum vitae, which are widely used for understanding people. We propose a method that extracts event sentences from Web pages and displays them like a curriculum vita. The event sentence includes both time and events related to a person. Our method is based on the following: (1) extracting event sentences using heuristics and filtering them, (2) judging whether event sentences are related to a designated person by mainly using the patterns of HTML tags, (3) classifying these sentences to categories by SVM, and (4) clustering event sentences including both identical times and events. Experimental results revealed the usefulness of our proposed method.
1 0 0 0 マルチエージェント実時間探索における組織化とその評価
- 著者
- 北村 泰彦 寺西 憲一 辰巳 昭治 Yasuhiko Kitamura Ken-ichi Teranishi Shoji Tatsumi
- 雑誌
- 人工知能学会誌 = Journal of Japanese Society for Artificial Intelligence (ISSN:09128085)
- 巻号頁・発行日
- vol.11, no.3, pp.470-477, 1996-05-01
- 参考文献数
- 9
- 被引用文献数
- 7
Real-Time A^*(RTA^*) is an on-line search scheme in which look-ahead searches and moves are interleaved. It does not guarantee to find an optimal solution but it finds a semi-optimal solution with less search effort. To improve the quality of solution, Knight has proposed Multi-Agent Real Time A^*(MARTA^*), in which multiple agents concurrently and autonomously execute RTA^* for a given problem. In this scheme, agents do not coordinate their moves, but each agent just randomly chooses its move when the candidates look equally good. In this paper, we have interest in how agents should coordinate their moves to find a better solution faster. We propose two organizational approaches based on scattering and gathering. Each agent measures the distances from other agents and chooses its move in the direction of departing or approaching. These two approaches strengthen the discovery effect to find more undiscovered solutions and the learning effect to find more good solutions of MARTA^* respectively. We evaluate them through simulation experiments on maze and 15-puzzle problems and analyze why they work well or not from a point of heuristic depression, which is a local hollow of heuristic state evaluation values on paths to goal states. Once an agent falls into a depression, it cannot escape without filling in the depression, namely updating the state evaluation values. In a maze problem, in which deep depressions are scattered in its state space, scattered agents show better performance than gathered agents because less agents fall into depressions. On the other hand, in a 15-puzzle problem, in which shallow depressions are ubiquitous, gathered agents show better performance because they are better at cooperating to fill in the depressions. As a result, it is shown that we can get better search performance in MARTA^* by using an appropriate organization of agents depending on the characteristic of heuristic depressions of the given problem.
1 0 0 0 OA Web上の同姓同名人物識別のための職業関連情報の抽出
- 著者
- 上田 洋 村上 晴美 辰巳 昭治
- 出版者
- THE INSTITUTE OF SYSTEMS, CONTROL AND INFORMATION ENGINEERS (ISCIE)
- 雑誌
- システム制御情報学会論文誌 (ISSN:13425668)
- 巻号頁・発行日
- vol.22, no.6, pp.229-240, 2009 (Released:2011-04-22)
- 参考文献数
- 15
- 被引用文献数
- 1 2
Distinguishing different people with identical names is becoming more and more important in person searches on the Web. The aim of this research is to dispatch useful labels for identifying persons in “person clusters,” which are generated as a result of person searches on the Web. In this paper, we propose a method to label person clusters with “vocation-related information.” The vocation-related information includes broader terms that may be considered as vocations, and terms that are useful to infer vocations, not only those rigorously defined as vocations. Our method is based on (a) extracting candidates of vocation-related information by using HTML structures and simple heuristics, and (b) generating vocation-related information by using term frequencies,synonym clustering, and Web search engines. Experimental results revealed the usefulness of the proposed method.
1 0 0 0 OA 協調型高精度時刻同期システムの構築とその認証処理等への応用
- 著者
- 小松 久美子 下代 博之 中野 秀男 辰巳 昭治
- 雑誌
- マルチメディア通信と分散処理ワークショップ論文集
- 巻号頁・発行日
- vol.2006, no.15, pp.19-24, 2006-11-23
コンピュータネットワークにおける通信の高度化に伴い,今後,その時刻保持はさらに高精度化を求められるであろう.本論文は,現状のコンピュータネットワークにおける時刻同期の問題点について問い,その高精度化の必要性についての問題提起を行うものである.天文分野での超高精度時刻同期技術の応用としてハードウェアが比較的安価に実現できることから, GPSを利用した時刻同期システムを提案する.著者らはこの時刻同期システムを4拠点に設置したので,その実際を報告する.低コストで手軽に構築できることから,高精度時刻サーバの普及が期待できる.多数の高精度時刻サーバによる協調型時刻同期により実現できることやその応用には認証処理を始め,多くの可能性がある.問題提起の段階であるが, 個々の高精度時刻サーバが相互に時刻監査する方法については研究対象となると思われる.
1 0 0 0 OA 文法推論のコンパイラ言語への適用
- 著者
- 常見 一樹 上野 敦志 田窪 朋仁 辰巳 昭治
- 出版者
- 人工知能学会
- 雑誌
- 人工知能学会全国大会論文集 (ISSN:13479881)
- 巻号頁・発行日
- vol.26, 2012
本研究の目的は、プログラミング言語において、ソースコードとそのソースコードが示す実行可能なデータ情報との対を要素とする学習データから、コンパイラに必要な構文解析情報を自動的に学習することである。本手法は、従来記号系列のみに特化していた文法推論にトークンの意味処理を追加し、構文の意味解析に繋げることである。この際予め字句解析など構文に関係ない処理は固定する。実験により本手法の学習可能性を示す。