Isbn: 9789812563392 - graph-theoretic techniques for web content mining (series in machine perception and artificial intelligence, band 62) (6 Ergebnisse)

16 x 23 cm. 248 pages. Hardcover. Versand aus Deutschland / We dispatch from Germany via Air Mail. Einband bestoßen, daher Mängelexemplar gestempelt, sonst sehr guter Zustand. Imperfect copy due to slightly bumped cover, apart from this in very good condition. Stamped. Sprache: Englisch.

Hardcover. Zustand: Gut. 235 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. M15665 9789812563392 Sprache: Englisch Gewicht in Gramm: 550.

Hardcover. Zustand: Brand New. illustrated edition. 248 pages. 9.25x6.25x0.75 inches. In Stock.

Zustand: New. In.

Gebunden. Zustand: New. 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.

Buch. Zustand: Neu. Neuware - 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.…