|
| |
|
|
Conditioning and Flexibility in Compositional Models
Kratochvíl, Václav
Reasoning by cases or assumptions is a common form of human reasoning. In case of probability reasoning, this is modeled by conditioning of a multidimensional probability distribution. Compositional models are defined as a multidimensional distributions assembled from a (so called generating) sequence of lowdimensional probability distributions, with the help of operators of composition. In this case, the conditioning process can be viewed as a transformation of one generating sequence into another one. It appears that the conditioning process is simple when conditioning variable appears in the argument of the first distribution of the corresponding generating sequence. That is why we introduce the so called flexible sequences. Flexible sequences are those, which can be reordered in many ways that each variable can appears among arguments of the first distribution. In this paper, we study the problem of flexibility in light of the very recent solution of the equivalence problem.
|
|
| |
|
|
Fast Dependency-Aware Feature Selection in Very-High-Dimensional Pattern Recognition Problems
Somol, Petr ; Grim, Jiří
The paper addresses the problem of making dependency-aware feature selection feasible in pattern recognition problems of very high dimensionality. The idea of individually best ranking is generalized to evaluate the contextual quality of each feature in a series of randomly generated feature subsets. Each random subset is evaluated by a criterion function of arbitrary choice (permitting functions of high complexity). Eventually, the novel dependency-aware feature rank is computed, expressing the average benefit of including a feature into feature subsets. The method is efficient and generalizes well especially in very-high-dimensional problems, where traditional context-aware feature selection methods fail due to prohibitive computational complexity or to over-fitting. The method is shown well capable of over-performing the commonly applied individual ranking which ignores important contextual information contained in data.
|
|
|
Introduction to Feature Selection Toolbox 3 – The C++ Library for Subset Search, Data Modeling and Classification
Somol, Petr ; Vácha, Pavel ; Mikeš, Stanislav ; Hora, Jan ; Pudil, Pavel ; Žid, Pavel
We introduce a new standalone widely applicable software library for feature selection (also known as attribute or variable selection), capable of reducing problem dimensionality to maximize the accuracy of data models, performance of automatic decision rules as well as to reduce data acquisition cost. The library can be exploited by users in research as well as in industry. Less experienced users can experiment with different provided methods and their application to real-life problems, experts can implement their own criteria or search schemes taking advantage of the toolbox framework. In this paper we first provide a concise survey of a variety of existing feature selection approaches. Then we focus on a selected group of methods of good general performance as well as on tools surpassing the limits of existing libraries. We build a feature selection framework around them and design an object-based generic software library. We describe the key design points and properties of the library.
|
|
|
Sequential Retreating Search Methods in Feature Selection
Somol, Petr ; Pudil, Pavel
Inspired by Floating Search, our new pair of methods, the Sequential Forward Retreating Search (SFRS) and Sequential Backward Retreating Search (SBRS) is exceptionally suitable for Wrapper based feature selection. (Conversely, it cannot be used with monotonic criteria.) Unlike most of other known sub-optimal search methods, both the SFRS and SBRS are parameter-free deterministic sequential procedures that incorporate in the optimization process both the search for the best subset and the determination of the best subset size. The subset yielded by either of the two new methods is to be expected closer to optimum than the best of all subsets yielded in one run of the Floating Search. Retreating Search time complexity is to be expected slightly worse but in the same order of magnitude as that of the Floating Search. In addition to introducing the new methods we provide a testing framework to evaluate them with respect to other existing tools.
|
|
|
Problém chybějících dat při sčítání lidu - kteří respondenti neodpověděli
Hora, Jan
Interaktivní reprodukce výsledků sčítání lidu pomocí statistického modelu nabízí v této souvislosti alternativní publikační možnost s dokonale zabezpečenou ochranou anonymity dat. Základem metody je odhad statistického modelu původní databáze ve tvaru diskrétní součinové směsi, která je následně použita jako báze znalostí pravděpodobnostního expertního systému. Interaktivní statistický model umožňuje odvozování libovolně podmíněných tabulek resp. histogramů s uživatelským komfortem, který je srovnatelný nebo lepší než v případě souboru mikrodat. Odhadnutá distribuční směs neobsahuje původní data, takže výsledný interaktivní softwarový produkt může být zpřístupněn všem uživatelům bez jakéhokoli omezení.
|
|
| |
|
| |
|
| |
host ::
RSS.