Learn More
—We introduce a transaction database distribution scheme that divides the frequent item set mining task in a top-down fashion. Our method operates on a graph where vertices correspond to frequent items and edges correspond to frequent item sets of size two. We show that partitioning this graph by a vertex separator is sufficient to decide a distribution of(More)
Frequency mining problem comprises the core of several data mining algorithms. Among frequent pattern discovery algorithms, FP-GROWTH employs a unique search strategy using compact structures resulting in a high performance algorithm that requires only two database passes. We introduce an enhanced version of this algorithm called FP-GROWTH-TINY which can(More)
We frame the question of what kind of subjective experience a brain simulation would have in contrast to a biological brain. We discuss the brain prosthe-sis thought experiment. Then, we identify finer questions relating to the original inquiry, and set out to answer them moving forward from both a general physi-calist perspective, and pan-experientialism.(More)
We continue our analysis of volume and energy measures that are appropriate for quantifying inductive inference systems. We extend logical depth and conceptual jump size measures in AIT to stochas-tic problems, and physical measures that involve volume and energy. We introduce a graphical model of computational complexity that we believe to be appropriate(More)