The following pages link to Jerzy W. Grzymala-Busse (Q507635):
Displaying 50 items.
- Mining incomplete data with singleton, subset and concept probabilistic approximations (Q507637) (← links)
- Combinatorial machine learning. A rough set approach. (Q545918) (← links)
- (Q582936) (redirect page) (← links)
- On rough sets and information system homomorphisms (Q582938) (← links)
- Partition triples: A tool for reduction of data sets (Q676461) (← links)
- (Q688818) (redirect page) (← links)
- Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities (Q688819) (← links)
- Fusion methods for unsupervised learning ensembles. (Q708016) (← links)
- Prediction-preserving reducibility (Q756441) (← links)
- A note on intersections of free submonoids of a free monoid (Q760507) (← links)
- Characterization of state-independent automata (Q1085977) (← links)
- On the complexity of finite autonomous Moore automata (Q1097701) (← links)
- Global discretization of continuous attributes as preprocessing for machine learning (Q1125694) (← links)
- Finite globally-idempotent semigroups (Q1153444) (← links)
- Compatibility relations for the representation of associations between variables in knowledge-based systems, and their use in approximate reasoning (Q1177686) (← links)
- Decision theoretic generalizations of the PAC model for neural net and other learning applications (Q1198550) (← links)
- Belief functions: The disjunctive rule of combination and the generalized Bayesian theorem (Q1308975) (← links)
- Consistency of incomplete data (Q1750037) (← links)
- A comparison of characteristic sets and generalized maximal consistent blocks in mining incomplete data (Q2107353) (← links)
- Characteristic sets and generalized maximal consistent blocks in mining incomplete data (Q2195384) (← links)
- Generalized probabilistic approximations of incomplete data (Q2353672) (← links)
- Operation-preserving functions and autonomous factors of finite automata (Q2548580) (← links)
- Mining incomplete data using global and saturated probabilistic approximations based on characteristic sets and maximal consistent blocks (Q2670885) (← links)
- (Q2710084) (← links)
- (Q2729104) (← links)
- (Q2766917) (← links)
- (Q2776637) (← links)
- (Q2784614) (← links)
- (Q2843952) (← links)
- An Experimental Comparison of Three Probabilistic Approximations Used for Rule Induction (Q2865087) (← links)
- A Local Version of the MLEM2 Algorithm for Rule Induction (Q3065013) (← links)
- (Q3142021) (← links)
- A Rough Set Approach to Incomplete Data (Q3300351) (← links)
- A Comparison of Four Classification Systems Using Rule Sets Induced from Incomplete Data Sets by Local Probabilistic Approximations (Q3388215) (← links)
- Definability and Other Properties of Approximations for Generalized Indiscernibility Relations (Q3401127) (← links)
- (Q3526719) (← links)
- (Q3526720) (← links)
- (Q3675531) (← links)
- (Q3696559) (← links)
- (Q3875348) (← links)
- (Q4003814) (← links)
- (Q4068622) (← links)
- (Q4077919) (← links)
- (Q4087094) (← links)
- (Q4105613) (← links)
- (Q4109587) (← links)
- (Q4171562) (← links)
- (Q4176976) (← links)
- (Q4250259) (← links)
- (Q4298837) (← links)
