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
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.
Dr. Yanchun Zhang is Associate Professsor and the Head of Computing Discipline in the Department of Mathematics and Computing at the University of Southern Queensland. He obtained PhD degree in Computer Science from the University of Queensland in 1991. His research areas cover databases, electronic commerce, internet/web information systems, web data management, web search and web services. He has published over 100 research papers on these topics in international journals and conference proceedings, and edited over 10 books/proceedings and journal special issues. He is a co-founder and Co-Editor-In-Chief of World Wide Web: Internet and Web Information Systems and Co-Chairman of International Web Information Systems Engineering Society. Dr. Jeffrey Xu Yu received his B.E., M.E. and Ph.D. in computer science, from the University of Tsukuba, Japan, in 1985, 1987 and 1990, respectively. Jeffrey Xu Yu was a faculty member in the Institute of Information Sciences and Electronics, University of Tsukuba, Japan, and was a Lecturer in the Department of Computer Science, The Australian National University. Currently, he is an Associate Professor in the Department of Systems Engineering and Engineering Management, the Chinese University of Hong Kong. His research areas cover databases, data warehouse and data mining. He has published over 100 research papers on these topics in international journals and conference proceedings. Jeffrey Xu Yu is a member of ACM, and a society affiliate of IEEE Computer Society. Dr Jingyu Hou received his BSc in Computational Mathematics from Shanghai University of Science and Technology (1985) and his PhD in Computational Mathematics from Shanghai University (1995). He is now a Lecturer in the School of Information Technology at Deakin University, Australia. He has also completed a PhD in Computer Science in the Department of Mathematics and Computing at The University of Southern Queensland, Australia. His researchinterests include Web-Based Data Management and Information Retrieval, Web Databases, Internet Computing and Electronic Commerce, and Semi-Structured Data Models. He has extensively published in the areas of Web information retrieval and Web Communities.
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
Preliminaries.- HITS and Related Algorithms.- PageRank Related Algorithms.- Affinity and Co-Citation Analysis Approaches.- Building a Web Community.- Web Community Related Techniques.- Conclusions.
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
Preliminaries.- HITS and Related Algorithms.- PageRank Related Algorithms.- Affinity and Co-Citation Analysis Approaches.- Building a Web Community.- Web Community Related Techniques.- Conclusions.
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
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)
Es gelten unsere Allgemeinen Geschäftsbedingungen: www.buecher.de/agb
Impressum
www.buecher.de ist ein Shop der buecher.de GmbH & Co. KG Bürgermeister-Wegele-Str. 12, 86167 Augsburg Amtsgericht Augsburg HRA 13309
