| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Artificial Intelligence and Knowledge-Based Processing (AI) (Searched in: 2007)
Search Results: Keywords 'from:2007-05-31 to:2007-05-31'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| AI | 2007-05-31 10:20 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Towards a Logical Reconstruction of CF-Induction Yoshitaka Yamamoto (Graduate Univ. for Advanced Studies), Oliver Ray (Univ. of Bristol), Katsumi Inoue (NII/Graduate Univ. for Advanced Studies)  AI2007-1 |
CF-Induction is a sound and complete hypothesis finding procedure for full clausal logic. Given a background theory and... [more] | AI2007-1 pp.1-6 |
| AI | 2007-05-31 10:45 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | A Parallel SAT Solver for Multi-Core Processor Environment Akihide Takami, Koji Iwanuma, Hidetomo Nabeshima (Univ. of Yamanashi) AI2007-2 |
In this paper, we propose a new parallel SAT solver based on the fastest sequential SAT solver ”Mini- Sat” for a multi-... [more] |
AI2007-2 pp.7-12 |
| AI | 2007-05-31 11:10 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Collaborative Filtering using Purchase Sequences Tomoharu Iwata, Takeshi Yamada, Naonori Ueda (NTT) AI2007-3 |
We propose a collaborative filtering method that uses sequential information in purchase histories for recommendations. ... [more] | AI2007-3 pp.13-18 |
| AI | 2007-05-31 11:35 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Personalized Recommendation by Identifying Innovator Noriaki Kawamae, Takeshi Yamada, Naonori Ueda (NTT) AI2007-4 |
(To be available after the conference date) [more] | AI2007-4 pp.19-24 |
| AI | 2007-05-31 13:00 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | [Invited Talk]
String data compression, pattern matching, and pattern discovery Masayuki Takeda (Kyushu Univ.) AI2007-5 |
The compressed pattern matching (CPM, in short) problem is, given a compressed string data, to perform a string pattern ... [more] | AI2007-5 p.25 |
| AI | 2007-05-31 14:00 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | [Invited Talk]
Recent Topics on Data Mining and Knoledge Discovery Using Binary Decision Diagrams Shin-ichi Minato (Hokkaido Univ.) AI2007-6 |
Binary Decision Diagrams (BDDs) are the efficient data structure for representing Boolean functions on the main memory. ... [more] | AI2007-6 pp.27-32 |
| AI | 2007-05-31 15:00 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | approximate partial string detection technique for multiple documents Takaharu Takeda (Sokendai), Atsuhiro Takasu (NII) AI2007-7 |
Similar expression and character string appear frequently during documents written about the same topic. It is easy to ... [more] |
AI2007-7 pp.33-38 |
| AI | 2007-05-31 15:25 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Finding Common and Freqent Tree Pattern From Semi-Structured Texts Compressed by a Tree Grammar Compression Method Seiji Murakami, Koichiro Doi, Akihiro Yamamoto (Kyoto Univ.) AI2007-8 |
In this study, we present an algorithm that solves the problem of finding common tree patterns from semi-structured text... [more] | AI2007-8 pp.39-44 |
| AI | 2007-05-31 15:50 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | An Analysis of Sequential Data with Hierarchical Structure of Time Frame Using Frequent Subtree Mining Ryohei Fukuda, Hiroyuki Oono, Hiroshige Inazumi (Aoyama Gakuin Univ.) AI2007-9 |
Finding hierarchical relations from categorical time series data can be an effective way for feature extraction. To do... [more] |
AI2007-9 pp.45-50 |
| AI | 2007-05-31 16:15 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | New Structure Similarity and Graph Clustering in Matching Any Graph Characterized by Subgraph Distributions Takahisa Wada, Hiroyuki Oono, Hiroshige Inazumi (Aoyama Gakuin Univ.) AI2007-10 |
As a diversification and increases of a complex structure data, the development of a useful DB system and a new data min... [more] | AI2007-10 pp.51-56 |
[Return to Top Page]