Advances in Mining Graphs, Trees and Sequences (Paperback)

Ever since the early days of machine learning and data mining, it has been realized that the traditional attribute-value and item-set representations are too limited for many practical applications in domains such as chemistry, biology, network analysis and text mining. This has triggered a lot of research on mining and learning within alternative and more expressive representation formalisms such as computational logic, relational algebra, graphs, trees and sequences. The motivation for using graphs, trees and sequences. Is that they are 1) more expressive than flat representations, and 2) potentially more efficient than multi-relational learning and mining techniques. At the same time, the data structures of graphs, trees and sequences are among the best understood and most widely applied representations within computer science. Thus these representations offer ideal opportunities for developing interesting contributions in data mining and machine learning that are both theoretically well-founded and widely applicable. The goal of this book is to collect recent outstanding studies on mining and learning within graphs, trees and sequences in studies worldwide.

General

Imprint:	IOS Press,US
Country of origin:	United States
Series:	Frontiers in Artificial Intelligence and Applications, v. 124
Release date:	June 2005
First published:	June 2005
Editors:	Luc de Raedt • T. Washio • J.N. Kok
Dimensions:	246 x 189 x 11mm (L x W x T)
Format:	Paperback
Pages:	220
ISBN-13:	978-1-58603-528-0
Categories:	Books > Computing & IT > Applications of computing > Databases > General Books > Computing & IT > Applications of computing > Artificial intelligence > Machine learning
LSN:	1-58603-528-2
Barcode:	9781586035280

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!