Tze, Alex Hiang Sim and Indrawan, M. and Zutshi , S. and Srinivasan, B. (2010) Logic-based pattern discovery. IEEE Transactions on Knowledge and Data Engineering, 22 (6). 798 -811. ISSN 1041-4347
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1109/TKDE.2010.49
In the data mining field, association rules are discovered having domain knowledge specified as a minimum support threshold. The accuracy in setting up this threshold directly influences the number and the quality of association rules discovered. Often, the number of association rules, even though large in number, misses some interesting rules and the rules' quality necessitates further analysis. As a result, decision making using these rules could lead to risky actions. We propose a framework to discover domain knowledge report as coherent rules. Coherent rules are discovered based on the properties of propositional logic, and therefore, requires no background knowledge to generate them. From the coherent rules discovered, association rules can be derived objectively and directly without knowing the level of minimum support threshold required. We provide analysis of the rules compare to those discovered via the a priori.
|Uncontrolled Keywords:||association rules, data mining, mining methods|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Divisions:||Computer Science and Information System (Formerly known)|
|Deposited By:||Liza Porijo|
|Deposited On:||29 Jun 2012 08:07|
|Last Modified:||08 Feb 2017 08:10|
Repository Staff Only: item control page