#### Filter Results:

#### Publication Year

2004

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

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)

- Eray Özkural
- AGI
- 2011

- Eray Özkural
- AGI
- 2012

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)

- Eray Özkural
- AGI
- 2016

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)

- Eray Özkural
- AGI
- 2015

We propose that Solomonoff induction is complete in the physical sense via several strong physical arguments. We also argue that Solomonoff induction is fully applicable to quantum mechanics. We show how to choose an objective reference machine for universal induction by defining a physical message complexity and physical message probability , and argue… (More)

All-pairs similarity problem asks to find all vector pairs in a set of vectors the similarities of which surpass a given similarity threshold, and it is a computational kernel in data mining and information retrieval for several tasks. We investigate the parallelization of a recent fast sequential algorithm. We propose effective 1-D and 2-D data… (More)