Sciweavers

573 search results - page 39 / 115
» Mining Frequent Itemsets from Uncertain Data
Sort
View
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
14 years 4 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki
DASFAA
2005
IEEE
153views Database» more  DASFAA 2005»
14 years 1 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
ACTA
2007
85views more  ACTA 2007»
13 years 7 months ago
The complexity of satisfying constraints on databases of transactions
Abstract Computing frequent itemsets is one of the most prominent problems in data mining. Recently, a new related problem, called FREQSAT, was introduced and studied: given some i...
Toon Calders
MLDM
2009
Springer
14 years 2 months ago
Relational Frequent Patterns Mining for Novelty Detection from Data Streams
We face the problem of novelty detection from stream data, that is, the identification of new or unknown situations in an ordered sequence of objects which arrive on-line, at cons...
Michelangelo Ceci, Annalisa Appice, Corrado Loglis...
ICDM
2008
IEEE
95views Data Mining» more  ICDM 2008»
14 years 2 months ago
Publishing Sensitive Transactions for Itemset Utility
We consider the problem of publishing sensitive transaction data with privacy preservation. High dimensionality of transaction data poses unique challenges on data privacy and dat...
Yabo Xu, Benjamin C. M. Fung, Ke Wang, Ada Wai-Che...