Skip to main content

An Evolutionary Approach for Clustering User Access Patterns from Web Logs

  • Conference paper
AI 2006: Advances in Artificial Intelligence (AI 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4304))

Included in the following conference series:

  • 3435 Accesses

Abstract

In this paper rough c-means is applied to cluster user access patterns, in which PSO(Particle Swarm Optimization) algorithm is employed to tune the threshold and relative importance of upper and lower approximations. The Davies-Bouldin clustering validity index is used as the fitness function that is minimized while arriving at an optimal clustering. The effectiveness of the algorithm is demonstrated by an experiment.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Bezdek, J., Pal, N.: Some new indexes for cluster validity. IEEE Transactions on Systems, Man, and Cybernetics. Part-B 28, 301–315 (1998)

    Article  Google Scholar 

  2. Eberhat, R., Kennedy, J.: A new Optimizer Using Particles Swarm Theory. In: Proceedings of Sixth International Symposium on Micro Machine and Human Science, Japan, pp. 39–43 (1995)

    Google Scholar 

  3. De, S., Krishna, P.: Clustering web transactions using rough approximation. Fuzzy Sets and Systems 148, 131–138 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  4. Krishnapram, R., Joshi, A., et al.: Low compexity fuzzy relational clustering algorithms for web mining. IEEE Transactions on Fuzzy Systems 9, 595–607 (2001)

    Article  Google Scholar 

  5. Hathaway, R., Beadek, J.: Switching regression models and fuzzy clustering. IEEE Transactions on Fuzzy Systems 1(3), 195–204 (1993)

    Article  Google Scholar 

  6. Lingras, P.: Rough set clustering for web mining. In: Proceedings of the 2002 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE 2002), Honolulu, HI, United States, vol. 2, pp. 1039–1044 (2002)

    Google Scholar 

  7. Liu, B., Liu, Y.: Expected value of fuzzy variable and fuzzy expected value models. IEEE Transactions on Fuzzy Systems 10, 445–450 (2002)

    Article  Google Scholar 

  8. Ning, Y., Tang, W., Zhang, Y.: Analytic hierarchy process based on fuzzy simulation. In: Proceedings of the IEEE International Conference on Fuzzy Systems, Reno, NV, USA, pp. 546–550 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, R. (2006). An Evolutionary Approach for Clustering User Access Patterns from Web Logs. In: Sattar, A., Kang, Bh. (eds) AI 2006: Advances in Artificial Intelligence. AI 2006. Lecture Notes in Computer Science(), vol 4304. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11941439_145

Download citation

  • DOI: https://doi.org/10.1007/11941439_145

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-49787-5

  • Online ISBN: 978-3-540-49788-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics