Listing closed sets of strongly accessible set systems with applications to data

نویسندگان

  • Mario Boley
  • Tamás Horváth
  • Axel Poigné
  • Stefan Wrobel
چکیده

We study the problem of listing all closed sets of a closure operator σ that is a partial function on the power set of some finite ground set E, i.e., σ : F → F with F ⊆ P(E). A very simple divide-and-conquer algorithm is analyzed that correctly solves this problem if and only if the domain of the closure operator is a strongly accessible set system. Strong accessibility is a strict relaxation of greedoids as well as of independence systems. This algorithm turns out to have delay O(|E|(TF + Tσ + |E|)) and space O(|E| + SFSσ), where TF , SF , Tσ , and Sσ are the time and space complexities of checking membership in F and computing σ, respectively. In contrast, we show that the problem becomes intractable for accessible set systems. We relate our results to the data mining problem of listing all support-closed patterns of a dataset and show that there is a corresponding closure operator for all datasets if and only if the set system satisfies a certain confluence property. submissions. ∗A long version of this extended abstract appeared in Theoretical Computer Science 411(3), 691–700, 2010.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Regular Fuzzy Irresolute Mappings and Their Applications

In this paper, the notion of generalized regular fuzzy irresolute, generalized regular fuzzy irresolute open  and generalized regular fuzzy irresolute closed maps in fuzzy  topological spaces are introduced and studied. Moreover, some separation axioms and $r$-GRF-separated sets are established. Also, the relations between generalized regular fuzzy continuous maps and generalized regular fuzzy ...

متن کامل

Efficient Closed Pattern Mining in Strongly Accessible Set Systems

Many problems in data mining can be viewed as a special case of the problem of enumerating the closed elements of an independence system with respect to some specific closure operator. Motivated by real-world applications, e.g., in track mining, we consider a generalization of this problem to strongly accessible set systems and arbitrary closure operators. For this more general problem setting,...

متن کامل

Listing Maximal Subgraphs in Strongly Accessible Set Systems

Algorithms for listing the subgraphs satisfying a given property (e.g., being a clique, a cut, a cycle, etc.) fall within the general framework of set systems. A set system (U ,F) uses a ground set U (e.g., the network nodes) and an indicator F ⊆ 2U of which subsets of U have the required property. For the problem of listing all sets in F maximal under inclusion, the ambitious goal is to cover ...

متن کامل

Some new properties of fuzzy strongly ${{g}^{*}}$-closed sets and $delta {{g}^{*}}$-closed sets in fuzzy topological spaces

‎In this paper, a new class of fuzzy sets called fuzzy strongly ${{g}^{*}}$-closed sets is introduced and its properties are investigated. Moreover, we study some more properties of this type of closed spaces.

متن کامل

Soft regular generalized b-closed sets in soft topological spaces

The main purpose of this paper is to introduce and study new classes of soft closed sets like soft regular generalized b-closed sets in soft topological spaces (briefly soft rgb-closed set) Moreover, soft rg-closed, soft gpr-closed, soft gb-closed, soft gsp-closed, soft g$alpha$-closed, soft g$alpha$b-closed, and soft sgb-closed sets in soft topological spaces are introduced in this paper and w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010