Multipass algorithms for mining association rules in text databases
In this paper, we propose two new algorithms for mining association rules between words in text databases. The characteristics of text databases are quite different from those of retail transaction databases, and existing mining algorithms cannot handle text databases efficiently because of the large number of itemsets (i.e., words) that need to be counted. Two well-known mining algorithms, Apriori algorithm and Direct Hashing and Pruning (DHP) algorithm, are evaluated in the context of mining text databases, and are compared with the new proposed algorithms named Multipass-Apriori (M-Apriori) and Multipass-DHP (M-DHP). It has been shown that the proposed algorithms have better performance for large text databases.
- Mining association rules using inverted hashing and pruning.
- scientific article; zbMATH DE number 2086324 (Why is no real title available?)
- An algorithm of item-all-weighted association rules mining between terms from text database
- scientific article; zbMATH DE number 2086367 (Why is no real title available?)
- Efficient mining of association rules by reducing the number of passes over the database
This page was built for publication: Multipass algorithms for mining association rules in text databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1606558)