Join BookitisSave favorites, build lists, and follow creators.

Web communities

Work detail

Bookitis Pick
Cover for Web communities
WC
Image source: Open Library
Yanchun ZhangJeffrey Xu YuJingyu Hou2 editions

Due to the lack of a uniform schema for Web documents and the sheer amount and dynamics of Web data, both the effectiveness and the efficiency of information management and retrieval of Web data is often unsatisfactory when using conventional data management techniques. Web community, defined as a set of Web-based documents with its own logical structure, is a flexible and efficient approach to support information retrieval and to implement various applications. Zhang and his co-authors explain how to construct and analyse Web communities based on information like Web document contents, hyperlinks, or user access logs. Their approaches combine results from Web search algorithms, Web clustering methods, and Web usage mining. They also detail the necessary preliminaries needed to understand the algorithms presented, and they discuss several successful existing applications. Researchers and students in information retrieval and Web search find in this all the necessary basics and methods to create and understand Web communities. Professionals developing Web applications will additionally benefit from the samples presented for their own designs and implementations.

Overview

Shared work-level identity and catalog context.

3 credited authorsSearch language english

Bookitis keeps work pages focused on the shared book identity and the editions that actually belong to it. Unrelated books should not appear here as primary content.

Contributors

People credited with this work in the active catalog.

  • Yanchun Zhang

    Author profile in the active Bookitis catalog

    Open Author
  • Jeffrey Xu Yu

    Author profile in the active Bookitis catalog

    Open Author
  • Jingyu Hou

    Author profile in the active Bookitis catalog

    Open Author

Editions

Publication-specific versions linked to this work only.