391 search results - page 8 / 79 » Constructive Equivalence Relations on Computable Probability... |
CPC
1998
14 years 11 months ago
1998
For any Boolean functionf letL(f) be its formulasizecomplexityin the basis f^ 1g. For every n and every k n=2, we describe a probabilistic distribution on formulas in the basis f^...
PRL
2006
14 years 11 months ago
2006
Data reduction plays an important role in machine learning and pattern recognition with a high-dimensional data. In real-world applications data usually exists with hybrid formats...
115
click to vote
KDD
2007
ACM
15 years 5 months ago
2007
ACM
The support-confidence framework is the most common measure used in itemset mining algorithms, for its antimonotonicity that effectively simplifies the search lattice. This com...
DCC
2006
IEEE
15 years 11 months ago
2006
IEEE
In this work we consider the problem of universal prediction of individual sequences where the universal predictor is a deterministic finite state machine, with a fixed, relativel...
71
Voted
IEEEARES
2010
IEEE
15 years 6 months ago
2010
IEEE
- An operational complexity model (OCM) is proposed to enable the complexity of both the cognitive and the computational components of a process to be determined. From the complexi...