Skip to main content

Research on Path Clustering Based on the Access Interest of Users

  • Conference paper
  • 937 Accesses

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

Abstract

Users with same interests can be classified by making use of clustering technology, based on the access path of users, the page access time of users, the resident time at page and URL of linking to the page in a web site. A new clustering algorithm is proposed by using access interests of users in the paper, in which the new interest degree, similitude degree, and clustering center will be defined. A true experiment has been completed making use of log files in the www.ty.sx.cn web site. Experiment results are successful.

Sponsored by the grand science and technology research program of ministry of education (03020) and the Natural Science Foundation of Shanxi Province(20031038).

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Wang, S., Gao, W., Li, J.T., Xie, H.: Path Clustering: D is covering the knowledge in the Web site. Journal of Computer Research & Development 38(4), 482–486 (2001)

    Google Scholar 

  2. Song, A.B., Hu, K.F., Dong, Y.S.: Research on Web log mining. Journal of Southeast University (Natural Science Edition) 32(1), 15–18 (2002)

    Google Scholar 

  3. Qian, W.N., Zhou, A.Y.: Analyzing Popular Clustering Algorithms from Different Viewpoints. Journal of Software 13(8), 1382–1394 (2002)

    Google Scholar 

  4. Mobasher, B., Dai, H., Luo, T., Nakagawa, M.: Discovery and Evaluation of Aggregate Usage Profiles for Web Personalization. Data Mining and Knowledge Discovery 6(1), 61–82 (2002)

    Article  MathSciNet  Google Scholar 

  5. Cadez, I., Heckerman, D., Meek, C., Smyth, P., White, S.: Model-Based Clustering and Visualization of Navigation Patterns on a Web Site. Data Mining and Knowledge Discovery 7(4), 399–424 (2003)

    Article  MathSciNet  Google Scholar 

  6. Grabmeier, J., Rudolph, A.: Techniques of Cluster Algorithms in Data Mining. Data Mining and Knowledge Discovery 6(4), 303–360 (2002)

    Article  MathSciNet  Google Scholar 

  7. Cho, Y.H., Kim, J.K., Kim, S.H.: A personalized recommender system based on web usage mining and decision tree induction. Expert Systems with Applications 23(3), 329–342 (2002)

    Article  Google Scholar 

  8. Tan, P., Kumar, V.: Discovery of Web Robot Sessions Based on Their Navigational Patterns. Data Mining and Knowledge Discovery 6(1), 9–35 (2002)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, J., Wu, J. (2005). Research on Path Clustering Based on the Access Interest of Users. In: Szczepaniak, P.S., Kacprzyk, J., Niewiadomski, A. (eds) Advances in Web Intelligence. AWIC 2005. Lecture Notes in Computer Science(), vol 3528. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11495772_15

Download citation

  • DOI: https://doi.org/10.1007/11495772_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26219-0

  • Online ISBN: 978-3-540-31900-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics