Skip to main content
SpringerLink
Log in
Book cover

International Conference on High-Performance Computing

HiPC 2001: High Performance Computing — HiPC 2001 pp 385–396Cite as

Web Mining Is Parallel

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2228))

Abstract

The emerging WWW poses new technological challenges for information processing. The scale of WWW is expected to keep growing as more devices, such as mobile phones and PDAs are equipped with the ability to access internet. Here we report the application of data mining techniques on large scale web data of a directory service for users of i- Mode, a major mobile phone internet access in Japan. We develop tool to visualize the behavior of web site visitors. We also report experiments on PC cluster as promising platform for large scale web mining. Parallel algorithms for generalized association rules are implemented on PC cluster with 100 PCs.

NTT Information Sharing Platform Laboratories, Midori-cho 3-9-11, Musashino-shi, Tokyo 180-8585, Japan

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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. R. Agrawal and R. Srikant. “Fast Algorithms for Mining Association Rules”. In Proc. of VLDB, pp. 487–499, Sep. 1994.

    Google Scholar 

  2. R. Agrawal and J. C. Shafer. “Parallel Mining of Associaton Rules”. In IEEE TKDE, Vol. 8

    Google Scholar 

  3. E.-H. Han and G. Karypis and Vipin Kumar “Scalable Parallel Data Mining for Association Rules.” In Proc. of SIGMOD, pp. 277–288, May. 1997

    Google Scholar 

  4. J.I. Hong and J.A. Landay “WebQuilt: A Framework for Capturing and Visualizing the Web Experience” In Proc. of WWW10, 2001.

    Google Scholar 

  5. J.S. Park, M.-S. Chen, P.S. Yu “Efficient Parallel Algorithms for Mining Association Rules” In Proc. of CIKM, pp. 31–36, Nov. 1995

    Google Scholar 

  6. R. Srikant, R. Agrawal. “Mining Generalized Association Rules”. In Proc. of VLDB, 1995.

    Google Scholar 

  7. T. Shintani and M. Kitsuregawa “Hash Based Parallel Algorithms for Mining Association Rules”. In Proc. of PDIS, pp. 19–30, Dec. 1996.

    Google Scholar 

  8. T. Shintani, M. Kitsuregawa “Parallel Mining Algorithms for Generalized Association Rules with Classification Hierarchy.” In Proc. of SIGMOD, pp. 25–36, 1998.

    Google Scholar 

  9. T. Shintani, M. Oguchi, M. Kitsuregawa. “Performance Analysis for Parallel Generalized Association Rule Mining on a Large Scale PC Cluster”. In Proc. of Euro-par, 1999.

    Google Scholar 

  10. M. Spiliopoulou and L.C. Faulstich “WUM:A tool for Web Utilization Analysis” In Proc. of EDBT Workshop WebDB’98, 1998.

    Google Scholar 

  11. M. Tamura, M. Kitsuregawa. “Dynamic Load Balancing for Parallel Association Rule Mining on Heterogeneous PC Cluster System”. In Proc. of VLDB, 1999.

    Google Scholar 

  12. T. Tamura, M. Oguchi, M. Kitsuregawa “Parallel Database Processing on a 100 Node PC Cluster: Cases for Decision Support Query Processing and Data Mining.” In Proc of Super Computing 97::High Performance Networking and Computing, 1997

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Industrial Science, The University of Tokyo, 4-6-1 Komaba, Meguro-ku, 153-8505, Tokyo, Japan

    Masaru Kitsuregawa, Iko Pramudiono, Katsumi Takahashi & Bowo Prasetyo

Authors
  1. Masaru Kitsuregawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Iko Pramudiono
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Katsumi Takahashi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Bowo Prasetyo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computer Science, University of Paderborn, Fürstenallee 11, 33102, Paderborn, Germany

    Burkhard Monien

  2. Department of EE-Systems, Computer Engineering Division, University of Southern California, 3740 McClintock Avenue, EEB 200C, 90089-2562, Los Angeles, CA, USA

    Viktor K. Prasanna

  3. Independent Consultant, c/o Infosys Ltd., “Mangala”, Kuloor Ferry Road, Kottara, 575006, Mangalore, India

    Sriram Vajapeyam

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kitsuregawa, M., Pramudiono, I., Takahashi, K., Prasetyo, B. (2001). Web Mining Is Parallel. In: Monien, B., Prasanna, V.K., Vajapeyam, S. (eds) High Performance Computing — HiPC 2001. HiPC 2001. Lecture Notes in Computer Science, vol 2228. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45307-5_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-45307-5_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43009-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation