• DocumentCode
    2227697
  • Title

    Bidirectional hierarchical clustering for Web mining

  • Author

    Yao, Zhongmei ; Choi, Ben

  • Author_Institution
    Comput. Sci., Louisiana Tech. Univ., Ruston, LA, USA
  • fYear
    2003
  • fDate
    13-17 Oct. 2003
  • Firstpage
    620
  • Lastpage
    624
  • Abstract
    We propose a new bidirectional hierarchical clustering system for addressing challenges of Web mining. The key feature of the approach is that it aims to maximize the intra-cluster similarity in the bottom-up cluster-merging phase and it ensures to minimize the inter-cluster similarity in the top-down refinement phase. This two-pass approach achieves better clustering than existing one-pass approaches. We also propose a new cluster-merging criterion for allowing more than two clusters to be merged in each step and a new measure of similarity for taking into consideration not only the inter-connectivity between clusters but also the internal connectivity within the clusters. These result in reducing the average complexity for creating the final hierarchical structure of clusters from O(n2) to O(n). The hierarchical structure represents a semantic structure between concepts of clusters and is directly applicable to the future of semantic net.
  • Keywords
    Internet; Web sites; computational complexity; data mining; minimisation; pattern clustering; Web mining; bidirectional hierarchical clustering; bottom-up cluster-merging phase; cluster-merging criterion; intra-cluster similarity maximization; semantic net; two-pass approach; Clustering algorithms; Computational complexity; Computer science; Educational institutions; Explosives; Noise shaping; Partitioning algorithms; Shape; Web mining; Web sites;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Web Intelligence, 2003. WI 2003. Proceedings. IEEE/WIC International Conference on
  • Print_ISBN
    0-7695-1932-6
  • Type

    conf

  • DOI
    10.1109/WI.2003.1241281
  • Filename
    1241281