Titlebook: KI 2015: Advances in Artificial Intelligence; 38th Annual German C Steffen H?lldobler,Rafael Pe?aloza,Sebastian Rudol Conference proceeding

Lensometer

書目名稱KI 2015: Advances in Artificial Intelligence影響因子(影響力)




書目名稱KI 2015: Advances in Artificial Intelligence影響因子(影響力)學科排名




書目名稱KI 2015: Advances in Artificial Intelligence網(wǎng)絡公開度




書目名稱KI 2015: Advances in Artificial Intelligence網(wǎng)絡公開度學科排名




書目名稱KI 2015: Advances in Artificial Intelligence被引頻次




書目名稱KI 2015: Advances in Artificial Intelligence被引頻次學科排名




書目名稱KI 2015: Advances in Artificial Intelligence年度引用




書目名稱KI 2015: Advances in Artificial Intelligence年度引用學科排名




書目名稱KI 2015: Advances in Artificial Intelligence讀者反饋




書目名稱KI 2015: Advances in Artificial Intelligence讀者反饋學科排名

Judicious

A Serendipity Model for News Recommendationof serendipity in the area of news articles and propose a general framework that incorporates the benefits of serendipity- and similarity-based recommendation techniques. An evaluation against other baseline recommendation models is carried out in a user study.

Asymptomatic

ABHOR

0302-9743 nity to present a wider range of results and ideas that are of interest to the KI audience, including reports about recent own publications, position papers, and previews of ongoing work..978-3-319-24488-4978-3-319-24489-1Series ISSN 0302-9743 Series E-ISSN 1611-3349

值得

0302-9743 ence, KI 2015, held in Dresden, Germany, in September 2015. ..The 15 revised full technical papers presented together with 14 technical communications, 4 doctoral consortium contributions, ?and 3 keynotes were carefully reviewed and selected from 58 submissions. ..The conference provides the opportu

Generosity

Kernel Feature Maps from Arbitrary Distance Metricsg pseudo line projections called . (DBFM). We show that our approximation does not depend on the input dataset size or the dimension of the input space. We experimentally evaluate our approach on two real datasets using two metric and one non-metric distance function.

engrave

Necessary Observations in Nondeterministic Planningcally, we develop a bottom-up algorithm which computes a set of variables which are always necessary to observe, in order to always reach a goal state. Our experimental results show that the knowledge about necessary observation variables can be used to minimize the number of sensors of an agent.

單片眼鏡

Fatten

Substance

Complexity of Interval Relaxed Numeric Planningoblem. We present a relaxation approach with intervals for numeric planning and show that plan existence can be decided in polynomial time for tasks where dependencies between numeric effects are acyclic.