processing framework
Recently Published Documents


TOTAL DOCUMENTS

603
(FIVE YEARS 207)

H-INDEX

26
(FIVE YEARS 7)

2022 ◽  
Author(s):  
Joshua Martin

According to the predictive processing framework, perception is geared to represent the environment in terms of embodied action opportunities as opposed to objective truth. Here, we argue that such an optimisation is reflected by biases in expectations (i.e., prior predictive information) that facilitate ‘useful’ inferences of external sensory causes. To support this, we highlight a body of literature suggesting that perception is systematically biased away from accurate estimates under conditions where utility and accuracy conflict with one another. We interpret this to reflect the brain’s attempt to adjudicate between conflicting sources of prediction error, as external accuracy is sacrificed to facilitate actions that proactively avoid physiologically surprising outcomes. This carries important theoretical implications and offers new insights into psychopathology.


2022 ◽  
Vol 163 ◽  
pp. 107999
Author(s):  
Michael Candon ◽  
Oleg Levinski ◽  
Hideaki Ogawa ◽  
Robert Carrese ◽  
Pier Marzocca

2021 ◽  
Author(s):  
Pankaj Singh ◽  
Sudhakar Singh ◽  
P K Mishra ◽  
Rakhi Garg

Abstract Frequent itemset mining (FIM) is a highly computational and data intensive algorithm. Therefore, parallel and distributed FIM algorithms have been designed to process large volume of data in a reduced time. Recently, a number of FIM algorithms have been designed on Hadoop MapReduce, a distributed big data processing framework. But, due to heavy disk I/O, MapReduce is found to be inefficient for the highly iterative FIM algorithms. Therefore, Spark, a more efficient distributed data processing framework, has been developed with in-memory computation and resilient distributed dataset (RDD) features to support the iterative algorithms. On this framework, Apriori and FP-Growth based FIM algorithms have been designed on the Spark RDD framework, but Eclat-based algorithm has not been explored yet. In this paper, RDD-Eclat, a parallel Eclat algorithm on the Spark RDD framework is proposed with its five variants. The proposed algorithms are evaluated on the various benchmark datasets, and the experimental results show that RDD-Eclat outperforms the Spark-based Apriori by many times. Also, the experimental results show the scalability of the proposed algorithms on increasing the number of cores and size of the dataset.


Sign in / Sign up

Export Citation Format

Share Document