著者
尾崎 知伸 渡沼 智己 大川 剛直
出版者
一般社団法人 人工知能学会
雑誌
人工知能学会論文誌 (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.