Bisher 77,99 €**
75,99 €
versandkostenfrei*

inkl. MwSt.
**Früherer Preis
Sofort lieferbar
38 °P sammeln
    Gebundenes Buch

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,…mehr

Produktbeschreibung
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.
  • Produktdetails
  • Verlag: Springer, Berlin
  • Artikelnr. des Verlages: 10963388
  • Erscheinungstermin: 8. Dezember 2005
  • Englisch
  • Abmessung: 241mm x 160mm x 17mm
  • Gewicht: 424g
  • ISBN-13: 9783540277378
  • ISBN-10: 3540277374
  • Artikelnr.: 15031677
Autorenporträt
Yanchun Zhang, Victoria University of Technology, Melbourne, VIC, Australia / Jeffrey Xu Yu, Chinese University of Hong Kong, China / Jingyu Hou, Deakin University, Burwood, VIC, Australia
Inhaltsangabe
Chapter 1: Introduction (10 pages) -- Web Search, -- Information Filtering -- Web Community Chapter 2: Preliminaries (30 pages) -- Statistics -- Similarity -- Markov Model -- Matrix Expression of Hyperlinks -- Eigenvector, Principle Engenvector, Secondary Engenvector -- Singular Value Decomposition (SVD) of Matrix -- Graph Theory Basis (Random walk) Chapter 3: HITS and Related Algorithms (50 pages) -- The Original HITS -- The Stability issues -- The Randomized HITS -- The Subspace HITS -- Weighted HITS -- Vector Space Model (VSM) -- Cover Density Ranking (CDR) -- The In-depth Analysis of the HITS -- HITS Improvement (a significant improvement to clever algorithm) -- Noise Page Elimination Algorithm Based on SVD -- The PHITS algorithm (probabilistic HITS) -- SALSA (Stochastic algorithm) -- Random Walks and the Kleinberg Algorithm Chapter 4: PageRank Related Algorithms (50 pages) -- The Original PageRank -- Probability Combination of Link and Content Information in PageRank -- Topic-Sensitve PageRank -- Search-Order: Breadth-First, Backlink, Random -- Quadratic Extrapolation -- Exporing the Block Structure of the Web for Computing PageRank -- Second Eignevalue of the Google Matrix -- A Latent Linkage Information (LLI) Algorithm -- WebPage Scoring Systems (WPSS) -- Rank Aggregation -- Random Suffer Method -- Voting Model -- SimRank (graph-based) -- When Experts Agree: Using Non-Affliated Experts to Rank Popular Topics -- PageRank, HITS and a Unified Framework for Link Analysis Chapter 5: Web Classification and Clustering (50 pages) -- Web Document Similarity Measurement -- Web Document Classification Based on Hyperlinks and Document Semantics -- Clustering Hypertext with Applications to Web Search -- Link-based Clustering to Improve Web Search Results -- Measure Similarity of Interest for Clustering Web-Users -- Clustering of Web Users Using Session-based Similarity Measures -- Scalable Techniques for Clustering the Web -- Clustering web surfers with mixtures of hidden Markov Models -- Clustering User Queries of a Search Engine -- Using Web Structure for Classifying and Describing Web Pages -- Matrix-Based Hierarchical Clustering Algorithms Chapter 6: Web Log/Content Mining for Web Community (50 pages) -- Cut-and-Pick Transactions for Proxy Log Mining -- Mining Web Logs to Improve Website Organization -- Extracting Large-Scale Knowledge Bases from the Web -- Mining the Space of Graph Properties -- Discovering Test Set Regularities in Relational Domains (classification) -- Enhanced Hypertext Categorization Using Hyperlinks -- The Structure of Broad Topics on the Web -- Discovering Unexpected Information from Your Competitors' Web Sites -- On Integrating Catalogs -- Web Community Mining and Web Log Mi
Rezensionen
"The book can be used by applied mathematicians, search industry professionals, and anyone who wants to learn more about how search engines work. I recommend it for any course on Web information retrieval. I firmly believe that this book and the book by Langville and Meyer are the top two books about the algorithmic aspects of modern search engines." -- Yannis Manolopoulos, Aristotle University, Thessaloniki, Greece in ACM REVIEWS