Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Dynamic itemset counting and implication rules for market basket data
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Mining the most interesting rules
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Alternative Interest Measures for Mining Associations in Databases
IEEE Transactions on Knowledge and Data Engineering
Text Mining Handbook: Advanced Approaches in Analyzing Unstructured Data
Text Mining Handbook: Advanced Approaches in Analyzing Unstructured Data
Bioinformatics
Discovering implicit associations among critical biological entities
International Journal of Data Mining and Bioinformatics
Hi-index | 0.00 |
It is generally believed that the degree of a relation between two entities is likely to be stronger if they co-occur more often in the literature. Based on this assumption, several methods are used in biomedical text mining such as support, confidence, chi-square, odds ratio, lift, all-confidence, coherence, and pof. Comparing these eight methods, our work aims to find the best one. Also, we present a consensus approach that can further improve the performance. Experimental results on prioritising drug targets have shown that pof, coherence, and all-confidence in sequence are the top three. By integrating coherence into pof, the consensus method is the best one among all compared methods.