@article{ivncsy2006frequent,
  abstract = {Abstract: Frequent pattern mining is a heavily researched area in the field of data mining with wide range of applications. One of them is to use frequent pattern discovery methods in Web log data. Discovering hidden information from Web log data is called Web usage mining. The aim of discovering frequent patterns in Web log data is to obtain information about the navigational behavior of the users. This can be used for advertising purposes, for creating dynamic user profiles etc. In this paper three pattern mining approaches are investigated from the Web usage mining point of view. The different patterns in Web log mining are page sets, page sequences and page graphs.},
  author = {Iváncsy, Renáta and Vajk, István},
  interhash = {5612ed1c8203908fb94adf7ad8304e12},
  intrahash = {f29f4627c9ae99370fc7ba005982e2e6},
  journal = {Acta Polytechnica Hungarica},
  number = 1,
  title = {Frequent Pattern Mining in Web Log Data},
  url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.4559},
  volume = 3,
  year = 2006
}

@inproceedings{kdml26,
  abstract = {We study the problem of listing all closed sets of a closure operator $\sigma$ that is a partial function on the power set of some finite ground set $E$, i.e., $\sigma : {\cal F} \to {\cal F}$ with ${\cal F} \subseteq {\cal 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| (T_{\cal F} +T_\sigma + |E|))$ and space $O(|E| + S_{\cal F} S_\sigma)$, where $T_{\cal F}$, $S_{\cal F}$, $T_\sigma$, and $S_\sigma$  are the time and space complexities of checking membership in $\cal  F$ and computing $\sigma$, 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.},
  address = {Kassel, Germany},
  author = {Boley, Mario and Horvath, Tamas and Poigne, Axel and Wrobel., Stefan},
  booktitle = {Proceedings of LWA2010 - Workshop-Woche: Lernen, Wissen {\&} Adaptivitaet},
  crossref = {lwa2010},
  editor = {Atzmüller, Martin and Benz, Dominik and Hotho, Andreas and Stumme, Gerd},
  interhash = {49ca7e8ee8dcb2236232e9653cb576d1},
  intrahash = {75f0dabe405564eb640a8261edfce283},
  presentation_end = {2010-10-06 10:45:00},
  presentation_start = {2010-10-06 10:22:30},
  room = {0446},
  session = {kdml4},
  title = {Listing closed sets of strongly accessible set systems with applications to data},
  track = {kdml},
  url = {http://www.kde.cs.uni-kassel.de/conf/lwa10/papers/kdml26.pdf},
  year = 2010
}