نتایج جستجو برای: beta closed sets

تعداد نتایج: 510804  

Journal: :Journal of Machine Learning Research 2006
Gemma C. Garriga Petra Kralj Novak Nada Lavrac

Closed sets have been proven successful in the context of compacted data representation for association rule learning. However, their use is mainly descriptive, dealing only with unlabeled data. This paper shows that when considering labeled data, closed sets can be adapted for classification and discrimination purposes by conveniently contrasting covering properties on positive and negative ex...

2013
J. Mahanta

A new class of fuzzy closed sets, namely fuzzy weakly closed set in a fuzzy topological space is introduced and it is established that this class of fuzzy closed sets lies between fuzzy closed sets and fuzzy generalized closed sets. Alongwith the study of fundamental results of such closed sets, we define and characterize fuzzy weakly compact space and fuzzy weakly closed space.

Journal: :Theor. Comput. Sci. 2003
Michael H. Albert Mike D. Atkinson Nikola Ruskuc

Machines whose main purpose is to permute and sort data are studied. The sets of permutations that can arise are analysed by means of finite automata and avoided pattern techniques. Conditions are given for these sets to be enumerated by rational generating functions. As a consequence we give the first non-trivial examples of pattern closed sets of permutations all of whose closed subclasses ha...

2009
David Diamondstone Bjørn Kjos-Hanssen

The members of Martin-Löf random closed sets under a distribution studied by Barmpalias et al. are exactly the infinite paths through Martin-Löf random Galton-Watson trees with survival parameter 2 3 . To be such a member, a sufficient condition is to have effective Hausdorff dimension strictly greater than γ = log2 3 2 , and a necessary condition is to have effective Hausdorff dimension greate...

2008
ALDO J. LAZAR

We study Michael’s lower semifinite topology and Fell’s topology on the collection of all closed limit subsets of a topological space. Special attention is given to the subfamily of all maximal limit sets.

Journal: :Arch. Math. Log. 2008
Paul Brodhead Douglas A. Cenzer

An effectively closed set, or Π 1 class, may viewed as the set of infinite paths through a computable tree. A numbering, or enumeration, is a map from ω onto a countable collection of objects. One numbering is reducible to another if equality holds after the second is composed with a computable function. Many commonly used numberings of Π 1 classes are shown to be mutually reducible via a compu...

Journal: :Journal of the Egyptian Mathematical Society 2017

Journal: :Theory of Computing Systems 2016

Journal: :International Journal of Computer Applications 2013

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید