Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Evaluating the novelty of text-mined rules using lexical knowledge
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Mining Multiple-Level Association Rules in Large Databases
IEEE Transactions on Knowledge and Data Engineering
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Sampling Large Databases for Association Rules
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach
Data Mining and Knowledge Discovery
Hi-index | 0.00 |
Many methods were proposed to generate a large number of association rules efficiently. These methods are dependent on non-semantic information such as support, confidence. Also work on pattern analysis has been focused on frequent patterns, sequential patterns, closed patterns. Identifying semantic information and extracting semantically similar frequent patterns helps to interpret the meanings of the pattern and to further explore them at different levels of abstraction. This paper makes a study on existing semantic similarity measures and proposes a new measure for calculating semantic similarity using domain dependent and domain independent ontologies. This paper also proposes an algorithm SSFPOA (Semantically Similar Frequent Patterns extraction using Ontology Algorithm) for extracting and clustering semantically similar frequent patterns. The case study which is illustrated in this paper shows that the algorithm can be used to produce association rules at high level of abstraction.