 |
|
|
Item Details
| Title:
|
GRAPH-THEORETIC TECHNIQUES FOR WEB CONTENT MINING
|
| By: |
Abraham Kandel, Mark Last, Horst Bunke |
| Format: |
Hardback |
| List price:
|
£138.00 |
| Our price: |
£124.20 |
| Discount: |
|
| You save:
|
£13.80 |
|
|
|
|
|
| ISBN 10: |
9812563393 |
| ISBN 13: |
9789812563392 |
| Availability: |
Usually dispatched within 1-3 weeks.
 Delivery
rates
|
| Stock: |
Currently 0 available |
| Publisher: |
WORLD SCIENTIFIC PUBLISHING CO PTE LTD |
| Pub. date: |
31 May, 2005 |
| Series: |
Series In Machine Perception And Artificial Intelligence 62 |
| Pages: |
248 |
| Description: |
Describes opportunities for utilizing robust graph representations of data with machine learning algorithms. The authors have selected the domain of web content mining, which involves the clustering and classification of web documents based on their textual substance. |
| Synopsis: |
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. |
| Publication: |
Singapore |
| Imprint: |
World Scientific Publishing Co Pte Ltd |
| Returns: |
Returnable |
|
|
|
 |
|
|
|
|
|
Little Worried Caterpillar (PB)
Little Green knows she''s about to make a big change - transformingfrom a caterpillar into a beautiful butterfly. Everyone is VERYexcited! But Little Green is VERY worried. What if being a butterflyisn''t as brilliant as everyone says?Join Little Green as she finds her own path ... with just a littlehelp from her friends.
|
|
All the Things We Carry PB
What can you carry?A pebble? A teddy? A bright red balloon? A painting you''ve made?A hope or a dream?This gorgeous, reassuring picture book celebrates all the preciousthings we can carry, from toys and treasures to love and hope. With comforting rhymes and fabulous illustrations, this is a warmhug of a picture book.
|
|
|
|