Graph-theoretic Techniques For Web Content Mining
Regular price
€171.12
14 days return policy
Shipping & Delivery
A01=Abraham Kandel
A01=Adam Schenker
A01=Horst Bunke
A01=Mark Last
Author_Abraham Kandel
Author_Adam Schenker
Author_Horst Bunke
Author_Mark Last
Category=PBV
Category=UDB
Classification
Clustering
Data Mining
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
Graph
Graph Distance
Machine Learning
Maximum Common Subgraph
Web Mining
Product details
- ISBN 9789812563392
- Publication Date: 31 May 2005
- Publisher: World Scientific Publishing Co Pte Ltd
- Publication City/Country: SG
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
This book describes exciting new opportunities for utilizing robust graph representations of data with common machine learning algorithms. Graphs can model additional information which is often not present in commonly used data representations, such as vectors. Through the use of graph distance — a relatively new approach for determining graph similarity — the authors show how well-known algorithms, such as k-means clustering and k-nearest neighbors classification, can be easily extended to work with graphs instead of vectors. This allows for the utilization of additional information found in graph representations, while at the same time employing well-known, proven algorithms.To demonstrate and investigate these novel techniques, the authors have selected the domain of web content mining, which involves the clustering and classification of web documents based on their textual substance. Several methods of representing web document content by graphs are introduced; an interesting feature of these representations is that they allow for a polynomial time distance computation, something which is typically an NP-complete problem when using graphs. Experimental results are reported for both clustering and classification in three web document collections using a variety of graph representations, distance measures, and algorithm parameters.In addition, this book describes several other related topics, many of which provide excellent starting points for researchers and students interested in exploring this new area of machine learning further. These topics include creating graph-based multiple classifier ensembles through random node selection and visualization of graph-based data using multidimensional scaling.
