| |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 5 of 5
reviews
|
|
|
 |
|
|
|
|
Robots
Jordan J., The MIT Press, Cambridge, MA, 2016. 272 pp. Type: Book (978-0-262529-50-1)
This book is about the questions that arise in a society where robotics is increasingly important. Robotics is developing at such a fast rate that we do not stop to think about the questions that this raises. This book tries to uncover...
|
Sep 15 2017 |
|
|
|
|
|
|
Social question answering: textual, user, and network features for best answer prediction
Molino P., Aiello L., Lops P. ACM Transactions on Information Systems 35(1): 1-40, 2016. Type: Article
This paper combines a good review of the main techniques used in community question-answering (CQA) systems with an extensive and systematic study that compares the effect of using different sets of features for the task of predicting ...
|
Nov 11 2016 |
|
|
|
|
|
|
Metalearning: a survey of trends and technologies
Lemke C., Budka M., Gabrys B. Artificial Intelligence Review 44(1): 117-130, 2015. Type: Article
Metalearning has been studied for many years, tracing back to work done in educational psychology in the 1980s. However, beginning in the 1990s, great interest in it has been shown by the machine learning community due to the benefits ...
|
Oct 5 2015 |
|
|
|
|
|
|
Social networks: analysis and case studies
Gündüz-Ogüdücü S. (ed), Etaner-Uyar A., Springer Publishing Company, Incorporated, New York, NY, 2014. 249 pp. Type: Book (978-3-709117-96-5)
Experts in the field of social networks aim to help readers grasp the state of the art in the topic of network-based representation and analysis in this collection of papers. However, it is not a survey of this enormous area. Instead, ...
|
Apr 24 2015 |
|
|
|
|
|
|
Can machine learning learn a decision oracle for NP problems? A test on SAT
Grozea C., Popescu M. Fundamenta Informaticae 131(3-4): 441-450, 2014. Type: Article
Finding good heuristics for a nondeterministic polynomial-time (NP) problem is a very important research goal that is mostly addressed on a case-by-case basis. This paper takes a different path: a classic NP problem, 3-SAT, is used as ...
|
Jul 30 2014 |
|
|
|
|
|
| |
|
|
| |
|
|
