Machine Learning Paradigms

★ 3.8 avg 1 votes

About this book

This timely book presents Applications in Recommender Systems which are making recommendations using machine learning algorithms trained via examples of content the user likes or dislikes. Recommender systems built on the assumption of availability of both positive and negative examples do not perform well when negative examples are rare. It is exactly this problem that the authors address in the monograph at hand. Specifically, the books approach is based on one-class classification methodologies that have been appearing in recent machine learning research. The blending of recommender systems and one-class classification provides a new very fertile field for research, innovation and development with potential applications in “big data” as well as “sparse data” problems. The book will be useful to researchers, practitioners and graduate students dealing with problems of extensive and complex data. It is intended for both the expert/researcher in the fields of Pattern Recognition, Machine Learning and Recommender Systems, as well as for the general reader in the fields of Applied and Computer Science who wishes to learn more about the emerging discipline of Recommender Systems and their applications. Finally, the book provides an extended list of bibliographic references which covers the relevant literature completely.

3.8 ★★★★☆ average of 1 sources · 1 votes

Reader Profile

Enjoyment76Difficulty60Influence32Popularity17Classic11

3.8/5 · 1 readers · 370 pages · ≈ 6 h 51 m · Moderate

How long does it take to read Machine Learning Paradigms?

About ≈ 6 h 51 m — 370 pages, assuming roughly 250 words per page at 225 words per minute.Typical novel≈ 5 h 56 mMachine Learning Paradigms~6 h 51 m

How many pages is Machine Learning Paradigms?

370 pages in its most-read edition.Typical novel320Machine Learning Paradigms370

Is Machine Learning Paradigms in the public domain?

No — it is still under copyright.

Who wrote Machine Learning Paradigms?

Aristomenis S. Lampropoulos.