Results 231 to 240 of about 765,630 (290)
Patient Preferences for Low Back Pain Treatments in Iran: A Discrete Choice Experiment. [PDF]
Soofi M +3 more
europepmc +1 more source
AviaTAD-LGH: A Multi-Task Spatio-Temporal Action Detector with Lightweight Gradient Harmonization for Real-Time Avian Behavior Monitoring. [PDF]
Xie Z +9 more
europepmc +1 more source
Reconsidering HIV-related stigma as a barrier to accessing health care: a call for papers. [PDF]
Zakumumpa H, Mukui I.
europepmc +1 more source
Enhancing demarcation in regionalization in the eastern Qinghai-Xizang Plateau through geographically weighted. [PDF]
Liu X +5 more
europepmc +1 more source
Preferences for Infection Prevention in Hospital-Acquired Infections.
Elangovan S +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Attribute group for attribute reduction
Information Sciences, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yan Chen +5 more
openaire +2 more sources
Greedy Algorithm for Attribute Reduction
Fundamenta Informaticae, 2008In the paper the accuracy of greedy algorithmfor construction of partial tests (superreducts) and partial decision rules is considered. Results of experiments with greedy algorithm are described.
Zielosko, Beata, Piliszczuk, Marcin
openaire +2 more sources
Information system attribute reduction
Third International Workshop on Advanced Computational Intelligence, 2010This paper describes the information systems as a family of equivalence relations or functions. It brings forward the notion of separation polynomial, which is an expression found by the separators (complement of the equivalence relations) via finite union operations and intersection operations.
Shaobai Chen, Mengfei Cao, Xiaodan Chen
openaire +1 more source
Journal of Computer Science and Technology, 2004
Based on the principle of discernibility matrix, a kind of reduction algorithm with attribute order has been developed and its solution has been proved to be complete for reduct and unique for a given attribute order. Being called the reduct problem, this algorithm can be regarded as a mapping R = Reduct(S) from the attribute order space Θ to the ...
Su-Qing Han, Jue Wang
openaire +1 more source
Based on the principle of discernibility matrix, a kind of reduction algorithm with attribute order has been developed and its solution has been proved to be complete for reduct and unique for a given attribute order. Being called the reduct problem, this algorithm can be regarded as a mapping R = Reduct(S) from the attribute order space Θ to the ...
Su-Qing Han, Jue Wang
openaire +1 more source

