Skip to main content

Multilevel Clustering of Induction Rules for Web Meta-knowledge

  • Conference paper
Advances in Information Systems and Technologies

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 206))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Han, J., Kamber, M., Pei, J.: Data Mining: Concepts and Techniques, 3rd edn. Elsevier (2011)

    Google Scholar 

  2. Mariscal, G., Marbn, Fernndez, C.: A survey of data mining and knowledge discovery process models and methodologies. The Knowledge Engineering Review 25, 137–166 (2010)

    Article  Google Scholar 

  3. Kaufman, K.A., Michalski, R.S.: From Data Mining to Knowledge Mining. In: Rao, C.R., Solka, J.L., Wegman, E.J. (eds.) Handbook in Statistics. Data Mining and Data Visualization, vol. 24, pp. 47–75. Elsevier/North Holland (2005)

    Google Scholar 

  4. Michalski, R.S.: Knowledge mining: A proposed new direction, School of Computational Sciences George Mason University and Institute for Computer Science Polish Academy of Sciences (2003)

    Google Scholar 

  5. Saneifar, H., Bringay, S., Laurent, A.: S2MP: Similarity Measure for Sequential Patterns. In: Proceeding of the 7th Australian Data Mining Conference AusDM 2008, Adelaide, Australia, November 27-28, pp. 95–104 (2008)

    Google Scholar 

  6. Tuomi, I.: Data is More Than Knowledge Implications of the Reversed Knowledge Hierarchy for Knowledge Management and Organizational Memory. Journal of Management Information Systems 16(3), 107–121 (fall 1999)

    Google Scholar 

  7. Drias, H., Aouichat, A., Boutorh, A.: Towards Incremental Knowledge Warehousing and Mining. In: DCAI 2012, pp. 501–510 (2012)

    Google Scholar 

  8. Barnard, S.T., Simon, H.D.: A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency: Practice and Experience 6, 101–117 (1994)

    Article  Google Scholar 

  9. Hendrickson, B., Leland, R.: A multilevel algorithm for partitioning graphs. In: Proceedings of the Supercomputing 1995 (1995)

    Google Scholar 

  10. Karypis, G., Aggarwal, R., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359–392 (1999)

    Article  MATH  Google Scholar 

  11. Dhillon, S., Guan, Y., Kulis, B.: Weighted Graph Cuts without Eigenvectors: A Multilevel Approach. IEEE Transactions on Patterns Analysis and Machine Intelligence 29(11) (2007)

    Google Scholar 

  12. Korosec, P., Silc, J., Robic, B.: A Multi-level Ant-Colony-Optimization: Algorithm for MESH Partitioning, Computer Systems Department, Jozef Stefan Institute, Ljubljana, Slovenia. IEEE 2003 Conference Publication (2003)

    Google Scholar 

  13. Bouhmala, N.: A Multilevel Approach Applied to Sat-Encoded Problems, Vestfold University College Norway. VLSI Design (2012) ISBN: 978-953-307-884-7

    Google Scholar 

  14. Poongothai, K., Sathiyabama, S.: Integration of Clustering and Rule Induction Mining Framework for Evaluation of Web Usage Knowledge Discovery System. Journal of Applied Sciences 12, 1495–1500 (2012)

    Article  Google Scholar 

  15. Poongothai, K., Sathiyabama, S.: Efficient Web Usage Miner Using Decisive Induction Rules. Journal of Computer Science 8(6), 835–840 (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Amine Chemchem .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chemchem, A., Drias, H., Djenouri, Y. (2013). Multilevel Clustering of Induction Rules for Web Meta-knowledge. In: Rocha, Á., Correia, A., Wilson, T., Stroetmann, K. (eds) Advances in Information Systems and Technologies. Advances in Intelligent Systems and Computing, vol 206. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36981-0_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-36981-0_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-36980-3

  • Online ISBN: 978-3-642-36981-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics