Results 261 to 270 of about 2,172,385 (299)
Some of the next articles are maybe not open access.
The Covering Upper Approximation by Subcovering
2010 IEEE International Conference on Granular Computing, 2010Rough set theory is a useful tool for data mining to deal with the vagueness and granularity in information systems. The study of covering-based rough sets has made an interesting contribution to the classical rough set theory. Reduction is one of the fundamental and significant concepts in covering-based rough sets.
Shiping Wang +2 more
openaire +1 more source
Upper Bounds on Communication in Terms of Approximate Rank
Theory of Computing Systems, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anna Gál, Ridwan Syed
openaire +5 more sources
Upper-bound approximations for dynamic pruning
ACM Transactions on Information Systems, 2011Dynamic pruning strategies for information retrieval systems can increase querying efficiency without decreasing effectiveness by using upper bounds to safely omit scoring documents that are unlikely to make the final retrieved set. Often, such upper bounds are pre-calculated at indexing time for a given weighting model.
Craig Macdonald +2 more
openaire +6 more sources
Generalized lower and upper approximations in hyperrings
Journal of Intelligent & Fuzzy Systems, 2016The main goal of this paper is to investigate set valued homomorphisms on hyperrings and construct popularized lower and upper approximations operators via them. Also, we put forth the concept of generalized lower and upper approximations respect to a hyperideals of hyperrings.
Xiaolong Xin 0001 +2 more
openaire +1 more source
Clustering using Similarity Upper Approximation
2006 IEEE International Conference on Fuzzy Systems, 2006Rough set theory operates on an information system that consists of a set of objects. A core concept of rough set theory is that of equivalence between objects called indiscernibility. Indiscernibility reflects a total impossibility of distinguishing between objects, considering the available information.
Pradeep Kumar 0001 +3 more
openaire +1 more source
Tightening Upper Bounds for Approximate State Conversion
International Journal of Theoretical Physics, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zuo, Hai-Xin, Liu, Feng
openaire +2 more sources
On upper and lower approximative liftings
Russian Mathematical Surveys, 1985See the review in Zbl 0606.55014.
openaire +2 more sources
The lower and upper approximations in a fuzzy group
Information Sciences, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nobuaki Kuroki, Paul P. Wang
openaire +2 more sources
The lower and upper approximations in a hypergroup
Information Sciences, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
The lower and upper approximations in a multiplicative set
Journal of Intelligent & Fuzzy Systems, 2017Let S be a multiplicative subset of a commutative ring R . We considered a R × S as a universal and introduced the notion of lower[upper] approximations in a
Sinem Tarsuslu +2 more
openaire +1 more source