Positioning, Navigation, and Timing Trust Inference Engine

2020 ◽  
Author(s):  
Andres Molina-Markham ◽  
Joseph J. Rushanan
Keyword(s):  
Inference Engine ◽  
Trust Inference

Corrigendum to WebPIE: A Web-Scale Parallel Inference Engine Using MapReduce

2012 ◽  
Author(s):  
Jacopo Urbani ◽  
Spyros Kotoulas ◽  
Jason Massen ◽  
Frank van Harmelen ◽  
Henri Bal
Keyword(s):  
Inference Engine ◽  
Parallel Inference

scholarly journals Introducing the StataStan Interface for Fast, Complex Bayesian Modeling Using Stan

2017 ◽  
Vol 17 (2) ◽  
pp. 330-342 ◽  
Author(s):  
Robert L. Grant ◽  
Bob Carpenter ◽  
Daniel C. Furr ◽  
Andrew Gelman
Keyword(s):  
Bayesian Inference ◽  
Item Response Theory ◽  
Open Source ◽  
Item Response ◽  
Bayesian Modeling ◽  
Inference Engine ◽  
Software Components ◽  
Statistical Software ◽  
Simulation Based ◽  
Item Response Theory Models

In this article, we present StataStan, an interface that allows simulation-based Bayesian inference in Stata via calls to Stan, the flexible, open-source Bayesian inference engine. Stan is written in C++, and Stata users can use the commands stan and windowsmonitor to run Stan programs from within Stata. We provide a brief overview of Bayesian algorithms, details of the commands available from Statistical Software Components, considerations for users who are new to Stan, and a simple example. Stan uses a different algorithm than bayesmh, BUGS, JAGS, SAS, and MLwiN. This algorithm provides considerable improvements in efficiency and speed. In a companion article, we give an extended comparison of StataStan and bayesmh in the context of item response theory models.

Modelling trust networks using resistive circuits for trust-aware recommender systems

2016 ◽  
Vol 43 (1) ◽  
pp. 135-144 ◽  
Author(s):  
Mehdi Hosseinzadeh Aghdam ◽  
Morteza Analoui ◽  
Peyman Kabiri
Keyword(s):  
Collaborative Filtering ◽  
Recommender Systems ◽  
Recommender System ◽  
Cold Start ◽  
User Preferences ◽  
Item Selection ◽  
Trust Networks ◽  
Trust Inference ◽  
Trust Information

Recommender systems have been widely used for predicting unknown ratings. Collaborative filtering as a recommendation technique uses known ratings for predicting user preferences in the item selection. However, current collaborative filtering methods cannot distinguish malicious users from unknown users. Also, they have serious drawbacks in generating ratings for cold-start users. Trust networks among recommender systems have been proved beneficial to improve the quality and number of predictions. This paper proposes an improved trust-aware recommender system that uses resistive circuits for trust inference. This method uses trust information to produce personalized recommendations. The result of evaluating the proposed method on Epinions dataset shows that this method can significantly improve the accuracy of recommender systems while not reducing the coverage of recommender systems.

Prolog/Rex inference engine

1995 ◽  
Vol 12 (3) ◽  
pp. 239-250 ◽  
Author(s):  
Sanja Vraneš ◽  
Mladen Stanojevic
Keyword(s):  
Inference Engine

CoreALMlib: An library translated from the Component Library

2016 ◽  
Vol 16 (5-6) ◽  
pp. 800-816 ◽  
Author(s):  
DANIELA INCLEZAN
Keyword(s):  
Natural Language ◽  
Answer Set Programming ◽  
Natural Language Understanding ◽  
Inference Engine ◽  
Lexical Resources ◽  
Language Understanding ◽  
Commonsense Knowledge ◽  
Component Library ◽  
Action Language ◽  
Answer Set

AbstractThis paper presents CoreALMlib, an $\mathscr{ALM}$ library of commonsense knowledge about dynamic domains. The library was obtained by translating part of the Component Library (CLib) into the modular action language $\mathscr{ALM}$. CLib consists of general reusable and composable commonsense concepts, selected based on a thorough study of ontological and lexical resources. Our translation targets CLibstates (i.e., fluents) and actions. The resulting $\mathscr{ALM}$ library contains the descriptions of 123 action classes grouped into 43 reusable modules that are organized into a hierarchy. It is made available online and of interest to researchers in the action language, answer-set programming, and natural language understanding communities. We believe that our translation has two main advantages over its CLib counterpart: (i) it specifies axioms about actions in a more elaboration tolerant and readable way, and (ii) it can be seamlessly integrated with ASP reasoning algorithms (e.g., for planning and postdiction). In contrast, axioms are described in CLib using STRIPS-like operators, and CLib's inference engine cannot handle planning nor postdiction.

Sign in / Sign up

Export Citation Format

Share Document