Repository | Book | Chapter

176337

(2002) Progress in discovery science, Dordrecht, Springer.

Extended association algorithm based on roc analysis for visual information navigator

Hiroyuki Kawano , Minoru Kawahara

pp. 640-649

It is very important to derive association rules at high speed from huge volume of databases. However, the typical fast mining algorithms in text databases tend to derive meaningless rules such as stopwords, then many researchers try to remove these noisy rules by using various filters. In our researches, we improve the association algorithm and develop information navigation systems for text data using visual interface, and we also apply a dictionary to remove noisy keywords from derived association rules. In order to remove noisy keywords automatically, we propose an algorithm basedon the true positive rate and the false positive rate in the ROC analysis. Moreover, in order to remove stopwords automatically from raw association rules, we introduce several thresholdv alues of the ROC analysis into our proposedmining algorithm. We evaluate the performance of our proposedmining algorithms in a bibliographic database.

Publication details

DOI: 10.1007/3-540-45884-0_49

Full citation:

Kawano, H. , Kawahara, M. (2002)., Extended association algorithm based on roc analysis for visual information navigator, in S. Arikawa & A. Shinohara (eds.), Progress in discovery science, Dordrecht, Springer, pp. 640-649.

This document is unfortunately not available for download at the moment.