Relational knowledge discovery
Material type: TextSeries: Lecture notes on machine learningPublication details: Cambridge ; New York : Cambridge University Press, 2012Description: vi, 271 p. : illISBN: 9780521190213 (hardback)Subject(s): Computational learning theory | Machine learning | Relational databasesDDC classification: 006.31 Summary: "What is knowledge and how is it represented? This book focuses on the idea of formalising knowledge as relations, interpreting knowledge represented in databases or logic programs as relational data and discovering new knowledge by identifying hidden and defining new relations. After a brief introduction to representational issues, the author develops a relational language for abstract machine learning problems. He then uses this language to discuss traditional methods such as clustering and decision tree induction, before moving onto two previously underestimated topics that are just coming to the fore: rough set data analysis and inductive logic programming. Its clear and precise presentation is ideal for undergraduate computer science students. The book will also interest those who study artificial intelligence or machine learning at the graduate level. Exercises are provided and each concept is introduced using the same example domain, making it easier to compare the individual properties of different approaches"--Item type | Current library | Collection | Call number | Status | Date due | Barcode |
---|---|---|---|---|---|---|
BK | Kannur University Central Library Stack | Stack | 006.31 MUL/R (Browse shelf (Opens below)) | Available | 31346 |
"What is knowledge and how is it represented? This book focuses on the idea of formalising knowledge as relations, interpreting knowledge represented in databases or logic programs as relational data and discovering new knowledge by identifying hidden and defining new relations. After a brief introduction to representational issues, the author develops a relational language for abstract machine learning problems. He then uses this language to discuss traditional methods such as clustering and decision tree induction, before moving onto two previously underestimated topics that are just coming to the fore: rough set data analysis and inductive logic programming. Its clear and precise presentation is ideal for undergraduate computer science students. The book will also interest those who study artificial intelligence or machine learning at the graduate level. Exercises are provided and each concept is introduced using the same example domain, making it easier to compare the individual properties of different approaches"--
There are no comments on this title.