442 research outputs found

    Interpretations of Association Rules by Granular Computing

    No full text
    We present interpretations for association rules. We first introduce Pawlak's method, and the corresponding algorithm of finding decision rules (a kind of association rules). We then use extended random sets to present a new algorithm of finding interesting rules. We prove that the new algorithm is faster than Pawlak's algorithm. The extended random sets are easily to include more than one criterion for determining interesting rules. We also provide two measures for dealing with uncertainties in association rules

    Interpretation of association rules in multi-tier structures

    No full text
    Dealing with the large amount of data resulting from association rule mining is a big challenge. The essential issue is how to provide efficient methods for summarizing and representing meaningful discovered knowledge from databases. This paper presents a new approach called multi-tier granule mining to improve the performance of association rule mining. Rather than using patterns, it uses granules to represent knowledge that is implicitly contained in relational databases. This approach also uses multi-tier structures and association mappings to interpret association rules in terms of granules. Consequently, association rules can be quickly assessed and meaningless association rules can be justified according to these association mappings. The experimental results indicate that the proposed approach is promisin

    Correction: Mesenchymal stem cell-derived exosomal miR-223 regulates neuronal cell apoptosis

    No full text
    The original version of this article did not acknowledge Yuefeng Li as a corresponding author. This has now been corrected in both the PDF and HTML versions of the article

    Topic-oriented Mining and Reasoning

    No full text

    Summarization of association rules in multi-tier granule mining

    No full text
    It is a big challenge to find useful associations in databases for user specific needs. The essential issue is how to provide efficient methods for describing meaningful associations and pruning false discoveries or meaningless ones. One major obstacle is the overwhelmingly large volume of discovered patterns. \ud \ud This paper discusses an alternative approach called multi-tier granule mining to improve frequent association mining. Rather than using patterns, it uses granules to represent knowledge implicitly contained in databases. It also uses multi-tier structures and association mappings to represent association rules in terms of granules. Consequently, association rules can be quickly accessed and meaningless association rules can be justified according to the association mappings. Moreover, the proposed structure is also an precise compression of patterns which can restore the original supports. The experimental results shows that the proposed approach is promising

    Rough association rule mining in text documents for acquiring Web user information needs

    No full text
    It is a big challenge to apply data mining techniques for effective Web information gathering because of duplications and ambiguities of data values (e.g., terms). To provide an effective solution to this challenge, this paper first explains the relationship between association rules and rough set based decision rules. It proves that a decision pattern is a kind of closed pattern. It also presents a novel concept of rough association rules in order to improve the effectiveness of association rule mining. The premise of a rough association rule consists of a set of terms and a frequency distribution of terms. The distinct advantage of rough association rules is that they contain more specific information than normal association rules. It is also feasible to update rough association rules dynamically to produce effective result

    Deploying Association Rules on Hypothesis Spaces

    No full text
    corecore