Generalized subsumption and its applications to induction and redundancy
Artificial Intelligence
Discovery of frequent DATALOG patterns
Data Mining and Knowledge Discovery
Inducing Multi-Level Association Rules from Multiple Relations
Machine Learning
Faster association rules for multiple relations
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Frequent pattern discovery from OWL DLP knowledge bases
EKAW'06 Proceedings of the 15th international conference on Managing Knowledge in a World of Networks
Towards discovery of frequent patterns in description logics with rules
RuleML'05 Proceedings of the First international conference on Rules and Rule Markup Languages for the Semantic Web
Grouping Results of Queries to Ontological Knowledge Bases by Conceptual Clustering
ICCCI '09 Proceedings of the 1st International Conference on Computational Collective Intelligence. Semantic Web, Social Networks and Multiagent Systems
Theory and Practice of Logic Programming
Hi-index | 0.00 |
In this paper we discuss how to reduce redundancy in the process and in the results of mining the Semantic Web data. In particular, we argue that the availability of the domain knowledge should not be disregarded during data mining process. As the case study we show how to integrate the semantic redundancy reduction techniques into our approach to mining association rules from the hybrid knowledge bases represented in OWL with rules.