Sciweavers

Share
8 search results - page 1 / 2
» Algorithms for Discovery of Frequent Superset, Rather than F...
Sort
View
DAWAK
2004
Springer
12 years 11 months ago
Algorithms for Discovery of Frequent Superset, Rather than Frequent Subset
Abstract. In this paper, we propose a novel mining task: mining frequent superset from the database of itemsets that is useful in bioinformatics, e-learning systems, jobshop schedu...
Zhung-Xun Liao, Man-Kwan Shan
ADBIS
2000
Springer
111views Database» more  ADBIS 2000»
12 years 10 months ago
Discovering Frequent Episodes in Sequences of Complex Events
Data collected in many applications have a form of sequences of events. One of the popular data mining problems is discovery of frequently occurring episodes in such sequences. Eff...
Marek Wojciechowski
DASFAA
2005
IEEE
153views Database» more  DASFAA 2005»
12 years 11 months ago
FASST Mining: Discovering Frequently Changing Semantic Structure from Versions of Unordered XML Documents
Abstract. In this paper, we present a FASST mining approach to extract the frequently changing semantic structures (FASSTs), which are a subset of semantic substructures that chang...
Qiankun Zhao, Sourav S. Bhowmick
PKDD
2005
Springer
129views Data Mining» more  PKDD 2005»
12 years 11 months ago
Interestingness is Not a Dichotomy: Introducing Softness in Constrained Pattern Mining
Abstract. The paradigm of pattern discovery based on constraints was introduced with the aim of providing to the user a tool to drive the discovery process towards potentially inte...
Stefano Bistarelli, Francesco Bonchi
SSD
2001
Springer
218views Database» more  SSD 2001»
12 years 10 months ago
Efficient Mining of Spatiotemporal Patterns
The problem of mining spatiotemporal patterns is finding sequences of events that occur frequently in spatiotemporal datasets. Spatiotemporal datasets store the evolution of object...
Ilias Tsoukatos, Dimitrios Gunopulos
books