The current World Wide Web is featured by a huge mass of knowledge, making it difficult to exploit. One possible way to cope with this issue is to proceed to knowledge mining in a way that we could control its volume and hence make it manageable. This paper explores meta-knowledge discovery and in particular focuses on clustering induction rules for large knowledge sets. Such knowledge representation is considered for its expressive power and hence its wide use. Adapted data mining is proposed to extract meta-knowledge taking into account the knowledge representation which is more complex than simple data. Besides, a new clustering approach based on multilevel paradigm and called multilevel clustering is developed for the purpose of treating large scale knowledge sets. The approach invokes the k-means algorithm to cluster induction rules using new designed similarity measures. The developed algorithms have been implemented on four public benchmarks to test the effectiveness of the multilevel clustering approach. The numerical results have been compared to those of the simple k-means algorithm. As foreseeable, the multilevel clustering outperforms clearly the basic k-means on both the execution time and success rate that remains constant to 100 % while increasing the number of induction rules.
Weitere Kapitel dieses Buchs durch Wischen aufrufen
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten
Sie möchten Zugang zu diesem Inhalt erhalten? Dann informieren Sie sich jetzt über unsere Produkte:
- Multilevel Clustering of Induction Rules for Web Meta-knowledge
- Springer Berlin Heidelberg
Neuer Inhalt/© ITandMEDIA